{"$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":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"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":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"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":"AXR1","name":"Runtime accessibility (rendered)","shortDescription":{"text":"Runtime accessibility (rendered)"},"helpUri":"https://codehealth.canine.dev/dimensions/AXR1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"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":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"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":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF2","name":"Allocation hygiene","shortDescription":{"text":"Allocation hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF2"},{"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":"R11","name":"Import Boundaries","shortDescription":{"text":"Import Boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/R11"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"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":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::run_pipeline::run_with_parse_cache (cyclomatic 936): perry::commands::compile::run_pipeline::run_with_parse_cache has cyclomatic complexity 936 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/run_pipeline.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eaff0f74032a9526bd9b3b8ccc9546a88e5a2032df24172ecaa06c334806da4"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::hash (cyclomatic 659): Expr::hash has cyclomatic complexity 659 (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/perry-hir/src/stable_hash/expr.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b280328ebd502d4db9ff0eb892df2234e402b27ca42baceb838ae370dc15c5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::lower_module (cyclomatic 365): perry_codegen::codegen::lower_module has cyclomatic complexity 365 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/mod.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3a8ff5be9c3367397bde25b3ecb2ae899a55c4236e636b2dc9c2a0af05523e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::walker::expr_mut::walk_expr_children_mut (cyclomatic 332): perry_hir::walker::expr_mut::walk_expr_children_mut has cyclomatic complexity 332 (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/perry-hir/src/walker/expr_mut.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9925e4bc3a473d4fd051132c69d62d64879dc9cbf30e922e1e23efd124aaf3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::walker::expr_ref::walk_expr_children (cyclomatic 332): perry_hir::walker::expr_ref::walk_expr_children has cyclomatic complexity 332 (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/perry-hir/src/walker/expr_ref.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bf91d1b79d14bb6d554bdb4c3b718f17ccb4ee1407ee265d45accbe30cf42d"}},{"ruleId":"D1","level":"warning","message":{"text":"wasm_runtime.buildImports (cyclomatic 331): wasm_runtime.buildImports has cyclomatic complexity 331 (threshold 15). Most of this is not in the body itself: 4 of the 331 points are its own statements and the rest belongs to 158 function literals inside it that branch (lines 668, 172, 581, \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d997a4d1ca3ed9a73281642863cf5e96ddcbc1fa41fbece2ab74c3270e1ce6"}},{"ruleId":"D1","level":"warning","message":{"text":"JsEmitter::emit_expr (cyclomatic 319): JsEmitter::emit_expr has cyclomatic complexity 319 (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/perry-codegen-js/src/emit/exprs.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3cf55fe02e1bab609e2fdcb4997b64370c2400c788b08a06432ba94fbf7fdb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_get_set::get_field_by_name_tail::get_field_by_name_object_tail (cyclomatic 319): perry_runtime::object::field_get_set::get_field_by_name_tail::get_field_by_name_object_tail has cyclomatic complexity 319 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/field_get_set/get_field_by_name_tail.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"044793f780e167407b20c9c43d9f3cf8b8928495c5d3983058cca6eb14181c70"}},{"ruleId":"D1","level":"warning","message":{"text":"JsEmitter::emit_expr_continued (cyclomatic 303): JsEmitter::emit_expr_continued has cyclomatic complexity 303 (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/perry-codegen-js/src/emit/exprs_more.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8465b487e764541a6f52ca5e101d6827c8ec5200b0062e5e3c8977e721f239b6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_member::lower_member_inner (cyclomatic 303): perry_hir::lower::expr_member::lower_member_inner has cyclomatic complexity 303 (threshold 15). Of this number, 290 points are the body\u0027s own statements and 13 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":"crates/perry-hir/src/lower/expr_member.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbab3939c0d27ad26392f79ac1c0cb3fd9e07280137db529cf110829fdb36aa"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::apply_inner (cyclomatic 303): Model::apply_inner has cyclomatic complexity 303 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/solve/apply.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a65c8d1b579ded03d3847f7cff2accd9d20081b03e8027ad611cc645779ebc6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::publish::run_async (cyclomatic 297): perry::commands::publish::run_async has cyclomatic complexity 297 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/publish/mod.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"6468a9c385a54dc1c1d38c74f67f20f3adc715845f19ddc4709a8801ab64f6a5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::body_stmt::lower_body_stmt_impl (cyclomatic 288): perry_hir::lower_decl::body_stmt::lower_body_stmt_impl has cyclomatic complexity 288 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_decl/body_stmt.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b544b0203f4e55688da4f24a100c77d047f5ddd7ce325f937d28c3817c6dfe"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::link::build_and_run::build_and_run_link (cyclomatic 269): perry::commands::compile::link::build_and_run::build_and_run_link has cyclomatic complexity 269 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/link/build_and_run.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"393dd9e0c4d7a771577b0553995969836e68498818fcc9e1190ab9eeabbf7004"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::module_static::try_module_static_methods (cyclomatic 261): perry_hir::lower::expr_call::module_static::try_module_static_methods has cyclomatic complexity 261 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/module_static.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"832aaad548accac0c2fbad7c9df8e2ba55b94f954ee699757f6254321e18d5a9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_module::constants::get_native_module_constant (cyclomatic 243): perry_runtime::object::native_module::constants::get_native_module_constant has cyclomatic complexity 243 (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/perry-runtime/src/object/native_module/constants.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fed974a913d82814e062a671cd82a13045050fb63cefb22557f1c4a2fb47c6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::collect_modules::collect_module_one (cyclomatic 230): perry::commands::compile::collect_modules::collect_module_one has cyclomatic complexity 230 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/collect_modules.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcf1a02d9c7eb0a53a2fece49d0d0c60e6aec9220b3c262907859ae5de08ab6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::module_decl::lower_module_decl (cyclomatic 228): perry_hir::lower::module_decl::lower_module_decl has cyclomatic complexity 228 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/module_decl.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"11aa285b86519a1b5f3f037d56ba89651fea2bf66a64e0e9ef454351bf807734"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_new::lower_new (cyclomatic 217): perry_hir::lower::expr_new::lower_new has cyclomatic complexity 217 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_new.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea0d58c98c2ab3d6066a0df88c26052772729f989e3cb146f09589b6060032d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::instance_misc1::lower (cyclomatic 207): perry_codegen::expr::instance_misc1::lower has cyclomatic complexity 207 (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/perry-codegen/src/expr/instance_misc1.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfeccd6a527cd7f62c6d84c27e29760ee82e366619379df6bd968a1f270e1ae"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::analysis::value_types::infer_expr_type (cyclomatic 189): perry_hir::analysis::value_types::infer_expr_type has cyclomatic complexity 189 (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/perry-hir/src/analysis/value_types.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f4d20eb040044c4fcb3a3b9afe8642ad75cfa6235a0532952287d8bf5bc37a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::instanceof::static_dispatch::native_instanceof (cyclomatic 189): perry_runtime::object::instanceof::static_dispatch::native_instanceof has cyclomatic complexity 189 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/instanceof/static_dispatch.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"a999a2af050dc26e42afb72b2030c38b9e22618151d4c79dd91ee3e13fd8a7b8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::host_config::apply_pkg_and_toml_config (cyclomatic 188): perry::commands::compile::host_config::apply_pkg_and_toml_config has cyclomatic complexity 188 (threshold 15). Of this number, 182 points are the body\u0027s own statements and 6 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":"crates/perry/src/commands/compile/host_config.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8841f8c5c016ba152c95e1b5fc97c3fd31696f26053e89aaa6dfe2a438afa5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::let_stmt::lower_let (cyclomatic 187): perry_codegen::stmt::let_stmt::lower_let has cyclomatic complexity 187 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/let_stmt.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a9ade0d0184ed0f6fb2689efe0a762090191d2b005149a0b718f1e203fbf09"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::escape_check::check_escapes_in_expr (cyclomatic 180): perry_codegen::collectors::escape_check::check_escapes_in_expr has cyclomatic complexity 180 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/escape_check.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c19340a1f66c24686e2959cbb023863502b61c0c39880c0dedf6a9f2bc96e33"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::buffer_dispatch::dispatch_buffer_method (cyclomatic 180): perry_runtime::object::buffer_dispatch::dispatch_buffer_method has cyclomatic complexity 180 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/buffer_dispatch.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"557b77a866b13242122792d402683fd8b3b26a937b91af9739a0fa6ba8e69a58"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_get_set::get_field_by_name::get_field_by_name_past_data_probe (cyclomatic 177): perry_runtime::object::field_get_set::get_field_by_name::get_field_by_name_past_data_probe has cyclomatic complexity 177 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/field_get_set/get_field_by_name.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"361d5595486d8c53a697a0d25b1000b9b09401e505a3e8a708b18a3873d0f1bf"}},{"ruleId":"D1","level":"warning","message":{"text":"JsEmitter::emit_ui_method_call (cyclomatic 172): JsEmitter::emit_ui_method_call has cyclomatic complexity 172 (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/perry-codegen-js/src/emit/calls.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b85da6ff38ba69692fc5cc31225b4a8df049b957f710c9194a5e582c09416fd"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::stmt::lower_stmt_inner (cyclomatic 172): perry_hir::lower::stmt::lower_stmt_inner has cyclomatic complexity 172 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/stmt.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f3437983b445fb2f9f48b521e91799909a11565678d51bd74d26e9c2bf3746"}},{"ruleId":"D1","level":"warning","message":{"text":"Gen::expr_rest (cyclomatic 168): Gen::expr_rest has cyclomatic complexity 168 (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/perry-wpfacts/src/gen_rest.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db55ec210de3257cfbabbe29116cb4aafabfc48f824bd7b1d04e031b54cf40a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::property_get::dynamic_dispatch::try_lower_instance_method_call (cyclomatic 164): perry_codegen::lower_call::property_get::dynamic_dispatch::try_lower_instance_method_call has cyclomatic complexity 164 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7f7202a965586cdf6196e13850b24d29b8a0c16987b27338571986f2376e19"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::class_decl::lower_class_decl (cyclomatic 163): perry_hir::lower_decl::class_decl::lower_class_decl has cyclomatic complexity 163 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_decl/class_decl.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"9550e7159b8e2fbf5e4985ede32e59c3d7837b17bee58b09170533685deca80c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::builtin::lower_builtin_new (cyclomatic 161): perry_codegen::lower_call::builtin::lower_builtin_new has cyclomatic complexity 161 (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/perry-codegen/src/lower_call/builtin.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8febac2af0a466c63287e7dbfb60af9e6c37ec2301a943706044d6c48e458b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::globals::try_global_builtins (cyclomatic 161): perry_hir::lower::expr_call::globals::try_global_builtins has cyclomatic complexity 161 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2b9b1ddd2de685e085ef94a75e02aaf6a3b7b70accca6729eca5dbc77a7629"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::js_transform::imports::transform_expr (cyclomatic 156): perry_hir::js_transform::imports::transform_expr has cyclomatic complexity 156 (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/perry-hir/src/js_transform/imports.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8c278d8039d6f51ea167ceffcdab3b4b14ac7e03c711cc63f82c0ccbde5b93"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::compute_in (cyclomatic 155): perry_wpfacts::compute_in has cyclomatic complexity 155 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/lib.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"354bcab609fae5694ed704b5a7aadd15aa4e2235c4d3c9cd05ae03aeee854537"}},{"ruleId":"D1","level":"warning","message":{"text":"WasmModuleEmitter::compile (cyclomatic 154): WasmModuleEmitter::compile has cyclomatic complexity 154 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/emit/compile.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"55126a95e870053cedbaa9ed83b3bfe040b689d342dbdf466aa3b8369e0a384f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_call_method::handle_methods::dispatch_handle (cyclomatic 154): perry_runtime::object::native_call_method::handle_methods::dispatch_handle has cyclomatic complexity 154 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/native_call_method/handle_methods.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"0398da4e4a34441fe7b1034af5fd371e9251b1418131c3b95e27e09e80312b3f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::options::fetch::lower_fetch_native_method (cyclomatic 153): perry_codegen::lower_call::options::fetch::lower_fetch_native_method has cyclomatic complexity 153 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/options/fetch.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eff70d6519abebf4043eea80955541b75c60eb572b78d70ba53c04f88a9ba09"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::object_ops::prototype::get_prototype_of_resolved (cyclomatic 152): perry_runtime::object::object_ops::prototype::get_prototype_of_resolved has cyclomatic complexity 152 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/object_ops/prototype.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f64241ec321dc2d1303bcaf79fd7b49f3aba9211d36f63b9ca4cc4f2133ca6f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::refs::refs_expr (cyclomatic 150): perry_codegen::collectors::refs::refs_expr has cyclomatic complexity 150 (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/perry-codegen/src/collectors/refs.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8b455ad67d1496f979c494d794bae8e0286aef36482fa1bb79e226135bcd94"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::lower_module_fn::lower_module_full_with_platform_globals (cyclomatic 150): perry_hir::lower::lower_module_fn::lower_module_full_with_platform_globals has cyclomatic complexity 150 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/lower_module_fn.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"3713fadee6fa65944c19852106d4052515baca873562f28e54b35802055f7c1b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_call_method::native_call_method_tower (cyclomatic 150): perry_runtime::object::native_call_method::native_call_method_tower has cyclomatic complexity 150 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/native_call_method.rs"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"3730631f79104806d56de804c716e1e301dbaa64ca92d1f7a206dda3f0a0d15d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::new::lower_new_impl_inner (cyclomatic 149): perry_codegen::lower_call::new::lower_new_impl_inner has cyclomatic complexity 149 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/new.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"28747ffdd17811789072b9d36949a54aeb0398101de8da99ab1ba4231337d0d4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::stmt_loops::lower_stmt_for_of_inner (cyclomatic 149): perry_hir::lower::stmt_loops::lower_stmt_for_of_inner has cyclomatic complexity 149 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"0917b5d335bfa55b77b1d90d8d6afc9f5e16f0a2c4405aa4e6fdfb91c9d5e156"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_set_by_name::tail::set_field_by_name_object_tail (cyclomatic 147): perry_runtime::object::field_set_by_name::tail::set_field_by_name_object_tail has cyclomatic complexity 147 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/field_set_by_name/tail.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4236057bba2a805fe3bf88de98e82d08c3133fb36b10e9e755312b4dd18cccc9"}},{"ruleId":"D1","level":"warning","message":{"text":"Gen::expr_inner (cyclomatic 146): Gen::expr_inner has cyclomatic complexity 146 (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/perry-wpfacts/src/gen_expr.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b827638d09abc5d3bac4d5ad11e2d204ca44ae44bdda377e28cd6d89af0cda"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::method::compile_method (cyclomatic 142): perry_codegen::codegen::method::compile_method has cyclomatic complexity 142 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/method.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ba7cb6714505d077e08349642d3047bb5f09e072b4df27882c2f2d6dd2ec05"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::destructuring::var_decl::native_fetch::register_native_fetch_and_streams (cyclomatic 141): perry_hir::destructuring::var_decl::native_fetch::register_native_fetch_and_streams has cyclomatic complexity 141 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/destructuring/var_decl/native_fetch.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63705345360083b5be89836897fb301020646c35f99640550ea0a5f9fbdd883"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_root_dominance_check.self_test (cyclomatic 140): gc_root_dominance_check.self_test has cyclomatic complexity 140 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gc_root_dominance_check.py"},"region":{"startLine":6812}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad07c2caffe9bac4b60571abc922e7bf2f60270e673370246ce64fcbb97e655"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::property_get::lower (cyclomatic 139): perry_codegen::expr::property_get::lower has cyclomatic complexity 139 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/property_get.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e026756baddf7acb689508f19947d65495e1fc5dbd9da76ffe5cebb0cccc62ee"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::this_super_call::lower_impl (cyclomatic 139): perry_codegen::expr::this_super_call::lower_impl has cyclomatic complexity 139 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/this_super_call.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a822372a763e2b82be12961100b4b5ee312268cc16416822cb80a5ecbc1cf5d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::string_pool::emit_string_pool (cyclomatic 138): perry_codegen::codegen::string_pool::emit_string_pool has cyclomatic complexity 138 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/string_pool.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f30a29babdc4c8ce42826541ccf3b11b84cfbf68b6563ad4b0e1a464f86a79"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::local_array_methods::try_local_array_methods (cyclomatic 138): perry_hir::lower::expr_call::local_array_methods::try_local_array_methods has cyclomatic complexity 138 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/local_array_methods.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c49c59e05d2e5a3d39d20f0a664de4a7b33b7080ac8905cf50bd561abbdf20"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::symbol::get::js_object_get_symbol_property_with_receiver (cyclomatic 136): perry_runtime::symbol::get::js_object_get_symbol_property_with_receiver has cyclomatic complexity 136 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/symbol/get.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"5894ec978aca0833beaaa2c09a15c4c10f487ed7cca1253db9e9d194f21f0598"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::wrap::wrap_commonjs_with_addon_paths (cyclomatic 135): perry::commands::compile::cjs_wrap::wrap::wrap_commonjs_with_addon_paths has cyclomatic complexity 135 (threshold 15). Of this number, 123 points are the body\u0027s own statements and 12 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/perry/src/commands/compile/cjs_wrap/wrap.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76de83907b979d96ba2bba1ba4c6dee23f99b101e3910ef70e5797a6a75296c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_get_set::has_property::object_has_property_generic (cyclomatic 135): perry_runtime::object::field_get_set::has_property::object_has_property_generic has cyclomatic complexity 135 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/field_get_set/has_property.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"d801b847971ebd58ade772f5495a1f659f1a557a09452e5d0c27eea90437ad23"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::webcrypto::jwk::js_webcrypto_import_key (cyclomatic 134): perry_stdlib::webcrypto::jwk::js_webcrypto_import_key has cyclomatic complexity 134 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/webcrypto/jwk.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdbef891eee1e5c9fc05d560d9836de9978936ed1ad3ad4f332ba4d21a551949"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::instanceof::dynamic_dispatch::js_instanceof_dynamic (cyclomatic 132): perry_runtime::object::instanceof::dynamic_dispatch::js_instanceof_dynamic has cyclomatic complexity 132 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/instanceof/dynamic_dispatch.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"049644b1b79ef55687919edb22849bb1e2b0e243d3153f56c717c38ff70df72a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::descriptors::own_property (cyclomatic 127): perry_runtime::object::descriptors::own_property has cyclomatic complexity 127 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/descriptors.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b805af440894ad19cd24baa590a96397b4ec0b15a9b60619860318f8389091b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::escape_news::collect_used_new_fields_in_expr (cyclomatic 126): perry_codegen::collectors::escape_news::collect_used_new_fields_in_expr has cyclomatic complexity 126 (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/perry-codegen/src/collectors/escape_news.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1dced23e591d0e60bdf59d8e0ea3d34118a06c4dd43b9fdf43f5a0c57928c43"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::runtime_layouts::runtime_layout_word (cyclomatic 126): perry_runtime::object::runtime_layouts::runtime_layout_word has cyclomatic complexity 126 (threshold 15). Of this number, 123 points are the body\u0027s own statements and 3 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/perry-runtime/src/object/runtime_layouts.rs"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6846316bc2134676bab54b4d334c77bd037228de313a3fd35b8f3ce855db5d5"}},{"ruleId":"D1","level":"warning","message":{"text":"WasmModuleEmitter::collect_strings_in_expr (cyclomatic 124): WasmModuleEmitter::collect_strings_in_expr has cyclomatic complexity 124 (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/perry-codegen-wasm/src/emit/string_collection.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"95318b737e1f8ff52a6ff34676ad5ffb32880f9fa543116e7f5c992303962b92"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::units::driver::run (cyclomatic 124): perry_wpfacts::units::driver::run has cyclomatic complexity 124 (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/perry-wpfacts/src/units/driver.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"d016865ceb2f9d69a3b2c86d4f9dd84eab4deac3491ac369220c19afa1ec5176"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_member::member_tail::lower_member_tail (cyclomatic 123): perry_hir::lower::expr_member::member_tail::lower_member_tail has cyclomatic complexity 123 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_member/member_tail.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff08dbda6b0e1007d3ae0bd5e45480d2fac26efbc11ba42d84b22d1f996c7f6"}},{"ruleId":"D1","level":"warning","message":{"text":"Solver.apply (cyclomatic 121): Solver.apply has cyclomatic complexity 121 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wpfacts_recompute.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2619dc2a83300877385f5eceaef90fd9fbe3ef01ebfca98f371eecaec7d11f6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::lower_expr::arm_unary::lower_unary_expr (cyclomatic 120): perry_hir::lower::lower_expr::arm_unary::lower_unary_expr has cyclomatic complexity 120 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/lower_expr/arm_unary.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"599f45116728a11fb5207a05d6e61bec77c3a02c534043f6a0bd2e33fa47c539"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::object_ops::define_property::apply_property_descriptor (cyclomatic 117): perry_runtime::object::object_ops::define_property::apply_property_descriptor has cyclomatic complexity 117 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/object_ops/define_property.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d430d2a78262d9913f43aa5efaa040d526834699930ab3b076e51df462abd4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::literals_vars::lower (cyclomatic 112): perry_codegen::expr::literals_vars::lower has cyclomatic complexity 112 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/literals_vars.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d5389f61bf986bac8cfce98c290a9cbb250faf5a825c4d3ff77bc1c0440db4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::crypto::cipher::cipher_step (cyclomatic 112): perry_stdlib::crypto::cipher::cipher_step has cyclomatic complexity 112 (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/perry-stdlib/src/crypto/cipher.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bd2c3c565396addbad7be259fa13ada3fc9a41a9d537b87ce28ec1dc9ea2bb"}},{"ruleId":"D1","level":"warning","message":{"text":"WasmModuleEmitter::emit_js_expr (cyclomatic 110): WasmModuleEmitter::emit_js_expr has cyclomatic complexity 110 (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/perry-codegen-wasm/src/emit/js_fallback.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"952d381c2d19de35357b4a3ffa1155c4e9631a065a9af55c1114d3201616c6d9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::array_only_methods::try_array_only_methods (cyclomatic 110): perry_hir::lower::expr_call::array_only_methods::try_array_only_methods has cyclomatic complexity 110 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/array_only_methods.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74348b8e092e2455844a19a89b4909c640170f7d459d71f3dfd3b0e0ca6c17f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::split_regions::try_extract (cyclomatic 107): perry_codegen::codegen::split_regions::try_extract has cyclomatic complexity 107 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/split_regions.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2874e32aba4fb02c2f7b9bbc97ea0a4bd1ba7bef6ac618e4d0b631041d941f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::logical_collections::lower (cyclomatic 107): perry_codegen::expr::logical_collections::lower has cyclomatic complexity 107 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/logical_collections.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d19fc3b5286575ac3524d752ca1bdbc97617b5ab8a3ce35156b68ee9054bde"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::i32_locals::collect_localset_ids_in_expr_filtered (cyclomatic 106): perry_codegen::collectors::i32_locals::collect_localset_ids_in_expr_filtered has cyclomatic complexity 106 (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/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fce5a9403d97301e69807d75b8fcecfb252613122677227332dc675f7cf884d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_http::server::handle_dispatch::js_ext_http_server_dispatch_method (cyclomatic 106): perry_ext_http::server::handle_dispatch::js_ext_http_server_dispatch_method has cyclomatic complexity 106 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-http/src/server/handle_dispatch.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"34660a109a00bd977357b2fccb42a7e77fa202eb682e947e21903f4d26818607"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::method_override::emit_guarded_direct_method_call (cyclomatic 105): perry_codegen::lower_call::method_override::emit_guarded_direct_method_call has cyclomatic complexity 105 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/method_override.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3700f0e3b7969cc61507bb5d487053b4982f5619beedee19f5e31e56eab1ac5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::monomorph::update_call_sites::update_call_sites_in_expr (cyclomatic 104): perry_hir::monomorph::update_call_sites::update_call_sites_in_expr has cyclomatic complexity 104 (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/perry-hir/src/monomorph/update_call_sites.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9603807d9339aad7569ed6e618af5c5fe52e4f910e5b0655b9013b797ae19f4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::function::compile_function (cyclomatic 103): perry_codegen::codegen::function::compile_function has cyclomatic complexity 103 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/function.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"08254c2284e1e06bc75fa48181aadaf81a956ad78ee7f908b04734f54b285736"}},{"ruleId":"D1","level":"warning","message":{"text":"GuardState::matches (cyclomatic 103): GuardState::matches has cyclomatic complexity 103 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/param_type_guard.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8aad13cfd0898027ebe54eab6320598aa6c1d4c21201fa2ccbb3e51f212ce4d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::class_decl::from_ast::lower_class_from_ast (cyclomatic 102): perry_hir::lower_decl::class_decl::from_ast::lower_class_from_ast has cyclomatic complexity 102 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_decl/class_decl/from_ast.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f53eec718ddada652b5b0b3cd8eeebd9d046233547c336b67f4da704557be5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_call_method::primitive_methods::dispatch_primitive (cyclomatic 102): perry_runtime::object::native_call_method::primitive_methods::dispatch_primitive has cyclomatic complexity 102 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/native_call_method/primitive_methods.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f2c286c9980a2f145b953550ee013aa17a6f2a248ac4211667505629ae7a05"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::monomorph::driver::collect_instantiations_in_expr (cyclomatic 101): perry_hir::monomorph::driver::collect_instantiations_in_expr has cyclomatic complexity 101 (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/perry-hir/src/monomorph/driver.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4139ccd8f8325929e6702ed78d859e59e9394d99bd2ab93555ce1394e97098"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::collect_modules::feature_detect::detect_optional_feature_usage (cyclomatic 100): perry::commands::compile::collect_modules::feature_detect::detect_optional_feature_usage has cyclomatic complexity 100 (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/perry/src/commands/compile/collect_modules/feature_detect.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40855d10bd30bc985f265490a918a8c5a321cd8591e44dc0715102f08e8681d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_types::infer_type_from_expr_inner (cyclomatic 100): perry_hir::lower_types::infer_type_from_expr_inner has cyclomatic complexity 100 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_types.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d027401e2b102029d48b57a43737aa651428538ad22f393d32efabd864286b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_types::infer_call_return_type (cyclomatic 100): perry_hir::lower_types::infer_call_return_type has cyclomatic complexity 100 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_types.rs"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e490a353bff3ccc99b9612c0434e6c38ad989beb26028df01a4b2960cf7f686"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_set_by_name::js_object_set_field_by_name (cyclomatic 100): perry_runtime::object::field_set_by_name::js_object_set_field_by_name has cyclomatic complexity 100 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/field_set_by_name.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f2858c39140500df9e1b37125cb4bfb24f2d9ce5fc766476c8a1b23477e730"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::webcrypto::keys::js_webcrypto_generate_key (cyclomatic 99): perry_stdlib::webcrypto::keys::js_webcrypto_generate_key has cyclomatic complexity 99 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/webcrypto/keys.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"861f0fe962a231138a2e0bb6ac63c5f64b24958a5c3dcf9b8e0989e645c0a257"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_object::lower_object (cyclomatic 98): perry_hir::lower::expr_object::lower_object has cyclomatic complexity 98 (threshold 15). Of this number, 85 points are the body\u0027s own statements and 13 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":"crates/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"f555bae9c68e06d5a5dd6ae9510b2a0b3cb9121122680bc97f97a648dcb3893a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::compare::lower (cyclomatic 97): perry_codegen::expr::compare::lower has cyclomatic complexity 97 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/compare.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db6acf5688ea7d12db92d023e59700e59f2e0eb57bd7ef6bddae620311abd8a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::descriptors::js_object_get_own_property_names_shape (cyclomatic 97): perry_runtime::object::descriptors::js_object_get_own_property_names_shape has cyclomatic complexity 97 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/descriptors.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3ac072127b5aec93e984ea2ec2e0d7ecd3a81b8335ee1f79776a1b4be4aeda"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::arrays_finds::lower (cyclomatic 95): perry_codegen::expr::arrays_finds::lower has cyclomatic complexity 95 (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/perry-codegen/src/expr/arrays_finds.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48b064288dcbbd68fd5ef39b57d9b486f7e2acaa23ce83f2a5ac8ebca792b4a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_gc_effects::graph::classify (cyclomatic 95): perry_gc_effects::graph::classify 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/perry-gc-effects/src/graph.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"22803dfed4df99b3f3fb70f95a40534cdf0404706d3cdadb07907bdb25c62ebb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_assign::lower_assignment_target (cyclomatic 95): perry_hir::lower::expr_assign::lower_assignment_target 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/perry-hir/src/lower/expr_assign.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"708ae210156dc5f522968adc8c64672362e0ca3c3415c41a59dad04c36439301"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::extern_func::try_lower_extern_func_call (cyclomatic 93): perry_codegen::lower_call::extern_func::try_lower_extern_func_call has cyclomatic complexity 93 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/extern_func.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8ff27bd69fa8c98b64d55d775bf69e3cb8bdee92ace6ec07a835fa19e0be2a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::global_this::populate::populate_global_this_builtins_inner (cyclomatic 93): perry_runtime::object::global_this::populate::populate_global_this_builtins_inner has cyclomatic complexity 93 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/global_this/populate.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdce767c111e4c2c0d73c129571dbd8728b94eeed3758c39d6e73d7e10adf86"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_call_method::string_methods::dispatch_string (cyclomatic 93): perry_runtime::object::native_call_method::string_methods::dispatch_string has cyclomatic complexity 93 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/native_call_method/string_methods.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"457953ed369b4ecbe3b64382f4c9f46e650bb7b245e7cec502b27d7808ab862a"}},{"ruleId":"D1","level":"warning","message":{"text":"Build::expr (cyclomatic 92): Build::expr has cyclomatic complexity 92 (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/perry-codegen/src/codegen/source_need/flow.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"318281944ea12cde90b02c300bc0a3aa581abc735d4f98d714b2b3d97b27ccc0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::string_regex_proc::lower (cyclomatic 92): perry_codegen::expr::string_regex_proc::lower has cyclomatic complexity 92 (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/perry-codegen/src/expr/string_regex_proc.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"90380e2f40b4ea15d5a6ebe69d68e823028e2ae163d151afe91f3921b07edd62"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_root_dominance_check.main (cyclomatic 92): gc_root_dominance_check.main has cyclomatic complexity 92 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gc_root_dominance_check.py"},"region":{"startLine":8076}}}],"partialFingerprints":{"codehealthFindingId/v1":"614a207a242b843369105493dba3fa714f9b187dd56be440b47cb0e2bd12dfb8"}},{"ruleId":"D1","level":"warning","message":{"text":"FuncEmitCtx::try_emit_expr_native_method (cyclomatic 91): FuncEmitCtx::try_emit_expr_native_method has cyclomatic complexity 91 (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/perry-codegen-wasm/src/emit/expr/native_method.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37810183d8d06dc8810a33548b0e522f7cf1003bdb557d25070c0622c0ac4e1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::artifacts::emit_module_artifacts (cyclomatic 90): perry_codegen::codegen::artifacts::emit_module_artifacts has cyclomatic complexity 90 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/artifacts.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"be769dbf242091f7c3b44a3e75cd5ca1daf03a56da4a4e56d28dda95251124d7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_string_method::lower_string_method_dispatch (cyclomatic 90): perry_codegen::lower_string_method::lower_string_method_dispatch has cyclomatic complexity 90 (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/perry-codegen/src/lower_string_method.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc0dcba0e22f8b404ed25c1c773d960f1d3e2c154469b2ed7e404e15e9fab8e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::global_this::fetch_globals::js_fetch_or_value_super (cyclomatic 90): perry_runtime::object::global_this::fetch_globals::js_fetch_or_value_super has cyclomatic complexity 90 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/global_this/fetch_globals.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22ee43c560b514d7bf48024610b2167d1abd139d3355a58bfb91cf5d70c90c8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_arkts::mutations::collect_mutations_in_expr (cyclomatic 89): perry_codegen_arkts::mutations::collect_mutations_in_expr has cyclomatic complexity 89 (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/perry-codegen-arkts/src/mutations.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21e3acd3a312d84b48a242e2c93224a58d1041bd32897e84ad3a4b50d87f002"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::store_into (cyclomatic 88): Model::store_into 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/perry-wpfacts/src/solve/store.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"441ee5cb35ec3578c1494141455d88c185affc8b60cba1d9ec0bfeb6014332fb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::element_shape_loop::match_element_shape_versioned_loop (cyclomatic 87): perry_codegen::stmt::element_shape_loop::match_element_shape_versioned_loop has cyclomatic complexity 87 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/element_shape_loop.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa6fed92f8fc586bcda0e596aca70cf97d59d7a6377dbb055621c108d9d6b45"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::lower_call_inner (cyclomatic 87): perry_hir::lower::expr_call::lower_call_inner has cyclomatic complexity 87 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/mod.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f3f8fc27ba38524312a01cd90c310c94393f4a4fbccd0ba673260c348485e1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_new::member::lower_new_member_native (cyclomatic 87): perry_hir::lower::expr_new::member::lower_new_member_native has cyclomatic complexity 87 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_new/member.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc943f9a8702d28361160c14da9989f2902c89139c0f5167da9ea4d2e4c4fc33"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::delete_rest::js_object_delete_field (cyclomatic 87): perry_runtime::object::delete_rest::js_object_delete_field has cyclomatic complexity 87 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/delete_rest.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c16bd72c646ad36dc5fb3814f5ea4506b813862e19a3dd69f816864da7912ac"}},{"ruleId":"D1","level":"warning","message":{"text":"Census::compute (cyclomatic 85): Census::compute 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/perry-codegen/src/codegen/reach_report.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"284f7b390e98823a0a0757223803af5f267c0b8fe1f7ebd5a76dd59980693a2c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_geisterhand::server::run_server (cyclomatic 85): perry_ui_geisterhand::server::run_server 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/perry-ui-geisterhand/src/server.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"941c4b99cc25162bd0690fbdc83aa1cabe9f765c0fe444bb1ccd15f05bb4f536"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::misc_methods::lower (cyclomatic 84): perry_codegen::expr::misc_methods::lower has cyclomatic complexity 84 (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/perry-codegen/src/expr/misc_methods.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"da68846fb1d7188cf95aaa961ee4c08f66a2860be09fabc6c6c246512aa0d014"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::new_dynamic::lower (cyclomatic 84): perry_codegen::expr::new_dynamic::lower has cyclomatic complexity 84 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/new_dynamic.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"737fdee855d23c886b02ceefb4fc99e3ba1cc46aba63094535a26b97bf2080b4"}},{"ruleId":"D1","level":"warning","message":{"text":"package_bench.cmd_report (cyclomatic 84): package_bench.cmd_report has cyclomatic complexity 84 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/package_bench.py"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e62108cf1bd9422e7630d339dc4d4f064552f8e7c2aebd3eaffa3f89fa501c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::class_registry::construct::builtin::construct (cyclomatic 83): perry_runtime::object::class_registry::construct::builtin::construct has cyclomatic complexity 83 (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/perry-runtime/src/object/class_registry/construct/builtin.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8c46d1b8184a0849f163d3b27e490ee2ce7a8768c4cae1ac9680868058ee98"}},{"ruleId":"D1","level":"warning","message":{"text":"FnReader::typed (cyclomatic 82): FnReader::typed has cyclomatic complexity 82 (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/perry-codegen/src/dialect/mod.rs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"76be49cd5af547b55737736764740dc019a1609eb43543e25563f8af58bbf3f0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::module_globals_emit::emit_module_globals (cyclomatic 82): perry_codegen::codegen::module_globals_emit::emit_module_globals has cyclomatic complexity 82 (threshold 15). Of this number, 77 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/perry-codegen/src/codegen/module_globals_emit.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb157d198c023587d67fe2add770ad0ac97778d0addd1f7258320e6b5274fb67"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::bigint_set::lower (cyclomatic 81): perry_codegen::expr::bigint_set::lower has cyclomatic complexity 81 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/bigint_set.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e6664595c4b370eba8c6c6d7f2c1cfbc6f7d4ba29f52bef0c6ae0085ee51d4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_call_method::typed_array::dispatch_typed_array_method (cyclomatic 81): perry_runtime::object::native_call_method::typed_array::dispatch_typed_array_method has cyclomatic complexity 81 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/native_call_method/typed_array.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"29bd782051df0e4ba5a048566df31b3e63af257dd731653c594d2d40ae2af227"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_root_dominance_check.statepoint_self_test (cyclomatic 81): gc_root_dominance_check.statepoint_self_test has cyclomatic complexity 81 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gc_root_dominance_check.py"},"region":{"startLine":6087}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac0964dfe7967122d8265b31a74a01629c384753438bbacdb2e35ad1882c26f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::root_reload::apply_to_function (cyclomatic 80): perry_codegen::root_reload::apply_to_function has cyclomatic complexity 80 (threshold 15). Of this number, 77 points are the body\u0027s own statements and 3 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":"crates/perry-codegen/src/root_reload.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"975cc813862f00e0bda9c0582599b764783e42c2b0013a6d4197fea9fef823e3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_function::lower_fn_expr_anon (cyclomatic 80): perry_hir::lower::expr_function::lower_fn_expr_anon has cyclomatic complexity 80 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75c2fb710582c2653c466c48257295a1c5013ed19fbc2820e0aeef108b5fa27"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::eval_super_scan::scan_expr (cyclomatic 79): perry_hir::lower::eval_super_scan::scan_expr has cyclomatic complexity 79 (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/perry-hir/src/lower/eval_super_scan.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d77b8d78d65710917c6688366cb7c7a11d8bff6eb4dd2d37e1a4ea4d66d631"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::url_date_instance::try_url_date_weakref_instance (cyclomatic 79): perry_hir::lower::expr_call::url_date_instance::try_url_date_weakref_instance has cyclomatic complexity 79 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/url_date_instance.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9fe4247ac2d19ad69026e5e66bc92b71889c267101bd8ed56bccd274d9b186"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::gc::copying::run_copied_minor_attempt (cyclomatic 79): perry_runtime::gc::copying::run_copied_minor_attempt has cyclomatic complexity 79 (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/perry-runtime/src/gc/copying.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"133be069c5d59f8ab63579be3be469dead4df758312bf8c4c10d7aa88c7a125a"}},{"ruleId":"D1","level":"warning","message":{"text":"check_actions_topology.main (cyclomatic 79): check_actions_topology.main has cyclomatic complexity 79 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check_actions_topology.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d6028bde21b4fe5a13e1c9270bc2d4b28d66246894bcf5c6b17b7f9c99d276"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::builtins::tok_load (cyclomatic 78): perry_wpfacts::builtins::tok_load 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/perry-wpfacts/src/builtins.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"28baed6436a7a4b4b8204dfe2828767991c0cf6c6f733b727fc3d016f30f93b0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::closure::compile_closure (cyclomatic 77): perry_codegen::codegen::closure::compile_closure has cyclomatic complexity 77 (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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ebe5d9da27272bc50f205a69be001c48fde6b6a56106a28f86074b92aacf791"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::index_get::lower (cyclomatic 77): perry_codegen::expr::index_get::lower has cyclomatic complexity 77 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/index_get.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"03031f85fcad8a05c5bc61e48c9860c2b7970e3eba67f2aa0d01c70931b8272c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::type_analysis::refine::refine_type_from_init (cyclomatic 77): perry_codegen::type_analysis::refine::refine_type_from_init has cyclomatic complexity 77 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/type_analysis/refine.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef551c32d6a7e76450700c720ecddd05ead491bcc8405e47d453d2e5a73a5395"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::class_captures::synthesize_class_captures (cyclomatic 77): perry_hir::lower_decl::class_captures::synthesize_class_captures has cyclomatic complexity 77 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_decl/class_captures.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"88576ac73064b7db4db1b0a68042f3070e5109cedd73f4983a809f0f94cf021d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::index_set::lower (cyclomatic 76): perry_codegen::expr::index_set::lower has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/index_set.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce50d3eac6ca24df656da065525c6699c625a369b387c185dedc87090775992"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json::stringify_object::stringify_object_walk (cyclomatic 76): perry_runtime::json::stringify_object::stringify_object_walk has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/json/stringify_object.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"add2cc894e5e7ea193eb2507a05b2afb179c6c3109b91e182f956ae2f4b5b4d1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::link::platform_cmd::select_linker_command (cyclomatic 75): perry::commands::compile::link::platform_cmd::select_linker_command 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/perry/src/commands/compile/link/platform_cmd.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbf7ebd9ce339b9a347756ee7337792c01d0ca64bbb9c0e688ad96feb28c0d6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::to_string_tag::js_object_to_string (cyclomatic 75): perry_runtime::object::to_string_tag::js_object_to_string 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/perry-runtime/src/object/to_string_tag.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"4888d51eb0e3019bf2dd4598d4e78200e5f2f9276ff46a2670e7277a73ca02a8"}},{"ruleId":"D1","level":"warning","message":{"text":"package_bench.cmd_run (cyclomatic 75): package_bench.cmd_run 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":"scripts/package_bench.py"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"877ee7886fc2c5c3806b6f5e62613c8be5c1844a7ecbec312d7685518a47692c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::binary::lower (cyclomatic 74): perry_codegen::expr::binary::lower 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/perry-codegen/src/expr/binary.rs"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce1d7cb5fca893c9794b9b95e78bc83b1eaa93c96463a18de71167c9d2c9ac6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::static_field_meta::lower (cyclomatic 74): perry_codegen::expr::static_field_meta::lower 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/perry-codegen/src/expr/static_field_meta.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"be27880409b0800c12b43598d5007202deff52fb9a50f89195b4a10f03587e45"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::crypto::random::js_crypto_native_dispatch (cyclomatic 74): perry_stdlib::crypto::random::js_crypto_native_dispatch has cyclomatic complexity 74 (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/perry-stdlib/src/crypto/random.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"febb4b07032b7c962a1e3f755db9fa67e5acd442a547462727d671bc9e40b099"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::math_simple::lower (cyclomatic 73): perry_codegen::expr::math_simple::lower has cyclomatic complexity 73 (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/perry-codegen/src/expr/math_simple.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"3def8d93d169264372158801eb54202d175c24e53671bbde8f086b5b351df6ba"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::value::dyn_index::js_dyn_index_get (cyclomatic 73): perry_runtime::value::dyn_index::js_dyn_index_get 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/perry-runtime/src/value/dyn_index.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"741859f26c785c85281963eed59db1b6eb1d1680a19f92bd0136dc63282c17e8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::generator::lower::transform_generator_function_with_extra_captures (cyclomatic 73): perry_transform::generator::lower::transform_generator_function_with_extra_captures 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/perry-transform/src/generator/lower.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc41707911e48531e1d51707427cfef3755b21aafd339a736bf6252b8267cbb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::loops::lower_for_after_init_impl (cyclomatic 72): perry_codegen::stmt::loops::lower_for_after_init_impl 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":7176}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ff3e1e5d3a31eb7efe345348dc8e60c825007a4ce1a42eaf5ec6efd552d092"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::loops::expr_preserves_array_length (cyclomatic 71): perry_codegen::stmt::loops::expr_preserves_array_length has cyclomatic complexity 71 (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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":9570}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16fc2f44ae9584204932fd3177d56a031c1cbf7053703f226dd87197e095072"}},{"ruleId":"D1","level":"warning","message":{"text":"JsEmitter::emit_native_method_call (cyclomatic 71): JsEmitter::emit_native_method_call has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/emit/native.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e191e2aa7c693c24a0bbf5ec9326c6f5f1f60b051608c6e57c0f21ae110b28a0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::builtins::table::js_console_table_with_properties (cyclomatic 71): perry_runtime::builtins::table::js_console_table_with_properties has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/builtins/table.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"56297b2a02ec151bd2d98ccf5fb4309c09e0ba6ea508ea7a9c29ac057056c0b5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::entry::compile_module_entry (cyclomatic 70): perry_codegen::codegen::entry::compile_module_entry 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/perry-codegen/src/codegen/entry.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9513678218a4a10f413bba1eb7e3a2b89b4ce352ee23d4d18f5453d956bdf5c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_array_method::lower_array_method (cyclomatic 70): perry_codegen::lower_array_method::lower_array_method 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/perry-codegen/src/lower_array_method.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c5cd12892823f333f5bcac7054cd7065467454eaeaa5b02538186860617cf3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::indexed_owner_loop::lower (cyclomatic 70): perry_codegen::stmt::indexed_owner_loop::lower 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/perry-codegen/src/stmt/indexed_owner_loop.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb43aa0adfdb4bdc250ebc9692191616d05d6522a903d25bc1429e29099a7e75"}},{"ruleId":"D1","level":"warning","message":{"text":"FuncEmitCtx::try_emit_expr_literals_vars (cyclomatic 70): FuncEmitCtx::try_emit_expr_literals_vars has cyclomatic complexity 70 (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/perry-codegen-wasm/src/emit/expr/literals_vars.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad019c9905df49adf8bb2699a5b7aa0dd21740235b86057abca00a52cfb39a17"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::generator::linearize::linearize_body (cyclomatic 70): perry_transform::generator::linearize::linearize_body 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/perry-transform/src/generator/linearize.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"89038dd54cc5ecb75aee04be3a781caba816b50cc56bfa289ca94dadc17d08fe"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::extract_exports::extract_object_literal_exports_from_require (cyclomatic 69): perry::commands::compile::cjs_wrap::extract_exports::extract_object_literal_exports_from_require has cyclomatic complexity 69 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/cjs_wrap/extract_exports.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"8542870271954e33c1b3d169743ca8d53cc021e592d99e87f629f639f9ca95b4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::hoist_classes::collect_top_level_let_const_var_names (cyclomatic 69): perry::commands::compile::cjs_wrap::hoist_classes::collect_top_level_let_const_var_names has cyclomatic complexity 69 (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/perry/src/commands/compile/cjs_wrap/hoist_classes.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab41ad9a0396fd64b8f9cad5d5d810bdc2a4c957a11f5886fe5505d44098830c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::widget_decl::try_lower_widget_decl (cyclomatic 68): perry_hir::lower::widget_decl::try_lower_widget_decl 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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d9473b24f5067b5c2b87e29bf13efc9480ec0f622e3fbf742deb356da8d22d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_get_set::get_field_by_name::class_value_get_field (cyclomatic 68): perry_runtime::object::field_get_set::get_field_by_name::class_value_get_field 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/perry-runtime/src/object/field_get_set/get_field_by_name.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee66ffc4eb8bdd6fbcab4528d730a3f0b1f497177a5f8d426fad5ec6e720a9fb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::promise::microtasks::pump_protected (cyclomatic 68): perry_runtime::promise::microtasks::pump_protected 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/perry-runtime/src/promise/microtasks.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"0173c7e3e89823b3df0fb3d009ae6b5b00bcc9c6f6dca30bc4f92794f396050f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::region_loop::lower_split (cyclomatic 67): perry_codegen::stmt::region_loop::lower_split has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/region_loop/mod.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"362bbcaca3e33ede124e31ffd2e1c9dd3f5c85095239e2733658706396e5859e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::hoist_classes::extract_top_level_class_decls_with_exports (cyclomatic 66): perry::commands::compile::cjs_wrap::hoist_classes::extract_top_level_class_decls_with_exports has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/cjs_wrap/hoist_classes.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7568a8938050c21ce8cd08a2a34d2de74388fde26880d41778089f1d9f9dd78"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::escape_objects::check_object_literal_escapes_in_expr (cyclomatic 66): perry_codegen::collectors::escape_objects::check_object_literal_escapes_in_expr has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/escape_objects.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"b984b2b79b4c8717e26faa2d0300bb732230be8613bd3ee743498b9f22393245"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_root_dominance_check.check_func_unrooted_allocas (cyclomatic 66): gc_root_dominance_check.check_func_unrooted_allocas has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gc_root_dominance_check.py"},"region":{"startLine":3979}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72b28352c93c3359a8f74c0861e754f2b15c052805b76de4caef96567e90e15"}},{"ruleId":"D1","level":"warning","message":{"text":"measure_linux_rss_ab.main (cyclomatic 66): measure_linux_rss_ab.main has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/measure_linux_rss_ab.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7357769e6706bd0884e22d1cd66c11c87d23455d1cfe7e79b7c60929d6464b"}},{"ruleId":"D1","level":"warning","message":{"text":"FuncEmitCtx::try_emit_expr_classes (cyclomatic 65): FuncEmitCtx::try_emit_expr_classes 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/perry-codegen-wasm/src/emit/expr/classes.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f37a2dd6ec7ecc145e70789e3d1e070f77d4a0143f8a3665e2f3c4a9c69cd5"}},{"ruleId":"D1","level":"warning","message":{"text":"Proof::expr (cyclomatic 65): Proof::expr 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/perry-hir/src/analysis/numeric_order.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"356b2d9b2351ac43efea9243ca49545350b83981b188a48c0e7f0247393f9f3a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::child_process::reactor::cp_reactor_pump_inner (cyclomatic 65): perry_runtime::child_process::reactor::cp_reactor_pump_inner 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/perry-runtime/src/child_process/reactor.rs"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"391bd192a3c163149aa03438333027fb084bbf2eb4df62b5aa8382f39e7de244"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::gc::layout_slot_visit::visit_gc_rewrite_slot_descriptors_with (cyclomatic 65): perry_runtime::gc::layout_slot_visit::visit_gc_rewrite_slot_descriptors_with 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/perry-runtime/src/gc/layout_slot_visit.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"db50580cf8ec37527e2e8b6cf3ff1d07688d43b1c680ac397bddba1b502565f1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::object_ops::keys_array::ensure_key_in_keys_array_inner (cyclomatic 65): perry_runtime::object::object_ops::keys_array::ensure_key_in_keys_array_inner 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/perry-runtime/src/object/object_ops/keys_array.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"011130310eb1b42129e87c5c0cde8cdbb8abff4e3d65af4c05e997c0564304f3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::check::run (cyclomatic 64): perry::commands::check::run 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/perry/src/commands/check.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca2aa728494bd914f4cb5e9a1ddfe77d29d554fdc81cc81a88f35d29a4737b4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::js_transform::local_natives::fix_native_instance_expr_with_locals (cyclomatic 64): perry_hir::js_transform::local_natives::fix_native_instance_expr_with_locals 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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d709080347a1f5ff4c53a5575714260503e9e11e789b693e7c2d5301b7e565d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::value::dynamic_object::js_dynamic_object_get_property (cyclomatic 64): perry_runtime::value::dynamic_object::js_dynamic_object_get_property 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/perry-runtime/src/value/dynamic_object.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"11210de372384fc9e81bcb9fade4df2bd043008f8a064a31d28b1ca9f028d1bc"}},{"ruleId":"D1","level":"warning","message":{"text":"UseWalk::walk_expr (cyclomatic 63): UseWalk::walk_expr has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/ptr_shape.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"029663ce7631e311a14a773eef2b934ca16727c33afd0452666cdda339ee2946"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::func_ref::try_lower_func_ref_call (cyclomatic 63): perry_codegen::lower_call::func_ref::try_lower_func_ref_call has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/func_ref.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c915bbdc270c247a43f1f1e4d010a9b757e5b3c94a5b317d9511d6778d510d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::static_and_instance::try_static_method_and_instance (cyclomatic 63): perry_hir::lower::expr_call::static_and_instance::try_static_method_and_instance has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/static_and_instance.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2808819b3f24889abbd09ae8b9f660b1d69678f68c79ac478df6554cd171cdd"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_types::extract::extract_ts_type_with_ctx (cyclomatic 63): perry_hir::lower_types::extract::extract_ts_type_with_ctx has cyclomatic complexity 63 (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/perry-hir/src/lower_types/extract.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e677189e83932a25e2d5604c5ee3876959736b75cc1a5b9209dcaa8ef0e60f6f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_get::try_data_lookup_key (cyclomatic 63): perry_runtime::object::native_get::try_data_lookup_key has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/native_get.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"0877d53f3b4fe2026fc55e2980af441a34211274aaca3142d8e421f1ce34436b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::decl_units::views (cyclomatic 63): perry_wpfacts::decl_units::views has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/decl_units.rs"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e706e5c6effbbacb05ffbdd987923bc02c4fac59d435fed44937fea12a79ad"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::optimized_libs::features::auto_optimized_cross_features (cyclomatic 62): perry::commands::compile::optimized_libs::features::auto_optimized_cross_features has cyclomatic complexity 62 (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/perry/src/commands/compile/optimized_libs/features.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc92786311a1800333e36221dd45b7b98efe08683c710a07be0b3f32f283d84c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::early_branches::try_lower_closure_typed_local_call (cyclomatic 62): perry_codegen::lower_call::early_branches::try_lower_closure_typed_local_call has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/early_branches.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"19eae059f058a1e39e794c6bfe0e34aa502738c216aac6fca2cc85d9d5f9dab8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::analysis::replace_this_in_expr (cyclomatic 62): perry_hir::analysis::replace_this_in_expr has cyclomatic complexity 62 (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/perry-hir/src/analysis.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e30d899d24ca15c80a3c099b9e12e01ca266d4c0af121ade09dba55d68eecf2"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::closure_analysis::collect_closure_assigned_in_body_expr (cyclomatic 62): perry_hir::lower::closure_analysis::collect_closure_assigned_in_body_expr has cyclomatic complexity 62 (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/perry-hir/src/lower/closure_analysis.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"b812900717489cc2a4f539e834e0e44066277bcf7085ea994b245be866effc06"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::bundle_ios::build_ios_app_bundle (cyclomatic 61): perry::commands::compile::bundle_ios::build_ios_app_bundle has cyclomatic complexity 61 (threshold 15). Of this number, 59 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/perry/src/commands/compile/bundle_ios.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b633e6857ce4b235547ef201bef1c2c1345c57a94da4e33c110fa4a91c17307"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::native_value::verify::abi::validate_native_abi_type_record (cyclomatic 61): perry_codegen::native_value::verify::abi::validate_native_abi_type_record has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/native_value/verify/abi.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"298bc02e7193ab5019d5a3706552c2673806fb20110b5a47ab40e566a9c27e6d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::destructuring::var_decl::lower_var_decl_with_destructuring (cyclomatic 61): perry_hir::destructuring::var_decl::lower_var_decl_with_destructuring has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/destructuring/var_decl.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6710797945fd538a0f9d4ebd59a8ea40d72bed9f6591dd9ce68890649e7fc55"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::object_ops_frozen::object_integrity_level (cyclomatic 61): perry_runtime::object::object_ops_frozen::object_integrity_level has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/object_ops_frozen.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b40fa42c39dd2fa6ee21e19ee9e854c0065feadc5b84e7cbf62cb6349f26538"}},{"ruleId":"D1","level":"warning","message":{"text":"verification.native_rep_contract_results (cyclomatic 61): verification.native_rep_contract_results has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/compiler_output_harness/verification.py"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"df459a76d27ad605a6f550912c18427287a010546329fb64aefbfc99db1d1cac"}},{"ruleId":"D1","level":"warning","message":{"text":"wpfacts_recompute.run (cyclomatic 61): wpfacts_recompute.run 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":"scripts/wpfacts_recompute.py"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8401a69c8fdf931051f617933f00fc28dacb2bddbd57b447e5fad12f96e0477"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayFactCollector::collect_expr (cyclomatic 60): ArrayFactCollector::collect_expr has cyclomatic complexity 60 (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/perry-codegen/src/collectors/hir_facts.rs"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4085ef4cfded6560dc8c400d95a8a2159d42cfb06c15d5d4b31465966914b56"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape::collect_shape_proven_ptr_locals_impl (cyclomatic 60): perry_codegen::collectors::ptr_shape::collect_shape_proven_ptr_locals_impl has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/ptr_shape.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b07978fe2f63e802ab55bbd3b9184b6fa532a7d3ac8c6529ce2423e8e6a18d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::os_uri_dates::lower (cyclomatic 60): perry_codegen::expr::os_uri_dates::lower has cyclomatic complexity 60 (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/perry-codegen/src/expr/os_uri_dates.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3b1cd506c3da5c50c56cceddb82de8012715f8fb0ba6939c6c950004389f1f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::type_analysis::numeric::is_numeric_expr (cyclomatic 60): perry_codegen::type_analysis::numeric::is_numeric_expr has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/type_analysis/numeric.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c7c752c876885805b81343b287ba377e79db1aa7237bb14fed46c05f180a85"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::url::node_compat::legacy_url_parse_impl (cyclomatic 60): perry_runtime::url::node_compat::legacy_url_parse_impl has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/url/node_compat.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7e1582bd788d84c8c3dd283581de26baec8c894d2285cd88930a78df2aad25"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::webcrypto::hmac::js_webcrypto_verify (cyclomatic 60): perry_stdlib::webcrypto::hmac::js_webcrypto_verify has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/webcrypto/hmac.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89a20b3f297d5348ead7e2ac7f9e3f94a67885b546493d83bcdaa9877a7fa68"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::decl_units::closed (cyclomatic 60): perry_wpfacts::decl_units::closed has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/decl_units.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1be7fbfc9d7b137116ba1db3fbea54f1f57de9060a3153280873947b96f2c8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::extract_exports::extract_exports_from_source (cyclomatic 59): perry::commands::compile::cjs_wrap::extract_exports::extract_exports_from_source has cyclomatic complexity 59 (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/perry/src/commands/compile/cjs_wrap/extract_exports.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"d646dc002254be851b0a6944af127ed3f1dfbcc723842d583d08f200c9b6c57a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::run::remote::remote_build_and_launch (cyclomatic 59): perry::commands::run::remote::remote_build_and_launch has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/run/remote.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6069f820994db520fceab923651a4a752b8cf5e08bf9f9fc54301fa53a7460cc"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::escape_arrays::check_array_escapes_in_expr (cyclomatic 59): perry_codegen::collectors::escape_arrays::check_array_escapes_in_expr has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/escape_arrays.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb616c41a5786490e58b26ee0c9eeb582a9c547c33a4a853c4b715634579c38"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::call_spread::lower (cyclomatic 59): perry_codegen::expr::call_spread::lower has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/call_spread.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab0948e9084e6abbffcc904bc51f127f2c1126628f203694c2741800d5a761e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::proxy_reflect::lower (cyclomatic 59): perry_codegen::expr::proxy_reflect::lower has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/proxy_reflect.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc7a07e443b1dd2a5990de147fa56e05096123a182cb05ad46f37a9b5d03a18"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::static_method::lower (cyclomatic 59): perry_codegen::expr::static_method::lower has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/static_method.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecab7896ab795a199ae0e20026182ba850d17180c27ca997a72720e1baa542f4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::destructuring::var_decl::native_new::register_native_from_new_and_calls (cyclomatic 59): perry_hir::destructuring::var_decl::native_new::register_native_from_new_and_calls has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/destructuring/var_decl/native_new.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35358697cd633027aa3cde9ddde7c3155148eef6e4722d0accb794ec902f980"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::layout_desc::registration::register_bound (cyclomatic 59): perry_runtime::object::layout_desc::registration::register_bound has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/layout_desc/registration.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaebddc20f0b5e48d41234d20393952a708475ecc46ef9fd866e1f11d6a47530"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::typed_array_proto_thunks::dispatch_uint8_buffer_method (cyclomatic 59): perry_runtime::object::typed_array_proto_thunks::dispatch_uint8_buffer_method has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/typed_array_proto_thunks.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea71f49dd13509bb9bcdea51a773ffc76d7fba786ee4f27258d0efdfc0d331aa"}},{"ruleId":"D1","level":"warning","message":{"text":"actions_plan._matches_event (cyclomatic 59): actions_plan._matches_event has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/actions_plan.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc74478b77914cc52c836f099ed33499a10c790863e73677aacbbd06ae259d3"}},{"ruleId":"D1","level":"warning","message":{"text":"index.main (cyclomatic 59): index.main has cyclomatic complexity 59 (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":"upstream/actions/jdx/mr-boxington-action/src/index.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc140c153cff8d4c78838ae702fa18510884660417dfb8d789f1c154dab7498"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::console_promise::try_lower_console_call (cyclomatic 58): perry_codegen::lower_call::console_promise::try_lower_console_call has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/console_promise.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe4c38d219e0b926130884af06b5dd28d51c8b5a80e4781e6006788707e7b8c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_arkts::widgets::text::emit_style_modifiers (cyclomatic 58): perry_codegen_arkts::widgets::text::emit_style_modifiers has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-arkts/src/widgets/text.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d365ae3e6e6c9493e635b759b7af64f98496b37d6fecb1677ba91a984e6eab1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::destructuring::var_decl::type_infer::infer_decl_type (cyclomatic 58): perry_hir::destructuring::var_decl::type_infer::infer_decl_type has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/destructuring/var_decl/type_infer.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"502bde8bf158c7d0b82f3f72ce9915a7fce6fb0f59f6f99604077a213b24b2f7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::js_transform::cross_module_natives::fix_native_instance_expr (cyclomatic 58): perry_hir::js_transform::cross_module_natives::fix_native_instance_expr has cyclomatic complexity 58 (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/perry-hir/src/js_transform/cross_module_natives.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaef52e24761649ddfe2e23136b5f1c3fc8414d042336b3a38cf3e7c1b9df0eb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::native_module::try_native_module_methods (cyclomatic 58): perry_hir::lower::expr_call::native_module::try_native_module_methods has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/native_module.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"88be760a457fcf244789640e36418b68bb73935cf99eb83af1bdf92e858e18bf"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_module_dispatch::dispatch_m_p::nm_dispatch_path (cyclomatic 58): perry_runtime::object::native_module_dispatch::dispatch_m_p::nm_dispatch_path has cyclomatic complexity 58 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: perry_runtime::object::native_module_dispatch::dispatch_m_p::nm_dispatch_process (cyclomatic 72) 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/perry-runtime/src/object/native_module_dispatch/dispatch_m_p.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e99ee49d3403006ce0b4c4960bee1c4a6bf5fbb24d54e068c7be8be080b190"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::object_ops::has_own::object_has_own_generic (cyclomatic 58): perry_runtime::object::object_ops::has_own::object_has_own_generic has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/object_ops/has_own.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b7ed8331c6e57a76e2f8958b325fc4846d4a0f38c3848a1aabe125b3789856"}},{"ruleId":"D1","level":"warning","message":{"text":"FuncEmitCtx::try_emit_expr_url_process_path (cyclomatic 57): FuncEmitCtx::try_emit_expr_url_process_path has cyclomatic complexity 57 (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/perry-codegen-wasm/src/emit/expr/url_process_path.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee9bfd44e2b9a942c5a51fe496211ba62f16a33634c305d1e5245af6b8dffaa"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::analysis::fn_infer::round (cyclomatic 57): perry_hir::analysis::fn_infer::round has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/analysis/fn_infer.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"4680ec059fec3b01c35696b29a7017f7ba12ae17a1d8fc3bd59e12be52200b23"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::closure_analysis::widen_mutable_captures_expr (cyclomatic 57): perry_hir::lower::closure_analysis::widen_mutable_captures_expr has cyclomatic complexity 57 (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/perry-hir/src/lower/closure_analysis.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"4304d56575a81522f0dfbfdfa471a0ec2c13817e495ee522f35fa3bfd4a77b24"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::monomorph::defaults::fill_defaults_in_expr (cyclomatic 57): perry_hir::monomorph::defaults::fill_defaults_in_expr has cyclomatic complexity 57 (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/perry-hir/src/monomorph/defaults.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8081346d9ae7b75f2a2d3579266e0530dae3775e76836f6460f53bfc2a728a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::assign::object_assign_one (cyclomatic 57): perry_runtime::object::assign::object_assign_one has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/assign.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"7adb7ac427a4a4a1a89f456803614d8776cc459282adf8da1f5d8764cd6b1b06"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_get_set::enumeration::js_object_keys_shape (cyclomatic 57): perry_runtime::object::field_get_set::enumeration::js_object_keys_shape has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/field_get_set/enumeration.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae8d64303cd35a7770d928c22d3165401a212955f19e00aff7f7012aecd4fce"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::calls::lower (cyclomatic 56): perry_codegen::expr::calls::lower has cyclomatic complexity 56 (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/perry-codegen/src/expr/calls.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"df80ea40e0e1a73fddddf1c8fe364d36416b889bf9fca42986685b0fe35eeb0a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::url_main::lower (cyclomatic 56): perry_codegen::expr::url_main::lower has cyclomatic complexity 56 (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/perry-codegen/src/expr/url_main.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"353d5e06d70b356ea9d9ac11496f4c29bcfb929bc4760e53fddcfc39945436d5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::native::lower_native_method_call (cyclomatic 56): perry_codegen::lower_call::native::lower_native_method_call 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/perry-codegen/src/lower_call/native/mod.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c834e7875361fbd85cddee73d5de8a2c80347cc9ce6f068f5cc0af7b3cb07bb5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::loops::match_packed_f64_range_loop (cyclomatic 56): perry_codegen::stmt::loops::match_packed_f64_range_loop 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":1754}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b071ab44b3671247bfe6b7be484e435c0ffedb92cfbfd435d25943481470e9d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::loops::expr_array_length_effect (cyclomatic 56): perry_codegen::stmt::loops::expr_array_length_effect 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":9107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d439c595632ca3d2d046e4fab30ebb7f80f45ca30daefcfff1339a195d9404e5"}},{"ruleId":"D1","level":"warning","message":{"text":"FuncEmitCtx::emit_stmt (cyclomatic 56): FuncEmitCtx::emit_stmt 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/perry-codegen-wasm/src/emit/stmt.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffba9705180f078f6b4690b15ff1c60b152099415889d02107b3fa8977aba90"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_component_host::task_exit::instrument::instrument (cyclomatic 56): perry_component_host::task_exit::instrument::instrument 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/perry-component-host/src/task_exit/instrument.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eaf2ea12e68f0285deed592845a99a9b28225923bbc495d15407dd30d3bdb49"}},{"ruleId":"D1","level":"warning","message":{"text":"ComposeEngine::up (cyclomatic 56): ComposeEngine::up 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/perry-container-compose/src/compose.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efb4d9f55f224ea9094619e9552b0332f77ad47e36a1356f188d72aa1b229ca"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::builtins::formatting::format_jsvalue (cyclomatic 56): perry_runtime::builtins::formatting::format_jsvalue 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/perry-runtime/src/builtins/formatting.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5633536a7b6e7ad0f42d9006bc6524cb31152149af0b4490058f9e7401588d6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_call_method::common_methods::dispatch_common (cyclomatic 56): perry_runtime::object::native_call_method::common_methods::dispatch_common 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/perry-runtime/src/object/native_call_method/common_methods.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c76eb80bf60e2acf518a0e2c1fc4ac144dbf558fcb479cf119ce2a53cf5fe60"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::summary::compose::compress (cyclomatic 56): perry_wpfacts::summary::compose::compress 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/perry-wpfacts/src/summary/compose.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1ae42c2969e3b5f8676d547e44e72e872b9cd14e471f9e492f989b03f17df0"}},{"ruleId":"D1","level":"warning","message":{"text":"constfn_executable_gates.main (cyclomatic 56): constfn_executable_gates.main 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":"scripts/constfn_executable_gates.py"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"287bb4c5b880b7a9ee3ff9f4c40c52e484ce23533a446593b03fb18c9c6e359e"}},{"ruleId":"D1","level":"warning","message":{"text":"FuncEmitCtx::try_emit_expr_date_error (cyclomatic 55): FuncEmitCtx::try_emit_expr_date_error has cyclomatic complexity 55 (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/perry-codegen-wasm/src/emit/expr/date_error.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c517cc2361363cd927d1819fa006607c8f2259cbf7bef0793d51e3d38ba5e91"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::analysis::fn_infer::infer_module (cyclomatic 55): perry_hir::analysis::fn_infer::infer_module 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/perry-hir/src/analysis/fn_infer.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f2a42b581271ce4e27a6516c970caa331e7d69b48b0c96c6a7ffddf5b39296"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::closure_analysis::collect_closure_assigned_expr (cyclomatic 55): perry_hir::lower::closure_analysis::collect_closure_assigned_expr has cyclomatic complexity 55 (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/perry-hir/src/lower/closure_analysis.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd8245af2018d76231563c28e696fb4cc190676c6e855c047589816226e0393"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::static_receiver::static_receiver_class (cyclomatic 55): perry_hir::lower::expr_call::static_receiver::static_receiver_class 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/perry-hir/src/lower/expr_call/static_receiver.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b65622218345fc509a155e6099320acc0107f8a6b246673f40eee9df32bca1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::builtins::formatting::format_object_as_json (cyclomatic 55): perry_runtime::builtins::formatting::format_object_as_json 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/perry-runtime/src/builtins/formatting.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a00c8ce35d1ff0a449897eba960ce89c9f129981a38ab780dfb5a7b9c373c14"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::class_registry::construct::construct_function_impl (cyclomatic 55): perry_runtime::object::class_registry::construct::construct_function_impl 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/perry-runtime/src/object/class_registry/construct.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e944867ce565eaa280fd501b040156449aff0cb51f9ce20eae30b3ea369bf8ab"}},{"ruleId":"D1","level":"warning","message":{"text":"web_runtime._perryCodeToKey (cyclomatic 55): web_runtime._perryCodeToKey has cyclomatic complexity 55 (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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":1831}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b6db797104ef6969df8beda554a5c86934ea608ceede0e7bab8fa20d07f37e"}},{"ruleId":"D1","level":"warning","message":{"text":"wasm_runtime.__perryCodeToKey (cyclomatic 55): wasm_runtime.__perryCodeToKey has cyclomatic complexity 55 (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/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":3652}}}],"partialFingerprints":{"codehealthFindingId/v1":"f155dfdb96dc404b15da763ff0d3e276157bf184dad123064bc7c8ad0db92346"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::split_regions::split_list (cyclomatic 54): perry_codegen::codegen::split_regions::split_list has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/split_regions.rs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43af1208a8d67306ab7f2794fe85a6027510afef4b119a12b1ae3fcb047f1dd"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::loops::match_object_array_write_loop (cyclomatic 54): perry_codegen::stmt::loops::match_object_array_write_loop has cyclomatic complexity 54 (threshold 15). Of this number, 51 points are the body\u0027s own statements and 3 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":4574}}}],"partialFingerprints":{"codehealthFindingId/v1":"511155d5432a38ecda7a4cbe927fe63118781b5a0f795ca185207b165d55041d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::type_analysis::predicates::static_type_of (cyclomatic 54): perry_codegen::type_analysis::predicates::static_type_of has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/type_analysis/predicates.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9109c941a28f212b161d1de607444a212da2644ff7091bf8b56a64e5c5e01fb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_net::payload_socket::get (cyclomatic 54): perry_ext_net::payload_socket::get has cyclomatic complexity 54 (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/perry-ext-net/src/payload_socket.rs"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"54889160f44ef8539b154ae549a15079a49bf001126025df0cd43251a02b6dc5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::lower_expr::lower_expr_impl (cyclomatic 54): perry_hir::lower::lower_expr::lower_expr_impl has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/lower_expr.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"849406d1141c2f6035f7478223f8c2a197b56da6d799372df395a094fcf2919b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::date::parse::parse_slash_date (cyclomatic 54): perry_runtime::date::parse::parse_slash_date has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/date/parse.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bad67d77559a1cece4deb8211474eea6e098cf4999b56d3567aeeb3b3ca5f9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::array_object_ops::define_array_property (cyclomatic 54): perry_runtime::object::array_object_ops::define_array_property has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/array_object_ops.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4167b938b4ec99f9e1296de56f9f551d57b5187581c51f81e431e6903e19c7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::builtins::ns_method (cyclomatic 54): perry_wpfacts::builtins::ns_method has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/builtins.rs"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"b213335f9adc9e150f0e9b00543ec426a2c0b4248c30bfc6c4cfa33fd2414499"}},{"ruleId":"D1","level":"warning","message":{"text":"node_core_subset.main (cyclomatic 54): node_core_subset.main has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/node_core_subset.py"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"72879a2b924807792ec93cd45eda16b1c86d9f82150051a7c65470626254c383"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::setup::ios::ios_wizard (cyclomatic 53): perry::commands::setup::ios::ios_wizard 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/perry/src/commands/setup/ios.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ee8de38c6976bf67694cd7e9acafa35d2c5f53cb4b26f3d103ba1c3c567c82"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_elements::collect_element_shape_facts (cyclomatic 53): perry_codegen::collectors::ptr_shape_elements::collect_element_shape_facts 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/perry-codegen/src/collectors/ptr_shape_elements.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04294b15a0ca760c5f00afb033de3de3dbaed2e60240b98009be654b8321960"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::this_as_value::expr_uses_this_as_value (cyclomatic 53): perry_codegen::collectors::this_as_value::expr_uses_this_as_value 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/perry-codegen/src/collectors/this_as_value.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a955b3e70839df2d4afc6d5f2969c04cfac2aabb201a254b949491f58641e7b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::dispatch::lower_expr_inner (cyclomatic 53): perry_codegen::expr::dispatch::lower_expr_inner 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/perry-codegen/src/expr/dispatch.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"690c8f852df04c29033af27a6e6da68eb67f5cb8fcc4497e38da863ca53a225f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::console_promise::util_types::lower_util_types_predicate_arg (cyclomatic 53): perry_codegen::lower_call::console_promise::util_types::lower_util_types_predicate_arg 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/perry-codegen/src/lower_call/console_promise/util_types.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ccb051bd44f501ec8f9ed2905c2e7536c65e23ab7acedc7ae5d13278c0587b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_http::server::handle_dispatch::js_ext_http_server_response_dispatch_method (cyclomatic 53): perry_ext_http::server::handle_dispatch::js_ext_http_server_response_dispatch_method 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/perry-ext-http/src/server/handle_dispatch.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe422c9bfd6a47325324af20a8fdba3d59b7c30563aac669c81f5e112b68f8f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::intl::date_collator::build_parts_from_components (cyclomatic 53): perry_runtime::intl::date_collator::build_parts_from_components 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/perry-runtime/src/intl/date_collator.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13cab3aaa850775fad947770a5dc872de8682b72b261332218c39a5019dfd0e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::value::to_string::js_jsvalue_to_string_impl (cyclomatic 53): perry_runtime::value::to_string::js_jsvalue_to_string_impl 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/perry-runtime/src/value/to_string.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b46a3b63481f5938d50e3763f1ab6645bd5b84199ff9f83d2493e6092c39b0d"}},{"ruleId":"D1","level":"warning","message":{"text":"Gen::stand_in_class (cyclomatic 53): Gen::stand_in_class 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/perry-wpfacts/src/gen/class_values.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c9931a4d1518512cda25d20c4c0691dc30f91d686b5eb6c27e9289904ce79a"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_runtime_root_holders.self_test (cyclomatic 53): gc_runtime_root_holders.self_test has cyclomatic complexity 53 (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":"scripts/gc_runtime_root_holders.py"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bd872111da111ed61818b9e7195431e9ea6c7b29355703b902bc45ec3e8b7e"}},{"ruleId":"D1","level":"warning","message":{"text":"Need::compute (cyclomatic 52): Need::compute has cyclomatic complexity 52 (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/perry-codegen/src/codegen/source_need/flow.rs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e5d617fd002d7435d4e3445a1bc423dbceb152d524bf46d79fd80b8f2c9680"}},{"ruleId":"D1","level":"warning","message":{"text":"FuncEmitCtx::try_emit_expr_calls (cyclomatic 52): FuncEmitCtx::try_emit_expr_calls has cyclomatic complexity 52 (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/perry-codegen-wasm/src/emit/expr/calls.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6cd6f1dbb1e897888e5b03f5a0566945f1abc4ba7e664742dee7c4d09746b1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::fn_ctor_env::scan_expr_writes (cyclomatic 52): perry_hir::lower::fn_ctor_env::scan_expr_writes has cyclomatic complexity 52 (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/perry-hir/src/lower/fn_ctor_env.rs"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"65165dddf887bce62b28fa80b625c21109784fbdde8b098e97f80dfa733c784d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json::stringify::stringify_array_depth (cyclomatic 52): perry_runtime::json::stringify::stringify_array_depth 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/perry-runtime/src/json/stringify.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"69090d6bf57657e971d37f3117f665c95e4f56b4996c9e9a3b79f7694cae08c1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_module::native_module_property_by_name_impl (cyclomatic 52): perry_runtime::object::native_module::native_module_property_by_name_impl has cyclomatic complexity 52 (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/perry-runtime/src/object/native_module.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e09bb51d15659139684e97fb51c7186aaf97fa123514ab1bfa6ce2673db323"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::call_inliner::inline_calls_in_stmts (cyclomatic 52): perry_transform::inline::call_inliner::inline_calls_in_stmts 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/perry-transform/src/inline/call_inliner.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6227280b7bef22bece95c1df5b60ba04611257ba313dbaa6acbd853f963f04"}},{"ruleId":"D1","level":"warning","message":{"text":"Gen::stand_in_fn_of (cyclomatic 52): Gen::stand_in_fn_of has cyclomatic complexity 52 (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/perry-wpfacts/src/gen/import_values.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"2415733ebc3663871d178cef34e50221d0f8362d307f36aa2063e5432e9a53e3"}},{"ruleId":"D1","level":"warning","message":{"text":"Gen::runtime_extern (cyclomatic 52): Gen::runtime_extern 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/perry-wpfacts/src/gen_call.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1cb020735841835f239079afdd53cfae168500e7d6562b414515014e58d391"}},{"ruleId":"D1","level":"warning","message":{"text":"actions_plan.select (cyclomatic 52): actions_plan.select 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":"scripts/actions_plan.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"598421a729d7970cb0a935900e13fccac4531ba7a3a87b3aa776c1a3a0e6f060"}},{"ruleId":"D1","level":"warning","message":{"text":"verification.verify_artifacts (cyclomatic 52): verification.verify_artifacts 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":"scripts/compiler_output_harness/verification.py"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a179d41f09fb14b03e98503ae8a3becb9ae282d470fa233cf0799f3f4b88a5c"}},{"ruleId":"D1","level":"warning","message":{"text":"LlModule::layout_codegen_units (cyclomatic 51): LlModule::layout_codegen_units 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/perry-codegen/src/module.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f51add1e55c96f4fc1d0d2bd5072380a8eca1914967bb483596fdb848c80887"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::native_value::verify::verify_native_rep_records (cyclomatic 51): perry_codegen::native_value::verify::verify_native_rep_records 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/perry-codegen/src/native_value/verify.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"23af01c3063494e276eb9e0bd17d184635d172e2ca290defe6225679fa26d120"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::lower_stmt_inner (cyclomatic 51): perry_codegen::stmt::lower_stmt_inner 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/perry-codegen/src/stmt/mod.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a5144a9d5a5b6301ff51ad1de72232bf876387e6cd01a25e2dcf3e469592e5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::fn_decl::lower_fn_decl (cyclomatic 51): perry_hir::lower_decl::fn_decl::lower_fn_decl 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/perry-hir/src/lower_decl/fn_decl.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0e003d7eb81e4d6f0dec1109d234bb7b165460d8850212692b67cd42da0bac"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json::replacer::js_json_stringify_full (cyclomatic 51): perry_runtime::json::replacer::js_json_stringify_full 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/perry-runtime/src/json/replacer.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda439e971adcde2141748d8aa110a845ce82bb56c50fbf2ef4f243ab3d7c363"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json::stringify_shape_template::try_emit_shape_element (cyclomatic 51): perry_runtime::json::stringify_shape_template::try_emit_shape_element 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/perry-runtime/src/json/stringify_shape_template.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"d520fe025da497c2c902ab181ce854b858452ed78c5f41217ec2241c211d1d14"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::object_ops::has_own::js_object_property_is_enumerable (cyclomatic 51): perry_runtime::object::object_ops::has_own::js_object_property_is_enumerable 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/perry-runtime/src/object/object_ops/has_own.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"214a08ec329d026d97df7bfec4a367e21cc611fa89acfdd12290e9a5174eb697"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::tls::dispatch::dispatch_tls_handle (cyclomatic 51): perry_stdlib::tls::dispatch::dispatch_tls_handle has cyclomatic complexity 51 (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/perry-stdlib/src/tls/dispatch.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc155024e2cbc162305168a05de2d08fc7df5750d59a7ae09f2002b0f954a7ac"}},{"ruleId":"D1","level":"warning","message":{"text":"native_export_collisions.source_exports (cyclomatic 51): native_export_collisions.source_exports 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":"scripts/native_export_collisions.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"c845ae5af89952c0af351d725ba661a9ece0bc6254c9eca54265ff47e878237f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::hoist_classes::rewrite_module_exports_class_expression (cyclomatic 50): perry::commands::compile::cjs_wrap::hoist_classes::rewrite_module_exports_class_expression has cyclomatic complexity 50 (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/perry/src/commands/compile/cjs_wrap/hoist_classes.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b156ebe30959ba8b19eb561284d7214e0f41fcd8a3b9624a90e6261b81ceab"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::strip_dedup::strip_duplicate_objects_from_lib_with_evidence (cyclomatic 50): perry::commands::compile::strip_dedup::strip_duplicate_objects_from_lib_with_evidence has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/strip_dedup.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cdccfc88ea3dc47253e7208fd9f05723216decdf83e08cf5072f9a9b5d266a"}},{"ruleId":"D1","level":"warning","message":{"text":"Planner::expr (cyclomatic 50): Planner::expr has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/region_loop/plan.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a428d7a0ccca8eabb32ff9d458ffd0322e282662641ccb56a8187d7482efbe"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::env_clones::lower (cyclomatic 50): perry_codegen::expr::env_clones::lower has cyclomatic complexity 50 (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/perry-codegen/src/expr/env_clones.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59ac355d3ebcf4a0aaf6667a66c2f2a8f74baeb7b5d4930adf7d6e85389999b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_component_host::sync_wasi::errors::code (cyclomatic 50): perry_component_host::sync_wasi::errors::code has cyclomatic complexity 50 (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/perry-component-host/src/sync_wasi/errors.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2149b5df11e1260f7fc9d2fd0b67911e2bc88ebffee1563521ce119a8ae65633"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::analysis::builtins::builtin_static_function_length (cyclomatic 50): perry_hir::analysis::builtins::builtin_static_function_length has cyclomatic complexity 50 (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/perry-hir/src/analysis/builtins.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ebc4d01e92a951738020a76419e150354f6cadcb534514630926baa650e1e4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::closure_analysis::collect_closure_captures_expr (cyclomatic 50): perry_hir::lower::closure_analysis::collect_closure_captures_expr has cyclomatic complexity 50 (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/perry-hir/src/lower/closure_analysis.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"1059ff791091e1986187a5e1a529cb93656452be5db33336851ced3dce33b09d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::native_module::imported_module_dispatch::try_imported_module_dispatch (cyclomatic 50): perry_hir::lower::expr_call::native_module::imported_module_dispatch::try_imported_module_dispatch has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/native_module/imported_module_dispatch.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ed1b852696e098ced499ba56169f3be9892b5c22147d61018a07611bde3c89"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::native_module::process_module::try_process_module_methods (cyclomatic 50): perry_hir::lower::expr_call::native_module::process_module::try_process_module_methods has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/native_module/process_module.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c663edd76e19b5ab4ed1d66fe908fbd3cf67ad86008dbc942ea157a0fb4f8ec"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::i18n::cldr_plural_category (cyclomatic 50): perry_runtime::i18n::cldr_plural_category has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/i18n.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"1727c7f39cb1f212b36243efa267f8f7b28c7a8b182dad4c5ee61107d09e77da"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::intl::date_collator::format_components (cyclomatic 50): perry_runtime::intl::date_collator::format_components has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/intl/date_collator.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69c086cb900c2891abbb7aa0924545973fa06b84fc3488b06aa9c6257bb06cb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_windows::layout::measure_intrinsic (cyclomatic 50): perry_ui_windows::layout::measure_intrinsic has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-windows/src/layout.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"7203818c02ebb8d42f451b75d3ba0e867fc3245f96c732451c5a17c3dccceade"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::main_inner (cyclomatic 49): perry::main_inner has cyclomatic complexity 49 (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/perry/src/main.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"515e77e221f5583e2fe17e4db7baf0f20e24cbfee6d2b3d7c9f1e18983c43bcb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::class_artifacts::emit_class_artifacts (cyclomatic 49): perry_codegen::codegen::class_artifacts::emit_class_artifacts has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/class_artifacts.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"714093383752a3b8a3e8d39d5db755a5446038e18ead3ab598fda80883224799"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::property_set::lower (cyclomatic 49): perry_codegen::expr::property_set::lower has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/property_set.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"556fcc30c0e7308a8ec8b64307d1425a49e37960498ab65c52095ebf8556fb93"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::layout_families::own_keys (cyclomatic 49): perry_codegen::layout_families::own_keys has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/layout_families.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a5c3312701b0129f72428caed8bccc7279d814a20be40ca3f1d7a457562437"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::class_registry::parent_static::js_class_static_method_call (cyclomatic 49): perry_runtime::object::class_registry::parent_static::js_class_static_method_call has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/class_registry/parent_static.rs"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bd9c2f1514ddc18cb0363a4fe73f6a70b107373ecb8a549c82105710e5a8a5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::webcrypto::wrap::js_webcrypto_unwrap_key (cyclomatic 49): perry_stdlib::webcrypto::wrap::js_webcrypto_unwrap_key has cyclomatic complexity 49 (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/perry-stdlib/src/webcrypto/wrap.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62308fd657dee2ae0b1eea79d03347c237f590a61c1ed151b96b3e9bfb1b368"}},{"ruleId":"D1","level":"warning","message":{"text":"Gen::nested_fields (cyclomatic 49): Gen::nested_fields has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/gen/export.rs"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b7dcef5920e867a6031f26a7876f219501f2bc931f0e7fb94a07b4a016d9b9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::native_emit::compile_module_units_native_with_workers (cyclomatic 48): perry_codegen::native_emit::compile_module_units_native_with_workers has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/native_emit.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"f195c9399d9cee27fbcc5b406812c2cf4d8a52a91c7e8e233bfdcf01c7c2f818"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::js_transform::cross_module_natives::fix_cross_module_native_instances (cyclomatic 48): perry_hir::js_transform::cross_module_natives::fix_cross_module_native_instances has cyclomatic complexity 48 (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/perry-hir/src/js_transform/cross_module_natives.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"2225f5e28c9a1be9d336288082e99843b891815be6825e471c3c95e9fecf28c6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_call_method::native_call_method_value_inner (cyclomatic 48): perry_runtime::object::native_call_method::native_call_method_value_inner has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/native_call_method.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd3b8b527bae61ddf095ed73cc28bf51507d51b954106ab93d70787f88b8182"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_call_method::collection_methods::dispatch_map_set (cyclomatic 48): perry_runtime::object::native_call_method::collection_methods::dispatch_map_set has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/native_call_method/collection_methods.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa0c3bfea504e1e591c48e8b069b352fc5053b1be965074f01a3811a2286c87"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime_manifest::realm_json::parse (cyclomatic 48): perry_runtime_manifest::realm_json::parse has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime-manifest/src/realm_json.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7441b70b9560090d5710d3ed57c2e743a2c4fc23534fd572d54512256864edb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::webcrypto::hmac::js_webcrypto_sign (cyclomatic 48): perry_stdlib::webcrypto::hmac::js_webcrypto_sign has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/webcrypto/hmac.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e5bc3c72fdad05bc1632a95253c36cd080ee0bb242527678b1d3e47b156b81"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::inline_functions_inner (cyclomatic 48): perry_transform::inline::inline_functions_inner has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (perry_transform::inline::inline_functions_inner::walk_stmt_exprs) 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/perry-transform/src/inline/mod.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c509da8575668008c1f0c02fde8bc67b698d42b7cf2b707b0db8230107a699"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::call_inliner::inline_calls_in_expr (cyclomatic 48): perry_transform::inline::call_inliner::inline_calls_in_expr has cyclomatic complexity 48 (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/perry-transform/src/inline/call_inliner.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88388610c27553253285fb5e7106e21f00756ce9bc8e4fa2767fe4de64efb4d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_windows::app::wnd_proc (cyclomatic 48): perry_ui_windows::app::wnd_proc has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: perry_ui_windows::app::key_to_vk (cyclomatic 62) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-windows/src/app.rs"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"e868aec00e4838b2a457f46b82dd574aabc5dcc85ba9a27c0477a16e37cdd7ae"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::closure::lower (cyclomatic 47): perry_codegen::expr::closure::lower 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/perry-codegen/src/expr/closure.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe56c9e876127af0410475004ba53b3a71cda44ddbe8bdb2a69fe3c564b80fc"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::new_alloc::emit_instance_alloc_inner (cyclomatic 47): perry_codegen::lower_call::new_alloc::emit_instance_alloc_inner 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/perry-codegen/src/lower_call/new_alloc.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"02950cc299264fe37d4d58b08158447247ebc725bcfb2cab6904bcec3855ac7d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::lower_expr::arm_bin::lower_bin_expr (cyclomatic 47): perry_hir::lower::lower_expr::arm_bin::lower_bin_expr has cyclomatic complexity 47 (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/perry-hir/src/lower/lower_expr/arm_bin.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"730fc1f6250609ba893761c49728f72a8a1b3022f65335b0bbfe96e88f259b72"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::builtins::formatting::format_jsvalue_for_json (cyclomatic 47): perry_runtime::builtins::formatting::format_jsvalue_for_json 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/perry-runtime/src/builtins/formatting.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9375f18c2fc569a0d6026e8dd55733a7dbd480f558fba79a0a0d56d636729b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_set_by_name::fast_paths::object_set_field_by_name_transition_fast_impl_value (cyclomatic 47): perry_runtime::object::field_set_by_name::fast_paths::object_set_field_by_name_transition_fast_impl_value has cyclomatic complexity 47 (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/perry-runtime/src/object/field_set_by_name/fast_paths.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"349445814bb3e964da2d2bc6c9fc1bcb0c7c3f1463d51a083e310b20d3f590d3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::value::dyn_index::js_dyn_index_set_strict (cyclomatic 47): perry_runtime::value::dyn_index::js_dyn_index_set_strict 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/perry-runtime/src/value/dyn_index.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3a6029d6d1a9a621830baf6b1feaa227673f622e44db2c10e51b8d5fc0dd0b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::destructuring::var_decl::alias_tracking::track_decl_aliases (cyclomatic 46): perry_hir::destructuring::var_decl::alias_tracking::track_decl_aliases 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/perry-hir/src/destructuring/var_decl/alias_tracking.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6e78debbbc364044e114d22341379bf27e0929c043ceced756522a493c7fa7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_parser::normalize_unicode_identifier_escapes_with_metadata (cyclomatic 46): perry_parser::normalize_unicode_identifier_escapes_with_metadata has cyclomatic complexity 46 (threshold 15). Of this number, 33 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":"crates/perry-parser/src/lib.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"0410fddda9f377c4d7125e6620fe1504b3218afc25b48add44fdde53b1677715"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::closure::dynamic_props::closure_get_dynamic_prop_keyed (cyclomatic 46): perry_runtime::closure::dynamic_props::closure_get_dynamic_prop_keyed 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/perry-runtime/src/closure/dynamic_props.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a487093507cde957a8932549144cdcf843baeaba8e5c4e2c4bc4b800efb909"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json_tape::build_tape_into (cyclomatic 46): perry_runtime::json_tape::build_tape_into 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/perry-runtime/src/json_tape.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8b710be3a8fcc022aa96ab6554b44baebc6533d8d3d486bbb7bd42a0e67452"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::node_inspector::runtime_evaluate (cyclomatic 46): perry_runtime::node_inspector::runtime_evaluate has cyclomatic complexity 46 (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/perry-runtime/src/node_inspector.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e45b2eb2fcb8db9761843dc1359f653932c452e6be3dd892bbdb92ba84b96e6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::property_ops::put_value::js_put_value_set (cyclomatic 46): perry_runtime::object::property_ops::put_value::js_put_value_set 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/perry-runtime/src/object/property_ops/put_value.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d949fb1d8ce2ca20967674376fce6fb77f3a12e13bc9df01cdb0df652eed26"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::value::equality::js_jsvalue_loose_equals (cyclomatic 46): perry_runtime::value::equality::js_jsvalue_loose_equals has cyclomatic complexity 46 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 7 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/perry-runtime/src/value/equality.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a78620f61894ab82c3207f6b977b6b339fa2684ca4e48e7c46aba53e566dd58"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_gtk4::keyboard::gdk_name_to_keycode (cyclomatic 46): perry_ui_gtk4::keyboard::gdk_name_to_keycode has cyclomatic complexity 46 (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/perry-ui-gtk4/src/keyboard.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce8d91636f08ac066ab3ca31684ccfc9a0d37df40ba98684d948bfbed041ea3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::lib::contracts::describe_nodes (cyclomatic 46): perry_wpfacts::lib::contracts::describe_nodes 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/perry-wpfacts/src/lib/contracts.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3145a83ec6c4e627f06fc4e09622d215ad9b9cb2a8cc2775e9b26216ef2059"}},{"ruleId":"D1","level":"warning","message":{"text":"check_gate_freshness.self_test (cyclomatic 46): check_gate_freshness.self_test has cyclomatic complexity 46 (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":"scripts/check_gate_freshness.py"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"2caa5ce71045ec3a576d087f90f206e13e5c81cfe86ff53b45bc7cbb4798521e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::family_syntax::analyze (cyclomatic 45): perry::commands::compile::cjs_wrap::family_syntax::analyze 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/perry/src/commands/compile/cjs_wrap/family_syntax.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b78150653de90c1d23437a7e84db6bf23ba33be84403a526fc350fe68dc3a23"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::field_init::apply_field_initializers_recursive (cyclomatic 45): perry_codegen::lower_call::field_init::apply_field_initializers_recursive 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/perry-codegen/src/lower_call/field_init.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f118d1e582bf952c085c36cdfa5b8fa2e3b87f47ea7d9311308c364a8ebcfc"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::masked_window_region::try_match_masked_window_region (cyclomatic 45): perry_codegen::stmt::masked_window_region::try_match_masked_window_region 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/perry-codegen/src/stmt/masked_window_region.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29dd9171996d3565ba1f3611029ea016a507ebc8d6995d7b9e0b311408b20d9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_diagnostics::compat_report::redact_snippet (cyclomatic 45): perry_diagnostics::compat_report::redact_snippet 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/perry-diagnostics/src/compat_report.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d928f2be3d0e47e8aa88c99641fb6e8f00e6c71ed15fc7b94c490467ae1b9bd"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_http::client_request_surface::dispatch_method (cyclomatic 45): perry_ext_http::client_request_surface::dispatch_method 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/perry-ext-http/src/client_request_surface.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab3bbbdc6af73034c34853376ef3d6fb78702e306bdb828cf48aa5a7635b0a5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_net::payload_io::sink (cyclomatic 45): perry_ext_net::payload_io::sink 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/perry-ext-net/src/payload_io.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62348841d9f7eb39eb4d402aa432b967c99945a87b725b57ff2b9c6dd314273"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_ws::js_ws_process_pending (cyclomatic 45): perry_ext_ws::js_ws_process_pending 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/perry-ext-ws/src/lib.rs"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dab77c9eb2076f6a4db2a14043a994cdd3e616d4c791c83d13abc5a7754eefb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::shared_mutable_capture::desugar_shared_mutable_captures (cyclomatic 45): perry_hir::lower::shared_mutable_capture::desugar_shared_mutable_captures 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/perry-hir/src/lower/shared_mutable_capture.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b60b6549aa47ec45e8bc91babbfdbdc7ba529fa4b0b0e648f7eab930d8e4443"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::bun_compat::string_width::grapheme_break (cyclomatic 45): perry_runtime::bun_compat::string_width::grapheme_break 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/perry-runtime/src/bun_compat/string_width.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"5053d9b1e2d79193f4f22306bafa5c69eca7a87eae5689c2738e61c03c03f0ca"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::layout_probe::derive_word::derive_word (cyclomatic 45): perry_runtime::object::layout_probe::derive_word::derive_word 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/perry-runtime/src/object/layout_probe/derive_word.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"423780fe49037e6957ca5437849d18d66a29b017472e45a4ef73177a1429da34"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::property_ops::put_value::object_array_numeric_write_slots (cyclomatic 45): perry_runtime::object::property_ops::put_value::object_array_numeric_write_slots has cyclomatic complexity 45 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 16 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":"crates/perry-runtime/src/object/property_ops/put_value.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fe25cbb0baad360ffd1d4710d677c26fb2349986f933292e9eeba497bfb07a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::webcrypto::jwk::js_webcrypto_export_key (cyclomatic 45): perry_stdlib::webcrypto::jwk::js_webcrypto_export_key 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/perry-stdlib/src/webcrypto/jwk.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"9366bbd398cf0d3483a7e81d32484a8a1143f2644673f2ef2c37dc68155e1982"}},{"ruleId":"D1","level":"warning","message":{"text":"web_runtime._mapKeyToAction (cyclomatic 45): web_runtime._mapKeyToAction 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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":2245}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73c8da5a63f5fd55b6b7fdf55050f1fa304e8002f657d33e4bebee78098cd01"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::lowering_report::aggregate_record (cyclomatic 44): perry::commands::compile::lowering_report::aggregate_record 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/perry/src/commands/compile/lowering_report.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ee34deeff3b9aa594e9c9a6d01864724f0783318c3ee852cc0f384b37737c6"}},{"ruleId":"D1","level":"warning","message":{"text":"UseWalk::walk_expr (cyclomatic 44): UseWalk::walk_expr 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/perry-codegen/src/collectors/ptr_numarray.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d2d94f4837980c72dfd2631ac0c83da66d07d83337cd8be78c5ab44b3954a1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::calls::crypto_hash::arm_crypto_hash_chain (cyclomatic 44): perry_codegen::expr::calls::crypto_hash::arm_crypto_hash_chain 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/perry-codegen/src/expr/calls/crypto_hash.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"646d1bc696d2d4ec9c5e70dda12f9ed6ce727d724afbd92ebf5745bf0c193e6a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::dyn_extern_i18n::lower (cyclomatic 44): perry_codegen::expr::dyn_extern_i18n::lower 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/perry-codegen/src/expr/dyn_extern_i18n.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"6854a73103defb85e525e523c2482f7dc7b5f7629c83460dfb8ea6f1224d831e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::indexed_owner_loop::numeric (cyclomatic 44): perry_codegen::stmt::indexed_owner_loop::numeric has cyclomatic complexity 44 (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/perry-codegen/src/stmt/indexed_owner_loop.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"4911493b739d9d11e78591289a6835936069ec501344676ee45628fce9adc3f9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_arkts::emit_widget::emit_widget (cyclomatic 44): perry_codegen_arkts::emit_widget::emit_widget has cyclomatic complexity 44 (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/perry-codegen-arkts/src/emit_widget.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e1e71a9e1f34cdf3cc50a3c84912ea397367a518a90f1c71f0f8dc8e4b2ce4"}},{"ruleId":"D1","level":"warning","message":{"text":"FuncEmitCtx::try_emit_expr_math (cyclomatic 44): FuncEmitCtx::try_emit_expr_math has cyclomatic complexity 44 (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/perry-codegen-wasm/src/emit/expr/math.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34bb4bd37c584f81969720144a0b61bacc2b3f324c91a8e2f58919a4fb8d7ca"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::nested_namespace::dispatch_path_subnamespace (cyclomatic 44): perry_hir::lower::expr_call::nested_namespace::dispatch_path_subnamespace has cyclomatic complexity 44 (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/perry-hir/src/lower/expr_call/nested_namespace.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"61dc0ae2c4ac04318df46034ac2b4cbcec4be1de41bb0e1eb766df74ce1600c3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json::stringify::stringify_value (cyclomatic 44): perry_runtime::json::stringify::stringify_value 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/perry-runtime/src/json/stringify.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd7cdf5b8f4dfd3a266ec0e7694017b955059ebafba96ddf0d78557457c9847"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::turnloop_net::dispatch (cyclomatic 44): perry_runtime::turnloop_net::dispatch 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/perry-runtime/src/turnloop_net/mod.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"7110ea5cbc31246430dd37acf2e254a7bd14ed18c58fafd0939c9a945b85d257"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::fetch::request_copy::js_request_new_from_input (cyclomatic 44): perry_stdlib::fetch::request_copy::js_request_new_from_input 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/perry-stdlib/src/fetch/request_copy.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"023fa29e856b6c82ec9ff0f03874528db289baaa603f36ae576718fb3cdaf2fb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::decl_units::decl_units (cyclomatic 44): perry_wpfacts::decl_units::decl_units 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/perry-wpfacts/src/decl_units.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2295276a7285afc6e7f4dea25c188ecdfc4c47a95eec66282c2de4dfc05998"}},{"ruleId":"D1","level":"warning","message":{"text":"shape_descriptor_census.assert_authority_surfaces (cyclomatic 44): shape_descriptor_census.assert_authority_surfaces 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":"scripts/shape_descriptor_census.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"70043305a116eb13518eca04da8f41d78d0d5f7683f2d1eaa120b84582a9a494"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeRepSummary::from_records (cyclomatic 43): NativeRepSummary::from_records has cyclomatic complexity 43 (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/perry-codegen/src/native_value/artifact.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e036625c2b7a2532c1f37f7fb32c1e4bd2b67a5ed77d9492b527a5abb4e6a5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_numeric::expr_numeric_by_construction_with_region (cyclomatic 43): perry_codegen::collectors::ptr_shape_numeric::expr_numeric_by_construction_with_region has cyclomatic complexity 43 (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/perry-codegen/src/collectors/ptr_shape_numeric.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"394e2d274c888b8e84988bbdca68ca9f400a0ec27989dd053d6dfa4c57a68f64"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::native_value::verify::layout::valid_native_abi_transition (cyclomatic 43): perry_codegen::native_value::verify::layout::valid_native_abi_transition has cyclomatic complexity 43 (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/perry-codegen/src/native_value/verify/layout.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"054ade88a3fb544b2bd442e6038bd31c1c97b54c14dda80361008e5791125460"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_js::minify::minify_js (cyclomatic 43): perry_codegen_js::minify::minify_js 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/perry-codegen-js/src/minify.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2477e8de44fc8d6e73973a69132e11a98b10c896a53d11898d7ecdef4ec760"}},{"ruleId":"D1","level":"warning","message":{"text":"FuncEmitCtx::try_emit_expr_arrays (cyclomatic 43): FuncEmitCtx::try_emit_expr_arrays has cyclomatic complexity 43 (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/perry-codegen-wasm/src/emit/expr/arrays.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9def7d3c85a3b85e8f8a885c3f30e4aa3c3b6ebc9ccf1af35d7639f5a768fb5e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_wasm::minify::minify_js (cyclomatic 43): perry_codegen_wasm::minify::minify_js 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/perry-codegen-wasm/src/minify.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"86eb7cebef2edbba5fddc126539811e48e732589db97bcf07d18b609717a50dd"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalEvalHoist::rewrite_list_inner (cyclomatic 43): GlobalEvalHoist::rewrite_list_inner 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/perry-hir/src/lower/global_eval_hoist.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"298e843019240319d98cf76d3b38a39ff0d5e4a33ce1216ee425ccfa0ce2702d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::lower_expr::arm_class::lower_class_expr (cyclomatic 43): perry_hir::lower::lower_expr::arm_class::lower_class_expr 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/perry-hir/src/lower/lower_expr/arm_class.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8852d91783e4a94f5156011580ea044b0fe6435deef36eddbeb9b7b6e46d5bbe"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::widget_decl::parse_single_modifier (cyclomatic 43): perry_hir::lower::widget_decl::parse_single_modifier 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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac98d8a92a6d21772d512f3dfae0b34d8136282a60c5a6324aa4e2a066b9729"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::class_registry::prototype_objects::resolve_proto_chain_field_inner (cyclomatic 43): perry_runtime::object::class_registry::prototype_objects::resolve_proto_chain_field_inner 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/perry-runtime/src/object/class_registry/prototype_objects.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10a8a6f817bc4fa45120c03f7b065ee6e209dfb53b9ec39bb327efe99cfef43"}},{"ruleId":"D1","level":"warning","message":{"text":"Gen::runtime_glue (cyclomatic 43): Gen::runtime_glue 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/perry-wpfacts/src/gen/glue.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f8203b50f753009c90681ec212205d3f610be2f48c5134ee1e2c731071099f"}},{"ruleId":"D1","level":"warning","message":{"text":"HoneEditorView.onCreateInputConnection (cyclomatic 43): HoneEditorView.onCreateInputConnection 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":"android-build/app/src/main/java/com/perry/app/HoneEditorView.kt"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4475c5036da21bdf7fd79df1f3d543b900b5202fbc984f57d9f7e9d10c4a5e"}},{"ruleId":"D1","level":"warning","message":{"text":"verification.generic_native_rep_contract_results (cyclomatic 43): verification.generic_native_rep_contract_results 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":"scripts/compiler_output_harness/verification.py"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b978808e2af4d753061adbc0f624805f19320ae2652d68a4e58a3e474e362a3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::hoist_classes::collect_pattern_binding_names (cyclomatic 42): perry::commands::compile::cjs_wrap::hoist_classes::collect_pattern_binding_names has cyclomatic complexity 42 (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/perry/src/commands/compile/cjs_wrap/hoist_classes.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"0669a4871ad9fe57d9b42344f9cb55f1fd5508b344127019d67e9da2363171a9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::object_cache::compute_object_cache_key_with_env (cyclomatic 42): perry::commands::compile::object_cache::compute_object_cache_key_with_env has cyclomatic complexity 42 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/object_cache.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba1b4ea8283b37d6567a818d278171289c704dcf5ebd593d9c45b293f6c9f83"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::resolve::resolve_import_with_bunfs (cyclomatic 42): perry::commands::compile::resolve::resolve_import_with_bunfs 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/perry/src/commands/compile/resolve.rs"},"region":{"startLine":1580}}}],"partialFingerprints":{"codehealthFindingId/v1":"3639131fd029f8301950628352646ae694ecdd1922c59f275624349cf2354524"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::anon_key_adds::anon_receiver_added_keys (cyclomatic 42): perry_codegen::collectors::anon_key_adds::anon_receiver_added_keys 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/perry-codegen/src/collectors/anon_key_adds.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"9273581cf3180be1a60c2e612222e5b7edfc9ee350bf48e169cd5767343d38cf"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::index_uses::walk_index_uses_in_expr (cyclomatic 42): perry_codegen::collectors::index_uses::walk_index_uses_in_expr has cyclomatic complexity 42 (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/perry-codegen/src/collectors/index_uses.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07b8f10e9752721e7e6279cb188545c32f5c3b82b8086c333c054dc368ed372"}},{"ruleId":"D1","level":"warning","message":{"text":"JsEmitter::emit_stmt (cyclomatic 42): JsEmitter::emit_stmt 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/perry-codegen-js/src/emit/stmts.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b18f24c5f3d205d1c1bd1732d84f95c955f675025736daa55eddca86792940"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::builder_fold::walk_expr (cyclomatic 42): perry_hir::lower::builder_fold::walk_expr has cyclomatic complexity 42 (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/perry-hir/src/lower/builder_fold.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c1050ff899f0f346f2603b5b1c22d970cacdb9ad6b8eecec31353a869a87dc"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::module_decl::namespace::lower_namespace_block (cyclomatic 42): perry_hir::lower::module_decl::namespace::lower_namespace_block 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/perry-hir/src/lower/module_decl/namespace.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fa019e07276738338e056c109120c297c9004ef53bdcb79b7cf8cde24c3265"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::gc::oldgen::legacy_sweep_with_age_bump_and_old_reclaim_targets (cyclomatic 42): perry_runtime::gc::oldgen::legacy_sweep_with_age_bump_and_old_reclaim_targets 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/perry-runtime/src/gc/oldgen.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"61cfd4076094ac6da216259221f3394558fc68e4bf23292e6ec1fd674a4a1b91"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::iterator_helpers::dispatch_iterator_helper_method (cyclomatic 42): perry_runtime::iterator_helpers::dispatch_iterator_helper_method 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/perry-runtime/src/iterator_helpers.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba308e81fc71a666eb62abbb77f7f6474ed96a02369ddab3f6e4e8e47dd8ba7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::global_this::proto_methods::populate_builtin_prototype_methods (cyclomatic 42): perry_runtime::object::global_this::proto_methods::populate_builtin_prototype_methods has cyclomatic complexity 42 (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/perry-runtime/src/object/global_this/proto_methods.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fc41934ccf8c9de1f52708fb7419c6ff7e622cf1f5c1f16d5bcecba759b8d3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::object_ops::define_properties::js_object_set_prototype_of (cyclomatic 42): perry_runtime::object::object_ops::define_properties::js_object_set_prototype_of 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/perry-runtime/src/object/object_ops/define_properties.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"764949feaa17acf90e397543b4970f4262145af96b8c53cd5175b4475cda294c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::polymorphic_index::js_object_get_index_polymorphic (cyclomatic 42): perry_runtime::object::polymorphic_index::js_object_get_index_polymorphic 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/perry-runtime/src/object/polymorphic_index.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb55c4718da66e1256291ee6b862ed477e2c5fccc2a86ba9bb17f663b4e852ec"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::derive::judge (cyclomatic 42): perry_wpfacts::derive::judge 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/perry-wpfacts/src/derive.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"045eb150586c493786f3aeafd7db824cb24c3d42ae588fd24a9b3bad17a93579"}},{"ruleId":"D1","level":"warning","message":{"text":"native_abi_evidence_report.compiler_output_summary (cyclomatic 42): native_abi_evidence_report.compiler_output_summary 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":"scripts/native_abi_evidence_report.py"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"828fe632ab03bbd4d1eb8c6ec78e89163ad101a09600fa532237f4bfbac994e0"}},{"ruleId":"D1","level":"warning","message":{"text":"package_bench_attr.run (cyclomatic 42): package_bench_attr.run 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":"scripts/package_bench_attr.py"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"94df459a5351822d48b5aaa713e5ab45f591c852299c56706a3d45887817ba55"}},{"ruleId":"D1","level":"warning","message":{"text":"UseWalk::walk_stmt (cyclomatic 41): UseWalk::walk_stmt 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/perry-codegen/src/collectors/ptr_shape.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cc9c32d2e6a37613c9e6695e1889d1584229db667d0b9b16d59094f1b44a7d"}},{"ruleId":"D1","level":"warning","message":{"text":"FnReader::binary_or_cast (cyclomatic 41): FnReader::binary_or_cast has cyclomatic complexity 41 (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/perry-codegen/src/dialect/mod.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d89be7da340fc293c66d477bd0e5e7934371c8a6524e9d69aec9e65ed1eb05a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::member_update::lower (cyclomatic 41): perry_codegen::expr::member_update::lower 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/perry-codegen/src/expr/member_update.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2d9e99706e3ebced126868b851b2da33ae551cd3b6007934826a55c801c468"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::region_loop::plan::plan_once (cyclomatic 41): perry_codegen::stmt::region_loop::plan::plan_once 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/perry-codegen/src/stmt/region_loop/plan.rs"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad8dd16526f64fdc4f5ee8209a97f1d03c642175c72ac7af66713d89ff99350"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::destructuring::pattern_binding::lower_pattern_binding_into (cyclomatic 41): perry_hir::destructuring::pattern_binding::lower_pattern_binding_into 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/perry-hir/src/destructuring/pattern_binding.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"260fba6dbcb6e46328a6b77d2b6998126935941aee6ea661e5e0e6d1238e7d76"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::native_module::object_statics::try_object_statics (cyclomatic 41): perry_hir::lower::expr_call::native_module::object_statics::try_object_statics 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/perry-hir/src/lower/expr_call/native_module/object_statics.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"640fb4b7ace52dc97d7aa79e121ba274968bc2bdc34b434ef936c0ff255b8b99"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::lower_expr::arm_ident::lower_ident_expr (cyclomatic 41): perry_hir::lower::lower_expr::arm_ident::lower_ident_expr 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/perry-hir/src/lower/lower_expr/arm_ident.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c7c56f85a231f5e03e3d19a2e9fd1a9f7fdd3b1a1d17132514373e7505a1fa"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::body_stmt::gen_capture_scan::collect_idents_expr (cyclomatic 41): perry_hir::lower_decl::body_stmt::gen_capture_scan::collect_idents_expr has cyclomatic complexity 41 (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/perry-hir/src/lower_decl/body_stmt/gen_capture_scan.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"266197c15666db92852bd6ba0f84b4e012320f8c49576484945a738bfdbcfa3b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::iterator::array_from_spread_value (cyclomatic 41): perry_runtime::array::iterator::array_from_spread_value 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/perry-runtime/src/array/iterator.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"84048219cff0670b880273be60b94169a94318611eccd870af35bdc2f3467736"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::builtins::formatting::util_format::js_util_format (cyclomatic 41): perry_runtime::builtins::formatting::util_format::js_util_format has cyclomatic complexity 41 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 3 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":"crates/perry-runtime/src/builtins/formatting/util_format.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4c42ec8e93ffc169741b423fce27b9898496ee4b59c5751c6f8196730371ea"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::property_ops::set::own_set_descriptor (cyclomatic 41): perry_runtime::object::property_ops::set::own_set_descriptor 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/perry-runtime/src/object/property_ops/set.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd42e27bb9101ea0e2ed412b4439658180250e89b787a73be9034586f39bc7b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime_manifest::realm_source::declarations (cyclomatic 41): perry_runtime_manifest::realm_source::declarations 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/perry-runtime-manifest/src/realm_source.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4f24bc734cd92730bd8c884b9734d9a8fa589bbf3911d5184a2295621e6394"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::webcrypto::wrap::js_webcrypto_wrap_key (cyclomatic 41): perry_stdlib::webcrypto::wrap::js_webcrypto_wrap_key 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/perry-stdlib/src/webcrypto/wrap.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df4a976154e90d7088eb40822667c4d3e2d53e609abf0b3b79b205e5eb5f1af"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassContract::join (cyclomatic 41): ClassContract::join has cyclomatic complexity 41 (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/perry-wpfacts/src/units.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"758e2ce21b7d643eb3bf27e6cfde5a78bdcbab4a533854c5a6a4b69d24908544"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::builtins::collections::array_method (cyclomatic 41): perry_wpfacts::builtins::collections::array_method has cyclomatic complexity 41 (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/perry-wpfacts/src/builtins/collections.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15510cf4b329588f12260dc2ee6d95133f6987312da84196ed9902a1a430da5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::derive::template_facts (cyclomatic 41): perry_wpfacts::derive::template_facts 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/perry-wpfacts/src/derive.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"957c2b761cab8062f649e2ad28f0ea8bde07a56ced6f71f691159c7fdff248ad"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::lib::contracts::arg_contract_of (cyclomatic 41): perry_wpfacts::lib::contracts::arg_contract_of 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/perry-wpfacts/src/lib/contracts.rs"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a3d9c9d20fc50fb783770fee844a3be9b248abd6b890ce67258f1ebcea99bd"}},{"ruleId":"D1","level":"warning","message":{"text":"native_abi_evidence_report.benchmark_deltas (cyclomatic 41): native_abi_evidence_report.benchmark_deltas 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":"scripts/native_abi_evidence_report.py"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c8026668abd4a3e3214411398409a8816af416ae894aa1971f66e662877b0d"}},{"ruleId":"D1","level":"warning","message":{"text":"perf_frontier_report.collect_report (cyclomatic 41): perf_frontier_report.collect_report 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":"scripts/perf_frontier_report.py"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"291e35a3b60cac459431537c4f9cd501f85152b905bb886c5fbb5fa4d9ed6d5b"}},{"ruleId":"D1","level":"warning","message":{"text":"rust_dependency_inventory.main (cyclomatic 41): rust_dependency_inventory.main 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":"scripts/rust_dependency_inventory.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95e365c0350eb320baf5acebe25f55b9e4fd7dd96fdeb733bb5c8f881bf3c8d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::run::android::build_and_run_android_impl (cyclomatic 40): perry::commands::run::android::build_and_run_android_impl 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/perry/src/commands/run/android.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3cb16f761a19cad6054fb035a287431055f9f31d741e29f497113e69b26bb43"}},{"ruleId":"D1","level":"warning","message":{"text":"NumberAtReadFlow::stmt (cyclomatic 40): NumberAtReadFlow::stmt 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/perry-codegen/src/collectors/number_by_construction.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"167453a5f786f649d8d4da79144ee7443259616e2dd37679b43f2cad9a83428b"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayWalk::walk_expr (cyclomatic 40): ArrayWalk::walk_expr 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/perry-codegen/src/collectors/ptr_shape_elements.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"53768e5ab4776e259e912cabb8448b951092fa9d93239f1e4036e803ce0e6d89"}},{"ruleId":"D1","level":"warning","message":{"text":"ThisFlowAnalysis::expr_this_safe (cyclomatic 40): ThisFlowAnalysis::expr_this_safe 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/perry-codegen/src/collectors/ptr_shape_this_flow.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4051f661be3ab01ea54b0a859db265b5be096d01f2478cd00b00f88c7efc99a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::property_get::static_dispatch::try_lower_static_dispatch (cyclomatic 40): perry_codegen::lower_call::property_get::static_dispatch::try_lower_static_dispatch 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/perry-codegen/src/lower_call/property_get/static_dispatch.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7dc630f6cd4d47498b81f47ea5d1fd35dcf18855879b14bd6426bdbb10ae70"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_zlib::js_ext_zlib_native_dispatch (cyclomatic 40): perry_ext_zlib::js_ext_zlib_native_dispatch has cyclomatic complexity 40 (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/perry-ext-zlib/src/lib.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f21331dab6e0b4e55b874a9814c7224b6dda4a80e97d28c116436edabd2af5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::intl::make_instance_this (cyclomatic 40): perry_runtime::intl::make_instance_this 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/perry-runtime/src/intl.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc7b52c4fb782e5a1a873197f46ba482d22354234e8a50caa19c79eebcbb6f2"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::intl::number_format_options::configure_number_format (cyclomatic 40): perry_runtime::intl::number_format_options::configure_number_format 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/perry-runtime/src/intl/number_format_options.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d03b173626ffb7af37b04926eaf31da539e14df62607bd68f84ba01f6088c0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::class_registry::parent_static::register_class_parent_dynamic (cyclomatic 40): perry_runtime::object::class_registry::parent_static::register_class_parent_dynamic 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/perry-runtime/src/object/class_registry/parent_static.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e074f7875c1014eba3dedcdf1d62289253ffc4b618ca7dba225f7ca5a648ba5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::instanceof::shape_ancestry::class_shape_reaches (cyclomatic 40): perry_runtime::object::instanceof::shape_ancestry::class_shape_reaches 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/perry-runtime/src/object/instanceof/shape_ancestry.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f7909f22d3fce188b02c2d13ad7ec23a58720f107dad1e873fde25d0561c84"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_windows::layout::layout_stack (cyclomatic 40): perry_ui_windows::layout::layout_stack 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/perry-ui-windows/src/layout.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b038918b655d9171e5f2add34c2813132472cb0643689399250bb556555a5d0"}},{"ruleId":"D1","level":"warning","message":{"text":"Gen::unit_boundary (cyclomatic 40): Gen::unit_boundary 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/perry-wpfacts/src/gen/export.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"882c60a542546a97844cb6fdb0088c5ac7244b6b5e3253c2fb841beeca9ae923"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::escape (cyclomatic 40): Model::escape 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/perry-wpfacts/src/solve/call_and_construct.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"d863fc0eea5c6f487110b41a3715e7f7e24f24624f0003b6be333b83c6be75b8"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_1090_evidence_report.old_page_policy_summary (cyclomatic 40): gc_1090_evidence_report.old_page_policy_summary 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":"scripts/gc_1090_evidence_report.py"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"967073611d3fcc720b4c17375a288d1911fee3ce1a735c2766065f094fc1588a"}},{"ruleId":"D1","level":"warning","message":{"text":"link_absence.main (cyclomatic 40): link_absence.main 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":"scripts/link_absence.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c8eba204218fa6c17df98b0bc3c8925a8b699ed7247561ed743f42f4397195"}},{"ruleId":"D1","level":"warning","message":{"text":"color.namedColor (cyclomatic 40): color.namedColor has cyclomatic complexity 40 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/perry-styling/src/color.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2b5efded75762ffd60b6024e5bc79a561bc857095b2c2834d5b43522c645da"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::detect::strip_comments_and_strings (cyclomatic 39): perry::commands::compile::cjs_wrap::detect::strip_comments_and_strings has cyclomatic complexity 39 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 13 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":"crates/perry/src/commands/compile/cjs_wrap/detect.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9332e4f7a5726b4caff96c1277dacde6423b1e325afa2025a67c3bf80105a17"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::mutation::expr_has_mutation (cyclomatic 39): perry_codegen::collectors::mutation::expr_has_mutation has cyclomatic complexity 39 (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/perry-codegen/src/collectors/mutation.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"70debf862134fb3c1ea9faecf2432312473203e5913e4e372a3bba239a50e89d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::lower_expr_value (cyclomatic 39): perry_codegen::expr::lower_expr_value 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/perry-codegen/src/expr/mod.rs"},"region":{"startLine":4392}}}],"partialFingerprints":{"codehealthFindingId/v1":"568df6ce28fa914474048b11ff51ae76c6a5fc01aaaffd44adae937809c07724"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::i32_fast_path::lower_expr_native_i32 (cyclomatic 39): perry_codegen::expr::i32_fast_path::lower_expr_native_i32 has cyclomatic complexity 39 (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/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8dd1267aa109d789d4cca839bebe94c08f984e017951e271dc1d5d0c1f0746"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_wasm::emit::closures::collect_closures_from_expr (cyclomatic 39): perry_codegen_wasm::emit::closures::collect_closures_from_expr has cyclomatic complexity 39 (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/perry-codegen-wasm/src/emit/closures.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca72aa5e03fbd1515edaa2f3486ff12d6c549ccc34ad804690c5499b2f31b2c6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::js_transform::local_natives::fix_class_field_expr (cyclomatic 39): perry_hir::js_transform::local_natives::fix_class_field_expr has cyclomatic complexity 39 (threshold 15). Of this number, 37 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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffead14c0d36ab32ff43947ece2dcef7fb2303f0bfb5cef29db0f8b29adcd81"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::fn_ctor_env::build_fn_ctor_env (cyclomatic 39): perry_hir::lower::fn_ctor_env::build_fn_ctor_env has cyclomatic complexity 39 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 11 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/perry-hir/src/lower/fn_ctor_env.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2e4998349cfda1f2bf8a9e486ecc1053fec690d73a2bc3dc3d339b90ec32ef"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::fn_ctor_env::scan_stmt (cyclomatic 39): perry_hir::lower::fn_ctor_env::scan_stmt 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/perry-hir/src/lower/fn_ctor_env.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9e80104850f2c930686886adf2416b6b11862b7f622b27d68bbe07f9daa3b5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::enum_decl::eval_enum_init (cyclomatic 39): perry_hir::lower_decl::enum_decl::eval_enum_init has cyclomatic complexity 39 (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/perry-hir/src/lower_decl/enum_decl.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb457e091672144e0e0390be497272150c4fd552e868174cccf00d43e6c4b9f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_patterns::expr_reads_name_before_assignment (cyclomatic 39): perry_hir::lower_patterns::expr_reads_name_before_assignment has cyclomatic complexity 39 (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/perry-hir/src/lower_patterns.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f60b78a70f6efbf80c422ae0db1b14d9c3d352a5f005c6b8aab8ac360c1f96"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json::stringify::stringify_value_depth (cyclomatic 39): perry_runtime::json::stringify::stringify_value_depth 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/perry-runtime/src/json/stringify.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"589cb375ead709e50ca317e3d58520531f2b09e55ae63605cf819509ac36a566"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::readline::pump::js_readline_process_pending (cyclomatic 39): perry_stdlib::readline::pump::js_readline_process_pending 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/perry-stdlib/src/readline/pump.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d29703468526a8e5da4c17948b6c244febf479dca3204421f2eac3af3ca539d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::webcrypto::aes::js_webcrypto_encrypt (cyclomatic 39): perry_stdlib::webcrypto::aes::js_webcrypto_encrypt has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This shape REPEATS in the file: one other method here (perry_stdlib::webcrypto::aes::js_webcrypto_decrypt) 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/perry-stdlib/src/webcrypto/aes.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5df034fbd2de3d33f94c73616729ba46aa1d7d04a46aa1d8ee4673258f44642"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::webcrypto::aes::js_webcrypto_decrypt (cyclomatic 39): perry_stdlib::webcrypto::aes::js_webcrypto_decrypt has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This shape REPEATS in the file: one other method here (perry_stdlib::webcrypto::aes::js_webcrypto_encrypt) 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/perry-stdlib/src/webcrypto/aes.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a457dfc06845328e3bd5f9a6428ad847b34a2139a24d859f01e33fa05a27bd8"}},{"ruleId":"D1","level":"warning","message":{"text":"Emitter::lower_inner (cyclomatic 39): Emitter::lower_inner 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/perry-wit/src/guest_c/values.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8cc8dc3ce3281b8efd7d32fed2c7c6b2e0d6fa11fb1562e4fb5dd5065071e9"}},{"ruleId":"D1","level":"warning","message":{"text":"delete_retired_workflow_runs.main (cyclomatic 39): delete_retired_workflow_runs.main 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":"scripts/delete_retired_workflow_runs.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f386fc3b078bdd8c9e9fb0b64e454f2bbb64045f3fc75b30ef36cb1a3f01ebc5"}},{"ruleId":"D1","level":"warning","message":{"text":"LlInst::render_into (cyclomatic 38): LlInst::render_into has cyclomatic complexity 38 (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/perry-codegen/src/inst.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4b5cf5e6a6855f4c32b861c628da0b63a18cae3f83e7b6a720789f0ba766e9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::static_constfn_class::class_final (cyclomatic 38): perry_codegen::codegen::static_constfn_class::class_final 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/perry-codegen/src/codegen/static_constfn_class.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"09315d929607dad7545b816687197d641a19d6691ab808172c1a822b59bd2326"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::expr_value_type (cyclomatic 38): perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::expr_value_type has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This shape REPEATS in the file: 4 other methods here (perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals, perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::collect_expr_writes_in_closure_stmts, perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::collect_facts, \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/perry-codegen/src/collectors/pointer_locals.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b33e6de93f33d97072e859503ea03eb36a06b783a481aa80c11e62a2bcc0c92"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::debug_info::attach_line_tables (cyclomatic 38): perry_codegen::debug_info::attach_line_tables 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/perry-codegen/src/debug_info.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a30a0642d7dc11359538cea555469cbdf77f5a1a455605d810ed0e064607db"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::layout_desc::emit_module_layouts (cyclomatic 38): perry_codegen::layout_desc::emit_module_layouts has cyclomatic complexity 38 (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/perry-codegen/src/layout_desc.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"a205cf480b1a33051d01345de4871f16276be95ca6e8eacd73be2e1d4d3c0cae"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::native_module_dispatch::lower_native_module_dispatch (cyclomatic 38): perry_codegen::lower_call::native_module_dispatch::lower_native_module_dispatch has cyclomatic complexity 38 (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/perry-codegen/src/lower_call/native_module_dispatch.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"81572cd0884a2ed756bf405cecfb57b2ed50658a6554dd849debc1b197fe02f7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::loops::masked_window_expression_proof (cyclomatic 38): perry_codegen::stmt::loops::masked_window_expression_proof has cyclomatic complexity 38 (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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":2982}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b598cd376833aae0b5aa9b4a4fc6d46acb9eaf801e267a0391a50b350c5ceb0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_arkts::conditions::evaluate_condition::to_lit (cyclomatic 38): perry_codegen_arkts::conditions::evaluate_condition::to_lit has cyclomatic complexity 38 (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/perry-codegen-arkts/src/conditions.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce49741c26344b70bb0ca05f31784e1ec152ad16d204d7f37aa1488ae493e367"}},{"ruleId":"D1","level":"warning","message":{"text":"FuncEmitCtx::try_emit_expr_objects (cyclomatic 38): FuncEmitCtx::try_emit_expr_objects has cyclomatic complexity 38 (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/perry-codegen-wasm/src/emit/expr/objects.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"37076767dbcd62fca6303e9efd3ee95c5fb12a57372ae158ea2d6400a3ab52bc"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_function::lower_arrow (cyclomatic 38): perry_hir::lower::expr_function::lower_arrow 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/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"31606c50a0a61991cab68ef5c3ef196af66f6e7cc3024eaf2f525986ae157f5b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_object::lower_method_prop (cyclomatic 38): perry_hir::lower::expr_object::lower_method_prop 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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"145061050bfcac4638f6d2859719fa5c3cfc28c055181f7507bb9b493256a5b5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::helpers::expr_uses_arguments (cyclomatic 38): perry_hir::lower_decl::helpers::expr_uses_arguments has cyclomatic complexity 38 (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/perry-hir/src/lower_decl/helpers.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d38e7fb72916cc361e94639b0fce4121b28b3e87618cb3e047fc13787bf488"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::push_pop::proxy_array_mutator (cyclomatic 38): perry_runtime::array::push_pop::proxy_array_mutator 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/perry-runtime/src/array/push_pop.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c148f6a7e0bcab4fb89a939027ff435572c2c6eb5e4d136512779f080164f5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::component::persistent::poll::complete (cyclomatic 38): perry_runtime::component::persistent::poll::complete 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/perry-runtime/src/component/persistent/poll.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"527ef3fbbc9431fe1cd2087e8d36ac7f0e7739eb0fe4ec8a9b6927ffaf9340ef"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::class_constructors::js_super_construct_apply (cyclomatic 38): perry_runtime::object::class_constructors::js_super_construct_apply 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/perry-runtime/src/object/class_constructors.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a283c40e51b8474f544eaf74826147dff14b12e68402e3b13c94b094cc3be9b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_call_method::common_methods::dispatch_function_proto_method (cyclomatic 38): perry_runtime::object::native_call_method::common_methods::dispatch_function_proto_method 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/perry-runtime/src/object/native_call_method/common_methods.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df72b9827b816a64e03a7c7932308c68f5a0b899bd6b476bc601eac2a622752"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::turnloop_net::transport::dispatch_stream (cyclomatic 38): perry_runtime::turnloop_net::transport::dispatch_stream 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/perry-runtime/src/turnloop_net/transport.rs"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9c976cd9a6eeed3ce815c6d9306135084b7d71bcb89a82921f5ca8a952dc5f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::url::parse::parse_url (cyclomatic 38): perry_runtime::url::parse::parse_url 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/perry-runtime/src/url/parse.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4563d86214f9ad2618b7598c935092f1bdfe0268d1403957e5f6dae774b522"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::worker_threads::channel_pump::js_worker_threads_channels_process_pending (cyclomatic 38): perry_stdlib::worker_threads::channel_pump::js_worker_threads_channels_process_pending 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/perry-stdlib/src/worker_threads/channel_pump.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"281f93f69d90549a3fe643870d0c9f7ffce953b2b2ac26bc13d2f73436c30a32"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::call_inliner::try_inline_simple_call (cyclomatic 38): perry_transform::inline::call_inliner::try_inline_simple_call 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/perry-transform/src/inline/call_inliner.rs"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"948ddfef382bd54d0424d122f11a59508695a8f74d5cf2a2fab78b03f26b32a1"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_root_dominance_check.flag_path_feasible (cyclomatic 38): gc_root_dominance_check.flag_path_feasible 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":3871}}}],"partialFingerprints":{"codehealthFindingId/v1":"27dfaa75f21d836d77b0255cfe438f3b1e899a66ad767b5f95c72830fb00d178"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::collect_modules::finish::collect_module_finish (cyclomatic 37): perry::commands::compile::collect_modules::finish::collect_module_finish 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/perry/src/commands/compile/collect_modules/finish.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e83161d797aff28475a3587dbc4ba27b31e381a2853adff6ada6dd1eee90bc"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::resolve::native_library::parse_native_abi_descriptor (cyclomatic 37): perry::commands::compile::resolve::native_library::parse_native_abi_descriptor has cyclomatic complexity 37 (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/perry/src/commands/compile/resolve/native_library.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbbc1e926ca8e6e0a5d1197be5dba4ea9964f3b6ffebb43d111f54cf9bfdc0d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::publish::credentials::validate_credentials_for_distribute (cyclomatic 37): perry::commands::publish::credentials::validate_credentials_for_distribute 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/perry/src/commands/publish/credentials.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41c0e5e9ed429183f3cd3409ccc49347bf9816871a2736afa3fe1efce1b0082"}},{"ruleId":"D1","level":"warning","message":{"text":"Walk::stmt (cyclomatic 37): Walk::stmt 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/perry-codegen/src/collectors/read_before_write.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1baea0b930712c312f55746434dfb27fe782db81a624a563d85f1dbbbbcb4f7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::static_constfn::collect_literal_finals::block (cyclomatic 37): perry_codegen::codegen::static_constfn::collect_literal_finals::block 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/perry-codegen/src/codegen/static_constfn.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb7a9d3fb9d9d640d850b12fdc428e3adfb7fb7faaf0d587b6a3b718832f1bd"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::definite_init::order_verdict (cyclomatic 37): perry_codegen::collectors::definite_init::order_verdict 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/perry-codegen/src/collectors/definite_init.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3c0f5977e4586afca1af4a03744f062f10044cfaf2a7b5587e59a5e19219ea"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::calls::fs::arm_fs (cyclomatic 37): perry_codegen::expr::calls::fs::arm_fs 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/perry-codegen/src/expr/calls/fs.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35d32e32dceb48f7a788476a594eace37bc8c2ba123a1a96a22d3158026cc7a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::property_get::generic_dispatch::lower_property_site_tail (cyclomatic 37): perry_codegen::expr::property_get::generic_dispatch::lower_property_site_tail has cyclomatic complexity 37 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/property_get/generic_dispatch.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a739570683d6d2eca25f2833694172a93f05d457e45a24f916d950d99dbf2f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::func_ref::try_emit_spec_static_call (cyclomatic 37): perry_codegen::lower_call::func_ref::try_emit_spec_static_call has cyclomatic complexity 37 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 6 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":"crates/perry-codegen/src/lower_call/func_ref.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8503d0753dfff907316f00361474e576c5c018ace60d98dfc0d7d4902153c46b"}},{"ruleId":"D1","level":"warning","message":{"text":"FuncEmitCtx::emit_method_call (cyclomatic 37): FuncEmitCtx::emit_method_call has cyclomatic complexity 37 (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/perry-codegen-wasm/src/emit/method_call.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbaa42f5a8beff4a19f6f7a720499f7d935e8327779d97d4c7dee17853e490a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::js_transform::local_natives::detect_native_instance_creation_with_context (cyclomatic 37): perry_hir::js_transform::local_natives::detect_native_instance_creation_with_context has cyclomatic complexity 37 (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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18562b20537c5cacfa50d1c2a937315e236f2fc22db2b1e739c9cec40dc3a04"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::intrinsics::eval_strict::expr_has_violation (cyclomatic 37): perry_hir::lower::expr_call::intrinsics::eval_strict::expr_has_violation 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/perry-hir/src/lower/expr_call/intrinsics/eval_strict.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"3571d02dba8998c73f4739abecad79e31c0c7cae17c459aadd7007884fb961c4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::body_stmt::gen_capture_scan::collect_idents_stmt (cyclomatic 37): perry_hir::lower_decl::body_stmt::gen_capture_scan::collect_idents_stmt has cyclomatic complexity 37 (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/perry-hir/src/lower_decl/body_stmt/gen_capture_scan.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f6a31697d0f5ac3dca710f7620d46a9e4d172b76413c9760b82f86bb96517b"}},{"ruleId":"D1","level":"warning","message":{"text":"DirectParser::parse_number (cyclomatic 37): DirectParser::parse_number 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/perry-runtime/src/json/parser.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"525a1edc0864249bc0c20ac2a0d537efb73f09b7b32491ff016bb22cabac4a0b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::builtins::numbers::number_coerce_non_plain (cyclomatic 37): perry_runtime::builtins::numbers::number_coerce_non_plain 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/perry-runtime/src/builtins/numbers.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64c02a940c847c8060a9802742256f5051923e34a67364f14f732ee282ccda7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::gc::heap_snapshot::gc_build_v8_heap_snapshot_json_with_format (cyclomatic 37): perry_runtime::gc::heap_snapshot::gc_build_v8_heap_snapshot_json_with_format 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/perry-runtime/src/gc/heap_snapshot.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1155723bdd49dc2fefb0c70071948871e9f12a26a70923b9732dbe155ebdb1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_module_dispatch::dispatch_v_z::nm_dispatch_v8 (cyclomatic 37): perry_runtime::object::native_module_dispatch::dispatch_v_z::nm_dispatch_v8 has cyclomatic complexity 37 (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/perry-runtime/src/object/native_module_dispatch/dispatch_v_z.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a9eeea1b5de2b063211ab93d3faff752acfd8d41c5f70556824920b66676a4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::path::push_glob_regex (cyclomatic 37): perry_runtime::path::push_glob_regex 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/perry-runtime/src/path.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d41f71c0c567c788bc064a72f6a0ac55ef5aad07cada83f16775074ff4b159"}},{"ruleId":"D1","level":"warning","message":{"text":"repsel_census.census_from_report (cyclomatic 37): repsel_census.census_from_report 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":"scripts/compiler_output_harness/repsel_census.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe1bf33b483a28e02bad75c0143e28bcefff3ad280a15fea29fbe96009fcfd5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::loops::lower_object_array_write_versioned_for (cyclomatic 36): perry_codegen::stmt::loops::lower_object_array_write_versioned_for has cyclomatic complexity 36 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":5094}}}],"partialFingerprints":{"codehealthFindingId/v1":"d275113ca808a4f090e806dbe1b6b22aee41a6843865ad82ad2d3c990af3c373"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::monomorph::infer::infer_expr_type (cyclomatic 36): perry_hir::monomorph::infer::infer_expr_type has cyclomatic complexity 36 (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/perry-hir/src/monomorph/infer.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"56600fa34257985ae2158fe6c437793ba8b06423cd53b6b8725bd2c793644715"}},{"ruleId":"D1","level":"warning","message":{"text":"DirectParser::parse_object_untyped (cyclomatic 36): DirectParser::parse_object_untyped 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/perry-runtime/src/json/parser.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafb7d53afdfe88e07ca12266ef27f9f6b2eb292cf94375fd6d982e026d4786e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::flat_clone::js_array_clone (cyclomatic 36): perry_runtime::array::flat_clone::js_array_clone 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/perry-runtime/src/array/flat_clone.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab98d070851a4e2d9ff8cced5d924e597ac057f6c21619ac26fb7594c7834a8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::component::persistent::poll::cycle (cyclomatic 36): perry_runtime::component::persistent::poll::cycle 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/perry-runtime/src/component/persistent/poll.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a14e88749af1a1af0b56379a4ef645f8d8768d15b8f6a6054ed3f3ece9c8376"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::intl::duration_format::parse_iso_duration (cyclomatic 36): perry_runtime::intl::duration_format::parse_iso_duration 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/perry-runtime/src/intl/duration_format.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"633de212b731b409f0bafb274eabf077b4708c5c4fedcacbaf758e176cba7a58"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::intl::number_format::number_parts_core (cyclomatic 36): perry_runtime::intl::number_format::number_parts_core 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/perry-runtime/src/intl/number_format.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"1560f55757c8bf5dcc8d3c5eae01c5a99469d07d6cd2140b84d4c770758820b3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_set_by_name::fast_paths::existing_own_data_overwrite (cyclomatic 36): perry_runtime::object::field_set_by_name::fast_paths::existing_own_data_overwrite 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/perry-runtime/src/object/field_set_by_name/fast_paths.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"703bdf18994d761fb2877d007ce169809032fd523daf33129065298034019dc0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::process::node_module::module_typescript_code_mask (cyclomatic 36): perry_runtime::process::node_module::module_typescript_code_mask 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/perry-runtime/src/process/node_module.rs"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"2144ad77148a3e31708f101f0476d0b63491df89d98d67118556f9ff1809172d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::tty::color_depth_from_lookup (cyclomatic 36): perry_runtime::tty::color_depth_from_lookup 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/perry-runtime/src/tty.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bcafa07c7300a39a6ee5c0f9bf4b91cbea561f94563ba35e1ddc7a0429c939"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::url::node_compat::legacy_url_resolve_impl (cyclomatic 36): perry_runtime::url::node_compat::legacy_url_resolve_impl 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/perry-runtime/src/url/node_compat.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"f598f6081dbc7ee8b080ee594f8ff5eea67c0e255c76ce8a1b0158c0211b930e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::aggregate_scalar::return_record_stmts_are_safe (cyclomatic 36): perry_transform::aggregate_scalar::return_record_stmts_are_safe has cyclomatic complexity 36 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 7 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/perry-transform/src/aggregate_scalar.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"574682771acc1c6ebab8270fee3fe4920dfedc7350b9c883869ff8192b45ec8e"}},{"ruleId":"D1","level":"warning","message":{"text":"Gen::contract_check (cyclomatic 36): Gen::contract_check 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/perry-wpfacts/src/gen/export.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb87291aed1b86a255e53a86b080ff395e9d4defaabb88b1a293219ce370d3c"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::solve (cyclomatic 36): Model::solve 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. This is NOT this file\u0027s highest cyclomatic complexity: Model::cons_line (cyclomatic 67) 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/perry-wpfacts/src/solve.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebcd25f0bbaf614ab176ddc50f86222197e653f7d6d5293efd6839b9a59724d"}},{"ruleId":"D1","level":"warning","message":{"text":"check_docs.main (cyclomatic 36): check_docs.main 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":"scripts/check_docs.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b19d0d1f27106a4cde762842210f4a53abb2a4b9b82926aaeb0c4e068693b1"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_root_dominance_check.check_func (cyclomatic 36): gc_root_dominance_check.check_func 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":2294}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a2a1ef9f474d1bbcca184056d1df20b41f7db76f250a978c9d70020ab0364d"}},{"ruleId":"D1","level":"warning","message":{"text":"thread_exit_address_globals.check (cyclomatic 36): thread_exit_address_globals.check 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":"scripts/thread_exit_address_globals.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e5d8ac4926123731cf438d4d2222561bd9da65f56385b572b7064a13105c61"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::collect_modules::reexport_prune::forwarding::normalize (cyclomatic 35): perry::commands::compile::collect_modules::reexport_prune::forwarding::normalize 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/perry/src/commands/compile/collect_modules/reexport_prune/forwarding.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb7994756b01edde6376afd2312d88a232675b2f4fd08853e590c58e4a94a6f"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayWalk::walk_stmt (cyclomatic 35): ArrayWalk::walk_stmt 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/perry-codegen/src/collectors/ptr_shape_elements.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1824afde5b0575330055b6680474fd25e60edb1bdfba03ea34e6a16ac38b1ed"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::static_prototype::collect (cyclomatic 35): perry_codegen::codegen::static_prototype::collect 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/perry-codegen/src/codegen/static_prototype.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c6334ac9eef8c42ccb4afc2e76cf86fd0dcff03c57033725f2dd370f4a1234"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::fallback_diag::enter_expr (cyclomatic 35): perry_codegen::fallback_diag::enter_expr has cyclomatic complexity 35 (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/perry-codegen/src/fallback_diag.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"df66ce34be865a7a70a0912af1314a34463e2a554e5cf2fc59521556a5f69426"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::lower_call (cyclomatic 35): perry_codegen::lower_call::lower_call 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/perry-codegen/src/lower_call/mod.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1770bace014485f264c4341717e065d94b959fe5b19ec7d26dda3a879a477a6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::property_get::number_string::try_lower_number_string_methods (cyclomatic 35): perry_codegen::lower_call::property_get::number_string::try_lower_number_string_methods 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/perry-codegen/src/lower_call/property_get/number_string.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f792ea7143332d4597ea8f17455a99cfdc5e558d667d41b8ead5a82386aa72"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::loops::packed_f64_range_loop_dense_stmts_collect (cyclomatic 35): perry_codegen::stmt::loops::packed_f64_range_loop_dense_stmts_collect 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":2711}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44b61507cf6a3f24d76908788ae70a3ab1d76f1d914413270fb157a461d9778"}},{"ruleId":"D1","level":"warning","message":{"text":"WasmModuleEmitter::emit_js_stmt (cyclomatic 35): WasmModuleEmitter::emit_js_stmt has cyclomatic complexity 35 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/emit/js_fallback.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7c53359dd672db9705934621aebf20639f1c56d34b19ce8235f44599f907f4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_http::client_turnloop::native_client::run (cyclomatic 35): perry_ext_http::client_turnloop::native_client::run 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/perry-ext-http/src/client_turnloop/native_client.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ededeb7eba64b0d56ed27f0386ad16e0b7d1ff8d08c320b7506bee0129a102"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::analysis::fn_infer::ty_of (cyclomatic 35): perry_hir::analysis::fn_infer::ty_of has cyclomatic complexity 35 (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/perry-hir/src/analysis/fn_infer.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a54fdb256c5253a7f176c59debf06c1396be811f828afab0caac990038e79b3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_assign::lower_assign (cyclomatic 35): perry_hir::lower::expr_assign::lower_assign 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/perry-hir/src/lower/expr_assign.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2dbcc05e864615bed38b483480440121bcec0a0bb92f8401533504dc79eb7c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::global_eval_hoist::rename_ident_in_stmt (cyclomatic 35): perry_hir::lower::global_eval_hoist::rename_ident_in_stmt 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/perry-hir/src/lower/global_eval_hoist.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cf3c3c4de6a58d89fdb2f23f010c5fa745e040c296d2843bb6a756a78b446f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::lower_expr::arm_optchain::lower_opt_chain_expr (cyclomatic 35): perry_hir::lower::lower_expr::arm_optchain::lower_opt_chain_expr 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/perry-hir/src/lower/lower_expr/arm_optchain.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2114e2c5bd966e5d09dfebcbaa7181dedd4e6c4e4e6780ae209986ef6821cca7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::dyn_eval::expr::eval_expr (cyclomatic 35): perry_runtime::dyn_eval::expr::eval_expr has cyclomatic complexity 35 (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/perry-runtime/src/dyn_eval/expr.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f78ade9de64d7bfc3689e6fcb0734deec54c68963f1d30290acfe34c251336"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::intl::date_collator::format_parts_with_dtf_obj (cyclomatic 35): perry_runtime::intl::date_collator::format_parts_with_dtf_obj 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/perry-runtime/src/intl/date_collator.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c380146b6731669eec0d88dc1d3158f9821e3cf193c9341822d265b6113c2e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::node_stream::native_hooks::run_native_steps (cyclomatic 35): perry_runtime::node_stream::native_hooks::run_native_steps 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/perry-runtime/src/node_stream/native_hooks.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"01958afe9781d1b38b412d78a41d5eaa7dfc354d27f1b36d5994c1f37e2672a7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::cross_module::localize_cross_module_functions (cyclomatic 35): perry_transform::inline::cross_module::localize_cross_module_functions 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/perry-transform/src/inline/cross_module.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e9432d59f2bc62f0ccfe5447e1653e5f3fb5390aae62add27b7f9ffc2bad52"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wasi::filesystem::primitives::windows::fs::create_file_at_w::CreateFileAtW (cyclomatic 35): perry_wasi::filesystem::primitives::windows::fs::create_file_at_w::CreateFileAtW has cyclomatic complexity 35 (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/perry-wasi/src/filesystem/primitives/windows/fs/create_file_at_w.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d33b7d2f03e14514f4c0048b48f65f9336d5e68e41192efcb44846159d037e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::units::published_surface (cyclomatic 35): perry_wpfacts::units::published_surface 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/perry-wpfacts/src/units.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"2086de3b7e560529ecaa6828c6c44e59d812fe913395b44356fab789a94e53e7"}},{"ruleId":"D1","level":"warning","message":{"text":"component_http_guest_acceptance.main (cyclomatic 35): component_http_guest_acceptance.main 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":"scripts/component_http_guest_acceptance.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2094fa9e8317688a7c68e986bd9fbef439dfb7e15dfb288b8a8b287a45b1ce05"}},{"ruleId":"D1","level":"warning","message":{"text":"wpfacts_corpus.check_one (cyclomatic 35): wpfacts_corpus.check_one 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":"scripts/wpfacts_corpus.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc582a2f91a4c694863afd4553262aa8d8b76ab34c0b770159625643d39bb139"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::publish::preflight::ios_preflight_validation (cyclomatic 34): perry::commands::publish::preflight::ios_preflight_validation 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/perry/src/commands/publish/preflight.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"58457443d647e401b36c674673fb5d01dbe5baebb92756ff475ab1449b32d7bc"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_cli_support::dotenv::parse_record (cyclomatic 34): perry_cli_support::dotenv::parse_record 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/perry-cli-support/src/dotenv.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b2b07368a18d84083a392071d5b23549c33e1053390ba8b04aec06e7dabfe0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::export_value_wrappers::emit_export_value_wrappers (cyclomatic 34): perry_codegen::codegen::export_value_wrappers::emit_export_value_wrappers 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/perry-codegen/src/codegen/export_value_wrappers.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5d3a1ca80e1fc1ab891e18bedc0019308a2704bfedcea25ee27e55f8980293"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::mutation::any_top_level_expr (cyclomatic 34): perry_codegen::collectors::mutation::any_top_level_expr 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/perry-codegen/src/collectors/mutation.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d37d2ad2740d296c0d0ae7a385eebbe41d2eb4a8c55e88bbceddc0c74d08e3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::dialect::types::constant (cyclomatic 34): perry_codegen::dialect::types::constant has cyclomatic complexity 34 (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/perry-codegen/src/dialect/types.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"aacfabf57afd71aaaf7443740da7129f0e2a14bf447baf4837f94d0147f4ed5e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::array_methods::lower (cyclomatic 34): perry_codegen::expr::array_methods::lower 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/perry-codegen/src/expr/array_methods.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e285db276529b8e7b5504ff3aea8d0b8d9c04e1d607a6580bacc49241659d5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::compare_chain::try_lower (cyclomatic 34): perry_codegen::expr::compare_chain::try_lower 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/perry-codegen/src/expr/compare_chain.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce7b304e13ae737b94a850be4f6e54a33cce3c2e7e8a289a211e7696dd5a45a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::ui_tables::lower_perry_ui_table_call (cyclomatic 34): perry_codegen::lower_call::ui_tables::lower_perry_ui_table_call has cyclomatic complexity 34 (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/perry-codegen/src/lower_call/ui_tables.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bb1a1696b52e2965cd57eebb432bf89bdfc8a5005d4e4c38c2a0328e43f21e"}},{"ruleId":"D1","level":"warning","message":{"text":"WasmModuleEmitter::collect_strings (cyclomatic 34): WasmModuleEmitter::collect_strings 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/perry-codegen-wasm/src/emit/string_collection.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9cb5da7ad98229d521856133f777db9f18cb39ec7b8a632ef53087c5c53741"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_http::server::http2_server::pump::process_pending_h2_events (cyclomatic 34): perry_ext_http::server::http2_server::pump::process_pending_h2_events has cyclomatic complexity 34 (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/perry-ext-http/src/server/http2_server/pump.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"724ea669a22b56145e14e3938b4c40d6c14e305e309827019da59ac3635a2648"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_zlib::stream::create_stream (cyclomatic 34): perry_ext_zlib::stream::create_stream has cyclomatic complexity 34 (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/perry-ext-zlib/src/stream.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b745d5eae1377629175bda96acfc49545d9f4257539e18b69620b59ac01496"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::module_class_static::try_module_class_static (cyclomatic 34): perry_hir::lower::expr_call::module_class_static::try_module_class_static 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/perry-hir/src/lower/expr_call/module_class_static.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d5a22ea0896b27f2220f0450a86314fe17c420a72b313ce2609852ee0c7c53"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::subclass_loop_guard::js_packed_arraylike_loop_revalidate_live (cyclomatic 34): perry_runtime::array::subclass_loop_guard::js_packed_arraylike_loop_revalidate_live has cyclomatic complexity 34 (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/perry-runtime/src/array/subclass_loop_guard.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"839be74e6ecbda853c94d603cf0bc92ef1641c565f98c437d4c8090814fb766f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::builtins::arithmetic::js_loose_eq (cyclomatic 34): perry_runtime::builtins::arithmetic::js_loose_eq 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/perry-runtime/src/builtins/arithmetic.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"578a31e5ea1336ba7e878091536fa2194975f0e5af845ac26cecfa98da56ba5e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::intl::list_relative_plural::plural_category (cyclomatic 34): perry_runtime::intl::list_relative_plural::plural_category has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: perry_runtime::intl::list_relative_plural::polish_unit (cyclomatic 47) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/intl/list_relative_plural.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"b822867a134627406e41a6c3edb15316c75650b26bac99250a84953555a6428a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json::replacer::stringify_value_pretty (cyclomatic 34): perry_runtime::json::replacer::stringify_value_pretty 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/perry-runtime/src/json/replacer.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03efc9c0f8c36aad271fef03a38079a3a97776cc4e8142d85e605fd63b5fdf8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::node_api_host::properties::napi_get_all_property_names (cyclomatic 34): perry_runtime::node_api_host::properties::napi_get_all_property_names 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/perry-runtime/src/node_api_host/properties.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8a4f6206559fe685ea1b029598fc5ef034eafdcaa7fb5691f270576f68b80b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::temporal::zoned_date_time::get (cyclomatic 34): perry_runtime::temporal::zoned_date_time::get has cyclomatic complexity 34 (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/perry-runtime/src/temporal/zoned_date_time.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad1bc02ed15c589545ced83bf7080ed8f366d26dc4abc21c5215857b87ad512"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::wasi_net::pump (cyclomatic 34): perry_runtime::wasi_net::pump 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/perry-runtime/src/wasi_net/mod.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21331b497ea3655f9fb430584507a10cc09171779b1a391b8dfa1e7b7b7026b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::streams::subclass::dispatch_stream_method (cyclomatic 34): perry_stdlib::streams::subclass::dispatch_stream_method has cyclomatic complexity 34 (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/perry-stdlib/src/streams/subclass.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"5baca5836a7618cb5308a866740f4483839c6e233becce808fb51d955b094088"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::unroll::refresh_in_stmt (cyclomatic 34): perry_transform::unroll::refresh_in_stmt has cyclomatic complexity 34 (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/perry-transform/src/unroll/mod.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4eeb136e424b84c9723adc00750591c73d3a91016d00aae0c243c29bb028da"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::builtins::collections::bobj_method (cyclomatic 34): perry_wpfacts::builtins::collections::bobj_method has cyclomatic complexity 34 (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/perry-wpfacts/src/builtins/collections.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0fa0cf10f5bacebde7f38ba511ed890f564e5ab803d40c0a22361ecbcf3c876"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::lib::contracts::describe_toks (cyclomatic 34): perry_wpfacts::lib::contracts::describe_toks 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/perry-wpfacts/src/lib/contracts.rs"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"10675e08412e29c186e65aa80c78026868014e42a843b740c27d1456c2126dd0"}},{"ruleId":"D1","level":"warning","message":{"text":"repsel_knob_isolation._verdict (cyclomatic 34): repsel_knob_isolation._verdict 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":"scripts/compiler_output_harness/repsel_knob_isolation.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"002acca916ba9f1ae0e7f43cf6196dabd6d6ec8c5886d585a64c4ae03e41a8eb"}},{"ruleId":"D1","level":"warning","message":{"text":"component_http_p3_acceptance.main (cyclomatic 34): component_http_p3_acceptance.main 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":"scripts/component_http_p3_acceptance.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf9a742d31570e43788bc3318c413263ba55eef2c69ea424daae70835f122d3"}},{"ruleId":"D1","level":"warning","message":{"text":"global_sink_isolation.self_test (cyclomatic 34): global_sink_isolation.self_test has cyclomatic complexity 34 (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":"scripts/global_sink_isolation.py"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbced3acdf9297be1419b2eb88c8d391c589580983bb0e7771a80ea413c84c13"}},{"ruleId":"D1","level":"warning","message":{"text":"generator.generateTheme (cyclomatic 34): generator.generateTheme 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":"packages/perry-styling/src/generator.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad522e8f053dd21a17b12656ec2d9b31ef472b87898d9a0e0549e764a9767e9"}},{"ruleId":"D1","level":"warning","message":{"text":"Scanner::summary (cyclomatic 33): Scanner::summary 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/perry/src/commands/compile/collect_modules/reexport_prune/scan.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"7760f27b62df19ece94c4bfa6331f236b42f1b4c137e7e2de72f0b1dccee3654"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::extract_requires::function_local_specs (cyclomatic 33): perry::commands::compile::cjs_wrap::extract_requires::function_local_specs has cyclomatic complexity 33 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/cjs_wrap/extract_requires.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf44699e92d684792c27a7f1394ecd38b0ddc72db7c21afd503505bafe7afa6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::collect_modules::static_require_transform::transform_static_literal_requires_with_bunfs (cyclomatic 33): perry::commands::compile::collect_modules::static_require_transform::transform_static_literal_requires_with_bunfs 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/perry/src/commands/compile/collect_modules/static_require_transform.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5b8ae6435c019c3839a1a5f197e4d09dde5f6556c19fac59400e3c7d310706"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::lowering_report::print_text_report (cyclomatic 33): perry::commands::compile::lowering_report::print_text_report has cyclomatic complexity 33 (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/perry/src/commands/compile/lowering_report.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2cf5c9f85e80ac1d26ec71bfb441e80cba109daba3417eb637abb7836cd655a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::layout_desc::create_families::literal_iife (cyclomatic 33): perry_codegen::layout_desc::create_families::literal_iife 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/perry-codegen/src/layout_desc/create_families.rs"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"b823b061bec5495b0ea8db7ec015536987b3c8b6ba1105f91b50b27b05b885cd"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::property_get::map_set::try_lower_map_set_methods (cyclomatic 33): perry_codegen::lower_call::property_get::map_set::try_lower_map_set_methods 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/perry-codegen/src/lower_call/property_get/map_set.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1162a9f7a1db69da64a829cd8444e25d9fe51c5ff847c1c78765f760c64ed9ac"}},{"ruleId":"D1","level":"warning","message":{"text":"FuncEmitCtx::try_emit_expr_buffers (cyclomatic 33): FuncEmitCtx::try_emit_expr_buffers 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/perry-codegen-wasm/src/emit/expr/buffers.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60057340973da58067945528dc90a97d1afacbd5ebf22f1ab98be79d03ff7e2"}},{"ruleId":"D1","level":"warning","message":{"text":"Types::value (cyclomatic 33): Types::value 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/perry-component-host/src/async_values/reader_types.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca19c21a056b41294fc02f4f2e8f7884928c60f98d08f9fc0f7cfca6ae21b54b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_component_host::driver::async_values::execute (cyclomatic 33): perry_component_host::driver::async_values::execute has cyclomatic complexity 33 (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/perry-component-host/src/driver/async_values.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5cfe45b9fe8355294bd12d1ba63220ee17edb0f04e4b8458366e8389ecf4e0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::analysis::collect_local_refs_stmt (cyclomatic 33): perry_hir::analysis::collect_local_refs_stmt has cyclomatic complexity 33 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/analysis.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"f624b6316931a3393e7e6ea35536fd1ef418b5322ed72308b3620b116872ec57"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::const_fold_fn::param_early_error::fn_ctor_kind_param_early_error::expr_has (cyclomatic 33): perry_hir::lower::const_fold_fn::param_early_error::fn_ctor_kind_param_early_error::expr_has 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/perry-hir/src/lower/const_fold_fn/param_early_error.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3c60726db91491301350cbe295f36b5113dedf6f7d446078e60b2a95c7c1f4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::eval_super_scan::scan_stmt (cyclomatic 33): perry_hir::lower::eval_super_scan::scan_stmt has cyclomatic complexity 33 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/eval_super_scan.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"3803c40fbb3c0da284bb85fa4ae88cc98e29494c4c633d0cc9fc4094e539ec27"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::lower_module_fn::collect_assigned_function_binding_candidates::collect_from_stmt (cyclomatic 33): perry_hir::lower::lower_module_fn::collect_assigned_function_binding_candidates::collect_from_stmt has cyclomatic complexity 33 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This shape REPEATS in the file: one other method here (perry_hir::lower::lower_module_fn::collect_assigned_function_binding_candidates::collect_from_expr) 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/perry-hir/src/lower/lower_module_fn.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"56fc9c605f45a161922def10b531f6b72bd418d7149b55dad9bd3434ff22ee4a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::child_process::validate::cp_validate_options (cyclomatic 33): perry_runtime::child_process::validate::cp_validate_options 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/perry-runtime/src/child_process/validate.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff4a7c0c37e9c6aabeee7697256ddc62f491dc942121eb1efdeb385f8615f9d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::intl::icu_dtf::format_components (cyclomatic 33): perry_runtime::intl::icu_dtf::format_components 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/perry-runtime/src/intl/icu_dtf.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e25ccc3e15920c143cb08fdec9f66d0c25bee8360e713c75a7f27151cd2d5a2"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::intl::list_relative_plural::rtf_auto_word (cyclomatic 33): perry_runtime::intl::list_relative_plural::rtf_auto_word 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. This is NOT this file\u0027s highest cyclomatic complexity: perry_runtime::intl::list_relative_plural::polish_unit (cyclomatic 47) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/intl/list_relative_plural.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f82cca1ca7513110db044f1a9123a5794ff130f39f2d92c964625d371e8b8b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_get_set::entries_shape::js_object_entries_shape (cyclomatic 33): perry_runtime::object::field_get_set::entries_shape::js_object_entries_shape 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/perry-runtime/src/object/field_get_set/entries_shape.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a7a58cc03c3c4fe3e243e77c228e3656dc0cf872cb93ae17af17bc8864c71b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_get_set::enumeration::js_object_values_shape (cyclomatic 33): perry_runtime::object::field_get_set::enumeration::js_object_values_shape 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/perry-runtime/src/object/field_get_set/enumeration.rs"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96f00586fc8813045f3c7d8a45f7747aff053f56f243dcce043034df2e7f619"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_get_set::ic_miss::get_field_miss (cyclomatic 33): perry_runtime::object::field_get_set::ic_miss::get_field_miss 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/perry-runtime/src/object/field_get_set/ic_miss.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bd6322ba66bc572438d007352430464b6f18d21a831d70e5a7c4634ab86a39"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_call_method::object_proto::js_object_is_prototype_of_value (cyclomatic 33): perry_runtime::object::native_call_method::object_proto::js_object_is_prototype_of_value 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/perry-runtime/src/object/native_call_method/object_proto.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"984254fa077f56a46238f579108fa3101d59fa51c218d819a6b873107dfbe68a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::property_ops::set::ordinary_set_with_receiver (cyclomatic 33): perry_runtime::object::property_ops::set::ordinary_set_with_receiver 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/perry-runtime/src/object/property_ops/set.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77f5b26d94511af2e6ff5ad6ef54e9d8fedfdb58128baf982b128c259954d20"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::turnloop_client::exchange::feed (cyclomatic 33): perry_stdlib::turnloop_client::exchange::feed 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/perry-stdlib/src/turnloop_client/exchange.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"783654a5ceed1f5db78fb7c1ff0cbb2262db93777bdf1236f1915b4e7cbc2dd1"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze-current0ed-native-v17.analyze (cyclomatic 33): analyze-current0ed-native-v17.analyze 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":"docs/audits/gc-rss-instructions-2026-10-03/analyze-current0ed-native-v17.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b31153e68aa87d4cbdd7ea654779fb4ec1725b497911440c24979da3e0a8149"}},{"ruleId":"D1","level":"warning","message":{"text":"copied_minor_fallback_report.run_target_collector_gates (cyclomatic 33): copied_minor_fallback_report.run_target_collector_gates 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":"scripts/copied_minor_fallback_report.py"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"7847d3e405c641a76a17893a1cf9d5b73f6d32e3321b6fed2a0f5f21e3cb0231"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_runtime_root_holders.scan (cyclomatic 33): gc_runtime_root_holders.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":"scripts/gc_runtime_root_holders.py"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c68879bbcb9a5d833a2ad7c2e44153fd58cfe20ad8e7a07f8fe268b59d8a80a"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_snapshot_contracts.snapshot_contract_problems (cyclomatic 33): gc_snapshot_contracts.snapshot_contract_problems 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":"scripts/gc_snapshot_contracts.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d7dd98a034f93d32f970f811dc929c4b2a9b1e1c2a999dec09b5bc1fb8d402"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime_abi_check.parse_codegen (cyclomatic 33): runtime_abi_check.parse_codegen 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":"scripts/runtime_abi_check.py"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"1113742ced37cd658cfcebc4b2f25c139cf0c8002432ce5ee82cf7b8e67ac46d"}},{"ruleId":"D1","level":"warning","message":{"text":"tokio_inventory.self_test (cyclomatic 33): tokio_inventory.self_test has cyclomatic complexity 33 (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":"scripts/tokio_inventory.py"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d80d7599ae390df054d01750a8af1184ee5f0b6e278f85fa5e9788ff588aa8a"}},{"ruleId":"D1","level":"warning","message":{"text":"wpfacts_recompute.derive (cyclomatic 33): wpfacts_recompute.derive 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":"scripts/wpfacts_recompute.py"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc46eae43f490003f18cd6f4415886a50b09880d8ba2f6671a5422d7d12992fb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::init_order::topo_sort_non_entry_modules (cyclomatic 32): perry::commands::compile::init_order::topo_sort_non_entry_modules has cyclomatic complexity 32 (threshold 15). Of this number, 27 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/perry/src/commands/compile/init_order.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c94341def113ede11473e00d00dc9887fbb642a9b2bf2db10ffc928c55a80e"}},{"ruleId":"D1","level":"warning","message":{"text":"Env::kind (cyclomatic 32): Env::kind 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/perry-codegen/src/collectors/typed_locals.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a391a6b2a3f5f9d04f3979a59c2477c62e5b44770b4693b323710907ab452a0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::lower_compare_value (cyclomatic 32): perry_codegen::expr::lower_compare_value 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/perry-codegen/src/expr/mod.rs"},"region":{"startLine":4237}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a5d5bf7111f895781ad588de39994bb04d6f53aced106f05b2797aab85d861"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::range_facts::int_range_expr_inner (cyclomatic 32): perry_codegen::expr::range_facts::int_range_expr_inner 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/perry-codegen/src/expr/range_facts.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"777c0dec3d10fee0520f468d5691730b27af62d9b7f2194032d32d6808e60030"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::function::precise_roots::remat::plan (cyclomatic 32): perry_codegen::function::precise_roots::remat::plan 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/perry-codegen/src/function/precise_roots/remat.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"6870037d180d4524116af89c2d7c9205bc0bdc0c0d58b4be2855561c05fb5bee"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::layout_families::late::module_groups (cyclomatic 32): perry_codegen::layout_families::late::module_groups 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/perry-codegen/src/layout_families/late.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"f580400535807ae5fd52cc7de0924b50c2980b040f92c454a966339388469105"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::birth_lanes::chain_birth_f64_fields (cyclomatic 32): perry_codegen::lower_call::birth_lanes::chain_birth_f64_fields 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/perry-codegen/src/lower_call/birth_lanes.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6c6a8e128ff0e890c3b7e7dad87169daf3dd2122754544fdb71c5f8c5e02b5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::element_shape_loop::lower_element_shape_versioned_for (cyclomatic 32): perry_codegen::stmt::element_shape_loop::lower_element_shape_versioned_for 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/perry-codegen/src/stmt/element_shape_loop.rs"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"6887d5b526cf4b1edce2d86fd29e6933205c5997f73897e20534b2ee14bde943"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_gc_effects::archive::build_graph (cyclomatic 32): perry_gc_effects::archive::build_graph 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/perry-gc-effects/src/archive.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bdd2513b00cc88c2940d8eaf8b356e2c389f673711fb4a4fb814fe006b4dee"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::analysis::collect_assigned_locals_stmt (cyclomatic 32): perry_hir::analysis::collect_assigned_locals_stmt has cyclomatic complexity 32 (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/perry-hir/src/analysis.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a82d085023f53f4e12c7ebb55b73d82fa3f8c4381c82516a2ce4244b5e66e1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::destructuring::var_decl_sources::register_destructured_stream_ctors (cyclomatic 32): perry_hir::destructuring::var_decl_sources::register_destructured_stream_ctors 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/perry-hir/src/destructuring/var_decl_sources.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ce6c7977573fa5ce4fa122a70e1a8cec548e67dc37776c1ca92a8d49c3d635"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::js_transform::cross_module_natives::fix_native_instance_stmt (cyclomatic 32): perry_hir::js_transform::cross_module_natives::fix_native_instance_stmt has cyclomatic complexity 32 (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/perry-hir/src/js_transform/cross_module_natives.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e9234c16ae193117d6e0b3bb07a1656f1ce5af5fcab4e2bb9dd5219d98b757"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::js_transform::local_natives::fix_native_instance_stmt_with_locals (cyclomatic 32): perry_hir::js_transform::local_natives::fix_native_instance_stmt_with_locals has cyclomatic complexity 32 (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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef25d6012803b5f1029e883e947bdcccfc0729dad866681c9f0de77a43f4f4ff"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::builder_fold::scan_expr (cyclomatic 32): perry_hir::lower::builder_fold::scan_expr 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/perry-hir/src/lower/builder_fold.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"88268a7ca8330eb8b094a3e4158b0b3d79f50e7cdeeecc33ca957098d68f1eef"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::builder_fold::value_is_fold_safe (cyclomatic 32): perry_hir::lower::builder_fold::value_is_fold_safe 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/perry-hir/src/lower/builder_fold.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"3641d4c45ce6e7f186967096d23c037fb87c8916c2d5d8a65b0664553785095c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::shared_mutable_capture::rewrite_expr (cyclomatic 32): perry_hir::lower::shared_mutable_capture::rewrite_expr has cyclomatic complexity 32 (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/perry-hir/src/lower/shared_mutable_capture.rs"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be787dd9d2d40f0d9c1f95f0e4a294b2b954ea9a1fa15b4373f90572f3bcded"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::monomorph::update_call_sites::infer_expr_type_from_lookup (cyclomatic 32): perry_hir::monomorph::update_call_sites::infer_expr_type_from_lookup 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/perry-hir/src/monomorph/update_call_sites.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f31e919ef666d397702ed694ef00314ab0465fbdbf80f54a240146fd58f24c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::closure::dispatch::bound::function_bind_observable (cyclomatic 32): perry_runtime::closure::dispatch::bound::function_bind_observable has cyclomatic complexity 32 (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/perry-runtime/src/closure/dispatch/bound.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"48889abe63045f7255b2f7252b6b744277184b3ad24c8739b9cded74590ca1aa"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_get_set::ic_miss::class_field_define_fast::try_define_new_class_field (cyclomatic 32): perry_runtime::object::field_get_set::ic_miss::class_field_define_fast::try_define_new_class_field 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/perry-runtime/src/object/field_get_set/ic_miss/class_field_define_fast.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f7d8b66a1ce4dbaedf4723e2bf352818174a682799a94df1af96f6ec2080e3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::timer::mock::scan_mock_timers_step (cyclomatic 32): perry_runtime::timer::mock::scan_mock_timers_step 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/perry-runtime/src/timer/mock.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b1e54eb5e0202f84d206d3482c61653f22f3ad866472f9d33057e10bc0b50e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime_manifest::realm_source::tokens (cyclomatic 32): perry_runtime_manifest::realm_source::tokens 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/perry-runtime-manifest/src/realm_source.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95a9f2615c93f0956fc704f7da94d5ba858d5231e0f2d8ac675c9b6ab9787a3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::deforest::detect::detect_producers (cyclomatic 32): perry_transform::deforest::detect::detect_producers 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/perry-transform/src/deforest/detect.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"523234866b64fca6dc0cb05ee9de9e2ecc1769cf383575dd9b950f6be1401604"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::closure_analysis::find_max_local_id::check_stmt (cyclomatic 32): perry_transform::inline::closure_analysis::find_max_local_id::check_stmt has cyclomatic complexity 32 (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/perry-transform/src/inline/closure_analysis.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8828811b3aeeb911afd79a74adb2f6b14bfb0312de140b202d2d7b96f925d4"}},{"ruleId":"D1","level":"warning","message":{"text":"Gen::link_exports (cyclomatic 32): Gen::link_exports 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/perry-wpfacts/src/gen/export.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"08616b2477cb5e5c5f5944b44cd2a9129150e272cd0f1bebd467b0f2f6d8f916"}},{"ruleId":"D1","level":"warning","message":{"text":"raw_handle_debt.self_test (cyclomatic 32): raw_handle_debt.self_test has cyclomatic complexity 32 (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":"scripts/raw_handle_debt.py"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a95f725ad7e3ed56bc8cf28a0bdc3313704418144d25a82c8ac35d1e7ef473f"}},{"ruleId":"D1","level":"warning","message":{"text":"registry_lifetime_check.scan_with_sites (cyclomatic 32): registry_lifetime_check.scan_with_sites 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":"scripts/registry_lifetime_check.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47e0031674fc96e31d4167e1e530d1fa806afe4fa124ea1d2ad415bb45924a9"}},{"ruleId":"D1","level":"warning","message":{"text":"wasi_host_qualification.main (cyclomatic 32): wasi_host_qualification.main 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":"scripts/wasi_host_qualification.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"801c760cc54a52f1835f54a58ace53f2452801b06ba5cedc3e453dc70019761f"}},{"ruleId":"D1","level":"warning","message":{"text":"release.ensureTagAndRelease (cyclomatic 32): release.ensureTagAndRelease 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":"scripts/publish/release.mts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5bbaa72b91f1e672c949fb3f9d8e299539777a8d7c968a98ec3ba0b50884e09"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::collect_modules::feature_detect::module_uses_json_format (cyclomatic 31): perry::commands::compile::collect_modules::feature_detect::module_uses_json_format has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 5 of the 31 points are its own statements and the rest belongs to 5 function items inside it that branch (expr_uses_json_format, format_args_need_json, formatter_offset, \u2026). 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/perry/src/commands/compile/collect_modules/feature_detect.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2e52b0f4c2eba52b7540c55a7fa790c29dc76d642af094db5d880c08e7601a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::resolve::resolve_with_extensions (cyclomatic 31): perry::commands::compile::resolve::resolve_with_extensions 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/perry/src/commands/compile/resolve.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06a6d271fde2d56fef85ecddfa7faeada99b2c768b3585fe0e4a228b2b4076f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::run::entry::resolve_target (cyclomatic 31): perry::commands::run::entry::resolve_target 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/perry/src/commands/run/entry.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5611179b8685f578c77a91460f2478aa0bf6d8faa3a9c29adf5963ec595cb50"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::build (cyclomatic 31): Model::build has cyclomatic complexity 31 (threshold 15). Of this number, 30 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/perry-codegen/src/collectors/definite_init.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b99892120d0800e20bbff1a42eabfdfc23e04db4e35c7feddbe3675e8b55f64"}},{"ruleId":"D1","level":"warning","message":{"text":"Flow::expression (cyclomatic 31): Flow::expression has cyclomatic complexity 31 (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/perry-codegen/src/layout_desc/array_families.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3edc32fab2546905db30b2473183ca41e42f40fb88f547e9020b83c31e36fd9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::gc_map::decode_v3 (cyclomatic 31): perry_codegen::gc_map::decode_v3 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/perry-codegen/src/gc_map.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"61387e04a08535e920e96cd0d6e4afa98414bf4d364657dc28410ab753213b09"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::func_ref::guarded_path_type (cyclomatic 31): perry_codegen::lower_call::func_ref::guarded_path_type has cyclomatic complexity 31 (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/perry-codegen/src/lower_call/func_ref.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48fa9287e0fea708822bdfd167830ad2f7576c18cee20fff8e507b24503dfaf"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::root_reload::raw_facts (cyclomatic 31): perry_codegen::root_reload::raw_facts 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/perry-codegen/src/root_reload.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06dc778deb072508212c6bfca27b830ce1aac021968ff6983b14f4df1242b90"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::masked_window_region::lower_region_copy (cyclomatic 31): perry_codegen::stmt::masked_window_region::lower_region_copy 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/perry-codegen/src/stmt/masked_window_region.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86cd236c4ab260e93b4f5ee5463a208e97868913f089e776db9841bb1b324fc"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::destructuring::helpers::ast_expr_contains_function_expr (cyclomatic 31): perry_hir::destructuring::helpers::ast_expr_contains_function_expr has cyclomatic complexity 31 (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/perry-hir/src/destructuring/helpers.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f776c366f874e5980ca1ba1e5c4b7212871c89e7d04c7e0155c523f06388805"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::dynamic_import::visitors::visit_stmt_for_dyn_imports (cyclomatic 31): perry_hir::dynamic_import::visitors::visit_stmt_for_dyn_imports has cyclomatic complexity 31 (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. This shape REPEATS in the file: 3 other methods here (perry_hir::dynamic_import::visitors::visit_stmt_for_dyn_imports_ref, perry_hir::dynamic_import::visitors::visit_stmt_for_worker_new, perry_hir::dynamic_import::visitors::visit_stmt_for_worker_new_ref) 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/perry-hir/src/dynamic_import/visitors.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63c0f20259892277bf149ecc53d00405e32388da324e1e03b661f2c01c6f39e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::dynamic_import::visitors::visit_stmt_for_dyn_imports_ref (cyclomatic 31): perry_hir::dynamic_import::visitors::visit_stmt_for_dyn_imports_ref has cyclomatic complexity 31 (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. This shape REPEATS in the file: 3 other methods here (perry_hir::dynamic_import::visitors::visit_stmt_for_dyn_imports, perry_hir::dynamic_import::visitors::visit_stmt_for_worker_new, perry_hir::dynamic_import::visitors::visit_stmt_for_worker_new_ref) 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/perry-hir/src/dynamic_import/visitors.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1c28fc9b7cecbf908cfd85aa5058622fdf59ae29b242bc4cce4230dd43bac7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::dynamic_import::visitors::visit_stmt_for_worker_new (cyclomatic 31): perry_hir::dynamic_import::visitors::visit_stmt_for_worker_new has cyclomatic complexity 31 (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. This shape REPEATS in the file: 3 other methods here (perry_hir::dynamic_import::visitors::visit_stmt_for_dyn_imports, perry_hir::dynamic_import::visitors::visit_stmt_for_dyn_imports_ref, perry_hir::dynamic_import::visitors::visit_stmt_for_worker_new_ref) 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/perry-hir/src/dynamic_import/visitors.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8a3f3d26a2976d0e13110673f7b59323f355edff1c0997da01eced15e62330"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::dynamic_import::visitors::visit_stmt_for_worker_new_ref (cyclomatic 31): perry_hir::dynamic_import::visitors::visit_stmt_for_worker_new_ref has cyclomatic complexity 31 (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. This shape REPEATS in the file: 3 other methods here (perry_hir::dynamic_import::visitors::visit_stmt_for_dyn_imports, perry_hir::dynamic_import::visitors::visit_stmt_for_dyn_imports_ref, perry_hir::dynamic_import::visitors::visit_stmt_for_worker_new) 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/perry-hir/src/dynamic_import/visitors.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b26cad7b795fa7fdb03ec5dc293be11b5d17860abed4c2d997221c4126c9ee6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_patterns::collect_implicit_assignment_expr_names (cyclomatic 31): perry_hir::lower_patterns::collect_implicit_assignment_expr_names has cyclomatic complexity 31 (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/perry-hir/src/lower_patterns.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a236e6e87d22d4914d90912d40e7952cc57bd1c28dcc1d823a89a6a6c54fbd"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_perex::tooling::dialect::translate (cyclomatic 31): perry_perex::tooling::dialect::translate 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/perry-perex/src/tooling/dialect.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b820c0ff619f886ad30609ad4fac9df515dc5ade179a580dd0e9ec15e1750173"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::subclass_loop_guard::packed_arraylike_loop_guard (cyclomatic 31): perry_runtime::array::subclass_loop_guard::packed_arraylike_loop_guard 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/perry-runtime/src/array/subclass_loop_guard.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"950a7db53135c2d968fb37b39585de0e5bb7607dca42170ef802e567006b8e47"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json::replacer::stringify_object_with_replacer_pretty (cyclomatic 31): perry_runtime::json::replacer::stringify_object_with_replacer_pretty 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/perry-runtime/src/json/replacer.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"df60faf0c321d0ee41b92c218265e5d5a3d1758dac29da55be011e91c0673f5f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_get_set::has_property::ordinary_has_property (cyclomatic 31): perry_runtime::object::field_get_set::has_property::ordinary_has_property 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/perry-runtime/src/object/field_get_set/has_property.rs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fefae2a052b93bacf1563cb4a58e5783be8b6875549719933e9ae6bda28bf2"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::regex::perex_replace_direct::replace (cyclomatic 31): perry_runtime::regex::perex_replace_direct::replace 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/perry-runtime/src/regex/perex_replace_direct.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81bf251f5e156e513de0dcfa6d2e2ab0945b70d28ff20cdca24672513ac82ee"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::tls::event_pump::js_tls_process_pending (cyclomatic 31): perry_stdlib::tls::event_pump::js_tls_process_pending 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/perry-stdlib/src/tls/event_pump.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a016579eb4012087cada3ca1be2ca17e3c7d90b8ac4c51fd87af71283ddfadaa"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::async_to_generator::hoist_awaits_in_stmt (cyclomatic 31): perry_transform::async_to_generator::hoist_awaits_in_stmt 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/perry-transform/src/async_to_generator.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c2685d21a01f0eaaf06a51985ee15ce9d80a412879026fc6fd369174758f22"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::finally_inline::process_stmts (cyclomatic 31): perry_transform::finally_inline::process_stmts 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/perry-transform/src/finally_inline.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e36b2483ffafbc6a7cf9b81a03288b26dd04b25ab25bace04373dda72035e1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::call_inliner::try_inline_call (cyclomatic 31): perry_transform::inline::call_inliner::try_inline_call 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/perry-transform/src/inline/call_inliner.rs"},"region":{"startLine":2051}}}],"partialFingerprints":{"codehealthFindingId/v1":"0626021bbc021f3064850b736a817cc61d72af6806552ce9a7ae90ad82d7d481"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::dump_meta (cyclomatic 31): Model::dump_meta has cyclomatic complexity 31 (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/perry-wpfacts/src/model/operations.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"1317117c62836bf5eb3bc3952296c58ea7656f02c13f8490897ae165dab7f85d"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::publish_class (cyclomatic 31): Model::publish_class 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/perry-wpfacts/src/solve/call_and_construct.rs"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"977a7dfeba5f77c4f3b1ced9ea42b2bef1b74d3d95bcd420813880925173d83b"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_repsel_matrix_merge.merge (cyclomatic 31): gc_repsel_matrix_merge.merge 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":"scripts/gc_repsel_matrix_merge.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05d11ad67390fd6d062fded983e8f8b30dc37f9b727eabd4f0b5d7645092ef0"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_root_dominance_check.check_func_statepoints (cyclomatic 31): gc_root_dominance_check.check_func_statepoints 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":5075}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafaa13959dfa80c5d50554d5ec57bfc73785dbf43c0b2446bfc52af399d7987"}},{"ruleId":"D1","level":"warning","message":{"text":"sso_unbox_inventory.apply_reviews (cyclomatic 31): sso_unbox_inventory.apply_reviews 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":"scripts/sso_unbox_inventory.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb2587f43fd65eda667f0dcbaf79a0379b4d9fe4a838b57423be8f4352d1539"}},{"ruleId":"D1","level":"warning","message":{"text":"wpfacts_oracle.main (cyclomatic 31): wpfacts_oracle.main has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wpfacts_oracle.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"87474cda4b141e9096c6cf221aff755947c278cdfcf7dc17da1b386d5fd24886"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::build_cache::eligibility (cyclomatic 30): perry::commands::compile::build_cache::eligibility 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/perry/src/commands/compile/build_cache.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c91c58c1df16cc7dc3f585da9c8575d56042965ae32b045db05ea025095452"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::init_order::classify_eager_modules (cyclomatic 30): perry::commands::compile::init_order::classify_eager_modules 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/perry/src/commands/compile/init_order.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a38e74dbfbcd3aeaf2730b3dde986db4992a9f353bf15a1fc622c09121e6489"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::optimized_libs::driver::build_optimized_libs (cyclomatic 30): perry::commands::compile::optimized_libs::driver::build_optimized_libs 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/perry/src/commands/compile/optimized_libs/driver.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5228b9db01c6cf9cd0bc4341f05b89a8feedec6af9c39148661903885ae7dad4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::program_facts::elision_for (cyclomatic 30): perry::commands::compile::program_facts::elision_for 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/perry/src/commands/compile/program_facts.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58012c0fdee92b23ba44b93406068e64a2664f21214b680da8b6efadd35d1f1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::sync_program::why_module_not_synchronous (cyclomatic 30): perry::commands::compile::sync_program::why_module_not_synchronous 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/perry/src/commands/compile/sync_program.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"083cd9587c51c47041723d65a74c04c5b13154e70dbc266be25e587e96685a8f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::setup::macos::macos_wizard (cyclomatic 30): perry::commands::setup::macos::macos_wizard 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/perry/src/commands/setup/macos.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0fa9fc3d2bf9b506844b236231f549ee72124fe849d64e7770066a7e6be509"}},{"ruleId":"D1","level":"warning","message":{"text":"Scan::walk_expr (cyclomatic 30): Scan::walk_expr 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/perry-codegen/src/collectors/sealed_buffers.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"452708f83f0813ccdcb20d72f4267cc6ec9ff02448c0cf50f6ec730c8800eae3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::closure_collect::scan_capture_use_stmt (cyclomatic 30): perry_codegen::codegen::closure_collect::scan_capture_use_stmt has cyclomatic complexity 30 (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/perry-codegen/src/codegen/closure_collect.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7bffa7ab8ea26d6eff84fc701a4c0d68f38cb4be6202ace15367731be0b2760"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::entry::module_init::compile_module_init (cyclomatic 30): perry_codegen::codegen::entry::module_init::compile_module_init 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/perry-codegen/src/codegen/entry/module_init.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7566d83893acf0dd6dc917f076c2086e07ebddd2347fdd03b96b03179837dfc"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::hot_callees::walk_expr (cyclomatic 30): perry_codegen::collectors::hot_callees::walk_expr 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/perry-codegen/src/collectors/hot_callees.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3cfd70d3acf2b9da33fb8663774c38ddca28e548ce978f1fd8c21d47a2b0b8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::int_valued_ta_locals::collect_closure_refs_stmt (cyclomatic 30): perry_codegen::collectors::int_valued_ta_locals::collect_closure_refs_stmt has cyclomatic complexity 30 (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/perry-codegen/src/collectors/int_valued_ta_locals.rs"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d885aedfbc66fc3743e0290af3db2136f80d4ec4ccbb67541821a6ed61c755"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::scalar_method_dispatch::collect_module_dispatch_facts (cyclomatic 30): perry_codegen::collectors::scalar_method_dispatch::collect_module_dispatch_facts 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/perry-codegen/src/collectors/scalar_method_dispatch.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d24d7fb5ae9d9652d4b7f4771b616f3cc533ea7a2c861f2d2e9cc23adc17f6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::i32_fast_path::try_lower_expr_native_i32_structural (cyclomatic 30): perry_codegen::expr::i32_fast_path::try_lower_expr_native_i32_structural 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/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03f32d0d5cfb1ae65e9d39156d2dc6ade4a3caf57fc325661ab294d553fcb93"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::inline_birth_invariant::check (cyclomatic 30): perry_codegen::lower_call::inline_birth_invariant::check 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/perry-codegen/src/lower_call/inline_birth_invariant.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e317460787e0420c1e1b467cd962e88b57fa8710c6ad99a678ea2aac6eed34b2"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::stable_packed_accumulator::collect_local_writes::walk_stmt (cyclomatic 30): perry_codegen::stmt::stable_packed_accumulator::collect_local_writes::walk_stmt has cyclomatic complexity 30 (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/perry-codegen/src/stmt/stable_packed_accumulator.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c5b3dcda6f2528d97ed28197544a1abb1552342b9dcc8b94ef6facaa68a0a4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::stable_packed_loop::match_candidate (cyclomatic 30): perry_codegen::stmt::stable_packed_loop::match_candidate 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/perry-codegen/src/stmt/stable_packed_loop.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ea8f2c81869c6e064ad6353ed15d5fc9706de92bdeb57b12eb28b3c8ce8871"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::type_analysis::predicates::is_promise_expr (cyclomatic 30): perry_codegen::type_analysis::predicates::is_promise_expr 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/perry-codegen/src/type_analysis/predicates.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f1b852d24909ead4621bb11a79e6b005f3195368f1e814c860a496c29a24c0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_swiftui::emit::emit_modifiers (cyclomatic 30): perry_codegen_swiftui::emit::emit_modifiers 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/perry-codegen-swiftui/src/emit.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5ef29430bec92bd86a87b4dd142f27411de91e7c31c55d8207ff2853e91a72"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_net::tls::js_tls_connect (cyclomatic 30): perry_ext_net::tls::js_tls_connect 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/perry-ext-net/src/tls.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd50abedcb42ad6429cc78da4b67d475f145f1e0899088b0bfb6cd1a4e14ca6"}},{"ruleId":"D1","level":"warning","message":{"text":"SolidJsx::native_parts (cyclomatic 30): SolidJsx::native_parts 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/perry-hir/src/solid_jsx/native.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8f0b02b04aa1469c411dae2bbb5d833b5ec8489e90599f5be08f10a2072dfc"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::audit::visit_stmt (cyclomatic 30): perry_hir::audit::visit_stmt 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. This is NOT this file\u0027s highest cyclomatic complexity: perry_hir::audit::specialized_stdlib_call (cyclomatic 61) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/audit.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e736448798bda38be7991f38e02b9e0212e9e459cd86e5f7f4da564173f3aab"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::capability::visit_stmt (cyclomatic 30): perry_hir::capability::visit_stmt 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/perry-hir/src/capability.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e6efa1fa1ff1912c743ad72a847c0d3d5d484931a125015d47927ba78f3c52"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::dynamic_import::resolve_import_path_with_context (cyclomatic 30): perry_hir::dynamic_import::resolve_import_path_with_context 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/perry-hir/src/dynamic_import.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f263de0aa460d81cafaa719c721f815ae2330f7877a0649dd41c98532afd2cc"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::egress::visit_stmt (cyclomatic 30): perry_hir::egress::visit_stmt 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/perry-hir/src/egress.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa684d7fc6aa43142d558782063865e0103f2fe1d4085abb4fdc9291ad7ed8c9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lockdown::visit_stmt (cyclomatic 30): perry_hir::lockdown::visit_stmt 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/perry-hir/src/lockdown.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"2795b74679fff6ac3c57f558de544d8a28a4a1cf856e3490a53bf377f095aed8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::imported_array_methods::try_imported_array_methods (cyclomatic 30): perry_hir::lower::expr_call::imported_array_methods::try_imported_array_methods 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/perry-hir/src/lower/expr_call/imported_array_methods.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9b6bf5d43c142b90ced5aa71a3d0f87a4803fb65747d16938525fc7c43be6a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::global_eval_hoist::rename_ident_in_expr (cyclomatic 30): perry_hir::lower::global_eval_hoist::rename_ident_in_expr 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/perry-hir/src/lower/global_eval_hoist.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e3b083984cd686155f42e79915db71d6878f630db462dea394c68e4a31c55e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::body_stmt::nested_fn_decl::lower_nested_fn_decl (cyclomatic 30): perry_hir::lower_decl::body_stmt::nested_fn_decl::lower_nested_fn_decl 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/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3125510f4ae59e87465b029476427d47641eb468d2ae19629ff3fdfff68971fe"}},{"ruleId":"D1","level":"warning","message":{"text":"Serializer::write_heap_value (cyclomatic 30): Serializer::write_heap_value 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/perry-runtime/src/child_process/v8_serde.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dfde5d69085bb300c074a34732148d137958156846cc959a6ea50a384f4ae81"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::map::find_key_index_cold (cyclomatic 30): perry_runtime::map::find_key_index_cold 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/perry-runtime/src/map.rs"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d90bc549062f508cc82ff6a5a8ab1c057ac81c86d06b32eff7d98fe04b97940"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::bigint_dispatch::dispatch_bigint_binary_method (cyclomatic 30): perry_runtime::object::bigint_dispatch::dispatch_bigint_binary_method 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/perry-runtime/src/object/bigint_dispatch.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8193fd757325213ca58a4fd8ceee059d1ac9928a0a617b34146ad27d397efdc7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::class_registry::construct::js_new_function_construct_with_new_target (cyclomatic 30): perry_runtime::object::class_registry::construct::js_new_function_construct_with_new_target 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/perry-runtime/src/object/class_registry/construct.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95ea4224e851d7a76778d45c23e429f2b66e786e6facd7794f9d2581f778d37"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::pty::reactor::pty_reactor_pump_inner (cyclomatic 30): perry_runtime::pty::reactor::pty_reactor_pump_inner 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/perry-runtime/src/pty/reactor.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"4483550ed7503a3a5462c4a9ebb8be46509a25e7bc2ad1b34d5e7985a0250770"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::validators::received::received_native_fallback (cyclomatic 30): perry_runtime::validators::received::received_native_fallback 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/perry-runtime/src/validators/received.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d319937d188b2cd4474ba8daa2c3e1ff4925f71eb9b1d922d0ebd08d66a5d26"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::webassembly::call_wasm_import (cyclomatic 30): perry_runtime::webassembly::call_wasm_import 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/perry-runtime/src/webassembly.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"86401e051818ef056e7e296e2733254b2ce8d921ed1eeb63b085df3839fed27d"}},{"ruleId":"D1","level":"warning","message":{"text":"Emitter::lift (cyclomatic 30): Emitter::lift 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/perry-wit/src/guest_c/values.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"487460ff89aad70f9bfa1d9f341436957f2777b55943365e1c1588811954dfa5"}},{"ruleId":"D1","level":"warning","message":{"text":"capture.capture (cyclomatic 30): capture.capture 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":"scripts/compiler_output_harness/capture.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c43f37f3318a3a640f41b0f97c24861680cb5c52c1f850874596853c270471"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_1090_evidence_report.gate_copied_minor (cyclomatic 30): gc_1090_evidence_report.gate_copied_minor 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":"scripts/gc_1090_evidence_report.py"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03f7e02dcb9a24d97449c7d2137232b3504f63c3249bccd09691f635a7acf1f"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_1090_evidence_report.render_markdown (cyclomatic 30): gc_1090_evidence_report.render_markdown 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":"scripts/gc_1090_evidence_report.py"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"f690b01dc5b8dc44d17f13e8c227249c42c765f708f6b183830bcf0bd1e78b9f"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_root_dominance_check.check_func_stale (cyclomatic 30): gc_root_dominance_check.check_func_stale 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":3165}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8cf51c00e98d002fcaadf722ea3e4f2b3ba901929d774e9021382e30b4ef4c"}},{"ruleId":"D1","level":"warning","message":{"text":"realm_manifest_coverage.cell_names (cyclomatic 30): realm_manifest_coverage.cell_names 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":"scripts/realm_manifest_coverage.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2bd4664fca813304f5c60a959e3aaeb6745435dad4fcd6900984905b1d10a94"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::hoist_classes::collect_top_level_function_decls (cyclomatic 29): perry::commands::compile::cjs_wrap::hoist_classes::collect_top_level_function_decls has cyclomatic complexity 29 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 2 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":"crates/perry/src/commands/compile/cjs_wrap/hoist_classes.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d41abade88dd5e0ccf2b95b8905b4b96b8b120a875cae347c171fe6a0a317f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::hoist_classes::source_has_top_level_return (cyclomatic 29): perry::commands::compile::cjs_wrap::hoist_classes::source_has_top_level_return has cyclomatic complexity 29 (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/perry/src/commands/compile/cjs_wrap/hoist_classes.rs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da9eb858286cc1a5625837f2a304952ff6f1f1822a5901e710de90d9cff1d51"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::run::android::wire_native_lib_kotlin_sources (cyclomatic 29): perry::commands::run::android::wire_native_lib_kotlin_sources 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/perry/src/commands/run/android.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c976547a6c265ec27b99180f29a6c6b56f1739cc9123f926f23dd4731858d3a"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeAbiType::parse_str (cyclomatic 29): NativeAbiType::parse_str 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/perry-api-manifest/src/native_abi.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"82dea7b5f593704a20dbd61a4b6475cfd8e4d9768a439fbbe441b3dd7bfa3fe6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::class_declarations::class_declaration_globals (cyclomatic 29): perry_codegen::codegen::class_declarations::class_declaration_globals 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/perry-codegen/src/codegen/class_declarations.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ffd3fffab3fa73d69445fee0a92db11ea05649f6548989ca727e0fb1d810b8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::int_valued_ta_locals::observe_stmts (cyclomatic 29): perry_codegen::collectors::int_valued_ta_locals::observe_stmts 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/perry-codegen/src/collectors/int_valued_ta_locals.rs"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ccba9e15cfaa54846c3a11a159f75748d2545327afa47eb799d65b0a4f4a75"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::slot_rep::collect_canonical_str_ineligible_locals (cyclomatic 29): perry_codegen::expr::slot_rep::collect_canonical_str_ineligible_locals 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. This shape REPEATS in the file: one other method here (perry_codegen::expr::slot_rep::collect_canonical_str_ineligible_locals::scan_declared) 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/perry-codegen/src/expr/slot_rep.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e0eb4eb57458d83c279062dc29b2c8c1407277224a26a0da968ee3ee8c2972"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::layout_families::late::add_variants (cyclomatic 29): perry_codegen::layout_families::late::add_variants 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/perry-codegen/src/layout_families/late.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"8234a6f890ba7675604e980781a477733f488c4f987574766a506933ed684f9e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::buffer_intrinsic::module_shadows_buffer_read_method::stmt_shadows (cyclomatic 29): perry_codegen::lower_call::buffer_intrinsic::module_shadows_buffer_read_method::stmt_shadows has cyclomatic complexity 29 (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/perry-codegen/src/lower_call/buffer_intrinsic.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83a31914a3e7d25d7cb13b1097febba8e0991ccd7f551583d9f89b6b572b2e2"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::closure_analysis::find_outer_writes_stmt (cyclomatic 29): perry_codegen::lower_call::closure_analysis::find_outer_writes_stmt has cyclomatic complexity 29 (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/perry-codegen/src/lower_call/closure_analysis.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec42eef41640d238032f84abf143154a70dc313d0e89f0e83eb7906423248ccf"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::opt_report::render::render_text_with_sources (cyclomatic 29): perry_codegen::opt_report::render::render_text_with_sources 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/perry-codegen/src/opt_report/render.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c469c37d222e8f3eb04110c6eb04c2913030b28bb5f399a4e842f14f3b163e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::root_reload::facts_of (cyclomatic 29): perry_codegen::root_reload::facts_of 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/perry-codegen/src/root_reload.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad9381b00be9d29834bbb2fef30243982a88da5fc1467f38cd286e5a2592c5f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::let_scalar_new::try_lower_scalar_replaced_new (cyclomatic 29): perry_codegen::stmt::let_scalar_new::try_lower_scalar_replaced_new 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/perry-codegen/src/stmt/let_scalar_new.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d6db18b65d8801d77d2b90189963255632b83a8bc16287d8d88bb41eed544d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::number_local_loop::lower (cyclomatic 29): perry_codegen::stmt::number_local_loop::lower 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/perry-codegen/src/stmt/number_local_loop.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"490a9c38bc59efb7c529c70e35156f987ceb7ee619459c0762cd5f53b3b0f55b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::testing::temp_slots::slot_traffic (cyclomatic 29): perry_codegen::testing::temp_slots::slot_traffic 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/perry-codegen/src/testing/temp_slots.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3671ba209648a85d8eb4130ca0ad78154e88c181ae34c3d9bc8140b4c9da131"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::type_analysis::predicates::receiver_class_name (cyclomatic 29): perry_codegen::type_analysis::predicates::receiver_class_name 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/perry-codegen/src/type_analysis/predicates.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"1076950ddad6cb66deaf5a1c3859fc07106886f7695560807cf9eb548b52dec5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::type_analysis::strings::is_string_expr (cyclomatic 29): perry_codegen::type_analysis::strings::is_string_expr 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/perry-codegen/src/type_analysis/strings.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a2f2b92e55485d0147e4022a2a63acf6a14bc4b9f9504b69a5ec93e08a0cad"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::type_analysis_class_fields::class_field_global_index (cyclomatic 29): perry_codegen::type_analysis_class_fields::class_field_global_index 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 3 function items inside it that branch (walk, accessor_in_chain, count_keyable). 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/perry-codegen/src/type_analysis_class_fields.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb9fd76f69bb164ee35063884a1203df1218efacca7195273585ede20532278"}},{"ruleId":"D1","level":"warning","message":{"text":"Prepared::new (cyclomatic 29): Prepared::new 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/perry-component-host/src/async_values/compose.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2d8f354c3bb1c91bffd902f3269c9fe59ed96b13ba98899b3f0eb4417ad111"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_container_compose::capabilities::required_features (cyclomatic 29): perry_container_compose::capabilities::required_features 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/perry-container-compose/src/capabilities.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"729d6d2257f66aca7583a8d8947366c54b8be14b113d16c5b6c07e4dc280fbcb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_net::payload_tls::drive (cyclomatic 29): perry_ext_net::payload_tls::drive 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/perry-ext-net/src/payload_tls.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6770d214163e5006b8c2ba24b3a41e118271629a6a3aab616c6faa25e191382"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_zlib::stream::one_shot_callback::run (cyclomatic 29): perry_ext_zlib::stream::one_shot_callback::run 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/perry-ext-zlib/src/stream/one_shot_callback.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7a06f196d15dc02919314c30cc49ee14efd928612d9c6d22933d635da231c7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_gc_effects::instructions::analyze_node (cyclomatic 29): perry_gc_effects::instructions::analyze_node 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/perry-gc-effects/src/instructions.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"525719684da3acf3ebed3049bfc3d442f3dfbbf55f2d8c7d6f99f0b63962232d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::destructuring::assignment_expr::lower_destructuring_assignment (cyclomatic 29): perry_hir::destructuring::assignment_expr::lower_destructuring_assignment has cyclomatic complexity 29 (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/perry-hir/src/destructuring/assignment_expr.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c409c25049e3939a57a86b77a0bba9bc0fa0c82bdeb31779692f6699c6517e48"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::js_transform::local_natives::fix_class_field_stmt (cyclomatic 29): perry_hir::js_transform::local_natives::fix_class_field_stmt has cyclomatic complexity 29 (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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"71633c124a2469592b87bc46a287333b064fdd40de1805c9d45fbe45ae95f670"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::inline_array_methods::try_inline_array_methods (cyclomatic 29): perry_hir::lower::expr_call::inline_array_methods::try_inline_array_methods 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/perry-hir/src/lower/expr_call/inline_array_methods.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7d4c8acd922748467a27f4a13d1c22a05892099443ebb4540556ad790af726"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::native_module::reflect_statics::try_reflect_statics (cyclomatic 29): perry_hir::lower::expr_call::native_module::reflect_statics::try_reflect_statics 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/perry-hir/src/lower/expr_call/native_module/reflect_statics.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a92462453a13a9ec39a593590ebec3902976a2a489afddc7eecee3c90ef725b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::fn_ctor_env::collect_fn_scope_names (cyclomatic 29): perry_hir::lower::fn_ctor_env::collect_fn_scope_names has cyclomatic complexity 29 (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/perry-hir/src/lower/fn_ctor_env.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0ded14e16c11a1aff3a5dfae9961c92421553f1d771b59a8cc85e0ca3c24a8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::arena::reset::arena_reset_empty_blocks (cyclomatic 29): perry_runtime::arena::reset::arena_reset_empty_blocks 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/perry-runtime/src/arena/reset.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e9b6e70563bd3191990e475d33e484cff809bcc3b7517e22a782a5d5f61202"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::indexing::js_array_length (cyclomatic 29): perry_runtime::array::indexing::js_array_length 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/perry-runtime/src/array/indexing.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a47376a6459c721659c60e0363bb12dd0122a1f6ea8e4a3645c93f7081c1608"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::bun_compat::cli_utils::yaml_add_js_value (cyclomatic 29): perry_runtime::bun_compat::cli_utils::yaml_add_js_value 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/perry-runtime/src/bun_compat/cli_utils.rs"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8956c5676cd8d02ff2a075f96a84949d0240fc5f684c627cb84f328fed4f679"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::dyn_eval::expr::eval_call (cyclomatic 29): perry_runtime::dyn_eval::expr::eval_call 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/perry-runtime/src/dyn_eval/expr.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28ecbfd9ec814622d14ff69ecdfb4366d073adbbc8a0053f61d66383d865268"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::eh_walker_trace::run_cfi (cyclomatic 29): perry_runtime::eh_walker_trace::run_cfi 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/perry-runtime/src/eh_walker_trace.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f34616cf32ee4e4487f4daf34c82d90e2ab23acf86a0fc45e78f18a83f2819a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::gc::trace::mark_slots::trace_heap_rewrite_slots_impl (cyclomatic 29): perry_runtime::gc::trace::mark_slots::trace_heap_rewrite_slots_impl 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/perry-runtime/src/gc/trace/mark_slots.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee8f5d225dd94baff45b6a5beb1294315e8b63acf2a70882ee453211ea59bde"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_get_set::has_property::shape_presence::own_position (cyclomatic 29): perry_runtime::object::field_get_set::has_property::shape_presence::own_position 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/perry-runtime/src/object/field_get_set/has_property/shape_presence.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e9fbf53c9efdcf4e78f1424493422c1736dc71c3319eb4cb3fa8c40b11806a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_call_method::collection_methods::dispatch_raw_pointer (cyclomatic 29): perry_runtime::object::native_call_method::collection_methods::dispatch_raw_pointer 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/perry-runtime/src/object/native_call_method/collection_methods.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"787f509b50ececa496c05e72a91a71157c4a8285d3c65e24024233232c665206"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_module::class_method_bind::js_class_method_bind (cyclomatic 29): perry_runtime::object::native_module::class_method_bind::js_class_method_bind 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/perry-runtime/src/object/native_module/class_method_bind.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3600ac0e0db66d89348a43646a0b6a8948a6eceb6e2eabdd4cc14f04dd9a4a72"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::polymorphic_index::js_object_set_index_polymorphic (cyclomatic 29): perry_runtime::object::polymorphic_index::js_object_set_index_polymorphic 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/perry-runtime/src/object/polymorphic_index.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5c2d95b4e55a1492a53784e5b4fbd28700e0fb7b077295d26bfb5a8d57a44f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::shapes::scan_shape_table_keys_mut (cyclomatic 29): perry_runtime::object::shapes::scan_shape_table_keys_mut 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/perry-runtime/src/object/shapes.rs"},"region":{"startLine":6009}}}],"partialFingerprints":{"codehealthFindingId/v1":"72eb15e01347dab236766e2b70ef5caf00ba8d65b4f58ee76af033873f89e7ef"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::symbol::properties::set_symbol_property (cyclomatic 29): perry_runtime::symbol::properties::set_symbol_property 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/perry-runtime/src/symbol/properties.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf17a3a76ed296bbd145df03b0b571b5e181f365c02476298194f9e7d7200cc4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::value::dynamic_object::js_value_length_f64 (cyclomatic 29): perry_runtime::value::dynamic_object::js_value_length_f64 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/perry-runtime/src/value/dynamic_object.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6e5c98b3f3cb6369c068793f923b975f87210ce1f4edd11c1a6ff3b306b418"}},{"ruleId":"D1","level":"warning","message":{"text":"OutUsageAnalyzer::visit_stmt (cyclomatic 29): OutUsageAnalyzer::visit_stmt has cyclomatic complexity 29 (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/perry-transform/src/deforest/out_usage.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6b5c23e82c2833e2ebf34a29368fd97ea61f2d44bb7155ee1bc0899d209546"}},{"ruleId":"D1","level":"warning","message":{"text":"StmtRefWalker::visit_stmt (cyclomatic 29): StmtRefWalker::visit_stmt has cyclomatic complexity 29 (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/perry-transform/src/deforest/walk.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a1f7ab0db9b24cc340e0b4ea7607a5ee83af24cc612c1f0fae45f2e88955c3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::generator::break_continue::body_contains_yield (cyclomatic 29): perry_transform::generator::break_continue::body_contains_yield 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/perry-transform/src/generator/break_continue.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63282048aa464ee8d2f3c09aca75f73b96b07dacc6382bb567873b41ce0aae9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::generator::private_frame::lower_list (cyclomatic 29): perry_transform::generator::private_frame::lower_list 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. This shape REPEATS in the file: one other method here (perry_transform::generator::private_frame::lower_list::ids) 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/perry-transform/src/generator/private_frame.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cef810201902b7eef4ecc4369e51c5c596fcc34cb22b9b6e1d862e7976ebd90"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::local_copies::clean_function (cyclomatic 29): perry_transform::local_copies::clean_function has cyclomatic complexity 29 (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/perry-transform/src/local_copies.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"4479d6f8c9513f90dfb2b441866d02c960581eb312d7aa5ef92a3426128429a6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::unroll::substitute_localget_with_int_in_stmt (cyclomatic 29): perry_transform::unroll::substitute_localget_with_int_in_stmt has cyclomatic complexity 29 (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/perry-transform/src/unroll/mod.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"440093985c82b97f9269e3cbbe108fd7b279268e237131198a9f15480af23ad3"}},{"ruleId":"D1","level":"warning","message":{"text":"W::stmt (cyclomatic 29): W::stmt has cyclomatic complexity 29 (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/perry-wpfacts/src/ctor_phase.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"309f63afe7a71b88a934cfab07cd4b1c7b0df5a3458b3884a74425990c2a3db1"}},{"ruleId":"D1","level":"warning","message":{"text":"Gen::stmt_inner (cyclomatic 29): Gen::stmt_inner 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/perry-wpfacts/src/gen/walk.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edced832a293d49abde6e15cb3fc93a4ef76a0ead43f7a99896310298c0169f"}},{"ruleId":"D1","level":"warning","message":{"text":"check_thread_locals.self_test (cyclomatic 29): check_thread_locals.self_test 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":"scripts/check_thread_locals.py"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"4205d2469188e3b5d31129ffd3b6b3cf2df56715231cddf2172ad2af7108a7a1"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_root_dominance_check._array_element_loads (cyclomatic 29): gc_root_dominance_check._array_element_loads 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":3607}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f46ce8d50f2b1aeaadd0c736bee339514636de46ecba0c0ffb760921ebb258"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime_abi_check.self_test (cyclomatic 29): runtime_abi_check.self_test 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":"scripts/runtime_abi_check.py"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89ee06b3885e60351d665056b9421f72d13ad725a7b03224de9d7db3c2e6bf7"}},{"ruleId":"D1","level":"warning","message":{"text":"Build::stmt (cyclomatic 28): Build::stmt 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. This is NOT this file\u0027s highest cyclomatic complexity: Reason::name (cyclomatic 33) 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/perry-codegen/src/codegen/source_need/flow.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"4856f61da2cb37b01a33a3e4cdee2e664f454d5881aab6269906430663438646"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::array_record_stack::lower (cyclomatic 28): perry_codegen::array_record_stack::lower 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/perry-codegen/src/array_record_stack.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"812e5228b3adec1dc09f30de0c2d7cd23404e56aa768b57c8f241179e4aeaf78"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::entry_outline::max_func_id (cyclomatic 28): perry_codegen::codegen::entry_outline::max_func_id has cyclomatic complexity 28 (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/perry-codegen/src/codegen/entry_outline.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"1213481006d3d53bd59ec3ac71f493fd690b1ebaff13eae5ef0423ee8384a743"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::hoisted_callback_calls::collect_loop_called_callee_bindings::scan_stmt (cyclomatic 28): perry_codegen::collectors::hoisted_callback_calls::collect_loop_called_callee_bindings::scan_stmt has cyclomatic complexity 28 (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/perry-codegen/src/collectors/hoisted_callback_calls.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"3699c0acfd1669bf228f13825b4125422a9c813a5ff971fc848dc473c974aebc"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::receiver_regions::enders_in_stmt (cyclomatic 28): perry_codegen::collectors::receiver_regions::enders_in_stmt has cyclomatic complexity 28 (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/perry-codegen/src/collectors/receiver_regions.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca00c6b0fb874960c824d142970a45d8487d881f762d8f826c8be212f746b5ce"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::array_push::lower_inner (cyclomatic 28): perry_codegen::expr::array_push::lower_inner 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/perry-codegen/src/expr/array_push.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"9645533eb0929936aa64d575a0a2742d12c2e1e1a586e17770d137442d2fbc67"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::property_get::helpers::lower_raw_f64_class_field_get_for_number_context (cyclomatic 28): perry_codegen::expr::property_get::helpers::lower_raw_f64_class_field_get_for_number_context 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/perry-codegen/src/expr/property_get/helpers.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a287424195332c30e19ccf05c74924db8407c1c4c94abb5c3f7c82138aa97b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::layout_families::compute (cyclomatic 28): perry_codegen::layout_families::compute 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/perry-codegen/src/layout_families.rs"},"region":{"startLine":1518}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8ba81a969c95de34922853c4e65a80307c74eaca17433d7adf78dc7e984278"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_arkts::conditions::serialize_condition (cyclomatic 28): perry_codegen_arkts::conditions::serialize_condition has cyclomatic complexity 28 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. 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/perry-codegen-arkts/src/conditions.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05311d9c77d1bf37c5f09f99a2e323afd223d01ee28feefa36a70f4229e18e7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_component_host::driver::writers::execute (cyclomatic 28): perry_component_host::driver::writers::execute 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/perry-component-host/src/driver/writers.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f5531b7c95d1dd75ab451ffee3e22a3600f4e24fed94d62d80d45b572813c3"}},{"ruleId":"D1","level":"warning","message":{"text":"HirTypeEnv::from_module (cyclomatic 28): HirTypeEnv::from_module 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/perry-hir/src/analysis/value_types.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c67750f16c9d652b280169e21c69cc54b1ca46fa006dd1b4b6f7a1cd8c64da"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::analysis::fn_infer::for_each_stmt_expr (cyclomatic 28): perry_hir::analysis::fn_infer::for_each_stmt_expr has cyclomatic complexity 28 (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/perry-hir/src/analysis/fn_infer.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"035db796dde2e565848967866b74c19d7f96c017fd9eccb0c970fcd8d1015725"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::js_transform::cross_module_natives::scan_for_ident_init_propagation (cyclomatic 28): perry_hir::js_transform::cross_module_natives::scan_for_ident_init_propagation 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/perry-hir/src/js_transform/cross_module_natives.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bfd49d901e554d87e7166f5a9f0913e977157dc36192a187febfc9c249f1e2b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::builder_fold_width_hints::hint_walk_expr (cyclomatic 28): perry_hir::lower::builder_fold_width_hints::hint_walk_expr has cyclomatic complexity 28 (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/perry-hir/src/lower/builder_fold_width_hints.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7512bd6f758b1fd69b5b7aed4a8fe257bc6679af3a6a50bf248d7a21514940"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals::walk_stmt (cyclomatic 28): perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals::walk_stmt has cyclomatic complexity 28 (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. This shape REPEATS in the file: 2 other methods here (perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals, perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals::collect_shadowing_decls) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/perry-hir/src/lower/pre_scan/weakref_locals.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"7660ec54f646122009889138c970b10bef9da5258c7ca3327c694e349774b6d4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::block::lower_fn_body_block_stmt_inner (cyclomatic 28): perry_hir::lower_decl::block::lower_fn_body_block_stmt_inner 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/perry-hir/src/lower_decl/block.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c0655b0e57942fb51a0ccd9ec5149c813291e53684b2cd5a1b18de1e096d9c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::block::collect_refs_in_closure_bodies_stmt (cyclomatic 28): perry_hir::lower_decl::block::collect_refs_in_closure_bodies_stmt has cyclomatic complexity 28 (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/perry-hir/src/lower_decl/block.rs"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"74327110151244137b7ceca869d5639bdccca00dfb0a93c27e78cecde8e02d34"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::class_captures::append_new_args_stmt (cyclomatic 28): perry_hir::lower_decl::class_captures::append_new_args_stmt has cyclomatic complexity 28 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This shape REPEATS in the file: one other method here (perry_hir::lower_decl::class_captures::stamp_self_new_stmt) 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/perry-hir/src/lower_decl/class_captures.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc435e229c7423be64babbb845e81ea7d17fee0331200a5dfa122dd5c186417"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::class_captures::stamp_self_new_stmt (cyclomatic 28): perry_hir::lower_decl::class_captures::stamp_self_new_stmt has cyclomatic complexity 28 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This shape REPEATS in the file: one other method here (perry_hir::lower_decl::class_captures::append_new_args_stmt) 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/perry-hir/src/lower_decl/class_captures.rs"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"7971f0a708ea95383376647ea97c1d12a65733ceb8fab0a580a5a32a0a0f56d5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::monomorph::constraints::check_interface_satisfaction (cyclomatic 28): perry_hir::monomorph::constraints::check_interface_satisfaction 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/perry-hir/src/monomorph/constraints.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"5288fd3b7e08eb766430c474248f00e550a693d2f88f15636715395eb8e13042"}},{"ruleId":"D1","level":"warning","message":{"text":"Prop::get (cyclomatic 28): Prop::get 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/perry-runtime/src/node_stream/proto_methods.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c5d908102305313bc115cd770ae4895552b97351a9a1d301157bbbeafd39bf"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::splice_slice::js_array_splice (cyclomatic 28): perry_runtime::array::splice_slice::js_array_splice has cyclomatic complexity 28 (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/perry-runtime/src/array/splice_slice.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be7090c565504dbc0bf4bcb675810d56e7e8fd461ec7544c8f7b30108169c00"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::bun_compat::string_width::is_zero_width (cyclomatic 28): perry_runtime::bun_compat::string_width::is_zero_width has cyclomatic complexity 28 (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/perry-runtime/src/bun_compat/string_width.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"befcbd5cc60b21857b7782c96c58fddd324ace6d08c9f1a4530fedad87f51959"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::geisterhand_registry::perry_geisterhand_pump (cyclomatic 28): perry_runtime::geisterhand_registry::perry_geisterhand_pump 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/perry-runtime/src/geisterhand_registry.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2566b2a06a557d5399d6287dd39b721a70167d20e6e8d382b2e2b629b967bda"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json::replacer::stringify_object_pretty (cyclomatic 28): perry_runtime::json::replacer::stringify_object_pretty 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/perry-runtime/src/json/replacer.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a993dab31c2c6fb7f428f17ed11ed599e8de0585f9d440530bb07ca95af69e3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_get_set::class_object_template::record_class_object_template (cyclomatic 28): perry_runtime::object::field_get_set::class_object_template::record_class_object_template 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/perry-runtime/src/object/field_get_set/class_object_template.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b42ab54b9ff67ed1d9f23f3af099def0f6bdabb79f66d8c5b6b5f196602e135"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::layout_probe::probe_has (cyclomatic 28): perry_runtime::object::layout_probe::probe_has 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/perry-runtime/src/object/layout_probe.rs"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"9593a28a299e76de0b73c9908472ed6ff3f7b689275d6abc6d6ac08b448e2d44"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_module::callable_exports::bound_native_callable_export_value (cyclomatic 28): perry_runtime::object::native_module::callable_exports::bound_native_callable_export_value has cyclomatic complexity 28 (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/perry-runtime/src/object/native_module/callable_exports.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe1a7b40211925e794749148a40b849377eda05af445f77d730c841be98c421"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::object_ops::has_own::has_own_of_non_ordinary_kind (cyclomatic 28): perry_runtime::object::object_ops::has_own::has_own_of_non_ordinary_kind has cyclomatic complexity 28 (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/perry-runtime/src/object/object_ops/has_own.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"582bf78f432ceabf83ad50a4e78e32048a2a58814fa921d1f37a0f9b08ce4d81"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::shapes::region_loop_pack (cyclomatic 28): perry_runtime::object::shapes::region_loop_pack 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/perry-runtime/src/object/shapes.rs"},"region":{"startLine":3346}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d9722d270d1450076667a04e0378606217b15fc06297c8333a7ab82d3f6a23"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::static_shapes::finalized_constfn_facts (cyclomatic 28): perry_runtime::object::static_shapes::finalized_constfn_facts 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/perry-runtime/src/object/static_shapes.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"2694c41e902ca6cee038be762ac506f007d17b7522b7ffffaf9091ce443ab44a"}},{"ruleId":"D1","level":"warning","message":{"text":"SubstituteLocal::visit_stmt (cyclomatic 28): SubstituteLocal::visit_stmt has cyclomatic complexity 28 (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/perry-transform/src/deforest/producer_rewrite.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9c04ccad7ef40dc1d8441ee4658a91de11aa7fc9b6c9d675dc1b804e2f5627"}},{"ruleId":"D1","level":"warning","message":{"text":"StmtRefAllWalker::visit_stmt (cyclomatic 28): StmtRefAllWalker::visit_stmt has cyclomatic complexity 28 (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/perry-transform/src/deforest/scan.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca657905c201c5cd6ecc62ce252327db9816be740c91221a779c45101b6e5da5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::aggregate_scalar::rewrite_return_record_stmts (cyclomatic 28): perry_transform::aggregate_scalar::rewrite_return_record_stmts 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/perry-transform/src/aggregate_scalar.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ec5377ffaf621e89dd7dbfaf8f3c62248e2c1fb0bcce5e6e679b964570f219"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::inline_functions_inner::walk_stmt_exprs (cyclomatic 28): perry_transform::inline::inline_functions_inner::walk_stmt_exprs has cyclomatic complexity 28 (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. This shape REPEATS in the file: one other method here (perry_transform::inline::inline_functions_inner) 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/perry-transform/src/inline/mod.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79d381b118a7ddb102cffdea3204ece47f1c2ce2361ddab1def33b7d8d1ec84"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_windows::app::app_run (cyclomatic 28): perry_ui_windows::app::app_run 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. This is NOT this file\u0027s highest cyclomatic complexity: perry_ui_windows::app::key_to_vk (cyclomatic 62) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-windows/src/app.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc75ec0fbba36e13ed1117196d392861939036387c6803a476401ece8e37cf1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_windows::widgets::canvas::paint_canvas (cyclomatic 28): perry_ui_windows::widgets::canvas::paint_canvas 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/perry-ui-windows/src/widgets/canvas.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef936dce017b630e0d2373cd27a1cbc0e2fce1bafae6865dd92826b93f15a53a"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph::value (cyclomatic 28): Graph::value 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/perry-wit/src/canonical.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b70977e0456464b58c727c68259a0c22cd8178a91d729bedd8ccfcf21d2080"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::units::driver::unit_io (cyclomatic 28): perry_wpfacts::units::driver::unit_io has cyclomatic complexity 28 (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/perry-wpfacts/src/units/driver.rs"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"60091dd4a3e7ac76005b2673bc2cda78a1755d671fc80bcad47614ee988355ee"}},{"ruleId":"D1","level":"warning","message":{"text":"check_gc_scanner_latches.mask_non_code (cyclomatic 28): check_gc_scanner_latches.mask_non_code 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":"scripts/check_gc_scanner_latches.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ad78e26c9b458bd19166e7738535c91ed2361b44279c4b05580241b39473b5"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_gate_wiring_check.check_gate (cyclomatic 28): gc_gate_wiring_check.check_gate 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":"scripts/gc_gate_wiring_check.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7087a41900b6094e88a7496576d862af4327933e66f850bd2ebb7dd5a0e53f"}},{"ruleId":"D1","level":"warning","message":{"text":"test262_subset.main (cyclomatic 28): test262_subset.main 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":"scripts/test262_subset.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa6430ee9519d81493fe3692b267b7cc30104b51eb2d9b34a834cd4ec1b01b0"}},{"ruleId":"D1","level":"warning","message":{"text":"Session::finish (cyclomatic 27): Session::finish 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/perry/src/commands/compile/reach_report.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"7015442c843591e5eaf087bc79d0b0612de74e3e81a4e571c2ac3d7a15b67c0d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_numeric::prove_numeric_fields (cyclomatic 27): perry_codegen::collectors::ptr_shape_numeric::prove_numeric_fields 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/perry-codegen/src/collectors/ptr_shape_numeric.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60a2853d0232de290a3f15818174d944ececb16e227cc6d09dba53a109f760b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_this_flow::expr_mentions_this::stmt_visit (cyclomatic 27): perry_codegen::collectors::ptr_shape_this_flow::expr_mentions_this::stmt_visit has cyclomatic complexity 27 (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/perry-codegen/src/collectors/ptr_shape_this_flow.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efca1873970138f4dee518e8e7ad105163fdce35759d7bcd7ee6558fda52b65"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::static_field_meta::lower_class_evaluation_object (cyclomatic 27): perry_codegen::expr::static_field_meta::lower_class_evaluation_object 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/perry-codegen/src/expr/static_field_meta.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"36166e1e1f068a1e01ab5715be11f8fc83a4354ea26158b3c52a6afb303d6551"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::fallback_diag::record (cyclomatic 27): perry_codegen::fallback_diag::record 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/perry-codegen/src/fallback_diag.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"00acd415d1d113a13ab8a0d748c77957bc0798de2723e8fb9801afb504e4e221"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::inprocess::native_homes::retain (cyclomatic 27): perry_codegen::inprocess::native_homes::retain 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/perry-codegen/src/inprocess/native_homes.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"acab55e4248e4334af2616b7115ae58664950fcc2883e76cf63078f63cd239b3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::layout_families::colouring (cyclomatic 27): perry_codegen::layout_families::colouring 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/perry-codegen/src/layout_families.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e3b6fd8e4cdf63f2f756da6b8386159aa49cf032ed1683a07754ae157c277c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::options::notification::lower_notification_schedule (cyclomatic 27): perry_codegen::lower_call::options::notification::lower_notification_schedule has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/options/notification.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8e4ee583223b9379139cec97a1c321228e7ae6e702cec03db3a0e0bda581ab"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_wasm::emit::locals::resolve_export_to_func (cyclomatic 27): perry_codegen_wasm::emit::locals::resolve_export_to_func 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/perry-codegen-wasm/src/emit/locals.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfcc73341a9fe96ad994cfb11ff9fdf446f9b3d5e2ff27881411d73e7e65d84"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_http::server::http2_server::dispatch::js_ext_http2_session_dispatch_property (cyclomatic 27): perry_ext_http::server::http2_server::dispatch::js_ext_http2_session_dispatch_property has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-http/src/server/http2_server/dispatch.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"9771d62433ea11fc95ca99da23e61cf8fe7df9e39567fee44b868bffbf995e01"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_net::payload_socket::destroy (cyclomatic 27): perry_ext_net::payload_socket::destroy 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/perry-ext-net/src/payload_socket.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d766fcfb2870caf79c7f6318618533e5a19c29a89b329b33cf2851dfdadeb08"}},{"ruleId":"D1","level":"warning","message":{"text":"Header::read (cyclomatic 27): Header::read 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/perry-ext-zlib/src/stream/driver.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"1105a83b618a28a4521dd2cca9429095fd0c4fe7b982cf7027c46e44e5308648"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::analysis::remap_local_ids_in_expr (cyclomatic 27): perry_hir::analysis::remap_local_ids_in_expr 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/perry-hir/src/analysis.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"66672b990d8c6569ef32ef74b94c0974c09dfa781191831c7bdf758a6aceac3d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::dynamic_import::collect_dynamic_import_local_candidate_literals (cyclomatic 27): perry_hir::dynamic_import::collect_dynamic_import_local_candidate_literals 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/perry-hir/src/dynamic_import.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"261c828deaead9b392a424fa0c6b2cdd46dab751b4374571e9edcdc8fad5ceee"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::js_transform::cross_module_natives::scan_for_native_func_returns (cyclomatic 27): perry_hir::js_transform::cross_module_natives::scan_for_native_func_returns has cyclomatic complexity 27 (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/perry-hir/src/js_transform/cross_module_natives.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f56e4ed5cc9f1fbb181c14305a644fdbd1ebb3a4c7613cd7aaa132d61fe311"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::closure_analysis::collect_closure_assigned_stmt (cyclomatic 27): perry_hir::lower::closure_analysis::collect_closure_assigned_stmt has cyclomatic complexity 27 (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. This shape REPEATS in the file: 3 other methods here (perry_hir::lower::closure_analysis::collect_closure_captures_stmt, perry_hir::lower::closure_analysis::collect_scope_level_assigns_stmt, perry_hir::lower::closure_analysis::collect_closure_assigned_in_closure_body_stmt) 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/perry-hir/src/lower/closure_analysis.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb087348d63f60b6b73047412ede3b83b4928cc64055369f461aed427a0df859"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::closure_analysis::collect_closure_captures_stmt (cyclomatic 27): perry_hir::lower::closure_analysis::collect_closure_captures_stmt has cyclomatic complexity 27 (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. This shape REPEATS in the file: 3 other methods here (perry_hir::lower::closure_analysis::collect_closure_assigned_stmt, perry_hir::lower::closure_analysis::collect_scope_level_assigns_stmt, perry_hir::lower::closure_analysis::collect_closure_assigned_in_closure_body_stmt) 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/perry-hir/src/lower/closure_analysis.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba39d0a9bdf27bb099d9062c4642b4e7a6f34bcbe60acdc6643012190f65d54"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::closure_analysis::collect_scope_level_assigns_stmt (cyclomatic 27): perry_hir::lower::closure_analysis::collect_scope_level_assigns_stmt has cyclomatic complexity 27 (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. This shape REPEATS in the file: 3 other methods here (perry_hir::lower::closure_analysis::collect_closure_assigned_stmt, perry_hir::lower::closure_analysis::collect_closure_captures_stmt, perry_hir::lower::closure_analysis::collect_closure_assigned_in_closure_body_stmt) 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/perry-hir/src/lower/closure_analysis.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ccb224ff03dc58b7738140f4ec00527d3b320b9f7e5d04454c1af1401c62950"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::closure_analysis::collect_closure_assigned_in_closure_body_stmt (cyclomatic 27): perry_hir::lower::closure_analysis::collect_closure_assigned_in_closure_body_stmt has cyclomatic complexity 27 (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. This shape REPEATS in the file: 3 other methods here (perry_hir::lower::closure_analysis::collect_closure_assigned_stmt, perry_hir::lower::closure_analysis::collect_closure_captures_stmt, perry_hir::lower::closure_analysis::collect_scope_level_assigns_stmt) 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/perry-hir/src/lower/closure_analysis.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac5285b2c819bc7f64c1490da568e8fa063141bf5a3056df526749acade9179"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::intrinsics::eval_strict::stmt_has_violation (cyclomatic 27): perry_hir::lower::expr_call::intrinsics::eval_strict::stmt_has_violation has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/intrinsics/eval_strict.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24304ee2f549b5876dbd7a7d8fc3c7bf31c0cc6f1684dbff49c0c7d5565acb0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_function::collect_direct_eval_var_names_from_expr (cyclomatic 27): perry_hir::lower::expr_function::collect_direct_eval_var_names_from_expr has cyclomatic complexity 27 (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/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"54bb05e2be351ec6760722993064df5e1087ef58253f7c518921def93d5a509f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::type_widening::widen_lets_stmt (cyclomatic 27): perry_hir::lower::type_widening::widen_lets_stmt has cyclomatic complexity 27 (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/perry-hir/src/lower/type_widening.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"6309890dea3a97200ab4fe245b871828481bad595a38d5ab86813d360dd3a2f5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::block::pre_register_forward_captured_lets (cyclomatic 27): perry_hir::lower_decl::block::pre_register_forward_captured_lets 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/perry-hir/src/lower_decl/block.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f9a4b79208189bc57a1f65973036778a5d2fc3400ed4fed99b9d413382f169"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::indexing::js_array_get_f64 (cyclomatic 27): perry_runtime::array::indexing::js_array_get_f64 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/perry-runtime/src/array/indexing.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5c675cbcb31dc4c7a0819bcca11695aef4576792caf48f6645e1a889e7dbb1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::buffer::u8_codec::base64_decode_strict (cyclomatic 27): perry_runtime::buffer::u8_codec::base64_decode_strict 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/perry-runtime/src/buffer/u8_codec.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"675a150fa3f965cea876e84f41629c50afa2e372b164bf3134fdb8989a496699"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::closure::dispatch::value_call::dispatch_explicit_this_call (cyclomatic 27): perry_runtime::closure::dispatch::value_call::dispatch_explicit_this_call 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/perry-runtime/src/closure/dispatch/value_call.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"5137cddd0892f6d255595f1bd8386c1f32a6d2b83323c66ed96733c3ab0ec605"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::intl::duration_format::partition (cyclomatic 27): perry_runtime::intl::duration_format::partition 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/perry-runtime/src/intl/duration_format.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"175e9a1875a67114242189930e95c666c8ef9a0b769f3412f53cd88d48dd0435"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json::replacer::property_list::stringify_object_with_array_replacer (cyclomatic 27): perry_runtime::json::replacer::property_list::stringify_object_with_array_replacer 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/perry-runtime/src/json/replacer/property_list.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"590eff34f44bc557112bbd8b136a27a61877cd5514a2345dfd9ee56201b45516"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::descriptor_state::plain_custom_prototype_may_intercept (cyclomatic 27): perry_runtime::object::descriptor_state::plain_custom_prototype_may_intercept 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/perry-runtime/src/object/descriptor_state.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7834bc2ec71eb36682cc5b716375e4dba8cc18b5e1afba9e304c1907fb5e89"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_get_set::enumeration::for_in_keys_with (cyclomatic 27): perry_runtime::object::field_get_set::enumeration::for_in_keys_with 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/perry-runtime/src/object/field_get_set/enumeration.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6974ad113061116cafc320027d432a8996ed3a0aa7de8a51c436a7af0ab87c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_call_method::class_holder::chain_method_admitting (cyclomatic 27): perry_runtime::object::native_call_method::class_holder::chain_method_admitting 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/perry-runtime/src/object/native_call_method/class_holder.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a0387490eec7e7b110c74383e378dc08acf6d7c1241eaee4ef65bd07a0b6e3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::temporal::plain_date_time::get (cyclomatic 27): perry_runtime::temporal::plain_date_time::get has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/temporal/plain_date_time.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"706d0d7be4240a10ce448630e46911dc9f0fc40525b7154e93a4e60a4a424c40"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::turnloop_proc::translate (cyclomatic 27): perry_runtime::turnloop_proc::translate 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/perry-runtime/src/turnloop_proc/mod.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2360d622ab1407c8a1c5c6371a551133dd524bdd7e1b0c7eb631951bc7e8a6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::value::equality::js_jsvalue_equals (cyclomatic 27): perry_runtime::value::equality::js_jsvalue_equals 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/perry-runtime/src/value/equality.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b62817d7846d3374bdbbadaf4e3abf17b8d6a25aeb8657703de6cf52459161"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::cheerio::dispatch_cheerio (cyclomatic 27): perry_stdlib::cheerio::dispatch_cheerio 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/perry-stdlib/src/cheerio.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ee92d492f515b1e94b15982410c773e694c4a7eac9488d21618659bb991f42"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::readline::pump::route_pending_stdin_input (cyclomatic 27): perry_stdlib::readline::pump::route_pending_stdin_input 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/perry-stdlib/src/readline/pump.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adf5e4d58776f4119c34238209c5345f1c33f70bbcda814a348c903a66f5ff6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::streams::release_web_streams_in_freed_ranges (cyclomatic 27): perry_stdlib::streams::release_web_streams_in_freed_ranges 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/perry-stdlib/src/streams.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"2793457dc0c3de69ef7d50650ded9a18085f7fb2adb0bb45e68cb096e65851ad"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::deforest::scan::scan_stmt_call_sites (cyclomatic 27): perry_transform::deforest::scan::scan_stmt_call_sites 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/perry-transform/src/deforest/scan.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d92d3ef488c4e4a1f40e1496282d5cc6dbfa39c0674dc1f63e5ff14d2002ee"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::add_tokens (cyclomatic 27): Model::add_tokens 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. This is NOT this file\u0027s highest cyclomatic complexity: Model::cons_line (cyclomatic 67) 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/perry-wpfacts/src/solve.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8831110aac049ccbb524ee2a04c2865a772cb143128f5f1a1a7f2f3ba4b267f1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::summary::compose::expand (cyclomatic 27): perry_wpfacts::summary::compose::expand 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/perry-wpfacts/src/summary/compose.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7c592390f741e7754f8895c1cc11302586c1f91f7a0c181e064b9149c41e5f"}},{"ruleId":"D1","level":"warning","message":{"text":"verification._record_matches_required (cyclomatic 27): verification._record_matches_required 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":"scripts/compiler_output_harness/verification.py"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b2ddb7d0d64f6c116bacba1855ff849d4b59a5752d76396fe39037b2e48b6e"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_store_site_inventory.classify_rust_store (cyclomatic 27): gc_store_site_inventory.classify_rust_store 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":"scripts/gc_store_site_inventory.py"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d8449674aa635f03085702df500b5238664494f8cb712eb72922e6c276eb2b"}},{"ruleId":"D1","level":"warning","message":{"text":"package_bench_attr.write_markdown (cyclomatic 27): package_bench_attr.write_markdown has cyclomatic complexity 27 (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":"scripts/package_bench_attr.py"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5faf9fb9529e4b2e4879071cc0502bcfac9489286c90e0f0cde3ebea557a8a"}},{"ruleId":"D1","level":"warning","message":{"text":"perf_frontier_report.classify_row (cyclomatic 27): perf_frontier_report.classify_row 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":"scripts/perf_frontier_report.py"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35d1bd6c7ef7cd910d088cc0c67c1f80a9824f88c47ae2d010a1173d330f0f3"}},{"ruleId":"D1","level":"warning","message":{"text":"tokens.parseTokens (cyclomatic 27): tokens.parseTokens 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":"packages/perry-styling/src/tokens.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"79dd87a5b9e3a816eaa215489576d06a17f54a4f46917ec6e8b31c162195af4f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::targets::compile_metallib_for_bundle (cyclomatic 26): perry::commands::compile::targets::compile_metallib_for_bundle has cyclomatic complexity 26 (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/perry/src/commands/compile/targets.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"f251d3bea5354b8d429854a25e05afc268b193e32ab02f0aee9fb55fe7d3b831"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::publish::tarball::create_project_tarball_with_includes (cyclomatic 26): perry::commands::publish::tarball::create_project_tarball_with_includes 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/perry/src/commands/publish/tarball.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5fe91cad6dc1bd256d01cb75885c29c81e5917cde1ac5b71a2ec0a9f104651"}},{"ruleId":"D1","level":"warning","message":{"text":"GuardGraphBuilder::build_type (cyclomatic 26): GuardGraphBuilder::build_type has cyclomatic complexity 26 (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/perry-codegen/src/codegen/param_guard.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d57c9be64db135ae9e135311b257f285d31c5d087ebcc80370ae36fb609d815"}},{"ruleId":"D1","level":"warning","message":{"text":"Build::expr_kind (cyclomatic 26): Build::expr_kind 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/perry-codegen/src/codegen/reach_report.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"d359dcbacfd8c0764bd9c2f29dac24100024e331f54e2bfb619853d37193a746"}},{"ruleId":"D1","level":"warning","message":{"text":"Analyzer::stmt (cyclomatic 26): Analyzer::stmt 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/perry-codegen/src/scope_env/analysis.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31290aba62c9b5f3b052fa28e0da505bf6781f9d1e88032f4886ddd56935535"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::boxed_vars::writes_all_precede_captures (cyclomatic 26): perry_codegen::boxed_vars::writes_all_precede_captures has cyclomatic complexity 26 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 13 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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"e935489fb8e73212aaa294227434240e501fa35a1f01b8cc9ce09cd371e21ec9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::boxed_vars::collect_outer_writes_in_expr (cyclomatic 26): perry_codegen::boxed_vars::collect_outer_writes_in_expr has cyclomatic complexity 26 (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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd75057141e2b72b4f45e4d2566177b43fef1395758afd6db9546afee979bda"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::boxed_vars::collect_write_ids_in_expr (cyclomatic 26): perry_codegen::boxed_vars::collect_write_ids_in_expr has cyclomatic complexity 26 (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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"da90bcd46942d3c0b9a52bac59d5b87babbf4bb6a2d548a7c611c1fb4bfb8040"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::helpers::target_os_of (cyclomatic 26): perry_codegen::codegen::helpers::target_os_of 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/perry-codegen/src/codegen/helpers.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"478a83ec8d673856fb29081f6a8978b00d893392a9d6ce67b3fe1bd78a6ddfe8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::typed_abi::lower::lower_typed_i1_expr_with_env (cyclomatic 26): perry_codegen::codegen::typed_abi::lower::lower_typed_i1_expr_with_env has cyclomatic complexity 26 (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/perry-codegen/src/codegen/typed_abi/lower.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"3180681a8b411e60130730454d3a83e4de95e9934a4ba6a285241dc026fffa6b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::object_create_proto::object_create_protos (cyclomatic 26): perry_codegen::collectors::object_create_proto::object_create_protos 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/perry-codegen/src/collectors/object_create_proto.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ad3821836d59a0f22400fd6311bd8f9747abd7bd6874e4ccb402e85e34ec0f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::proven_this::method_proven_this_impl (cyclomatic 26): perry_codegen::collectors::proven_this::method_proven_this_impl 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/perry-codegen/src/collectors/proven_this.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"940b328b43df695df0f8540dca98d6f537246ec9f3b7a969536c318251a87120"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::wpfacts_access::prove (cyclomatic 26): perry_codegen::expr::wpfacts_access::prove 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/perry-codegen/src/expr/wpfacts_access.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c81d908fca9e0fedc077c1bd0234153df590f6ffdfe7aa790d4e4e0bba2672"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::write_barrier::lower_stream_super_init (cyclomatic 26): perry_codegen::expr::write_barrier::lower_stream_super_init has cyclomatic complexity 26 (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/perry-codegen/src/expr/write_barrier.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0940f420a016a7b4ffa33edea3427e2dac5c9d2942391f0351801bf27823eb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::inprocess::optimize_emit::optimize_and_emit (cyclomatic 26): perry_codegen::inprocess::optimize_emit::optimize_and_emit 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/perry-codegen/src/inprocess/optimize_emit.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fe6da1d6694e51672a1772c8bea507db1360b90e8dadd979c77decfd661af1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::extern_func::lower_manifest_param (cyclomatic 26): perry_codegen::lower_call::extern_func::lower_manifest_param has cyclomatic complexity 26 (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/perry-codegen/src/lower_call/extern_func.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba1edd1c5841ed21e9a5dfe90667ef070d2ba03b06abb904e040edef643dfae"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::namespace_call::try_lower_namespace_member_call (cyclomatic 26): perry_codegen::lower_call::namespace_call::try_lower_namespace_member_call 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/perry-codegen/src/lower_call/namespace_call.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"194deb8b219e96a0bf4a8abc4190283706a01b319e38d207471c22d686acec2d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::element_shape_loop::element_shape_loop_pure_expr_collect (cyclomatic 26): perry_codegen::stmt::element_shape_loop::element_shape_loop_pure_expr_collect has cyclomatic complexity 26 (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/perry-codegen/src/stmt/element_shape_loop.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e72213572cab69728a216cd2b8dca0d78702a256b7e56b7f95aaedb87d00b39"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::loops::match_strided_tagged_fill_loop (cyclomatic 26): perry_codegen::stmt::loops::match_strided_tagged_fill_loop has cyclomatic complexity 26 (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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f488a133bb9bb8f4514a7a0bfd77d72bfa8f98a6af16cd240ec1bf3958c10f5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::type_analysis::numeric::expr_produces_canonical_raw_f64 (cyclomatic 26): perry_codegen::type_analysis::numeric::expr_produces_canonical_raw_f64 has cyclomatic complexity 26 (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/perry-codegen/src/type_analysis/numeric.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0cb636c66cddc182172d992101726ccaf5c9d3917313a581e3c1d6ddc631ff2"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::type_analysis::pod::numeric_proof_is_declared_only (cyclomatic 26): perry_codegen::type_analysis::pod::numeric_proof_is_declared_only 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/perry-codegen/src/type_analysis/pod.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc1b2a897651066765da2b9c1268dd66e4774d51e0989c0241fff10f05d65e7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_gc_effects::instructions::writes (cyclomatic 26): perry_gc_effects::instructions::writes 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/perry-gc-effects/src/instructions.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e85f6a023818cf67350cca68758f8b32859beaeea165049719176f4c7e4932"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkerPaths::resolve (cyclomatic 26): WorkerPaths::resolve 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/perry-hir/src/dynamic_import/worker_paths.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"440fc5898519fd6b52264d0bc052fab9c080aad1451dc6d3b219224a14cca427"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::iterator_record::walk_stmt (cyclomatic 26): perry_hir::iterator_record::walk_stmt has cyclomatic complexity 26 (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/perry-hir/src/iterator_record.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"8543d74c772b3da29374204c6faddb3e1450c2f144143103b56c2a52b22cb063"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::builder_fold::walk_stmt (cyclomatic 26): perry_hir::lower::builder_fold::walk_stmt 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/perry-hir/src/lower/builder_fold.rs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c14e5e438fb4d9282fc2c615277e2f06f94f6dcb99d146f40bfabff561f82e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::const_fold_fn::fn_body_has_stray_private_name::expr_has (cyclomatic 26): perry_hir::lower::const_fold_fn::fn_body_has_stray_private_name::expr_has has cyclomatic complexity 26 (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/perry-hir/src/lower/const_fold_fn.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae660f3bd6a8abc185879006821e774761dbfb3f2bb3233d77bd87c2757b550"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::lower_module_fn::collect_assigned_function_binding_candidates::collect_from_expr (cyclomatic 26): perry_hir::lower::lower_module_fn::collect_assigned_function_binding_candidates::collect_from_expr has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This shape REPEATS in the file: one other method here (perry_hir::lower::lower_module_fn::collect_assigned_function_binding_candidates::collect_from_stmt) 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/perry-hir/src/lower/lower_module_fn.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d56f749cd045c8e8a568a80511553b9ee9225627f34f9700baf152e564d2c9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::lower_module_fn::collect_top_level_closure_reassigned_identifiers (cyclomatic 26): perry_hir::lower::lower_module_fn::collect_top_level_closure_reassigned_identifiers has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 9 of the 26 points are its own statements and the rest belongs to 3 function items inside it that branch (collect_stmts, collect_expr, bind_pat). 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/perry-hir/src/lower/lower_module_fn.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b6e3690bea3c2577919dae3e0604338f704c7ad207cf6b816a73e473abfbce"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals::collect_shadowing_decls (cyclomatic 26): perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals::collect_shadowing_decls has cyclomatic complexity 26 (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. This shape REPEATS in the file: 2 other methods here (perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals, perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals::walk_stmt) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/perry-hir/src/lower/pre_scan/weakref_locals.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"596bdbefa9dee808a9ad0b6ac30ff1cc7eb52ab2313a7d69032cb51941b7f004"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::shared_mutable_capture::rewrite_stmt (cyclomatic 26): perry_hir::lower::shared_mutable_capture::rewrite_stmt 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/perry-hir/src/lower/shared_mutable_capture.rs"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4002d9ca65e7d1042289569f709d5bdeb312f3cf386f858affa8e74f9b7352a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::block::var_names::collect_var_binding_names_from_stmt (cyclomatic 26): perry_hir::lower_decl::block::var_names::collect_var_binding_names_from_stmt has cyclomatic complexity 26 (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/perry-hir/src/lower_decl/block/var_names.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf4779f5aaffd25717d59ef288c9d4e1687c5e260adcb71971116ceb3561195"}},{"ruleId":"D1","level":"warning","message":{"text":"Substitute::visit_mut_expr (cyclomatic 26): Substitute::visit_mut_expr 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/perry-parser/src/defines.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"23459c94dbe264e779867d99ddfc2c68f4596a2abe7872de2cea0badd1090997"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::pointer (cyclomatic 26): Writer::pointer 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/perry-runtime/src/thread/clone_write.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b80814da414d10416030fdf7653ff84f06fd40544cda3cbbe84bc7237e2d6c1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::concat_reverse::js_array_concat (cyclomatic 26): perry_runtime::array::concat_reverse::js_array_concat 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/perry-runtime/src/array/concat_reverse.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"baded6b51cee5749408c414748f5f84b7d17519eeeaaebfd502748be80b5659c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::push_pop::js_array_set_length (cyclomatic 26): perry_runtime::array::push_pop::js_array_set_length 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/perry-runtime/src/array/push_pop.rs"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3ac8a5ed814344f5b848fd1d078856979b0ad2c167e22dc01c76f44d04762f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::closure::registry::dispatch_rest_bundled (cyclomatic 26): perry_runtime::closure::registry::dispatch_rest_bundled 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. This is NOT this file\u0027s highest cyclomatic complexity: perry_runtime::closure::registry::dispatch_with_arity (cyclomatic 35) 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/perry-runtime/src/closure/registry.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda4d3c182565cf7c449f380d366d17cca2567475c14c51b59f61749b962bfda"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::component::value::encode_at (cyclomatic 26): perry_runtime::component::value::encode_at 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/perry-runtime/src/component/value.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec459358db6a0d4b542300ad1f7c2ae06030e16195927a7c32d47d53e9d8e181"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::date::parse::parse_rfc_or_named (cyclomatic 26): perry_runtime::date::parse::parse_rfc_or_named 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/perry-runtime/src/date/parse.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a876d59f12cf791309a2bb85296969bea24f91e6245751caab1e2dbf0e35e39"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::dyn_eval::interp::collect_var_names_stmt (cyclomatic 26): perry_runtime::dyn_eval::interp::collect_var_names_stmt has cyclomatic complexity 26 (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/perry-runtime/src/dyn_eval/interp.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3e7d0ad8ac90a3901155bb6b7de1470305b0977875b7c246fc8a01bb683578"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::intl::locales_from_value (cyclomatic 26): perry_runtime::intl::locales_from_value 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/perry-runtime/src/intl.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e52293603dfb87c4e021236ddf9012ee4a6626010bbd6f339b7e6fc5517b7b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::intl::locale::parse_language_tag (cyclomatic 26): perry_runtime::intl::locale::parse_language_tag 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/perry-runtime/src/intl/locale.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1b6c801a3122efc3f49215af36dc81f76c91872d319d2595d637379291a91c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json::stringify_proxy::try_stringify (cyclomatic 26): perry_runtime::json::stringify_proxy::try_stringify 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/perry-runtime/src/json/stringify_proxy.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"5decf914df4ffa4736d3cde71800eb4e6def16e53d14b08016c22fced7c8fea1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_get_set::enumeration::js_object_keys_value (cyclomatic 26): perry_runtime::object::field_get_set::enumeration::js_object_keys_value 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/perry-runtime/src/object/field_get_set/enumeration.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"373689f0e5de8c7c0843e8ee9c21c609698cfb8ad14443512f52eea13ff00457"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_get_set::for_in_stable::stable_single_own_for_in_keys (cyclomatic 26): perry_runtime::object::field_get_set::for_in_stable::stable_single_own_for_in_keys 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/perry-runtime/src/object/field_get_set/for_in_stable.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ced23b07e6186bccebfdcdc80b207111e390fe48b4026cb0862901c3ea4c41"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::property_ops::set_interceptor::set_interceptor (cyclomatic 26): perry_runtime::object::property_ops::set_interceptor::set_interceptor 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/perry-runtime/src/object/property_ops/set_interceptor.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"509dda43a03f9cbac030bd2aa88e4f1d7cefc9e309ed0dda80236db5bc3057b0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::path::win32_dirname_inner (cyclomatic 26): perry_runtime::path::win32_dirname_inner 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/perry-runtime/src/path.rs"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"67148511dec23fae8d0e800cae873660f66553a649ce80e223dd392ebbb5958e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::path::win32_parse::parse_components (cyclomatic 26): perry_runtime::path::win32_parse::parse_components 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/perry-runtime/src/path/win32_parse.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7dcb73a4428d0909506b5698e07169a9c73ddd87d3fc32355cc9ac1c7fb3c90"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::process::node_module::module_strip_type_aliases (cyclomatic 26): perry_runtime::process::node_module::module_strip_type_aliases 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/perry-runtime/src/process/node_module.rs"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e847a29af4f16797c22e5b243c06f69d529afd7d6fd1ba7ef707e5105792ffb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::regex::perex_replace::regexp (cyclomatic 26): perry_runtime::regex::perex_replace::regexp 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/perry-runtime/src/regex/perex_replace.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e72ab83753723e1722aa0b0eb510b7826302b1b28c0fd3a5e3d2b116f5dbd7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::symbol::iterator::js_get_iterator (cyclomatic 26): perry_runtime::symbol::iterator::js_get_iterator 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/perry-runtime/src/symbol/iterator.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"7490459ec5bdb72f2ffb0a247dc74c56268ed29a4e15a4ff265bfecb4c707752"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::typedarray_props::typed_array_define_own_property (cyclomatic 26): perry_runtime::typedarray_props::typed_array_define_own_property 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/perry-runtime/src/typedarray_props.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc37061d138bca28926fe864e54907e9c6122e1bf176e9b80b6ed96bec09ebb9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::crypto::x509::dispatch_x509_property (cyclomatic 26): perry_stdlib::crypto::x509::dispatch_x509_property has cyclomatic complexity 26 (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/perry-stdlib/src/crypto/x509.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"a160d4853f817198bf6025644db8c7c409dd7ef3fbaa30380f05fbd44a5e362d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::streams::gc::scan_stream_roots_with (cyclomatic 26): perry_stdlib::streams::gc::scan_stream_roots_with 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/perry-stdlib/src/streams/gc.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"506197341371ab57982a2d62c30f2901e8b8157db2c1affee086717eca394068"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::generator::iter_result_rewrite::rewrite_stmt (cyclomatic 26): perry_transform::generator::iter_result_rewrite::rewrite_stmt has cyclomatic complexity 26 (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/perry-transform/src/generator/iter_result_rewrite.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"7740bf66366d3119bcc6a617f35d882a279d7bd5dc33fe17551eba9cd2069082"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::closure_analysis::collect_closure_captured_local_ids::visit_stmt (cyclomatic 26): perry_transform::inline::closure_analysis::collect_closure_captured_local_ids::visit_stmt has cyclomatic complexity 26 (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/perry-transform/src/inline/closure_analysis.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"db156e8c8f91b57a944907263e331108d958c3a0952391863413c7d45511ee60"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::closure_analysis::collect_mutated_local_ids::visit_stmt (cyclomatic 26): perry_transform::inline::closure_analysis::collect_mutated_local_ids::visit_stmt has cyclomatic complexity 26 (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/perry-transform/src/inline/closure_analysis.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8aa05269ae2cafa1dd43fb21208555f66a59c4378f2bc252c1d89b5bff5b32"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::exact_receivers::collect_exact_receiver_refs_in_stmt (cyclomatic 26): perry_transform::inline::exact_receivers::collect_exact_receiver_refs_in_stmt has cyclomatic complexity 26 (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/perry-transform/src/inline/exact_receivers.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16ede1710758ebc387942ad5cafa11011ec45471f6794774933d7acfe5121af"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::state_desugar::scan_stmt_handle_uses (cyclomatic 26): perry_transform::state_desugar::scan_stmt_handle_uses has cyclomatic complexity 26 (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/perry-transform/src/state_desugar.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8af4e612452164bdd529c3028cbff17a2c2db758b476f023c7ba61b86a55989"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_android::system::preferences_get (cyclomatic 26): perry_ui_android::system::preferences_get 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/perry-ui-android/src/system.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"21675d83dfab88d287b628f2891ea8206b7dac3167f053a38528b78055cac51f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_gtk4::app::app_run (cyclomatic 26): perry_ui_gtk4::app::app_run 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/perry-ui-gtk4/src/app.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee132583de9c312bee5952897a23325cca71a9cc3fba061824974a2264d4eef5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_windows::window::window_default_wnd_proc (cyclomatic 26): perry_ui_windows::window::window_default_wnd_proc 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/perry-ui-windows/src/window.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93041bba196c5e70ad61f17dcba5a07a732b8d938c41882502d4225e7385e53"}},{"ruleId":"D1","level":"warning","message":{"text":"Gen::walk_class (cyclomatic 26): Gen::walk_class has cyclomatic complexity 26 (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/perry-wpfacts/src/gen/walk.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f7110ea5223372175f7a5b0b46ad289b8f503da19086cdbf1aa6c3b396ee4a"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::settle_keyed_uses (cyclomatic 26): Model::settle_keyed_uses 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/perry-wpfacts/src/model/operations.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"735b83ef3c3db4c3260de4a143d090ea37e24ffbd28c11594e65ec6a2a062e25"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::store_out_arg_reach (cyclomatic 26): Model::store_out_arg_reach has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Model::cons_line (cyclomatic 67) 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/perry-wpfacts/src/solve.rs"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"079eeb273a3207ad569aeefe0ee426018d824ca6cf114de24fe3ac4e09ca20a8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::lib::contracts::fn_contract_of (cyclomatic 26): perry_wpfacts::lib::contracts::fn_contract_of has cyclomatic complexity 26 (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/perry-wpfacts/src/lib/contracts.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"13530355cca35604a68a5b4c55383192ea37a9809f8c7485cc3cd16d866ad26d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::units::driver::solves (cyclomatic 26): perry_wpfacts::units::driver::solves 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/perry-wpfacts/src/units/driver.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c7ae7cc1037e7091c8b0a394a5edd894d7d5b2e7679aad1ff59e6cbba2fbbb"}},{"ruleId":"D1","level":"warning","message":{"text":"check_gate_freshness.newest_post_merge_result (cyclomatic 26): check_gate_freshness.newest_post_merge_result 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":"scripts/check_gate_freshness.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a93def8d01122da992849a8faea96ea3a005079823b4e2d4355042e180b378"}},{"ruleId":"D1","level":"warning","message":{"text":"gate_failure_watch.subject_verdict (cyclomatic 26): gate_failure_watch.subject_verdict 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":"scripts/gate_failure_watch.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68259faceb200a5c995e4b316b013c96fb534c4424f4216f2f1190a88231eb1"}},{"ruleId":"D1","level":"warning","message":{"text":"gate_failure_watch.check_config (cyclomatic 26): gate_failure_watch.check_config 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":"scripts/gate_failure_watch.py"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95063b07c2a6561bbb9b7f947841cff84d4ad20af41dd81ceccfd930681cd41"}},{"ruleId":"D1","level":"warning","message":{"text":"gate_failure_watch.self_test (cyclomatic 26): gate_failure_watch.self_test 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":"scripts/gate_failure_watch.py"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec6e66483642f57165281cfd6649d0a0a14db120e9d99883582b9a085cc5959"}},{"ruleId":"D1","level":"warning","message":{"text":"gen_parity_gaps.covered (cyclomatic 26): gen_parity_gaps.covered 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":"scripts/gen_parity_gaps.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"23099f8eae031a5f486196e1dec6637f6c64048252e559cf79951fc3db8ef369"}},{"ruleId":"D1","level":"warning","message":{"text":"local_binding_type_audit.strip_rust_comments (cyclomatic 26): local_binding_type_audit.strip_rust_comments 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":"scripts/local_binding_type_audit.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"964f70acb8dd08c0caec40fe386524ddf17cd50d901eb7cca30fb35e9eb9e893"}},{"ruleId":"D1","level":"warning","message":{"text":"wasi_run.main (cyclomatic 26): wasi_run.main has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_run.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"a228cc9534a2351ac7533259d8f24b59767c7c8b4493ff97e72a53064cd1885a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::library_search::collect_library_candidates (cyclomatic 25): perry::commands::compile::library_search::collect_library_candidates 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/perry/src/commands/compile/library_search.rs"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e043f757195df58bf62a9d3b849bfc4c30d9850a70b118d77b54ea2ca27e75"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::size_report::build_report (cyclomatic 25): perry::commands::compile::size_report::build_report 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/perry/src/commands/compile/size_report.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6fbb1cae8df6c1862bfc9e79cdd41b6f2387901b32837e9c494ff2087ad7f2"}},{"ruleId":"D1","level":"warning","message":{"text":"Build::call (cyclomatic 25): Build::call 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 is NOT this file\u0027s highest cyclomatic complexity: Reason::name (cyclomatic 33) 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/perry-codegen/src/codegen/source_need/flow.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"82664a8b8f18d63833bb8541fa4d2e05b20b7401cc720623f57ce3cae8e62cf5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::static_fields::init_static_fields_early (cyclomatic 25): perry_codegen::codegen::static_fields::init_static_fields_early 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/perry-codegen/src/codegen/static_fields.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d14542dc8fc4c394063f44f27f9add818f9fa25388089fe344154e36c797fa"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::param_ranges::collect_param_int_ranges (cyclomatic 25): perry_codegen::collectors::param_ranges::collect_param_int_ranges has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/param_ranges.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8e6e582ce1c7f5fdb9bb7afb915939abb5a17bbaf16baac51b320aa1db0860"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_report::scan_stmts (cyclomatic 25): perry_codegen::collectors::ptr_shape_report::scan_stmts 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/perry-codegen/src/collectors/ptr_shape_report.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"80497d267e1f5f69400fa30a11c199cc9c3e920ded497f0e6ea66c51a240f441"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::safepoint_sites::count_in_stmt (cyclomatic 25): perry_codegen::collectors::safepoint_sites::count_in_stmt has cyclomatic complexity 25 (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/perry-codegen/src/collectors/safepoint_sites.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86579695ac626188a7d69d5970624e337afa88970fafc28ef387a054a244f0d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::channel::try_match_channel_reduction (cyclomatic 25): perry_codegen::expr::channel::try_match_channel_reduction 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/perry-codegen/src/expr/channel.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f885eef324f8ac848f200e51b6a20ed5b47b464ae60640c5db3e86d0fda1e48"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::native::perf_hooks::lower_perf_hooks_method (cyclomatic 25): perry_codegen::lower_call::native::perf_hooks::lower_perf_hooks_method 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/perry-codegen/src/lower_call/native/perf_hooks.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9963218fe14c8646dd59c8089c1bd7b6da01bf08d35c6a32d4fc25bd042a9447"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::indexed_owner_loop::emit_body (cyclomatic 25): perry_codegen::stmt::indexed_owner_loop::emit_body 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/perry-codegen/src/stmt/indexed_owner_loop.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"296ac33ccbf15897511927ce9de6c51cc3ff8e871ab0f13e8fb8b05649bd2b99"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::loops::lower_packed_f64_versioned_for_with_protocol (cyclomatic 25): perry_codegen::stmt::loops::lower_packed_f64_versioned_for_with_protocol 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8784a137b3846b7c991472e96d524a25d04e4c934a720fd113c53cb379f17f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::loops::match_packed_f64_versioned_loop (cyclomatic 25): perry_codegen::stmt::loops::match_packed_f64_versioned_loop has cyclomatic complexity 25 (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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":5835}}}],"partialFingerprints":{"codehealthFindingId/v1":"478c18547c694b26f55d75f39189b2403bbd5ba72f5c6348dba1dd8656e823c5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::loops::iterator_record::lower (cyclomatic 25): perry_codegen::stmt::loops::iterator_record::lower has cyclomatic complexity 25 (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/perry-codegen/src/stmt/loops/iterator_record.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2a5bba4b3393a52f6cce15b72be8fab225b475642d1ae232303ddae2ca4ba6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::versioned_indexed_loop::match_candidate (cyclomatic 25): perry_codegen::stmt::versioned_indexed_loop::match_candidate 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/perry-codegen/src/stmt/versioned_indexed_loop.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd64761fd5577ad9af660f74b7eaeabee415ad5f2be835b22d8186ed8d8ee2a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::type_analysis::pod::expr_may_materialize_pod_local (cyclomatic 25): perry_codegen::type_analysis::pod::expr_may_materialize_pod_local 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/perry-codegen/src/type_analysis/pod.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad699159b74aab63d2ac1fd31f57d85e0ec1ff5865a3e44a053c65d2f8847b62"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_arkts::set_hidden::rewrite_set_hidden_in_expr (cyclomatic 25): perry_codegen_arkts::set_hidden::rewrite_set_hidden_in_expr has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-arkts/src/set_hidden.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7204c06270ee50f19fc958eb56a15603dca6ce1b918a3dd667b8cd2343aa39"}},{"ruleId":"D1","level":"warning","message":{"text":"Disposal::visit (cyclomatic 25): Disposal::visit 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/perry-component-host/src/async_values/reader_dispose.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa16c0409ee564fba2797be9ab0fa6e8fe875513c8b5d5e0ad140ea64c4fbcc8"}},{"ruleId":"D1","level":"warning","message":{"text":"Registry::dispatch (cyclomatic 25): Registry::dispatch 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/perry-db-turnloop/src/lib.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94b7f53bb49eeb35df237e310c618b705c7ae43fee0330b0abcdaffd8604fb3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_http::agent::js_ext_http_agent_dispatch_property (cyclomatic 25): perry_ext_http::agent::js_ext_http_agent_dispatch_property 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/perry-ext-http/src/agent.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71b7d5b6a36ca84b8c22cec56ac5304baca0816de01ebe9b52a643335f4b24a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_http::agent::agent_new_with_protocol (cyclomatic 25): perry_ext_http::agent::agent_new_with_protocol 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/perry-ext-http/src/agent.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"64248e14e534089d4b3aa8e7505b650c6c4ef30179a9cc88f00862ec04e81efc"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_net::payload_socket::write (cyclomatic 25): perry_ext_net::payload_socket::write 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/perry-ext-net/src/payload_socket.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0ae0b0d87bd9f940a7a8f92f4b8fec6878cced2325029720f2afa361fb176d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_net::turnloop_tls::step (cyclomatic 25): perry_ext_net::turnloop_tls::step 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/perry-ext-net/src/turnloop_tls.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f5938209c68a446201c5459d629379f64b2c0cbb715970f9bee596ebfdea9a"}},{"ruleId":"D1","level":"warning","message":{"text":"Cfg::pinned (cyclomatic 25): Cfg::pinned 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/perry-gc-effects/src/instructions.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad2e8eeb3a554856f18d64788207a5d4dc5084032c3efc726f300e16d41654c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::intrinsics::apply_call::try_builtin_prototype_method_apply_call (cyclomatic 25): perry_hir::lower::expr_call::intrinsics::apply_call::try_builtin_prototype_method_apply_call has cyclomatic complexity 25 (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/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24e9feee3dea835f3563f09b5d146d1d843c35d035c9b57335463ad20461b15"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::native_module::buffer_statics::try_buffer_uint8array_statics (cyclomatic 25): perry_hir::lower::expr_call::native_module::buffer_statics::try_buffer_uint8array_statics 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/perry-hir/src/lower/expr_call/native_module/buffer_statics.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bd894ce467bdd4055ddd5483b3ab00a2e98eacc3ce46ad1264a0e7704df0b1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::lower_expr::json_literal::serialize (cyclomatic 25): perry_hir::lower::lower_expr::json_literal::serialize 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/perry-hir/src/lower/lower_expr/json_literal.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"df73b1c8185b0e4ebdb1883d2b15db53c21cc687fd861a2a715cb00b4d39a58c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::class_members::lower_class_method_in_scope (cyclomatic 25): perry_hir::lower_decl::class_members::lower_class_method_in_scope 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/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"432974617117bcd8b30645459eac88af995a7810d64ec97c59b170105fef33de"}},{"ruleId":"D1","level":"warning","message":{"text":"DirectParser::parse_string_bytes_slow (cyclomatic 25): DirectParser::parse_string_bytes_slow 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/perry-runtime/src/json/parser.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d8726b5285559b5474ac3ec36fb316c8fd08a18a59bd59f5cd343686a34f70"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::builtins::arithmetic::abstract_relational (cyclomatic 25): perry_runtime::builtins::arithmetic::abstract_relational has cyclomatic complexity 25 (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/perry-runtime/src/builtins/arithmetic.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1ee0bad2871b418f81d4abcfb6c164b24780ee2b052d572b9a14f6af7afd2e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::component::asynchronous::step (cyclomatic 25): perry_runtime::component::asynchronous::step has cyclomatic complexity 25 (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/perry-runtime/src/component/asynchronous.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"2648d4cdf5cc04e56c4ffd49ed9898c558c4f2cdcc02d2652f4d527b4d33173c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::component::value::decode_at (cyclomatic 25): perry_runtime::component::value::decode_at 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/perry-runtime/src/component/value.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1b78b12604cd141cf35ffc4c70a7e1d16f2c92b02ea5f82bd423537edd3375"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::gc::layout_slot_visit::visit_gc_layout_slot_descriptors_generic (cyclomatic 25): perry_runtime::gc::layout_slot_visit::visit_gc_layout_slot_descriptors_generic 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/perry-runtime/src/gc/layout_slot_visit.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"049e8a26f736f491d050ad46c8c7da7926c04fcd816293de50e136c553fca670"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::array_object_ops::array_set_length_from_descriptor (cyclomatic 25): perry_runtime::object::array_object_ops::array_set_length_from_descriptor 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/perry-runtime/src/object/array_object_ops.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"832bfc6d6efce1eba8487b5bc9d31b3d41120dc4b622be6cc0400e41627e987a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_get_set::class_object_props::instance_constructor_value (cyclomatic 25): perry_runtime::object::field_get_set::class_object_props::instance_constructor_value 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/perry-runtime/src/object/field_get_set/class_object_props.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8fb8f4b922f7ee00f480ddb45b100ae985d629919af760029d09082fbcc7a2e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::layout_probe::exotic_get (cyclomatic 25): perry_runtime::object::layout_probe::exotic_get 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/perry-runtime/src/object/layout_probe.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fd9d0d9c23b3cc01c7d4bc757010302a21e4f3f08aaffd03a23671ac030e70"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::os_process_streams_build::build_stream_object_with_write (cyclomatic 25): perry_runtime::os_process_streams_build::build_stream_object_with_write has cyclomatic complexity 25 (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/perry-runtime/src/os_process_streams_build.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1d1fd70d9edd312473a5ad969824f9ec13bbe9f512a373d2ec8a9bb0d4f8d4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::perf_hooks::js_perf_observer_observe (cyclomatic 25): perry_runtime::perf_hooks::js_perf_observer_observe 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/perry-runtime/src/perf_hooks.rs"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"736d64773e654e00aa19728c7da9c22ffb39e6a8a68381d760fb431055b47e83"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::promise::async_step::js_async_step_chain (cyclomatic 25): perry_runtime::promise::async_step::js_async_step_chain 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/perry-runtime/src/promise/async_step.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f25b09a2ec4aec7bebebe269b73dab1dfd041b504902208eabb85fe9df887a"}},{"ruleId":"D1","level":"warning","message":{"text":"RealmManifest::validate (cyclomatic 25): RealmManifest::validate 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/perry-runtime-manifest/src/realm.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"903f8e4d7a6d308e9f22250aac36f816db34aa659a0e29ea79120a8f9083333b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_tls_session::session::step (cyclomatic 25): perry_tls_session::session::step 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/perry-tls-session/src/session.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6df4965a16739babbaf5f746cbe1512d2132e6e0cbfdbf83cb6b9a27893a6cb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::generator::transform_generator_closures_in_stmts (cyclomatic 25): perry_transform::generator::transform_generator_closures_in_stmts has cyclomatic complexity 25 (threshold 15). Of this number, 24 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/perry-transform/src/generator/mod.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cf2faf36c4b575dae7aafe5a07e43aa98e694b97ddfe8fc4a467bcf394bb0b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::generator::per_iteration::rewrite_cells_in_expr (cyclomatic 25): perry_transform::generator::per_iteration::rewrite_cells_in_expr has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/generator/per_iteration.rs"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"023a1a3fdd34f9d78411d0972c64b394181debd7af05ab967b7e19c83bb54d9d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::analysis::scalar_aggregate_loop_param (cyclomatic 25): perry_transform::inline::analysis::scalar_aggregate_loop_param has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 12 of the 25 points are its own statements and the rest belongs to 2 function items inside it that branch (stmts_use_param_safely, expr_uses_param_safely). 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/perry-transform/src/inline/analysis.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e61053864734182f151c282e7b828f919d9757b0a5d550c1f0ba0fa01db0f6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_windows::audio::start (cyclomatic 25): perry_ui_windows::audio::start 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/perry-ui-windows/src/audio.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6a77f4896a7ae1591d8d0bd19b04764736cd65db3f0900c9afd1843dba17fa"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_windows::widgets::handle_command (cyclomatic 25): perry_ui_windows::widgets::handle_command 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/perry-ui-windows/src/widgets/mod.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b9205b4037e3e7840c55fedbb425be169c26515442f1c26f93a7d5b7c07496"}},{"ruleId":"D1","level":"warning","message":{"text":"Gen::reports (cyclomatic 25): Gen::reports 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/perry-wpfacts/src/gen.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca1360da158b0fb00a1b03e1ffa697e92b6da3b23af498e80a5d852640c8a27"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::load_from (cyclomatic 25): Model::load_from 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/perry-wpfacts/src/solve/lookup.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"38543da2d7fffd8dc315ddc4ab082679e76fb254e6ad4e7d1f8f0198608900fe"}},{"ruleId":"D1","level":"warning","message":{"text":"primary-map-prefix-main07-v69r2-auto.build_arm (cyclomatic 25): primary-map-prefix-main07-v69r2-auto.build_arm 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":"docs/audits/gc-rss-instructions-2026-10-03/primary-map-prefix-main07-v69r2-auto.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"837f35138612ca40b3b151d1f3fc23a1e22fc8374a5dc73ca3504612e2f934d4"}},{"ruleId":"D1","level":"warning","message":{"text":"check_npm_publish_freshness.self_test (cyclomatic 25): check_npm_publish_freshness.self_test has cyclomatic complexity 25 (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":"scripts/check_npm_publish_freshness.py"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0fcca0ef44d45a10bb081463e61ef6ad2ae432790d94b91933c170f6b053680"}},{"ruleId":"D1","level":"warning","message":{"text":"perf_frontier_report.summarize_gc_trace (cyclomatic 25): perf_frontier_report.summarize_gc_trace 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":"scripts/perf_frontier_report.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"8412c4a41e895329b11aa7032cb77d8d149dbb9805266e14f828defa15503c85"}},{"ruleId":"D1","level":"warning","message":{"text":"perf_readpath3.main (cyclomatic 25): perf_readpath3.main 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":"scripts/perf_readpath3.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5be3e899737e9aff0da4c9b63f064a27f640f92c97d1195371282e7ecfdf9bd"}},{"ruleId":"D1","level":"warning","message":{"text":"string_payload_access_inventory.mask_non_code (cyclomatic 25): string_payload_access_inventory.mask_non_code 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":"scripts/string_payload_access_inventory.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d63921ee99ee7c2af29d4683740a7e7eb31e4f02c12b756b86a7da3177e94fc"}},{"ruleId":"D1","level":"warning","message":{"text":"server_ab.idle_client (cyclomatic 25): server_ab.idle_client 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":"scripts/turnloop/server_ab.py"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"429747cde9643f45e4f0a722f834b8c93918353f65a45575c8faded95d40560d"}},{"ruleId":"D1","level":"warning","message":{"text":"server_ab.markdown (cyclomatic 25): server_ab.markdown 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":"scripts/turnloop/server_ab.py"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9f0f87098da83ac7effd47d1e747c4233b5e1e258c956235290cb1c0df48e3"}},{"ruleId":"D1","level":"warning","message":{"text":"Solver.call_tok (cyclomatic 25): Solver.call_tok 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":"scripts/wpfacts_recompute.py"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a2aceb2a4a1095b78575fa7c53aae96315003a2dd41bd7c565f22f9abcdfbf"}},{"ruleId":"D1","level":"warning","message":{"text":"wpfacts_recompute.load (cyclomatic 25): wpfacts_recompute.load 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":"scripts/wpfacts_recompute.py"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a3be74ae8c105a418c037073c252b7f57c35deab10ea50959f49e511da987b"}},{"ruleId":"D1","level":"warning","message":{"text":"index.post (cyclomatic 25): index.post has cyclomatic complexity 25 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 6 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":"upstream/actions/jdx/mr-boxington-action/src/index.ts"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafc3ecd1bd4c6ef903be596a473f79655c8482514e327770eaaf7840f12a95c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::collect_modules::walk::walk_modules (cyclomatic 24): perry::commands::compile::collect_modules::walk::walk_modules 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/perry/src/commands/compile/collect_modules/walk.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4373043d946cfa10ac0640d9b2043a7d61b2354f341231ff967336ec6cf196"}},{"ruleId":"D1","level":"warning","message":{"text":"Walk::seed_stmts (cyclomatic 24): Walk::seed_stmts 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/perry-codegen/src/collectors/int_valued_i64_locals.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c3b0b6770c4ddea03637012a6767cae3cc15b86c3201bc48db225a535e9719"}},{"ruleId":"D1","level":"warning","message":{"text":"ProvenanceJudge::walk_stmts (cyclomatic 24): ProvenanceJudge::walk_stmts 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/perry-codegen/src/collectors/integer_locals.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b9ca0202514f75333f1e60992bf3677b9183414a8deeaa9737e314354a5157"}},{"ruleId":"D1","level":"warning","message":{"text":"Census::body (cyclomatic 24): Census::body 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/perry-codegen/src/layout_families/late.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e3d2405f6f009e89d2b9b145d4b23042a00508420275933734f7e76a61e476"}},{"ruleId":"D1","level":"warning","message":{"text":"LoopFacts::walk_expr (cyclomatic 24): LoopFacts::walk_expr 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/perry-codegen/src/stmt/number_local_loop.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"670a2a29423a9439469588843c5ec0bcaeef6cc9920e32f58efa63b1f81d933a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::boxed_vars::collect_nested_closure_boxed_vars_in_expr (cyclomatic 24): perry_codegen::boxed_vars::collect_nested_closure_boxed_vars_in_expr 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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb2e4470cbe006c84600e0153281ee8dbd7b1cb85034ee4abd7b11d02d5ae14"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::closure_collect::collect_module_closures (cyclomatic 24): perry_codegen::codegen::closure_collect::collect_module_closures 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/perry-codegen/src/codegen/closure_collect.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59c3aa6ee167ab3003ce6375dcce19184ef2ba797048beef381de94f3b50ccc"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals (cyclomatic 24): perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals 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: 4 other methods here (perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::expr_value_type, perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::collect_expr_writes_in_closure_stmts, perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::collect_facts, \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/perry-codegen/src/collectors/pointer_locals.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"45575672ad73d6580825edc9c1a7c26040b603ed798854d07a84128defaf10fd"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::scalar_method_dispatch::read_only_prototype_reads (cyclomatic 24): perry_codegen::collectors::scalar_method_dispatch::read_only_prototype_reads 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/perry-codegen/src/collectors/scalar_method_dispatch.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"046d0c4d5557ff11ecf2a27513b57410687b7617ccb51091690383bded07fb01"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::sealed_buffers::buffer_exposure (cyclomatic 24): perry_codegen::collectors::sealed_buffers::buffer_exposure 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/perry-codegen/src/collectors/sealed_buffers.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"936694d8631926156af114b52c6e25c92ea6e5f403970a0fabf787973ee3c5e3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::shadow_slots::collect_declared_shadow_locals_in_stmt (cyclomatic 24): perry_codegen::collectors::shadow_slots::collect_declared_shadow_locals_in_stmt 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/perry-codegen/src/collectors/shadow_slots.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5f2ed1ec5af2b9a6cca43b88b7cd739160de41030ed0e43ea36b3c2e047e7f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::literals_vars::typeof_compile_time_answer (cyclomatic 24): perry_codegen::expr::literals_vars::typeof_compile_time_answer 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/perry-codegen/src/expr/literals_vars.rs"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e05ec75f24326998b2e119814a15b8fb1909a059cc27edfb48f7b9433f1f4e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::fn_info::render_definition (cyclomatic 24): perry_codegen::fn_info::render_definition 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/perry-codegen/src/fn_info.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ce867aefe6a3ed631f6a3bcbbab3417f227c9402321284e0ac3b67028cf93f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_conditional_array_record::abrupt_args (cyclomatic 24): perry_codegen::lower_conditional_array_record::abrupt_args 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/perry-codegen/src/lower_conditional_array_record.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd5206e33b01b558d038d7ca77338c68a87bbde9c900b5a7d59dfcd6211da20"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::lower_stmts_list (cyclomatic 24): perry_codegen::stmt::lower_stmts_list 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/perry-codegen/src/stmt/mod.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"cadff75a85ccdbbaff257d4070ff2aa080c62173f68e432fc54a9d72fac13c6e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::loops::lower_packed_f64_range_versioned_for (cyclomatic 24): perry_codegen::stmt::loops::lower_packed_f64_range_versioned_for 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":3700}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a291ce79461cc1358d1482dbe4eaaa24c6add71fb8e5a9dbd414203c19775d3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::loops::expr_is_packed_f64_loop_safe (cyclomatic 24): perry_codegen::stmt::loops::expr_is_packed_f64_loop_safe 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":6523}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef4657260805d295b0cd44bd92d2637a66a6e597a3a4d94c1cf312997e5c64c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::loops::classify_for_length_hoist_impl (cyclomatic 24): perry_codegen::stmt::loops::classify_for_length_hoist_impl has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":8297}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f60b02c17adebc2b360f302a65bbf202c4e8a13bdfee45590743253d0cfd5b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_arkts::state_rewrite::rewrite_state_in_expr (cyclomatic 24): perry_codegen_arkts::state_rewrite::rewrite_state_in_expr 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/perry-codegen-arkts/src/state_rewrite.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fa7e6cfc8553f5a4a4dd57a7216572d1177d9890627689853fff8819504b87"}},{"ruleId":"D1","level":"warning","message":{"text":"FuncEmitCtx::try_emit_expr_net_fetch_crypto (cyclomatic 24): FuncEmitCtx::try_emit_expr_net_fetch_crypto 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/perry-codegen-wasm/src/emit/expr/net_fetch_crypto.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6421c35f237f2555662be50ed022b5a3154dcb888d9975e6fc24e830f0d07a09"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_http::server::response_end::standalone_end (cyclomatic 24): perry_ext_http::server::response_end::standalone_end 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/perry-ext-http/src/server/response_end.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d75640dff2a2a4447cd42e77c0fdf825bae3b384f70c7e6318c5a66247870e6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_pdf::serde_json_lite::parse_value (cyclomatic 24): perry_ext_pdf::serde_json_lite::parse_value 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/perry-ext-pdf/src/lib.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"f052904a3d6d9b380763e725f8c084c7a1f4e4663ff62d3b341ecfb8397dd128"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_gc_effects::instructions::idiom (cyclomatic 24): perry_gc_effects::instructions::idiom 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/perry-gc-effects/src/instructions.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1753aa592a83fae97196e9275b47d39460882976a2ad6f1edad7addedbca588"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::dynamic_import::collect_local_candidate_defs_from_frames (cyclomatic 24): perry_hir::dynamic_import::collect_local_candidate_defs_from_frames 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/perry-hir/src/dynamic_import.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"6852557c15b1b8c6a6ea37ca06ba49dbd9bdb3fed392c13ed16e72c935a459e9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::dynamic_import::binding_origin::resolve_exported_binding (cyclomatic 24): perry_hir::dynamic_import::binding_origin::resolve_exported_binding 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/perry-hir/src/dynamic_import/binding_origin.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db3c1ccba346506e05a4d5f36de2c5d7f4afc55d3105980b706f8868ac95377"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::js_transform::imports::transform_stmt (cyclomatic 24): perry_hir::js_transform::imports::transform_stmt 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/perry-hir/src/js_transform/imports.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1e111f0e3e225c2ea0e00a1787ba560ccbf355ec924b85050071b611f2f3d8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::builder_fold_width_hints::const_build_loop_width (cyclomatic 24): perry_hir::lower::builder_fold_width_hints::const_build_loop_width 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/perry-hir/src/lower/builder_fold_width_hints.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16305b2e00a9f13b2aea7452abcfbca7e149dabbdbddba8b3a48643882a2193"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_assign::hoist_compound_member_assign (cyclomatic 24): perry_hir::lower::expr_assign::hoist_compound_member_assign 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/perry-hir/src/lower/expr_assign.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0b8150d6089e19e4764c5f93e2b08c5a55e95645d117975b18b4e326ed9bc0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::intrinsics::apply_call::try_native_module_method_apply_call (cyclomatic 24): perry_hir::lower::expr_call::intrinsics::apply_call::try_native_module_method_apply_call 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/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2025d129a76ed9b6cba5c6b8652a1d0931b1ce0137b28737aa079fd0c7f0c7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_new::non_ident::register_stream_controller_params (cyclomatic 24): perry_hir::lower::expr_new::non_ident::register_stream_controller_params 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/perry-hir/src/lower/expr_new/non_ident.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4993891bb71afe8044ff5dfe48df377a6303296728f188176afe5b6b7435f728"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::type_widening::visit_stmt (cyclomatic 24): perry_hir::lower::type_widening::visit_stmt 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/perry-hir/src/lower/type_widening.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"c885774d4e87bed1a0b54c8c3617384c650a5d25a0200efb8ab88ff636a3d2c1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::widget_decl::parse_gauge_node (cyclomatic 24): perry_hir::lower::widget_decl::parse_gauge_node 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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"95840c33e0a4d4333bd69be4adfee2ccf33261055f2fdf8e6b0f7218c33fe325"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_types::url_encoding_constructor_type (cyclomatic 24): perry_hir::lower_types::url_encoding_constructor_type has cyclomatic complexity 24 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 6 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":"crates/perry-hir/src/lower_types.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b0c693233fb28ba90b2f958148ff0c18e415b50cfbb2af17b7cd96de68c2d6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::native_profile::pod_field_type (cyclomatic 24): perry_hir::native_profile::pod_field_type 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/perry-hir/src/native_profile.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99b2a8fae33d2ea501ea1eaeff7e5448d4ae7684795216b15eefcf70d8ec1df"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::indexing::js_array_set_f64_extend_resolved (cyclomatic 24): perry_runtime::array::indexing::js_array_set_f64_extend_resolved 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/perry-runtime/src/array/indexing.rs"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64dc689dc8286f5b17b92dd9b6584750e28f1dc5ea4846854fb6e2b54bc7f4d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::iter_object::collection_iter_obj_for_receiver (cyclomatic 24): perry_runtime::array::iter_object::collection_iter_obj_for_receiver 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/perry-runtime/src/array/iter_object.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec3aea3ce32990ac903c79eb2dc3bb6a441d165d4eadce3a462da6042c70eac"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::date::parse::parse_legacy_iso_tail (cyclomatic 24): perry_runtime::date::parse::parse_legacy_iso_tail 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/perry-runtime/src/date/parse.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"599a4396e4e9d799a91c444c3a660c0a0d7455bc69506883be5256dbc7a7e8a3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json::stringify_record_output::emit_cached_record_memo (cyclomatic 24): perry_runtime::json::stringify_record_output::emit_cached_record_memo 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/perry-runtime/src/json/stringify_record_output.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ad64d62d637bed5595a666f0c9b53e78981ca3d612cc4b35490fb64f550a13"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json_tape::lazy_get_rooted_impl (cyclomatic 24): perry_runtime::json_tape::lazy_get_rooted_impl 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/perry-runtime/src/json_tape.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da666a704933fddc1f12e35b44a520730eebcad4819fe5d055ebefc19e21f2e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::exotic_expando::exotic_define_own_property (cyclomatic 24): perry_runtime::object::exotic_expando::exotic_define_own_property 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/perry-runtime/src/object/exotic_expando.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b822d63de8bccb014b6ed54636b3b7a57ebbbac4612a8e9770c719aff322885"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::global_this::install_static::install_builtin_constructor_statics (cyclomatic 24): perry_runtime::object::global_this::install_static::install_builtin_constructor_statics 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/perry-runtime/src/object/global_this/install_static.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"f771347766043a2e2dc7fe1ff21bc1a840a5332f0bcadd268d7a6209eac0b1b6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_module::scan_native_callable_export_roots_mut (cyclomatic 24): perry_runtime::object::native_module::scan_native_callable_export_roots_mut 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/perry-runtime/src/object/native_module.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f91d2ecd6e0b4389a715f01010caa982d97bfa055e6a809bde141cd93db5d1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_module_dispatch::dispatch_a_c::nm_dispatch_buffer (cyclomatic 24): perry_runtime::object::native_module_dispatch::dispatch_a_c::nm_dispatch_buffer 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 is NOT this file\u0027s highest cyclomatic complexity: perry_runtime::object::native_module_dispatch::dispatch_a_c::nm_dispatch_bun (cyclomatic 30) 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/perry-runtime/src/object/native_module_dispatch/dispatch_a_c.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b4be3524214aeda0ffad7b757040384a197435322d61d2783761eb5f89882e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::typed_feedback::js_typed_feedback_array_index_get_fallback_boxed (cyclomatic 24): perry_runtime::typed_feedback::js_typed_feedback_array_index_get_fallback_boxed 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/perry-runtime/src/typed_feedback.rs"},"region":{"startLine":2251}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7a9042409e1c0eabe7a9c78a65797c56075d690e49b950ed35a91e5bd50062"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::value::equality::js_jsvalue_compare (cyclomatic 24): perry_runtime::value::equality::js_jsvalue_compare 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/perry-runtime/src/value/equality.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee89001a090dd25cd1e851ac37a01ce0991bcdfb81d1afaf71d9173a66ccc39"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_tls_session::step (cyclomatic 24): perry_tls_session::step 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/perry-tls-session/src/lib.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"277d3325f54fa7c8eb6f6bf6b56bf6db63d749314ca20770057fa0b5e547a061"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::generator::id_scan::scan_stmt_for_max_local (cyclomatic 24): perry_transform::generator::id_scan::scan_stmt_for_max_local 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/perry-transform/src/generator/id_scan.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53f5f5015c42198ade2445f13e8bfb8be97054ed9a348e599f14cecd895a681"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::generator::private_frame::closed_effects (cyclomatic 24): perry_transform::generator::private_frame::closed_effects has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/generator/private_frame.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf94df99ca63679e1e673107a9ee30bc335142a183354f1bcd88506c085f7f6b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::i18n::apply_i18n (cyclomatic 24): perry_transform::i18n::apply_i18n 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/perry-transform/src/i18n.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"211e4207ee2cdaf139c32f1a64f494093a902b48980150b8459e7b1b3b4ab9ae"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::factory_specialize::specialize_captured_class_factories::rewrite_call_init (cyclomatic 24): perry_transform::inline::factory_specialize::specialize_captured_class_factories::rewrite_call_init 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 (perry_transform::inline::factory_specialize::specialize_captured_class_factories, perry_transform::inline::factory_specialize::specialize_captured_class_factories::visit_stmts, perry_transform::inline::factory_specialize::specialize_captured_class_factories::rewrite_to_specialized_class) 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/perry-transform/src/inline/factory_specialize.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb40a91f4f3181d6097d8e77e262be7988cede90220c3ffcc9bab42c6621b3b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::factory_specialize::specialize_captured_class_factories::rewrite_to_specialized_class (cyclomatic 24): perry_transform::inline::factory_specialize::specialize_captured_class_factories::rewrite_to_specialized_class 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 (perry_transform::inline::factory_specialize::specialize_captured_class_factories, perry_transform::inline::factory_specialize::specialize_captured_class_factories::visit_stmts, perry_transform::inline::factory_specialize::specialize_captured_class_factories::rewrite_call_init) 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/perry-transform/src/inline/factory_specialize.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a6bcecda2f7b77eec7023ce601745892c11e2e380800f8489653fae5e6765d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::module_const_fold::walk_stmt_exprs (cyclomatic 24): perry_transform::module_const_fold::walk_stmt_exprs 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/perry-transform/src/module_const_fold.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0693c69cb3f61b57221c98d378188e2f4a36e84ece4c54a9561e0b11e18101"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_gtk4::state::state_set (cyclomatic 24): perry_ui_gtk4::state::state_set 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/perry-ui-gtk4/src/state.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6046d1f153b7d796d0d8da8cee889b15dc3b8d0e1266a6559a83ebb56e17ebfe"}},{"ruleId":"D1","level":"warning","message":{"text":"Gen::publish_result (cyclomatic 24): Gen::publish_result 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/perry-wpfacts/src/gen/export.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"db22b30ba661abd9a5ba0adda92091e542c5c5ae519dccb09fa58f0fcd85289d"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::summarize_and_replay (cyclomatic 24): Model::summarize_and_replay has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: perry_wpfacts::summary::map_cons (cyclomatic 67) 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/perry-wpfacts/src/summary.rs"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccdf4df8987edf722940a9747cc1f96f11e806d5a74e99dc7fe9e0113412f79"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::builtins::own_method_inner (cyclomatic 24): perry_wpfacts::builtins::own_method_inner 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/perry-wpfacts/src/builtins.rs"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bd78425d0380cbe39db202614920496180966afdc24f8988bdd5403c50e444"}},{"ruleId":"D1","level":"warning","message":{"text":"repsel_census.census (cyclomatic 24): repsel_census.census 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":"scripts/compiler_output_harness/repsel_census.py"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"c029b0f2a71f2310c3b638a70be09b3a626c277fa730081e7287fd350d077a8e"}},{"ruleId":"D1","level":"warning","message":{"text":"copied_minor_fallback_report.aggregate_workload (cyclomatic 24): copied_minor_fallback_report.aggregate_workload 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":"scripts/copied_minor_fallback_report.py"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef74fc5577854615b6b44ad3b57c82a6d2ce55bffd304b7d4949bd7ac52b0c9"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_1090_evidence_report.perf_frontier_summary (cyclomatic 24): gc_1090_evidence_report.perf_frontier_summary 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":"scripts/gc_1090_evidence_report.py"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"485a876e8cd6185dfa95f829769a3a05b05f950ea70fdf9dead314e4af07d4e6"}},{"ruleId":"D1","level":"warning","message":{"text":"report_gc_ratchet.report (cyclomatic 24): report_gc_ratchet.report 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":"scripts/report_gc_ratchet.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca18d5ac5af572bbeb6e3abb855f0891d5424196e10a515ea516f004b5d6c06"}},{"ruleId":"D1","level":"warning","message":{"text":"wpfacts_recompute.site_verdicts (cyclomatic 24): wpfacts_recompute.site_verdicts 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":"scripts/wpfacts_recompute.py"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"496563789e855c9dff38cd8aa4f98cbdf3ee6cd55ff5190efb2825cf0d138cf4"}},{"ruleId":"D1","level":"warning","message":{"text":"objects-cache.validateObjectsCachePaths (cyclomatic 24): objects-cache.validateObjectsCachePaths has cyclomatic complexity 24 (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":"upstream/actions/jdx/mr-boxington-action/src/objects-cache.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8d64eb75ed7624e20cce642664529b45f36ab188c259604ae19d85a3a396f9"}},{"ruleId":"D1","level":"warning","message":{"text":"Fixer::find_issues_in_expr (cyclomatic 23): Fixer::find_issues_in_expr has cyclomatic complexity 23 (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/perry/src/commands/fixer.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e2ae243c354c77e022bc2b37bcb5f43d574d4675fd4c278c15504c7d87e2f4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::link::link_cache::feed_command_args (cyclomatic 23): perry::commands::compile::link::link_cache::feed_command_args 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/perry/src/commands/compile/link/link_cache.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"261ae8dd7ae0c5a78371a665f43e000e57017b019ef3faa18922b9e1907158f6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::tiny_program::try_compile (cyclomatic 23): perry::commands::compile::tiny_program::try_compile 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/perry/src/commands/compile/tiny_program/mod.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c44c8a6c84e96d9b0c5d0f4d834f90d9f224e1b089e1d6cd62f48007ea1da3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::widget_build::build_declared_widgets_ios (cyclomatic 23): perry::commands::compile::widget_build::build_declared_widgets_ios 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/perry/src/commands/compile/widget_build.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0f25de71b72e7c4c5d3278ff4a6817b30e0a51a343b8e55763b3b58d4c25b0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::boxed_vars::collect_closure_refs_and_writes_in_expr (cyclomatic 23): perry_codegen::boxed_vars::collect_closure_refs_and_writes_in_expr has cyclomatic complexity 23 (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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"71451ec2c493cf907400a11a87882750a623a2d16e73379d2f55d8d6ca74c5e7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::split_regions_literal::chunk_giant_literal (cyclomatic 23): perry_codegen::codegen::split_regions_literal::chunk_giant_literal 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/perry-codegen/src/codegen/split_regions_literal.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"301d4a907c7b02c7f8fae29afdabe6ed70c383abb2946996d0f3033fe4642b35"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::escape_news::collect_used_new_fields_in_stmts (cyclomatic 23): perry_codegen::collectors::escape_news::collect_used_new_fields_in_stmts 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/perry-codegen/src/collectors/escape_news.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f231e79b19f473096d1f706adf02482956158b424feac3e5276e933a73d4614"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::i32_locals::walk_writes_for_unsigned_i32 (cyclomatic 23): perry_codegen::collectors::i32_locals::walk_writes_for_unsigned_i32 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/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f229db7cbcb812150eb5fd500729c8f099e493e7db17ce105e15a0e594bebb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::index_uses::absorb_writes_into_index_used (cyclomatic 23): perry_codegen::collectors::index_uses::absorb_writes_into_index_used 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/perry-codegen/src/collectors/index_uses.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8794a5ef7207ea015099caea33b344cb6bbf2dca851345d1cabefb06c054e471"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::int_valued_i64_locals::collect_written_ids (cyclomatic 23): perry_codegen::collectors::int_valued_i64_locals::collect_written_ids 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/perry-codegen/src/collectors/int_valued_i64_locals.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"966cccec38182bf6d577619173ee54d30cc09c101c20c993375fd7a687c9e141"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::object_literal_exports::capability_from_init (cyclomatic 23): perry_codegen::collectors::object_literal_exports::capability_from_init 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/perry-codegen/src/collectors/object_literal_exports.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2b11aaad7d4d246b2a3999f06c59fa697feb0afa8cbd7d5ede137226c04af1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::refs::refs_stmts (cyclomatic 23): perry_codegen::collectors::refs::refs_stmts 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/perry-codegen/src/collectors/refs.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ced6bd5f5b0dc834b8de33f5161adfd3a870b4d18dd0bdd97643d302ae86ca1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::i32_fast_path::i32_chain_magnitude_bits (cyclomatic 23): perry_codegen::expr::i32_fast_path::i32_chain_magnitude_bits has cyclomatic complexity 23 (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/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3d890cb0c4c5747f1bd2b4f1d88df06a497ddd1b1551f3690c83fd7fa97f1e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::inprocess::native_homes::collecting_loop_blocks (cyclomatic 23): perry_codegen::inprocess::native_homes::collecting_loop_blocks has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/inprocess/native_homes.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"d096a98e83905b103ba6728b9bc48190644cca00090c744491b23f965e20369b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::new_alloc::constructor_added_key_count_in (cyclomatic 23): perry_codegen::lower_call::new_alloc::constructor_added_key_count_in has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 6 of the 23 points are its own statements and the rest belongs to 2 function items inside it that branch (visit_stmts, visit_expr). 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/perry-codegen/src/lower_call/new_alloc.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"188eddc1984cc0c33b9ebf87fc96d4ca0a70a18a44442136a6733380ba4eeaed"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::native_value::pod::pod_init_value_roundtrips_exact (cyclomatic 23): perry_codegen::native_value::pod::pod_init_value_roundtrips_exact has cyclomatic complexity 23 (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/perry-codegen/src/native_value/pod.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8e77f2772c8fc66365ece624cbf0e6934dc66f4a8eaa82fee2e8838682ac1c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::native_value::verify::layout::validate_pod_layout (cyclomatic 23): perry_codegen::native_value::verify::layout::validate_pod_layout 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/perry-codegen/src/native_value/verify/layout.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f32595ab675554536b83c6cbecd09a313f1121e582fdb713786927ef9a4c1ec"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::region_loop::plan::accesses (cyclomatic 23): perry_codegen::stmt::region_loop::plan::accesses has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 2 function items inside it that branch (s_walk, e_walk). 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/perry-codegen/src/stmt/region_loop/plan.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab371fd892e5f9c4bb459301b77cbfb07992596fa734b0d11e2f758f04e686da"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::stable_packed_loop::lower (cyclomatic 23): perry_codegen::stmt::stable_packed_loop::lower 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/perry-codegen/src/stmt/stable_packed_loop.rs"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"876b95a59f33a17611db1c2a6a89a610a236498a8c583788fbc3eff398af5caf"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::type_analysis::pod::collect_pod_numeric_field_read_locals (cyclomatic 23): perry_codegen::type_analysis::pod::collect_pod_numeric_field_read_locals has cyclomatic complexity 23 (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/perry-codegen/src/type_analysis/pod.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff458d48044b62babc1393e02808ef3237c3c702f1ef8aabb5f10d1e92d68f9"}},{"ruleId":"D1","level":"warning","message":{"text":"WasmModuleEmitter::collect_strings_in_stmt (cyclomatic 23): WasmModuleEmitter::collect_strings_in_stmt 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/perry-codegen-wasm/src/emit/string_collection.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"b670c86788d60ded3e861ed1250e8dc3fc9e6659a64ce9072c37110ea51e3e6d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_wasm::emit::locals::collect_locals (cyclomatic 23): perry_codegen_wasm::emit::locals::collect_locals 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/perry-codegen-wasm/src/emit/locals.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"6135498b2583ee50cc9f33281884c7ca9c5812661043e3f1173b5250a8e6eeb5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_http::pending_dispatch::js_http_process_pending (cyclomatic 23): perry_ext_http::pending_dispatch::js_http_process_pending has cyclomatic complexity 23 (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/perry-ext-http/src/pending_dispatch.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7afbcf817cec9428308f3b73acf49f6fe18c2df5f9f966a14638afddb4fb61"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_http::server::http2_server::dispatch::js_ext_http2_session_dispatch_method (cyclomatic 23): perry_ext_http::server::http2_server::dispatch::js_ext_http2_session_dispatch_method 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/perry-ext-http/src/server/http2_server/dispatch.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc937c8e6721573bdc1e11d13540d8da48c1a85bb1dbc0a659779e17c72e38da"}},{"ruleId":"D1","level":"warning","message":{"text":"Remap::stmt (cyclomatic 23): Remap::stmt 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/perry-hir/src/lexical_frames.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"6853f96ab162db71ef4533ad1630db52f031cfd0a8bc0d30d12d34e338800b61"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::analysis::remap_local_ids_in_stmt_propagating (cyclomatic 23): perry_hir::analysis::remap_local_ids_in_stmt_propagating 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. This shape REPEATS in the file: one other method here (perry_hir::analysis::remap_local_ids_in_stmt) 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/perry-hir/src/analysis.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"3849a70cfac13eb47bc3fe05e6eb146a5fb97dfd9a43e263ac4a5de5a996b11b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::analysis::remap_local_ids_in_stmt (cyclomatic 23): perry_hir::analysis::remap_local_ids_in_stmt 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. This shape REPEATS in the file: one other method here (perry_hir::analysis::remap_local_ids_in_stmt_propagating) 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/perry-hir/src/analysis.rs"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fcce5ca3139deba32eeaef65b693b094d21dacb9b21c3a75f21425b515b6347"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::dynamic_import::collect_param_literal_sets_from_frames (cyclomatic 23): perry_hir::dynamic_import::collect_param_literal_sets_from_frames 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/perry-hir/src/dynamic_import.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87f81b4b571fe7eeb74e49e943724ff2332ccab6c7f2e70753272cd0638b2dc"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::dynamic_import::collect_const_locals_from_frames (cyclomatic 23): perry_hir::dynamic_import::collect_const_locals_from_frames 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/perry-hir/src/dynamic_import.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"397a129d9cabc11229ce272b6429a399326404d3bdd78b7fd272fb275f7b0f36"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::textencoder::try_textencoder_decoder (cyclomatic 23): perry_hir::lower::expr_call::textencoder::try_textencoder_decoder 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/perry-hir/src/lower/expr_call/textencoder.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cad3da17ef235e46d782e895fe8ed1ffe4dff462290524ca4de9272ab692d5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_member::native_dispatch::is_native_dispatch_member (cyclomatic 23): perry_hir::lower::expr_member::native_dispatch::is_native_dispatch_member has cyclomatic complexity 23 (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/perry-hir/src/lower/expr_member/native_dispatch.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"848d066328d984997c269c14832818194ff49193cac70cdf09ccee6d66233587"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::fn_ctor_env::object_tostring_body (cyclomatic 23): perry_hir::lower::fn_ctor_env::object_tostring_body has cyclomatic complexity 23 (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/perry-hir/src/lower/fn_ctor_env.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b090bae44614996983a928dc67161975aa4bb548c60639facdd08f382834c0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::module_tdz::apply (cyclomatic 23): perry_hir::lower::module_tdz::apply 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/perry-hir/src/lower/module_tdz.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aec3e400d5c31e030ac3caf3e4c664af068415c85356052c16611f21ac0a039"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::stmt_loops::mark_iterator_completion_on_abrupt (cyclomatic 23): perry_hir::lower::stmt_loops::mark_iterator_completion_on_abrupt has cyclomatic complexity 23 (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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea3d1490392970f813653a813ee1caa4df73997353f5b022b54babc919a1d53"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::widget_decl::reactive_animate::collect_state_value_reads (cyclomatic 23): perry_hir::lower::widget_decl::reactive_animate::collect_state_value_reads has cyclomatic complexity 23 (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/perry-hir/src/lower/widget_decl/reactive_animate.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e19d96399b2d53ecb029a6d0a5bdfc7cc025b9f3f0075390b8d8a4141e0105"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::block::var_names::annexb_nested_stmt (cyclomatic 23): perry_hir::lower_decl::block::var_names::annexb_nested_stmt has cyclomatic complexity 23 (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/perry-hir/src/lower_decl/block/var_names.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb78dbc8681b289e943bc18f093621006371a3e93a11c11be9ac1b22eabf5b7f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::helpers::stmt_uses_arguments (cyclomatic 23): perry_hir::lower_decl::helpers::stmt_uses_arguments has cyclomatic complexity 23 (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/perry-hir/src/lower_decl/helpers.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5774bdd7e100a524c4929c23ad92da354a38fff778564a4d106e41058532d20"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::monomorph::driver::collect_instantiations_in_stmt (cyclomatic 23): perry_hir::monomorph::driver::collect_instantiations_in_stmt 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/perry-hir/src/monomorph/driver.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1f21708badfcd184791139e32d00f8f7c62ce3f43e0c9aea0d276a979fc12e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::monomorph::update_call_sites::update_call_sites_in_stmt (cyclomatic 23): perry_hir::monomorph::update_call_sites::update_call_sites_in_stmt 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/perry-hir/src/monomorph/update_call_sites.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d24ab73257d3d1340e2f0ac561a5d9ffc66378af446fdbbc574886dd6dc97a3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_http_server::conn::drain (cyclomatic 23): perry_http_server::conn::drain 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/perry-http-server/src/conn.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e0706afddf7645589b5a4299f20c4e288ef21bf9cd99e19de89abeeb0b0817"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_perex::tooling::dialect::common_escape (cyclomatic 23): perry_perex::tooling::dialect::common_escape has cyclomatic complexity 23 (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/perry-perex/src/tooling/dialect.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"653e5f46055cf22b4bd5b040d207fe30c5136feb3b3b8fe90d9ce4a044dc58aa"}},{"ruleId":"D1","level":"warning","message":{"text":"GcCycleState::step_reclaim (cyclomatic 23): GcCycleState::step_reclaim 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/perry-runtime/src/gc/cycle.rs"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b9ecc33209785dde7020b9bdf607d35cf86f5671c4cfd277cdfa474ce55263"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::push_pop::js_array_grow (cyclomatic 23): perry_runtime::array::push_pop::js_array_grow 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/perry-runtime/src/array/push_pop.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93461f4b90fc94a9b2b6a68d150d52d0a10271911b03c806a36b5f6d9cbf271"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::child_process::sync_run::cp_run_to_completion (cyclomatic 23): perry_runtime::child_process::sync_run::cp_run_to_completion has cyclomatic complexity 23 (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/perry-runtime/src/child_process/sync_run.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2cbef0a6d42011bc24fd2c93302d507dd48eb40ecbc3f7aba6c62ff25d86826"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::closure::native_constructor::inherits_function (cyclomatic 23): perry_runtime::closure::native_constructor::inherits_function has cyclomatic complexity 23 (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/perry-runtime/src/closure/native_constructor.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"155009220170b9eab48fcb30e2eb536fea5eaa5f25f77b59a9283035653b2c0f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::eh_walker_trace::capture_js_return_addresses (cyclomatic 23): perry_runtime::eh_walker_trace::capture_js_return_addresses 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/perry-runtime/src/eh_walker_trace.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"033226cac8c3ac0b0ffcec5bc084e3092f84fc1b468dedf8a4cf952e352165ee"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::gc::barrier::scan_dirty_object_slots (cyclomatic 23): perry_runtime::gc::barrier::scan_dirty_object_slots 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/perry-runtime/src/gc/barrier/mod.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5a49d70e0d5d4eec9a8b36916ae61bc3e112753635003b56bcc51738d0c999"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::gc::policy::gc_check_trigger_evaluate (cyclomatic 23): perry_runtime::gc::policy::gc_check_trigger_evaluate 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/perry-runtime/src/gc/policy.rs"},"region":{"startLine":3245}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd910d69da3cf53f55f7da7be23cc527a90497e4b7b5a6d806476cd88a2a8fd"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::intl::date_collator::temporal::temporal_locale_string (cyclomatic 23): perry_runtime::intl::date_collator::temporal::temporal_locale_string has cyclomatic complexity 23 (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/perry-runtime/src/intl/date_collator/temporal.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4371116e55871ffbcb72b60372d92df419ab681a56403b64df85e15e330e44"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::node_stream_constructors::builders::init_transform_kind (cyclomatic 23): perry_runtime::node_stream_constructors::builders::init_transform_kind 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/perry-runtime/src/node_stream_constructors/builders.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"4472e21f3b356c090a69b295aa1a834600198b11f2418907b95631d7c6f2e0a8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::node_stream_event_emitter::own_data_slot (cyclomatic 23): perry_runtime::node_stream_event_emitter::own_data_slot 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/perry-runtime/src/node_stream_event_emitter.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"b851de9ee045ccdce9164d1e12b69687fa31698a76e0389317e53b8b00e899c3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::class_registry::decl_prototype_birth::decl_prototype_born_final (cyclomatic 23): perry_runtime::object::class_registry::decl_prototype_birth::decl_prototype_born_final 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/perry-runtime/src/object/class_registry/decl_prototype_birth.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ee068a64f7576eb8887de2b6bf57fa04d7cb562900ffa4289f4351eff62b4b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::delete_rest::try_delete_stable_sso (cyclomatic 23): perry_runtime::object::delete_rest::try_delete_stable_sso 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/perry-runtime/src/object/delete_rest.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7f2fca6e997c7eeb184f777a0c27d5d67f36ac022f24b2757502097fbde349"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_module_dispatch::dispatch_a_c::nm_dispatch_console (cyclomatic 23): perry_runtime::object::native_module_dispatch::dispatch_a_c::nm_dispatch_console has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: perry_runtime::object::native_module_dispatch::dispatch_a_c::nm_dispatch_bun (cyclomatic 30) 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/perry-runtime/src/object/native_module_dispatch/dispatch_a_c.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4cf4931fc2b3460e8363e3c33e019d9395ce7e4efcbbd161a767a449cc4305"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::shape_store::try_array_store (cyclomatic 23): perry_runtime::object::shape_store::try_array_store 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/perry-runtime/src/object/shape_store.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c8dfbec02f4a4a8d3864cfd46d9b112d9d034b2b68a2384bc5138743ec9c15"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::path::normalize_win32_str (cyclomatic 23): perry_runtime::path::normalize_win32_str 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/perry-runtime/src/path.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"c773c0b02639670109ff7afc4021fb962cf3bad7c876d5692939ad780939c713"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::perf_histogram::histogram_method (cyclomatic 23): perry_runtime::perf_histogram::histogram_method 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/perry-runtime/src/perf_histogram.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f20fc2f81e8a9843b9de60c7dccb7dbf4f12533baf9e98d81896c385d370c5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::proxy::own_keys::js_proxy_own_keys (cyclomatic 23): perry_runtime::proxy::own_keys::js_proxy_own_keys 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/perry-runtime/src/proxy/own_keys.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a878d81f1f2048b09875ee850a9c20fea4fff98fe515b841b869b884d57a5f6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::thread::parallel_map_impl (cyclomatic 23): perry_runtime::thread::parallel_map_impl 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/perry-runtime/src/thread.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0a20bbe77c4637098553b316a1417726d23a5f72ca2bd54af18f1e4a29a4cc"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::value::truthy::js_is_truthy (cyclomatic 23): perry_runtime::value::truthy::js_is_truthy 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/perry-runtime/src/value/truthy.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44e7c42cf6aeef122faa381a58cb315292c253cf6fb5cfe01c71fa5ffa56f6c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::string_decoder::dispatch_string_decoder (cyclomatic 23): perry_stdlib::string_decoder::dispatch_string_decoder has cyclomatic complexity 23 (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/perry-stdlib/src/string_decoder.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c370def98d7af31d821570dca28ca556594fa9312b40d9ecb16a0c2a3219e5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::aggregate_scalar::stmts_are_safe (cyclomatic 23): perry_transform::aggregate_scalar::stmts_are_safe has cyclomatic complexity 23 (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/perry-transform/src/aggregate_scalar.rs"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e680a8f7546fc7d5bcb56510f41573858f7dceb1cf7bd3bb15efae317a73fe3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::async_to_generator::strip_in_stmt (cyclomatic 23): perry_transform::async_to_generator::strip_in_stmt 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/perry-transform/src/async_to_generator.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59a3b2e0c75bcf9a86644717af08c95c840c12007eec6a2a2b9904f5c020446"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::deforest::walk::max_in_stmt (cyclomatic 23): perry_transform::deforest::walk::max_in_stmt 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/perry-transform/src/deforest/walk.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abadf7b9c3d9ed05f9f1b217b9ce87ad9ce9c3a38000b33a9f70368573c6ff0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::substitute::substitute_locals_inner (cyclomatic 23): perry_transform::inline::substitute::substitute_locals_inner 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/perry-transform/src/inline/substitute.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf405d617ab15442ef8fc531d35ea6cd4f2fb740a45c71be9e29865b7c6d75b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::local_occurrences::count_stmt (cyclomatic 23): perry_transform::local_occurrences::count_stmt 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/perry-transform/src/local_occurrences.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c076a8323a9868b246a19e8168deee3bdbb8a631d5dbd279cb8c88cfa522d633"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_android::widgets::canvas::repaint (cyclomatic 23): perry_ui_android::widgets::canvas::repaint 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/perry-ui-android/src/widgets/canvas.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"35903ea39805e6f15b83a7d2a592c6c16f1054fbc7521d6f54f4f1ed5d333b1e"}},{"ruleId":"D1","level":"warning","message":{"text":"Gen::register_all (cyclomatic 23): Gen::register_all has cyclomatic complexity 23 (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/perry-wpfacts/src/gen.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0a7c134f3d0dc60577e76642d0cf05d0908afa17ee82ae86e83ef07e8ff448"}},{"ruleId":"D1","level":"warning","message":{"text":"primary-entry-once-main07-v46-auto.build_arm (cyclomatic 23): primary-entry-once-main07-v46-auto.build_arm 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":"docs/audits/gc-rss-instructions-2026-10-03/primary-entry-once-main07-v46-auto.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cac379bee6e954943444e6b21e8f47a9ea9844c1f2734ec4628496504339a30"}},{"ruleId":"D1","level":"warning","message":{"text":"primary-lazy-rss-main07-v52-auto.build_arm (cyclomatic 23): primary-lazy-rss-main07-v52-auto.build_arm 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":"docs/audits/gc-rss-instructions-2026-10-03/primary-lazy-rss-main07-v52-auto.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e054dd04aa5456edfcd7dbd0e29376b67113a5036a5ed3713717aea0af5df3"}},{"ruleId":"D1","level":"warning","message":{"text":"primary-learned-floor-main07-v60-auto.build_arm (cyclomatic 23): primary-learned-floor-main07-v60-auto.build_arm 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":"docs/audits/gc-rss-instructions-2026-10-03/primary-learned-floor-main07-v60-auto.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"187fbb93cbff7fdb800351ee9c77e1d5e3918e261f690c1bffb1b672c511fa5c"}},{"ruleId":"D1","level":"warning","message":{"text":"primary-map-prefix-main07-v69-auto.build_arm (cyclomatic 23): primary-map-prefix-main07-v69-auto.build_arm 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":"docs/audits/gc-rss-instructions-2026-10-03/primary-map-prefix-main07-v69-auto.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83be2d3446b8a5c990ceb4024275670c6d9765c44bfe59a49ea0a3b56064b2c"}},{"ruleId":"D1","level":"warning","message":{"text":"primary-map-prefix-main07-v69r1-auto.build_arm (cyclomatic 23): primary-map-prefix-main07-v69r1-auto.build_arm 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":"docs/audits/gc-rss-instructions-2026-10-03/primary-map-prefix-main07-v69r1-auto.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b330bfb46f3f1886640fd9ef694b1c354719cd9523e110b540a6f3124dd07c"}},{"ruleId":"D1","level":"warning","message":{"text":"capture_linux_incident.main (cyclomatic 23): capture_linux_incident.main has cyclomatic complexity 23 (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":"scripts/capture_linux_incident.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e047c95436ac87c1422da31efbfc52e6e6f456586e4119a52b3dba9a245ffeb"}},{"ruleId":"D1","level":"warning","message":{"text":"check_node_version_consistency.check (cyclomatic 23): check_node_version_consistency.check 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":"scripts/check_node_version_consistency.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"8254be72054f06b1b449f91b8a4e3491746c616199f788218287a97f19ad36fe"}},{"ruleId":"D1","level":"warning","message":{"text":"analyzers._selector_matches (cyclomatic 23): analyzers._selector_matches has cyclomatic complexity 23 (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":"scripts/compiler_output_harness/analyzers.py"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7672b5b09238f194f033df50cf92d6f7f1b9c9f8e00e2a010913dbfcba1a7b2"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_root_dominance_check._tracked_across_statepoint (cyclomatic 23): gc_root_dominance_check._tracked_across_statepoint 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":5251}}}],"partialFingerprints":{"codehealthFindingId/v1":"482cbb3f236de3c72040dae1780948a392dfc424f2fddfcf878cb78f02d37a9e"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_store_site_inventory.strip_rust_comments (cyclomatic 23): gc_store_site_inventory.strip_rust_comments 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":"scripts/gc_store_site_inventory.py"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c0ff59507e423bec5d743873d1ab93192598931e8e615bb81918e94af27b1c"}},{"ruleId":"D1","level":"warning","message":{"text":"package_bench_attr.analyze (cyclomatic 23): package_bench_attr.analyze 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":"scripts/package_bench_attr.py"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce0cf8b216bd29cb1f9f539dc1342bd5f10bf635b49d0bebc30d262a6fef603"}},{"ruleId":"D1","level":"warning","message":{"text":"server_ab.run (cyclomatic 23): server_ab.run has cyclomatic complexity 23 (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":"scripts/turnloop/server_ab.py"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1de2228b0e3e0a0156102b80c91d39d38432625f34d24bae90f6576b289863"}},{"ruleId":"D1","level":"warning","message":{"text":"wpfacts_precision.census (cyclomatic 23): wpfacts_precision.census 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":"scripts/wpfacts_precision.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"372a2bb9ecfb7366ca5c84352772dc3f4ad8436e1c70ce8a890e0fa088a9cfab"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.renderDetail (cyclomatic 23): index.html.renderDetail has cyclomatic complexity 23 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 11 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":"crates/perry-ui-geisterhand/src/inspector_ui/index.html"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"580171cf8cf0de108589416c064baf0a27115dfd17ad2ddb8ab1239e8ddd498b"}},{"ruleId":"D1","level":"warning","message":{"text":"objects-cache.withObjectsResourceSampler (cyclomatic 23): objects-cache.withObjectsResourceSampler has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 9 of the 23 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 647, sample, recordSampleFailure, \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":"upstream/actions/jdx/mr-boxington-action/src/objects-cache.ts"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d9ad8fac524bfa6f48907991564abeb992e672eb7eee0a9d574374adc3d5d0"}},{"ruleId":"D1","level":"warning","message":{"text":"Session::finish (cyclomatic 22): Session::finish 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/perry/src/commands/compile/source_need.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebcbce068ab007e1e42377d59a8e2293ae2b53a3be08882eab4ef8ed1b4e4fcd"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::bootstrap::rerun_collect_with_class_field_types (cyclomatic 22): perry::commands::compile::bootstrap::rerun_collect_with_class_field_types 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/perry/src/commands/compile/bootstrap.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d7684b6c174431d62876d06cb7cd33540fc28ea3a231fd72160a79f8b1197a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::extract_requires::identifier_is_reassigned (cyclomatic 22): perry::commands::compile::cjs_wrap::extract_requires::identifier_is_reassigned 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/perry/src/commands/compile/cjs_wrap/extract_requires.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8dfb4bcc0ff8a6456e93c895afbcfc586ec5e2a81c4cdf8264d7cadc94f7034"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::collect_modules::native_addon::discovery::collect_declared_addons (cyclomatic 22): perry::commands::compile::collect_modules::native_addon::discovery::collect_declared_addons 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/perry/src/commands/compile/collect_modules/native_addon/discovery.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02ff7a16f79bd19b698afe3fc3e5ef5c9a37fd91c4f53ca3e256dc70bf06cf8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::library_search::find_msvc_lib_paths (cyclomatic 22): perry::commands::compile::library_search::find_msvc_lib_paths 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/perry/src/commands/compile/library_search.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96c8aa07bd464a0ea70e8f6f60f81eac6e86cb456f0a5aa02ebc05cee1a4bd6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::doctor::run (cyclomatic 22): perry::commands::doctor::run 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/perry/src/commands/doctor.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"987ebfe322d62353ee573be8280bb4514d5504d86ed280e77377274200cd533f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::login::run (cyclomatic 22): perry::commands::login::run 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/perry/src/commands/login.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e46f1a9b207afadf9b6c5d98eaa512d91c60f9ab46ee2dafbed85e78fdc8281"}},{"ruleId":"D1","level":"warning","message":{"text":"UseWalk::walk_stmt (cyclomatic 22): UseWalk::walk_stmt 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/perry-codegen/src/collectors/ptr_numarray.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09c24d1fe18e6865d508f41f423c5ad48f2da381486e239abac7ef4b535ae91"}},{"ruleId":"D1","level":"warning","message":{"text":"Scan::walk_stmt (cyclomatic 22): Scan::walk_stmt 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/perry-codegen/src/collectors/sealed_buffers.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d3585d278ac433ac1790162be77f5a4dcc4ce26d07cdb491317139519ec7e3"}},{"ruleId":"D1","level":"warning","message":{"text":"FnReader::call (cyclomatic 22): FnReader::call has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/dialect/mod.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e3514992df5672fa8e477a1b782454d771479353d17a62de3c41fac5ea0a49"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::closure_collect::collect_direct_call_closures_in_stmts (cyclomatic 22): perry_codegen::codegen::closure_collect::collect_direct_call_closures_in_stmts 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/perry-codegen/src/codegen/closure_collect.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9b586172b5e52922fd2934067606dbdd88ef222f36726f5f15acf60ee5ab05"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::helpers::collect_return_class (cyclomatic 22): perry_codegen::codegen::helpers::collect_return_class has cyclomatic complexity 22 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: perry_codegen::codegen::helpers::resolve_target_triple (cyclomatic 26) 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/perry-codegen/src/codegen/helpers.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc3c1513ed71aaf4e9cce3577599d34426cd93eeffd028e281836787844f30e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::method_registry::build_method_names (cyclomatic 22): perry_codegen::codegen::method_registry::build_method_names has cyclomatic complexity 22 (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/perry-codegen/src/codegen/method_registry.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9525f953a2adcfd0e23629ec599d519037f5d97c6e50129ad37861f6dfac03c1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::static_constfn::construction_final (cyclomatic 22): perry_codegen::codegen::static_constfn::construction_final 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/perry-codegen/src/codegen/static_constfn.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6014c98c77161dca23578c1155d19483928377181b0b4418379063232c7315"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::static_fields::init_static_fields_late (cyclomatic 22): perry_codegen::codegen::static_fields::init_static_fields_late 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/perry-codegen/src/codegen/static_fields.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5e2d56d1df908f6b709fd39cb777817e3157898c4f40a79230a2d86abc5704"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::definite_init::collect (cyclomatic 22): perry_codegen::collectors::definite_init::collect 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/perry-codegen/src/collectors/definite_init.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"5258e97f5fd457035ffe427631a1471d8fe8c3ce8c690eca96dab6321482ea7f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::escape_arrays::collect_length_only_indices_in_stmts (cyclomatic 22): perry_codegen::collectors::escape_arrays::collect_length_only_indices_in_stmts 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. This shape REPEATS in the file: one other method here (perry_codegen::collectors::escape_arrays::collect_used_array_indices_in_stmts) 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/perry-codegen/src/collectors/escape_arrays.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c130851d25ca28d4e7031464a393abf8d36ec12980ce314ee0c6c3b7b1556fd3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::escape_arrays::collect_used_array_indices_in_stmts (cyclomatic 22): perry_codegen::collectors::escape_arrays::collect_used_array_indices_in_stmts 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. This shape REPEATS in the file: one other method here (perry_codegen::collectors::escape_arrays::collect_length_only_indices_in_stmts) 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/perry-codegen/src/collectors/escape_arrays.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4bb14f5470f8b7c94ace9827af7b61610cc0f6803e01736977769de5fd2b04"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::escape_arrays::check_array_escapes_in_stmts (cyclomatic 22): perry_codegen::collectors::escape_arrays::check_array_escapes_in_stmts 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/perry-codegen/src/collectors/escape_arrays.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"e339ac9ced3fc3f5701cf8e8c2f60f987c1d03edaadd5a47aed9c0208896fa33"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::escape_check::check_escapes_in_stmts (cyclomatic 22): perry_codegen::collectors::escape_check::check_escapes_in_stmts 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/perry-codegen/src/collectors/escape_check.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3badecdea3b2dbf572a1c5399f5190cd34800d426159ade8e009e13910f5bd"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::escape_objects::collect_used_object_fields_in_stmts (cyclomatic 22): perry_codegen::collectors::escape_objects::collect_used_object_fields_in_stmts 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/perry-codegen/src/collectors/escape_objects.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bd19ec51ad425fb3654a0d5d47d091a1712910bb2d324ea42a988626b828a5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::escape_objects::check_object_literal_escapes_in_stmts (cyclomatic 22): perry_codegen::collectors::escape_objects::check_object_literal_escapes_in_stmts 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/perry-codegen/src/collectors/escape_objects.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac57d529eb3e9f1b0851b289c2b72094084ad2589585b7bb8094fd6cdf77bbd"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::i32_locals::collect_localset_ids_in_stmts_filtered (cyclomatic 22): perry_codegen::collectors::i32_locals::collect_localset_ids_in_stmts_filtered 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/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f993ead9ec46d6df8b24c75119b52d046aa1ab5f4b07e88ed43327370d9f4c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::index_uses::walk_index_uses_in_stmts (cyclomatic 22): perry_codegen::collectors::index_uses::walk_index_uses_in_stmts 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/perry-codegen/src/collectors/index_uses.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3d641c6629b2eeff36adb276524f5719b29c7615d52ef13e69f3e63624f39c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::int_valued_ta_locals::collect_facts (cyclomatic 22): perry_codegen::collectors::int_valued_ta_locals::collect_facts 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/perry-codegen/src/collectors/int_valued_ta_locals.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7128da0ef60203552482629ef5c9950689a5bfa1b7fc850ff72a23333aef5e3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::loop_bounded_i32::walk_stmts (cyclomatic 22): perry_codegen::collectors::loop_bounded_i32::walk_stmts 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/perry-codegen/src/collectors/loop_bounded_i32.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96bd82d28e347e0a273a61d787a9bacef94f56e00bbfd06950608fa47d45b52"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::not_bigint_locals::collect_writes (cyclomatic 22): perry_codegen::collectors::not_bigint_locals::collect_writes 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/perry-codegen/src/collectors/not_bigint_locals.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ced03e2494b34c70d99c3c8c16606a59504f795d4419c2cf1ff65f0bed20aa"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::proven_this::rewrite_array_field_reads_in_stmts (cyclomatic 22): perry_codegen::collectors::proven_this::rewrite_array_field_reads_in_stmts 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/perry-codegen/src/collectors/proven_this.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b2151181ab214a679b81ff2d3fe33510276e671481d23b9a5ff6756dccfd30"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::typed_locals::collect_typed_locals (cyclomatic 22): perry_codegen::collectors::typed_locals::collect_typed_locals has cyclomatic complexity 22 (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/perry-codegen/src/collectors/typed_locals.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"5665cde5f2bc31b1762afc21df4b09c5ec90c8e348b5fc80b9c17492bf505cd7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::index::lower_index_set_fast (cyclomatic 22): perry_codegen::expr::index::lower_index_set_fast 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/perry-codegen/src/expr/index.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0800674df253a87d33324d1854d1841c9352509c3bc9be4c172bb6911268215"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::index_get::lower_numeric_index_get_for_number_context (cyclomatic 22): perry_codegen::expr::index_get::lower_numeric_index_get_for_number_context 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/perry-codegen/src/expr/index_get.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30d8db430a570d99e227cae36647355affb4e72c35edb02759d06f6d00322da"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::literals_vars::bind_lowered_value_to_local (cyclomatic 22): perry_codegen::expr::literals_vars::bind_lowered_value_to_local 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/perry-codegen/src/expr/literals_vars.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1781f9aff6a7600194a572dcf8e96268a560a533082bfd37d7b2a3cfaeabe0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::proxy_reflect::same_put_value_receiver_expr (cyclomatic 22): perry_codegen::expr::proxy_reflect::same_put_value_receiver_expr has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/proxy_reflect.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2a022d58ec1c475d02629802a5ff3e12dd95fbe453e3982e4e91894c551f86"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::layout_desc::create_families::analyze (cyclomatic 22): perry_codegen::layout_desc::create_families::analyze 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/perry-codegen/src/layout_desc/create_families.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e8795e533b4f86b8694e45866620f6ad7cae9b59fc8d0772e68de1f4ae4593"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::layout_families::program_families (cyclomatic 22): perry_codegen::layout_families::program_families 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/perry-codegen/src/layout_families.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a5a4d2226ca74518f37461bb56618f4fd4f453d8b6a9a95166a276d9c5c94f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::closure_analysis::collect_closure_introduced_ids (cyclomatic 22): perry_codegen::lower_call::closure_analysis::collect_closure_introduced_ids has cyclomatic complexity 22 (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/perry-codegen/src/lower_call/closure_analysis.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a502df5ba60cb0c51d27d7934297afff3a056b998c352a73452b0df8393cec"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::ui_styling::apply_inline_style (cyclomatic 22): perry_codegen::lower_call::ui_styling::apply_inline_style has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/ui_styling.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bae27df3eb691f38491817f68a6497818bf612a9e6923db879a6de4ab65011"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::root_reload::rename_operand (cyclomatic 22): perry_codegen::root_reload::rename_operand has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/root_reload.rs"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb80b72ce874c9223c1fa046039a3b22ceec5336dbdf10fc45348c8285e18e4a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::loops::packed_f64_range_loop_pure_expr_collect (cyclomatic 22): perry_codegen::stmt::loops::packed_f64_range_loop_pure_expr_collect 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":3121}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a53d3eead24e53df1f46122bcead4ec316c848f7002d061b8d595710873705"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::region_loop::verify::verify_exit_effects (cyclomatic 22): perry_codegen::stmt::region_loop::verify::verify_exit_effects 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/perry-codegen/src/stmt/region_loop/verify.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"77344d6ac5c1c4d1c293e47f7bbab5bc9069346f99434aa198e023df44c00920"}},{"ruleId":"D1","level":"warning","message":{"text":"JsEmitter::emit_system_method_call (cyclomatic 22): JsEmitter::emit_system_method_call has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/emit/calls.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28d78d7839017025b319f01e4f085d25e5b61a7a4603989cacd381895b47074"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_swiftui::emit::emit_node (cyclomatic 22): perry_codegen_swiftui::emit::emit_node 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/perry-codegen-swiftui/src/emit.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa8ec11a55ed6e541f16ff72e3dd5b39376808b5b3f819182d71bf4ea103103"}},{"ruleId":"D1","level":"warning","message":{"text":"Host::new_prepared (cyclomatic 22): Host::new_prepared 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/perry-component-host/src/lib.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9d26aa85b449be1b28af0d3999a11bf575fef4b540ef5845286f4488bd16c1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_http::server::handle_dispatch::js_ext_http_server_dispatch_property (cyclomatic 22): perry_ext_http::server::handle_dispatch::js_ext_http_server_dispatch_property has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: perry_ext_http::server::handle_dispatch::js_ext_http_incoming_message_dispatch_method (cyclomatic 39) 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/perry-ext-http/src/server/handle_dispatch.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be9f6200ee4206fa70f8802c28a0807b2973fab31645ae2c23fed4f3d3caefd"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_http::server::turnloop_serve::conn::decode_step (cyclomatic 22): perry_ext_http::server::turnloop_serve::conn::decode_step 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/perry-ext-http/src/server/turnloop_serve/conn.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"86952a424111d1ae960453e65be0e0f8a480efc036d70c0e1793276805bab73b"}},{"ruleId":"D1","level":"warning","message":{"text":"CensusWalker::stmt (cyclomatic 22): CensusWalker::stmt 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/perry-hir/src/lower/shared_mutable_capture.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e235f377ea9d3cab8a29df84956723513e1bf807717c161f7a24abd309bace"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::analysis::fn_infer::walk_stmts (cyclomatic 22): perry_hir::analysis::fn_infer::walk_stmts 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/perry-hir/src/analysis/fn_infer.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"89af95fa23beeab85c77b03b83b29ebc0e557563e0e46155d16b316345c5afea"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::analysis::fn_infer::callee::round (cyclomatic 22): perry_hir::analysis::fn_infer::callee::round 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/perry-hir/src/analysis/fn_infer/callee.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bb8dff3e1bcf4e81c6d99a9ac6c99a8da46074f3d977dc87e99a1e9a54d384"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::dynamic_import::scan_mutations_from_frames (cyclomatic 22): perry_hir::dynamic_import::scan_mutations_from_frames 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/perry-hir/src/dynamic_import.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa68e3aca8bf1d629d3e81bc21212879644eb15dd2b977f720edaa2520beaaa"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::emitted_closures::collect_closure_refs_in_stmts (cyclomatic 22): perry_hir::emitted_closures::collect_closure_refs_in_stmts 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/perry-hir/src/emitted_closures.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e935abb63e82d58d478ab67bc6041ec9304b9158469dbea5b9f135aa2167b942"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::intrinsics::eval_strict::check_eval_function_call (cyclomatic 22): perry_hir::lower::expr_call::intrinsics::eval_strict::check_eval_function_call 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/perry-hir/src/lower/expr_call/intrinsics/eval_strict.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"22db9e8170867199d8ac4da81795a0012c3cd80e52aa9c0e9c08f65bc2e38ff2"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::nested_namespace::try_web_crypto_subtle (cyclomatic 22): perry_hir::lower::expr_call::nested_namespace::try_web_crypto_subtle 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/perry-hir/src/lower/expr_call/nested_namespace.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbe7771ebb34f27e0e87ba6752d4c312e86ec55bef592d1b29ca5704b474205"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::lower_expr::helpers::native_module_binding_value (cyclomatic 22): perry_hir::lower::lower_expr::helpers::native_module_binding_value 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/perry-hir/src/lower/lower_expr/helpers.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"959d18f6be29528c4826d77c0d21948b0b384ebcea88d8b890a46cb66ef43a14"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::shared_mutable_capture::demote_redeclarations_stmt (cyclomatic 22): perry_hir::lower::shared_mutable_capture::demote_redeclarations_stmt 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/perry-hir/src/lower/shared_mutable_capture.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"e777142c2af9ce478c8d91a2bea122ef01663df76bf2ec30bb4cc08af13d5856"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::class_captures::closure_capture_ids_stmt (cyclomatic 22): perry_hir::lower_decl::class_captures::closure_capture_ids_stmt 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/perry-hir/src/lower_decl/class_captures.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1145a8dd801484e1b4d7925de72b75f60a7ccdd0510842a854a8fe6f7f31a9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::helpers::collect_let_decls_in_stmt (cyclomatic 22): perry_hir::lower_decl::helpers::collect_let_decls_in_stmt has cyclomatic complexity 22 (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/perry-hir/src/lower_decl/helpers.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a414e19324746f69b6f9c1c1c2d5ef81bcec41dbf116f3592d3369646b2c20bb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::monomorph::defaults::fill_defaults_in_stmt (cyclomatic 22): perry_hir::monomorph::defaults::fill_defaults_in_stmt 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/perry-hir/src/monomorph/defaults.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"d761f5cf3764528fe5be7ca4c3847782a139bd6bf0c5efda86df5059f284957f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_http_client::http::exchange (cyclomatic 22): perry_http_client::http::exchange 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/perry-http-client/src/http.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbbd6f5e155ff5401a2b7a4b676c4e37a65213ee3c94694fddba13469aceaf8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_parser::normalize_swc_class_syntax_with_metadata (cyclomatic 22): perry_parser::normalize_swc_class_syntax_with_metadata 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/perry-parser/src/lib.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7b5548604223c98fca4bd7c16b2ba6aa300e9bc11605e6c4f0714272901581"}},{"ruleId":"D1","level":"warning","message":{"text":"MutableRegisteredRootScanState::step (cyclomatic 22): MutableRegisteredRootScanState::step 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/perry-runtime/src/gc/cycle/registered_root_scan.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe64ae0e45ad11dce0688b87dd18c25962db5023dce0ee81fb1ff52f887ddaf"}},{"ruleId":"D1","level":"warning","message":{"text":"GcCycleState::step_atomic_finalize_current_subphase (cyclomatic 22): GcCycleState::step_atomic_finalize_current_subphase 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/perry-runtime/src/gc/cycle.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3c8e6fef6024def8ea6bb99aa0032f65ee3e5c1ea2ee1eeed0e1d97e6707d8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::indexing::try_strict_dense_index_set (cyclomatic 22): perry_runtime::array::indexing::try_strict_dense_index_set 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/perry-runtime/src/array/indexing.rs"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"84191db5b45270c4d2a3c42ab372445ef04f83522a5c625dcc676958b5416e07"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::push_pop::js_array_pop_f64 (cyclomatic 22): perry_runtime::array::push_pop::js_array_pop_f64 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/perry-runtime/src/array/push_pop.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"484f78efa81d4c4b3cb15a5c464608a3cd33bbd801289e8f3ce823c8470a9cb3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::bun_ffi::dlopen::cstring_value (cyclomatic 22): perry_runtime::bun_ffi::dlopen::cstring_value 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/perry-runtime/src/bun_ffi/dlopen.rs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db39a33add64b622e19da6815300f3e1e5a6e68429bd642d14212396f244024"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::child_process::fork::js_child_process_fork (cyclomatic 22): perry_runtime::child_process::fork::js_child_process_fork 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/perry-runtime/src/child_process/fork.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccaa75352c108d45e450d014fb6af5be228ae8fb347d9644e377c5435a4df8b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::date::parse::parse_iso8601 (cyclomatic 22): perry_runtime::date::parse::parse_iso8601 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/perry-runtime/src/date/parse.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea4d87d5d730e062d5d72cadd3ae64451ba319ce3f21303437a31052da7a6c6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::dyn_eval::interp::eval_class_expr (cyclomatic 22): perry_runtime::dyn_eval::interp::eval_class_expr 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/perry-runtime/src/dyn_eval/interp.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e5492852e2281b30213a78151b1b4c5cd50fc6a6bc41d21dda914b7b5f42bb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::gc::barrier::replay_old_parent_slot_range (cyclomatic 22): perry_runtime::gc::barrier::replay_old_parent_slot_range 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/perry-runtime/src/gc/barrier/mod.rs"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c5e8d644e33429d90dcb1f4b335b88bf6c4c4dd3a1c192bc061a939ae1ded3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::gc::oldgen::evacuation_policy_final_decision (cyclomatic 22): perry_runtime::gc::oldgen::evacuation_policy_final_decision 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/perry-runtime/src/gc/oldgen.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc53301256d503c9db29bf39728134c24166ea063a3aa12be79d6fcdb6e51f69"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::gc::verify::restore_surviving_dirty_coverage_impl (cyclomatic 22): perry_runtime::gc::verify::restore_surviving_dirty_coverage_impl 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/perry-runtime/src/gc/verify.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"f668ee9c4a83a998bce987a7530efb2ec82e1c1eb6fe88554f68eb33574d0e8f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::iterator_helpers::helper_next (cyclomatic 22): perry_runtime::iterator_helpers::helper_next 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/perry-runtime/src/iterator_helpers.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c55471f9234c2a2a186b7b078ddf77460fe8988874739032e32f379ddfb4ba"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json::replacer::dispatch_pointer_with_replacer (cyclomatic 22): perry_runtime::json::replacer::dispatch_pointer_with_replacer 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/perry-runtime/src/json/replacer.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"1773cbf1f56ea1a6afce8aeb6e782a1d5d2d980d015310e94784b1c3de6747d9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json::stringify_primitive_object::emit (cyclomatic 22): perry_runtime::json::stringify_primitive_object::emit 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/perry-runtime/src/json/stringify_primitive_object.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef651ee60564a721a2cea1e7bfb20411190bbdc180d9bf8875e5e714e8b549e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::module_require::js_require_resolve_node_modules (cyclomatic 22): perry_runtime::module_require::js_require_resolve_node_modules 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/perry-runtime/src/module_require.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"56960b6110e0933941fba020d7926183c079c6328661b273af513f65d50bd2ec"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::node_submodules::js_node_submodule_export_as_function (cyclomatic 22): perry_runtime::node_submodules::js_node_submodule_export_as_function 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. This shape REPEATS in the file: one other method here (perry_runtime::node_submodules::js_node_submodule_namespace_member) 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/perry-runtime/src/node_submodules/mod.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c2d77712dbd6a99d871fa9f83f6094c87f1c2ef600e909ca760882975763c4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::node_submodules::js_node_submodule_namespace_member (cyclomatic 22): perry_runtime::node_submodules::js_node_submodule_namespace_member 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. This shape REPEATS in the file: one other method here (perry_runtime::node_submodules::js_node_submodule_export_as_function) 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/perry-runtime/src/node_submodules/mod.rs"},"region":{"startLine":1834}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18d92901c550532860f3fa32a96cb05fa01dc75f628503afa8673970c130d6d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::class_constructors::replay_class_object_constructor_impl (cyclomatic 22): perry_runtime::object::class_constructors::replay_class_object_constructor_impl 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/perry-runtime/src/object/class_constructors.rs"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b201beaf197b5da08287b2add6dc72f5f0d460675696392de76c740a7ea79bf"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::descriptor_state::class_instance_set_may_intercept (cyclomatic 22): perry_runtime::object::descriptor_state::class_instance_set_may_intercept 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/perry-runtime/src/object/descriptor_state.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"605d63cc514fb8330d12d0e1cf605304265faeb6b7d4217aa6bbc8596f05aec1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::layout_desc::methods::perry_probe_family_method (cyclomatic 22): perry_runtime::object::layout_desc::methods::perry_probe_family_method 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/perry-runtime/src/object/layout_desc/methods.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a77d7ae0832a2e0f12a3322290513510b4ecc631e84915d19d54dc6a408815"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::method_site::read_holder::keyed::walk_to_key (cyclomatic 22): perry_runtime::object::method_site::read_holder::keyed::walk_to_key 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/perry-runtime/src/object/method_site/read_holder/keyed.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b0c6c459d26796cecb38e1fa42ca436bc4881138387c653b6d60a25f5dcad1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::object_ops::descriptor_helpers::nonconfigurable_redefine_allowed (cyclomatic 22): perry_runtime::object::object_ops::descriptor_helpers::nonconfigurable_redefine_allowed 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/perry-runtime/src/object/object_ops/descriptor_helpers.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfe615440e3fd7301eec2da4803f4bc4d3beaae2c48005d080653135c8588c9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::reflect_support::obj_value_has_own_key (cyclomatic 22): perry_runtime::object::reflect_support::obj_value_has_own_key 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/perry-runtime/src/object/reflect_support.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3a17e44aeeb0e88a0f74743902b57dd356eb15dca78eedb169febf7feac56d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::shapes::scan_shape_keys_address (cyclomatic 22): perry_runtime::object::shapes::scan_shape_keys_address 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/perry-runtime/src/object/shapes.rs"},"region":{"startLine":6336}}}],"partialFingerprints":{"codehealthFindingId/v1":"793e5cbb0b965c5091d0e8dc1650a04c1c88e84c657e2ef565e6a76bd57d5be0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::path::js_path_win32_resolve_join (cyclomatic 22): perry_runtime::path::js_path_win32_resolve_join 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/perry-runtime/src/path.rs"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"432760c2e82d6a7b4303b4e21b5afb1e02f906eef43534bd24c527145a215913"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::typedarray::access::classify_set_source (cyclomatic 22): perry_runtime::typedarray::access::classify_set_source 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/perry-runtime/src/typedarray/access.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7019dad010d88da24dfad29c66dd86a31b23ff43ed49a2815db66d3cc8c2a48"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::deforest::detect::analyze_producer (cyclomatic 22): perry_transform::deforest::detect::analyze_producer 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/perry-transform/src/deforest/detect.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0bd5b3f020564f84d0b89dd9883f82bddffe93e110b88adb7fe3a250eb48ee"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::call_inliner::fold_scalar_aggregate_param_length (cyclomatic 22): perry_transform::inline::call_inliner::fold_scalar_aggregate_param_length 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/perry-transform/src/inline/call_inliner.rs"},"region":{"startLine":1944}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b76b45bf40ab8d3675244faf9540bc072e94626ed4702bee68f87d6a1f0e7fe"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::factory_specialize::specialize_captured_class_factories (cyclomatic 22): perry_transform::inline::factory_specialize::specialize_captured_class_factories 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. This shape REPEATS in the file: 3 other methods here (perry_transform::inline::factory_specialize::specialize_captured_class_factories::visit_stmts, perry_transform::inline::factory_specialize::specialize_captured_class_factories::rewrite_call_init, perry_transform::inline::factory_specialize::specialize_captured_class_factories::rewrite_to_specialized_class) 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/perry-transform/src/inline/factory_specialize.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7beff0fee959219c9ec1c77a5181c5351346e2d62539a224cf1e5205573892"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::prop_cse::scan_stmt (cyclomatic 22): perry_transform::prop_cse::scan_stmt has cyclomatic complexity 22 (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/perry-transform/src/prop_cse.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e2eed1c2250b8e1651058c6dfdcc17bdcbde080d12cd2fc7e3fbf941cea156"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::unroll::refresh_in_expr (cyclomatic 22): perry_transform::unroll::refresh_in_expr 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/perry-transform/src/unroll/mod.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d17a16b9c05e3dbea12a62117ff7ff55780b3c6f203767446d47cf9edc1f4fd"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_android::state::state_set (cyclomatic 22): perry_ui_android::state::state_set 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/perry-ui-android/src/state.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc8c8a709b7e1f8b54220d35a575d20c77a9422c379bd7279ded6d99619be26"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_gtk4::camera::schedule_frame_processing (cyclomatic 22): perry_ui_gtk4::camera::schedule_frame_processing 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/perry-ui-gtk4/src/camera.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e470c232cc189a82205fd9725f70f7b066a6c26cfc0c29b15ca6bf05ed7b707"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_gtk4::widgets::canvas::create (cyclomatic 22): perry_ui_gtk4::widgets::canvas::create 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/perry-ui-gtk4/src/widgets/canvas.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edbc88e8409b4206313c811774338c3b3f574b71276652a8b90fec9bc487b4d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_ios::state::state_set (cyclomatic 22): perry_ui_ios::state::state_set 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/perry-ui-ios/src/state.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c000b86919d5fe5b9c6f283d1910528072ababd8009880347ffba33054867b5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_windows::state::state_set (cyclomatic 22): perry_ui_windows::state::state_set 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/perry-ui-windows/src/state.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"41401be4bf4dffc513bdbf13415897973ca2c3c80a16ede4dd004b05ba73044f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wasm_host::instantiate_with_import_callbacks (cyclomatic 22): perry_wasm_host::instantiate_with_import_callbacks 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/perry-wasm-host/src/lib.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5405500ed20bbc2def72015ef3e6974be5bc37c6b40b8f0794e2835798dc802"}},{"ruleId":"D1","level":"warning","message":{"text":"Gen::stand_in_value (cyclomatic 22): Gen::stand_in_value 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/perry-wpfacts/src/gen/class_values.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d66c4c4490dafa8d268f706084e80ca98f9e1b7a651d9e8b3b0cc908bfc40df"}},{"ruleId":"D1","level":"warning","message":{"text":"Gen::note_for_in_define_keys (cyclomatic 22): Gen::note_for_in_define_keys 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/perry-wpfacts/src/gen/for_in.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fc95299d22473c71cba8d3c5d49268fb0ad1b1f465656b5935bcb8c367acd2"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::admit_this (cyclomatic 22): Model::admit_this 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. This is NOT this file\u0027s highest cyclomatic complexity: Model::cons_line (cyclomatic 67) 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/perry-wpfacts/src/solve.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23178b3275c72510e32afbea2b5e41579e0e6da7ef1bf5611393e88d0bb316f"}},{"ruleId":"D1","level":"warning","message":{"text":"check_gc_doc_claims.self_test (cyclomatic 22): check_gc_doc_claims.self_test 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":"scripts/check_gc_doc_claims.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f2295cfc39c65ff91d5b061a6a9f68c6975bf634a05c2d21391a281f4b49e9"}},{"ruleId":"D1","level":"warning","message":{"text":"repsel_census.self_test (cyclomatic 22): repsel_census.self_test 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":"scripts/compiler_output_harness/repsel_census.py"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e235715b240bd6b692475ac66069e1aeb102628c127c722f8d71ddc279e26e5"}},{"ruleId":"D1","level":"warning","message":{"text":"component_http_p3_acceptance.client (cyclomatic 22): component_http_p3_acceptance.client 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":"scripts/component_http_p3_acceptance.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"151e8c08071fdbb3fb9f697ffdfc8abc4d7ef083fa250beefa739e4d5dbf0710"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_root_dominance_check.run_statepoints (cyclomatic 22): gc_root_dominance_check.run_statepoints 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":5456}}}],"partialFingerprints":{"codehealthFindingId/v1":"142ec51e210f66d5c58766b1c3d93858cca97d0b199de68faf9cb09e63a2c4f3"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_runtime_root_holders.inventory_problems (cyclomatic 22): gc_runtime_root_holders.inventory_problems 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":"scripts/gc_runtime_root_holders.py"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"69510f76222c4dfd3d9af8ce00c468721881b11bdce757246d16fe8c5c33f7b6"}},{"ruleId":"D1","level":"warning","message":{"text":"native_abi_evidence_report.release_symbol_summary (cyclomatic 22): native_abi_evidence_report.release_symbol_summary 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":"scripts/native_abi_evidence_report.py"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a0e9990da73c0a2800dc0d98d22818014ba22e519065b231d1d2afabb60a61"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime_abi_check.strip_comments (cyclomatic 22): runtime_abi_check.strip_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":"scripts/runtime_abi_check.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3eaee01bbd994648a2c71b626786914f149c6a2d1d92a6dde36f4f44cdb7379"}},{"ruleId":"D1","level":"warning","message":{"text":"statepoint_report_assert.main (cyclomatic 22): statepoint_report_assert.main 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":"scripts/statepoint_report_assert.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"701e3d2e982b86ee736dda7958340cd0c140a2bdffeadfdefba1c94aee6691e2"}},{"ruleId":"D1","level":"warning","message":{"text":"server_ab.build (cyclomatic 22): server_ab.build 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":"scripts/turnloop/server_ab.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"9545a6f2773ace4f0fd9bbd2c5102047d88b1dad92aa92897a64d1dc89e5bd99"}},{"ruleId":"D1","level":"warning","message":{"text":"wpfacts_corpus.run_corpus (cyclomatic 22): wpfacts_corpus.run_corpus 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":"scripts/wpfacts_corpus.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"f158ec6242a22a6dffdb01b5a395b3735ff3437aa1a155fa50e272a221e84032"}},{"ruleId":"D1","level":"warning","message":{"text":"renderer.createNativeRenderer.insertNode (cyclomatic 22): renderer.createNativeRenderer.insertNode 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":"packages/perry-solid/src/renderer.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca3947bcd30d917fca0394ab699eb6ef8fca5ebab3ab3ae41d99bf44ef82b51"}},{"ruleId":"D1","level":"warning","message":{"text":"node_compat_matrix.checkAgainstBaseline (cyclomatic 22): node_compat_matrix.checkAgainstBaseline 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":"scripts/node_compat_matrix.mjs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ab7c1748ffea4990759e016b0af859498a372df5ee946cf28df2fe50067f1d"}},{"ruleId":"D1","level":"warning","message":{"text":"objects-cache.saveIsolatedObjectsBundle (cyclomatic 22): objects-cache.saveIsolatedObjectsBundle has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 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":"upstream/actions/jdx/mr-boxington-action/src/objects-cache.ts"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"0325c77ddc06087f45db5fa2a8f548586643e0fa75d172b8ae4a6e9a33b26b41"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::extract_requires::deferred_function_sites (cyclomatic 21): perry::commands::compile::cjs_wrap::extract_requires::deferred_function_sites 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/perry/src/commands/compile/cjs_wrap/extract_requires.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea5645d51e98d1a877bb0d70a72aa0d5c8ae9ccc0ea133bda15913ffd6d4f50"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::tiny_program::analysis::analyze_module (cyclomatic 21): perry::commands::compile::tiny_program::analysis::analyze_module 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/perry/src/commands/compile/tiny_program/analysis.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e038f29767eb1f6bda9ea409f672a04edbcef70921577c766d3a7b5fc65c917b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::deps::dynamic_import_lines (cyclomatic 21): perry::commands::deps::dynamic_import_lines 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/perry/src/commands/deps.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa1d93789a6414850081f108df9fd7e2336e9e22a64714bbe910374d8b107b5"}},{"ruleId":"D1","level":"warning","message":{"text":"Names::stmts (cyclomatic 21): Names::stmts 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/perry-codegen/src/codegen/tdz_names.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8473223996ee4b04b26214a23133c0042349874fa079bc9720e2e1fdfe74ae"}},{"ruleId":"D1","level":"warning","message":{"text":"Walk::judge_stmts (cyclomatic 21): Walk::judge_stmts 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/perry-codegen/src/collectors/int_valued_i64_locals.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c931df9db6d6526d39e921b640b96e9be7cc0952286d21f69339386f893b666"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::expr (cyclomatic 21): Model::expr 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/perry-codegen/src/collectors/repsel_benefit.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df3786e7f5510bc6e86ced2df09daa24c98fe0d56d7a6d2fd40798fcca3a40e"}},{"ruleId":"D1","level":"warning","message":{"text":"Probe::stmt (cyclomatic 21): Probe::stmt 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/perry-codegen/src/collectors/sealed_buffers.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef8242bef71f2d534bea269ec4fa217eb9ed6140aef0abf8bee9793bca19c84"}},{"ruleId":"D1","level":"warning","message":{"text":"LlFunction::proof_dominates_block_end (cyclomatic 21): LlFunction::proof_dominates_block_end 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/perry-codegen/src/function/proof_dominance.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd874f80546dfbb0a46982f65868e7302308b452fffd1f9e1b0e85609702ecab"}},{"ruleId":"D1","level":"warning","message":{"text":"Flow::statements (cyclomatic 21): Flow::statements 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/perry-codegen/src/layout_desc/array_families.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fc940d8175cd5855f1feeabee3194f98c2bc22ba462edc696a9f20f49d11c1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::arguments::arguments_observed_on_every_path::observes (cyclomatic 21): perry_codegen::codegen::arguments::arguments_observed_on_every_path::observes 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/perry-codegen/src/codegen/arguments.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"481035d3019b1f1d7afb67b9d195235591aa27c5cf11bba3a185cf1570c8244f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::retained_source_pool::prepare_ranges (cyclomatic 21): perry_codegen::codegen::retained_source_pool::prepare_ranges 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/perry-codegen/src/codegen/retained_source_pool.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6f6e12c6a4f07aa871ae97b9262d2d3673350ee0b27cda80ea8662f0c96ea5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::split_regions_facts::max_local_id (cyclomatic 21): perry_codegen::codegen::split_regions_facts::max_local_id has cyclomatic complexity 21 (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/perry-codegen/src/codegen/split_regions_facts.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec5973ce1adcd8a91a4e72943c97defb76c45406c2e85584a41474ebbf0ae08"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::all_pointer_arrays::collect_all_pointer_array_locals (cyclomatic 21): perry_codegen::collectors::all_pointer_arrays::collect_all_pointer_array_locals 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/perry-codegen/src/collectors/all_pointer_arrays.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef536ff559eec182703a9c6c418d9765b4bbaf9dfaf9823cd976956bc28e587"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::definite_init::shallow_expr_at (cyclomatic 21): perry_codegen::collectors::definite_init::shallow_expr_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/perry-codegen/src/collectors/definite_init.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10c3b62436029796b887d38019b9d6c4308039688bdd05618eacfce59b07d92"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::escape_objects::find_object_literal_candidates (cyclomatic 21): perry_codegen::collectors::escape_objects::find_object_literal_candidates 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/perry-codegen/src/collectors/escape_objects.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1fec59b5181aea067129d421bcf9604764a9753c59c26c27fe62c75f3f7406"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::hoisted_callback_calls::walk_stmt (cyclomatic 21): perry_codegen::collectors::hoisted_callback_calls::walk_stmt 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/perry-codegen/src/collectors/hoisted_callback_calls.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2adb58c43425227b616f2df334f0f5b5d5cb9750f8bf722b264bb5d5552b6113"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::hot_callees::collect_alloc_hot_functions (cyclomatic 21): perry_codegen::collectors::hot_callees::collect_alloc_hot_functions 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/perry-codegen/src/collectors/hot_callees.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b16acf020444e45349759f9c150f1eee34a7f1414f3298778c58aa537b68b9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::i32_locals::walk_writes_for_strict (cyclomatic 21): perry_codegen::collectors::i32_locals::walk_writes_for_strict 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/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f9387e66c6b65f316d5b98dd921b5fe2c44c5f403aff742488a6a1dae1b2ff"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::loop_bounded_i32::collect_written_locals::walk (cyclomatic 21): perry_codegen::collectors::loop_bounded_i32::collect_written_locals::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/perry-codegen/src/collectors/loop_bounded_i32.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be3d99eb76a9d4d8ace91254a3fbacd24defe5debf3ad00fee3a21dd8f15272"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::loop_bounded_i32::for_each_let (cyclomatic 21): perry_codegen::collectors::loop_bounded_i32::for_each_let 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/perry-codegen/src/collectors/loop_bounded_i32.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c4fb0f4aeeb22d86378c7507415381bb377c5983eef95450665ab6871b5655"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::loop_bounded_i32::walk_accumulator_stmts (cyclomatic 21): perry_codegen::collectors::loop_bounded_i32::walk_accumulator_stmts 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/perry-codegen/src/collectors/loop_bounded_i32.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9eeaf7ccba7eb8013a6c2c724470f969e7dbe9f83c3caa268de163b630dc988"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::collect_facts (cyclomatic 21): perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::collect_facts 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: 4 other methods here (perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals, perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::expr_value_type, perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::collect_expr_writes_in_closure_stmts, \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/perry-codegen/src/collectors/pointer_locals.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbc3f8d7f030c1483e9acf9fdcc55ef15e3c23f26b2f53c286f7531c8b14fb2"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::read_before_write::da_expr (cyclomatic 21): perry_codegen::collectors::read_before_write::da_expr 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/perry-codegen/src/collectors/read_before_write.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e341c0272bfafcfb8fa8be38e40fdb2a269c9632359b8335d36900922928eff"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::uppercase_strings::check_uses_in_stmt (cyclomatic 21): perry_codegen::collectors::uppercase_strings::check_uses_in_stmt 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/perry-codegen/src/collectors/uppercase_strings.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a8d33b0b0821092b69bd95c3f2530af767cd86a0d45883cc60abf148b3186f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::buffer_access::lower_typed_array_store (cyclomatic 21): perry_codegen::expr::buffer_access::lower_typed_array_store 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/perry-codegen/src/expr/buffer_access.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"509ae42e92dcd7cc5f32d7a7874a017ddedacf1d604d1e5d51dc518458996b1f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::index_get::guarded_array::lower_guarded_array_index_get_with_index (cyclomatic 21): perry_codegen::expr::index_get::guarded_array::lower_guarded_array_index_get_with_index 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/perry-codegen/src/expr/index_get/guarded_array.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2d554c812c7e7555c7b007f6b5953810e43c18d74eebc86fd33c2a11565fa9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::shadow_slot::expr_is_known_non_pointer_shadow_value (cyclomatic 21): perry_codegen::expr::shadow_slot::expr_is_known_non_pointer_shadow_value 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/perry-codegen/src/expr/shadow_slot.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"46942016887c2bf175cbf8f211512b84e19ba45df25bdff6378df50836a93629"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::field_init::ctor_prologue_assigned_fields_inner (cyclomatic 21): perry_codegen::lower_call::field_init::ctor_prologue_assigned_fields_inner 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/perry-codegen/src/lower_call/field_init.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"af41ba2c93a54cbfe7da5e986aeaba6f5a7020737c7379527641b4e64cad057e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::opt_report::callbacks::scan_stmts (cyclomatic 21): perry_codegen::opt_report::callbacks::scan_stmts 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/perry-codegen/src/opt_report/callbacks.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"569f5559c5c7f5cd16cda05106f148519ea9f84afeaa4801750d350f8131dbe7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::number_local_loop::bounded_counter::match_plan (cyclomatic 21): perry_codegen::stmt::number_local_loop::bounded_counter::match_plan has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 8 of the 21 points are its own statements and the rest belongs to 2 function items inside it that branch (stmts_budget, expr_budget). 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/perry-codegen/src/stmt/number_local_loop/bounded_counter.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b39d7e444f6aea7cb3b1416247d762d9d25e9ba9715f442c4591ab434f07c0d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::stable_packed_accumulator::accumulator_rhs_is_numeric (cyclomatic 21): perry_codegen::stmt::stable_packed_accumulator::accumulator_rhs_is_numeric 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/perry-codegen/src/stmt/stable_packed_accumulator.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5950dfa880eac82ca071058c138ec0c4bb562097aa7f5f9fbdebf8b0026083c2"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::switch_stmt::lower_switch (cyclomatic 21): perry_codegen::stmt::switch_stmt::lower_switch 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/perry-codegen/src/stmt/switch_stmt.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"39cbd6e1984c8eeef5212706388e9e903e83b05d88355fd46aeffbf9bf1e3bca"}},{"ruleId":"D1","level":"warning","message":{"text":"JsEmitter::emit_class (cyclomatic 21): JsEmitter::emit_class has cyclomatic complexity 21 (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/perry-codegen-js/src/emit/decls.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ff58c0acb90c86b1e3f2a3d0628515516d495b9732182196222702d330fb38"}},{"ruleId":"D1","level":"warning","message":{"text":"JsEmitter::emit_module (cyclomatic 21): JsEmitter::emit_module has cyclomatic complexity 21 (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/perry-codegen-js/src/emit/mod.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87f976ad9fc842de2fc5a522cd3b72d9c0eab779540b89f42ef78a29ecf66a6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_wasm::emit::closures::collect_closures_from_stmts (cyclomatic 21): perry_codegen_wasm::emit::closures::collect_closures_from_stmts 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/perry-codegen-wasm/src/emit/closures.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bcfbd06cec6356d7bf8ebd0ab770ec8b2f742f5031a8fe73ea19b49bd54d4cf"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_wasm::emit::locals::resolve_export_to_let (cyclomatic 21): perry_codegen_wasm::emit::locals::resolve_export_to_let 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/perry-codegen-wasm/src/emit/locals.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c66cd294f8cdc3f9aede1a4f93fa4907a6837a2a041ce8ac117bb8edd881622"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_component_io::embedding::option (cyclomatic 21): perry_component_io::embedding::option 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/perry-component-io/src/embedding.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fdc13ce7f49a088cb5e8fe26e7fc53c61b4533c0f6e345502873ced0cafd177"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_container_compose::capabilities::unsupported_feature_names (cyclomatic 21): perry_container_compose::capabilities::unsupported_feature_names 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. This is NOT this file\u0027s highest cyclomatic complexity: perry_container_compose::capabilities::feature_satisfies (cyclomatic 25) 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/perry-container-compose/src/capabilities.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"84825a43c5b4da85b3871e5543d8617b1818ad7daf2e3eb6c4f28f09a18b7013"}},{"ruleId":"D1","level":"warning","message":{"text":"CensusScanner::visit_call_expr (cyclomatic 21): CensusScanner::visit_call_expr 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/perry-hir/src/proto_census.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02cb73eb2f8ebf8daedaff8f7425fb41fc958b7d6e0551c6c79b7aee3224154"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::analysis::replace_this_in_stmt (cyclomatic 21): perry_hir::analysis::replace_this_in_stmt 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/perry-hir/src/analysis.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"40230e34d217a500cdc7632b2686ed908a701255dac46c2cfd381ca4617aad0c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::analysis::fn_infer::apply::apply_stmts (cyclomatic 21): perry_hir::analysis::fn_infer::apply::apply_stmts 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/perry-hir/src/analysis/fn_infer/apply.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba2e101f85fe7cc78517c27a8e7650f3706a8694f632113cdbf9b4ad7b4a527"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::enums::fix_imported_enums_in_stmts (cyclomatic 21): perry_hir::enums::fix_imported_enums_in_stmts 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/perry-hir/src/enums.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ffc720bf8743318fa107ff81c1b73ca735990f628c630cf78df42aabd52125"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::const_fold_fn::try_direct_eval_this_fold (cyclomatic 21): perry_hir::lower::const_fold_fn::try_direct_eval_this_fold 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/perry-hir/src/lower/const_fold_fn.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db3ffb4578e1a5021d936e68166b5737aa507d4b6e6dfe4dd00d56837df60a7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::dynamic_eval::lower (cyclomatic 21): perry_hir::lower::dynamic_eval::lower 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/perry-hir/src/lower/dynamic_eval.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6333d7f9b4465cd57a0710bb9955d56b4b0ab3001ceb68c358c9e301b5b9208"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::intrinsics::namespace_static::try_namespace_static_method_apply_call_bind (cyclomatic 21): perry_hir::lower::expr_call::intrinsics::namespace_static::try_namespace_static_method_apply_call_bind 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/perry-hir/src/lower/expr_call/intrinsics/namespace_static.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d8a0a896aec59856f44b6c544c8e164830f6f1312d44f67cd8d0e91477e8ed"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::intrinsics::native_arena::try_native_arena_public_api (cyclomatic 21): perry_hir::lower::expr_call::intrinsics::native_arena::try_native_arena_public_api 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/perry-hir/src/lower/expr_call/intrinsics/native_arena.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba73514214e76413b4d250e092482d6035e25fc4da3cfa42e94252e6198df1fa"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::stream::register_super_stream_controller_params (cyclomatic 21): perry_hir::lower::expr_call::stream::register_super_stream_controller_params 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/perry-hir/src/lower/expr_call/stream.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fff0b5505485540b09d93bbcf739d7035915a780d03593a00c3ce935344f3e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::lower_expr::json_literal::is_large (cyclomatic 21): perry_hir::lower::lower_expr::json_literal::is_large 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/perry-hir/src/lower/lower_expr/json_literal.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8ee1c37cfd601b6c07316bdf66262966e97e647417d26576f830aa298f551a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::class_captures::closure_free_exprs_of_stmt (cyclomatic 21): perry_hir::lower_decl::class_captures::closure_free_exprs_of_stmt 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/perry-hir/src/lower_decl/class_captures.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"022abc4f5c6c479b49f45f48a674ccf20b355cba0bcc2b95c9d7d62fd6b9a813"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::class_members::lower_constructor_in_scope (cyclomatic 21): perry_hir::lower_decl::class_members::lower_constructor_in_scope 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/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"59eb5815aeba08d1152f1b384b6db1ab50a0fe6fbc34c5fd4e2c5be06efba727"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_patterns::unescape_template (cyclomatic 21): perry_hir::lower_patterns::unescape_template 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/perry-hir/src/lower_patterns.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1dfb97fd8714d35678a03363601750a719d93f3653280fd7e956263d7bc307a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::tdz_check::for_each_stmt_part (cyclomatic 21): perry_hir::tdz_check::for_each_stmt_part 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/perry-hir/src/tdz_check.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"452d9f250392cbb39319466621dac58ee0449f6294a806d51b80dc4bfd57b195"}},{"ruleId":"D1","level":"warning","message":{"text":"ArenaSweepObjectsState::apply_block_skip (cyclomatic 21): ArenaSweepObjectsState::apply_block_skip 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/perry-runtime/src/gc/oldgen/sweep_objects.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"192f133fb92941810a2073e29841530e592dbdb7a35460a34c24c8e89299650e"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonSourceParser::parse_string_token (cyclomatic 21): JsonSourceParser::parse_string_token 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/perry-runtime/src/json/reviver.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71b8d3baba571049532251fdad25aeb3787f53611f305b8add5cc1c45da5cc0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::from_concat::try_append_spread_array_dense (cyclomatic 21): perry_runtime::array::from_concat::try_append_spread_array_dense 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/perry-runtime/src/array/from_concat.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebad2ede06e558580f86ef6628dee71b2faf4dee7ba97c7d1d6fb4a2f668008"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::search::js_array_last_index_of_jsvalue (cyclomatic 21): perry_runtime::array::search::js_array_last_index_of_jsvalue 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/perry-runtime/src/array/search.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c1c819fb0b13e79672642b36b2ea3c0ba92c9d822f90aa914e4e49d4dcdae3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::subclass::build_dense_layout (cyclomatic 21): perry_runtime::array::subclass::build_dense_layout 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/perry-runtime/src/array/subclass.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9723360a66b4b38b4def0af7c035fad39b87bf60fd2c96cc39511c5d6b3249"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::bigint::convert::js_bigint_from_f64 (cyclomatic 21): perry_runtime::bigint::convert::js_bigint_from_f64 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/perry-runtime/src/bigint/convert.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0d32e677537e1ac32f90dccbbae7297c3ae3f12bc9331d3efd270148ec463d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::builtins::arithmetic::classify_value_typeof (cyclomatic 21): perry_runtime::builtins::arithmetic::classify_value_typeof 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/perry-runtime/src/builtins/arithmetic.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"334c1697e622cf47331da098cd5f785a6e3b060dde1c264c9ab528a08b39ffa5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::builtins::numbers::float_prefix_end (cyclomatic 21): perry_runtime::builtins::numbers::float_prefix_end has cyclomatic complexity 21 (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/perry-runtime/src/builtins/numbers.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b34e230cd3ccc3a62018f6ad62c06d553da4ad23115d2197fcb2bd7b28d089d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::closure::dispatch::bound::dispatch_bound_method (cyclomatic 21): perry_runtime::closure::dispatch::bound::dispatch_bound_method 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/perry-runtime/src/closure/dispatch/bound.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"9889139d34efbc77d1988e1ce6bd31db4e3381e9e8db19689d420da4e9af2085"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::date::parse::parse_clock_token (cyclomatic 21): perry_runtime::date::parse::parse_clock_token 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/perry-runtime/src/date/parse.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1967a36a193bac15b66f05751eaa2f145df4f75315658f957350878153c30be"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::gc::oldgen::evacuation_policy_snapshot_after_mark (cyclomatic 21): perry_runtime::gc::oldgen::evacuation_policy_snapshot_after_mark 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/perry-runtime/src/gc/oldgen.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"461cc31a1db6e10986cb77703979f5ea31e8b0a666bafcce511b2b41e25f1e31"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::gc::roots::stack_maps_unwind_windows::visit (cyclomatic 21): perry_runtime::gc::roots::stack_maps_unwind_windows::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/perry-runtime/src/gc/roots/stack_maps_unwind_windows.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"7699d8f60b79003636f51e7a63bf087a874596791162f244760ed1ba3a7502f1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::intl::number_format::currency_instance_parts (cyclomatic 21): perry_runtime::intl::number_format::currency_instance_parts 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/perry-runtime/src/intl/number_format.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aedb635c279f423a99c480ae30ca33102d1849219cdda31a6fff324e2ade394"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json::parser_depth_blocks::nesting_depth_exceeds (cyclomatic 21): perry_runtime::json::parser_depth_blocks::nesting_depth_exceeds 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/perry-runtime/src/json/parser_depth_blocks.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3bbfe5744e22c1ba5facd1a4441495eea69dbdee2296eb5fab6c182d65a8f29"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json::stringify_shape_template::build_shape_prefix_template (cyclomatic 21): perry_runtime::json::stringify_shape_template::build_shape_prefix_template 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/perry-runtime/src/json/stringify_shape_template.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b62ffbe5fc6e8b5fdd747309721423a068d6b76ac28c8039c5a3aad2dac3b6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::collection_proto_thunks::render_incompatible_receiver (cyclomatic 21): perry_runtime::object::collection_proto_thunks::render_incompatible_receiver 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/perry-runtime/src/object/collection_proto_thunks.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4a7271953db7eae4312853d45a294994c1a84b5a8220dc34bc28313531e199"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_set_by_name::fast_paths::try_readd_stable_tombstone (cyclomatic 21): perry_runtime::object::field_set_by_name::fast_paths::try_readd_stable_tombstone 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/perry-runtime/src/object/field_set_by_name/fast_paths.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e31f4f6ab5585fb76b470ddde4a84e8e8b92f4a5ae3fbef3f1591906847384a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::key_attrs::apply_edits (cyclomatic 21): perry_runtime::object::key_attrs::apply_edits 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/perry-runtime/src/object/key_attrs.rs"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e55302a630779c4c3b159680f33df86fb4cf64870fb43d8bd48f03d44d06e1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::shapes::object_proto_id_for (cyclomatic 21): perry_runtime::object::shapes::object_proto_id_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/perry-runtime/src/object/shapes.rs"},"region":{"startLine":5174}}}],"partialFingerprints":{"codehealthFindingId/v1":"47205053f8c0b85864b46fad7786e08eda99d2f8086933d58ebbbd401ea7786d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::string::quote::escaping::write_escaped_bytes_from (cyclomatic 21): perry_runtime::string::quote::escaping::write_escaped_bytes_from 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/perry-runtime/src/string/quote/escaping.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7633dd26882f1d79f581b85fa11aad7147ed3083d0306d21b097bf17eebdf1ed"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::symbol::iterator::js_object_get_own_property_symbols (cyclomatic 21): perry_runtime::symbol::iterator::js_object_get_own_property_symbols 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/perry-runtime/src/symbol/iterator.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a83c4901cfda767de5720a942c03b0a8ffd4724c312b2877351ee5945fe281"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::temporal::plain_date::get (cyclomatic 21): perry_runtime::temporal::plain_date::get 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/perry-runtime/src/temporal/plain_date.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9ba4a5ae8f1dd0705b0998d9041b70369651b454f19f684f44ce6aa0f1ae27"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::thread::parallel_filter_impl (cyclomatic 21): perry_runtime::thread::parallel_filter_impl 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/perry-runtime/src/thread.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"2794f8851513dfa7cc738ff97e1fe50f7f8176960f1667629ca599f8912746c9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::url::search_params::url_search_params_dynamic_call (cyclomatic 21): perry_runtime::url::search_params::url_search_params_dynamic_call 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/perry-runtime/src/url/search_params.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf0b07b0591becea556754d51b666610c919109c839d65afc87315be6e595d7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::fetch::dispatch::dispatch_response_property (cyclomatic 21): perry_stdlib::fetch::dispatch::dispatch_response_property 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. This is NOT this file\u0027s highest cyclomatic complexity: perry_stdlib::fetch::dispatch::dispatch_request_property (cyclomatic 27) 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/perry-stdlib/src/fetch/dispatch.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"25fe7ef3a05d724aa06e3027693262c3bcf3806c840b50c7c92add1c7da06f06"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::fetch::gc::scan_fetch_roots_with (cyclomatic 21): perry_stdlib::fetch::gc::scan_fetch_roots_with 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/perry-stdlib/src/fetch/gc.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ba34aab476ae93cf455d751cb99d1def5db2dcd3e5d63b923bdce0c1f39fd1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::sqlite::bind::bind_node_sqlite_params (cyclomatic 21): perry_stdlib::sqlite::bind::bind_node_sqlite_params 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/perry-stdlib/src/sqlite/bind.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ed77b27ee85927e791639b02ec946413d18666829a317d2368d8f6325f1c76"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::streams::js_reader_read (cyclomatic 21): perry_stdlib::streams::js_reader_read 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/perry-stdlib/src/streams.rs"},"region":{"startLine":2358}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19af77321fce69b1af73425581fc53a866e72c230f36ba0ca326baa72deed5f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::tls::dispatch::dispatch_tls_property (cyclomatic 21): perry_stdlib::tls::dispatch::dispatch_tls_property 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/perry-stdlib/src/tls/dispatch.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"970c0427401b6aa6a866c28e5845d4f90d74d24c9513004cd23a1e94f946b27d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::deforest::run (cyclomatic 21): perry_transform::deforest::run has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/deforest/mod.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba963c5bd84708b70b9fac23d784abaec8326db78b67af7494a2a948416af60f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::cross_module::walk_stmts (cyclomatic 21): perry_transform::inline::cross_module::walk_stmts 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: one other method here (perry_transform::inline::cross_module::walk_stmts_mut) 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/perry-transform/src/inline/cross_module.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd3f3df73debbb371f8b22e743f686bd10658fa59b917441ab7a9bcd9a5d56d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::cross_module::walk_stmts_mut (cyclomatic 21): perry_transform::inline::cross_module::walk_stmts_mut 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: one other method here (perry_transform::inline::cross_module::walk_stmts) 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/perry-transform/src/inline/cross_module.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"9714f465a72172a9951a59d2b663af9750ce4072faf73a1161a33c03bf7db4a3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::substitute::collect_body_local_ids::collect_from_stmt (cyclomatic 21): perry_transform::inline::substitute::collect_body_local_ids::collect_from_stmt has cyclomatic complexity 21 (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/perry-transform/src/inline/substitute.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18200b74ba6d03fb7f09776043a1e10d41eb8d55565b0154b4d78a8a4498b6d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::state_desugar::try_rewrite_state_access (cyclomatic 21): perry_transform::state_desugar::try_rewrite_state_access 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/perry-transform/src/state_desugar.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef08946ad7813e889713e6786b71071309b68c747d78b24edf42fa31ad05d8d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_macos::app::app_run (cyclomatic 21): perry_ui_macos::app::app_run has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-macos/src/app.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5e769119aa7330c7c2c3a2fb6c4b080db2a8fc012a9c03edce2d7b5703f472"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_macos::state::state_set (cyclomatic 21): perry_ui_macos::state::state_set 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/perry-ui-macos/src/state.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"09da802de009333453dbaef74c7f8e543132d717595b46f07ea4560cd95a9421"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_windows::pointer::dispatch_message (cyclomatic 21): perry_ui_windows::pointer::dispatch_message 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/perry-ui-windows/src/pointer.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc44b0cd53033f3428eecf1717f32878e3d9d34d4797b5280c434352eadc7fb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_windows::widgets::paint_shadow_for_child (cyclomatic 21): perry_ui_windows::widgets::paint_shadow_for_child 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/perry-ui-windows/src/widgets/mod.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec967ec18afe189660946e50fb8091fcbe211c79db14ab467d2c0f02e663c27"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_windows_winui::widgets::render_handle (cyclomatic 21): perry_ui_windows_winui::widgets::render_handle 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/perry-ui-windows-winui/src/widgets.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"4379d054737fb514635a6d395d1b81f69137b0ea34e728af50c79a615e7805d5"}},{"ruleId":"D1","level":"warning","message":{"text":"Gen::register_class (cyclomatic 21): Gen::register_class 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/perry-wpfacts/src/gen.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"85032f3c0a0629afa140721137747a304be5c0ddd8a4e5d2fa2195feac0d21cf"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::instance (cyclomatic 21): Model::instance 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. This is NOT this file\u0027s highest cyclomatic complexity: perry_wpfacts::summary::map_cons (cyclomatic 67) 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/perry-wpfacts/src/summary.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23d97ad028934cce70427ad99e6583fb144044925c0465343c3076b5c8a601a"}},{"ruleId":"D1","level":"warning","message":{"text":"check_ext_net_socket_open_invariant.mask_non_code (cyclomatic 21): check_ext_net_socket_open_invariant.mask_non_code 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":"scripts/check_ext_net_socket_open_invariant.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3740c7b5fca5b85d38b2b1c58cb2fa7086168d68d2fdcbc081a38ad9684a6aa9"}},{"ruleId":"D1","level":"warning","message":{"text":"verification._text_check_passes (cyclomatic 21): verification._text_check_passes 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":"scripts/compiler_output_harness/verification.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"592a27093821b3a8f76a915a88f6f6e9ad8441d8a713771a190a43a770665fd9"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_1090_evidence_report.benchmark_matrix (cyclomatic 21): gc_1090_evidence_report.benchmark_matrix 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":"scripts/gc_1090_evidence_report.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"4847601bcd20c957ff44baf5c90db96516b9c0b4fbc9910769217d3c4f0dee45"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_root_dominance_check._sp_seed_sites (cyclomatic 21): gc_root_dominance_check._sp_seed_sites 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":5592}}}],"partialFingerprints":{"codehealthFindingId/v1":"92814eb4bd375ec19cb0a3ee7a56b96b27022b680d360015557dfdb95c636387"}},{"ruleId":"D1","level":"warning","message":{"text":"global_sink_isolation.asserted_globals (cyclomatic 21): global_sink_isolation.asserted_globals has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/global_sink_isolation.py"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"708a8176247660f9d97a18514b615aa241222f4973adac2592871cfafd9a5cf9"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceIndex.sourcemap (cyclomatic 21): SourceIndex.sourcemap 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":"scripts/package_bench_attr.py"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ca92e7b3b38ebcbbd6a74cafcbc797796ef4d84bfd1ed74a3647219555ace9"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime_abi_check.check_ir (cyclomatic 21): runtime_abi_check.check_ir 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":"scripts/runtime_abi_check.py"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"496532c7b14278b4c7d98137e2d62e7d89291d547f4b7d50eec73d4e34e9768c"}},{"ruleId":"D1","level":"warning","message":{"text":"turnloop_p0_loop_stats.main (cyclomatic 21): turnloop_p0_loop_stats.main 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":"scripts/turnloop_p0_loop_stats.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"444e27a953bd97b9ccde27a5163449d66f224c4b024cf9282f9e1a52e63dde72"}},{"ruleId":"D1","level":"warning","message":{"text":"wpfacts_recompute.compare (cyclomatic 21): wpfacts_recompute.compare 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":"scripts/wpfacts_recompute.py"},"region":{"startLine":1420}}}],"partialFingerprints":{"codehealthFindingId/v1":"0559111c6a24e7e79e70390c696e09488de1b85ace6334c8ee28c2773a042fdf"}},{"ruleId":"D1","level":"warning","message":{"text":"color.parseColor (cyclomatic 21): color.parseColor 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":"packages/perry-styling/src/color.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a65b64ec2a9d81e0da17dda763e8674494b283e5654de2e6222eedee119a9b2"}},{"ruleId":"D1","level":"warning","message":{"text":"node_compat_matrix.parseArgs (cyclomatic 21): node_compat_matrix.parseArgs has cyclomatic complexity 21 (threshold 15). Of this number, 20 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":"scripts/node_compat_matrix.mjs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43d364c9320ef46d57a3b0cb86c3a7fd4a31c89100241916f07e071f61bff0f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::bootstrap::dump_hir_for_debug (cyclomatic 20): perry::commands::compile::bootstrap::dump_hir_for_debug has cyclomatic complexity 20 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/bootstrap.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5540c904a9da92a1e7bf06ade7e44412a35b80638d653afd55d8fb59e46c9ad"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::cjs_link::stmt (cyclomatic 20): perry::commands::compile::cjs_link::stmt 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/perry/src/commands/compile/cjs_link.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ad7dd4f3fb7ffc7a6a75a0e3fdbe0723a3a4be9dc65c675ae2ef8d86b22d9d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::targets::compile_for_watchos_widget (cyclomatic 20): perry::commands::compile::targets::compile_for_watchos_widget 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/perry/src/commands/compile/targets.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd6d143bc40a0f015381e6a610ed4052cb9bda9f4d1752c574b46f8003326ed"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::run::resign::create_dev_profile_via_api (cyclomatic 20): perry::commands::run::resign::create_dev_profile_via_api 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/perry/src/commands/run/resign.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c439a00df1006e44ee3c38bf5e920a8d66b6ba096a228748736a50f754c148a"}},{"ruleId":"D1","level":"warning","message":{"text":"Build::class (cyclomatic 20): Build::class 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: Reason::name (cyclomatic 33) 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/perry-codegen/src/codegen/source_need/flow.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb5894c53769bba0d57104779b80ccc738c632b87478369928e555ea9bde197"}},{"ruleId":"D1","level":"warning","message":{"text":"ProgramLayoutOrdinals::assign (cyclomatic 20): ProgramLayoutOrdinals::assign 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/perry-codegen/src/layout_ordinals.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f42af2ac1e59596360746b75e5c19f28582545bffd6eb108d37f1c89c17a21a"}},{"ruleId":"D1","level":"warning","message":{"text":"Rewrite::stmt (cyclomatic 20): Rewrite::stmt 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/perry-codegen/src/scope_env/pass.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1223209cf77f6d291a7d9d07f82b6c0ac2dedd4cce13c08fbda6aa3f453e4fe"}},{"ruleId":"D1","level":"warning","message":{"text":"Plan::body (cyclomatic 20): Plan::body 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/perry-codegen/src/stmt/indexed_owner_loop.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb18c2b6fa2ca8b168f9b29b872c6afcf0438e196853c7347b884bc73c68116d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::boxed_vars::collect_nested_closure_boxed_vars_in_stmt (cyclomatic 20): perry_codegen::boxed_vars::collect_nested_closure_boxed_vars_in_stmt 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 shape REPEATS in the file: 3 other methods here (perry_codegen::boxed_vars::collect_closure_refs_and_writes_in_stmt, perry_codegen::boxed_vars::collect_outer_writes_in_stmt, perry_codegen::boxed_vars::collect_write_ids_in_stmt) 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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"0646ba7e50f9def86f24526744dc5f267f340e6ff60651d36d6ffd3e9c8b8055"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::boxed_vars::collect_closure_refs_and_writes_in_stmt (cyclomatic 20): perry_codegen::boxed_vars::collect_closure_refs_and_writes_in_stmt 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 shape REPEATS in the file: 3 other methods here (perry_codegen::boxed_vars::collect_nested_closure_boxed_vars_in_stmt, perry_codegen::boxed_vars::collect_outer_writes_in_stmt, perry_codegen::boxed_vars::collect_write_ids_in_stmt) 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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4318d26f66780cb665b8abde0a73ea0ff25a539ac29526d22f36c985bba13e1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::boxed_vars::collect_outer_writes_in_stmt (cyclomatic 20): perry_codegen::boxed_vars::collect_outer_writes_in_stmt 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 shape REPEATS in the file: 3 other methods here (perry_codegen::boxed_vars::collect_nested_closure_boxed_vars_in_stmt, perry_codegen::boxed_vars::collect_closure_refs_and_writes_in_stmt, perry_codegen::boxed_vars::collect_write_ids_in_stmt) 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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"84dea1f4477bd8db0107906870c065deb38e46558014fc4646836aacbb345650"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::boxed_vars::collect_write_ids_in_stmt (cyclomatic 20): perry_codegen::boxed_vars::collect_write_ids_in_stmt 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 shape REPEATS in the file: 3 other methods here (perry_codegen::boxed_vars::collect_nested_closure_boxed_vars_in_stmt, perry_codegen::boxed_vars::collect_closure_refs_and_writes_in_stmt, perry_codegen::boxed_vars::collect_outer_writes_in_stmt) 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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa082ec8f08042b00a1b28aa09a48cea4e08e1c57c51da054373bd84b506609"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::emit_lowered_module (cyclomatic 20): perry_codegen::codegen::emit_lowered_module 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/perry-codegen/src/codegen/mod.rs"},"region":{"startLine":4491}}}],"partialFingerprints":{"codehealthFindingId/v1":"533e1701f913d3c8bbfbca98e9499800198adfc610f101aaa5e804eb7ffb6723"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::artifact_source_text::extend_class_method_source_text (cyclomatic 20): perry_codegen::codegen::artifact_source_text::extend_class_method_source_text has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/artifact_source_text.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb95627ede83a95d308ec056e5f7f322f23f49d6f445cd80ad812602b6d13982"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::param_guard::guarded_undefined_method_candidate::body_has_loop_guard (cyclomatic 20): perry_codegen::codegen::param_guard::guarded_undefined_method_candidate::body_has_loop_guard 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. This is NOT this file\u0027s highest cyclomatic complexity: perry_codegen::codegen::param_guard::encode_node (cyclomatic 21) 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/perry-codegen/src/codegen/param_guard.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee0d40af2c9001069b4369fd985c173adf49a4ef3fd62d7cc0ee039823c11b1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::split_regions_facts::declarations_to_assignments (cyclomatic 20): perry_codegen::codegen::split_regions_facts::declarations_to_assignments 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/perry-codegen/src/codegen/split_regions_facts.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"de85e70dc968d03d7454ccd10210e91faefc57be049cd1ac127e5f51470eb401"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::hot_callees::walk_stmt (cyclomatic 20): perry_codegen::collectors::hot_callees::walk_stmt 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/perry-codegen/src/collectors/hot_callees.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cba2167a2bd359d1affcf300342dd0da51bd9d95e0bf0a3869ccad3ee21960b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::integer_locals::int32_producing_deps (cyclomatic 20): perry_codegen::collectors::integer_locals::int32_producing_deps 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/perry-codegen/src/collectors/integer_locals.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"074f0bbc5762443c36e0b0076d00d065ae9380d51183f1b81447ce45e5dcee51"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::collect_expr_writes_in_closure_stmts (cyclomatic 20): perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::collect_expr_writes_in_closure_stmts 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 shape REPEATS in the file: 4 other methods here (perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals, perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::expr_value_type, perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::collect_facts, \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/perry-codegen/src/collectors/pointer_locals.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bf7057d2e14502591445a559242a5ba4e9756f47340f05cf32e2a5dcd31178"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::array_literal::emit_array_from_lowered_values (cyclomatic 20): perry_codegen::expr::array_literal::emit_array_from_lowered_values 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/perry-codegen/src/expr/array_literal.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"73abaef87a89a661dfd23d474f67deb3230b17c11c0bd1b626ac6cd8d5239a56"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::layout_read::run_value (cyclomatic 20): perry_codegen::expr::layout_read::run_value has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to one function item inside it that branches (free). 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/perry-codegen/src/expr/layout_read.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"4867f61b4b82d208389fc4f4ab296222f45e8cc5c270ee02106e687b7441fe05"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::inprocess::native_homes::publish_with_builder (cyclomatic 20): perry_codegen::inprocess::native_homes::publish_with_builder 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/perry-codegen/src/inprocess/native_homes.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff51c3d346bbb540179372260159ca0990fc4c27ce7ef4c3a0d8db217b08a7f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::ctor_prologue_stores::prologue_store_plan (cyclomatic 20): perry_codegen::lower_call::ctor_prologue_stores::prologue_store_plan 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/perry-codegen/src/lower_call/ctor_prologue_stores.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78c073933dd518e7131003e60b6b0634ebf9483d38f557682ab0e82d25a9ff9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::loops::emit_packed_f64_range_guards (cyclomatic 20): perry_codegen::stmt::loops::emit_packed_f64_range_guards 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":3346}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6fe25edd0b3abfb310f16427510e659da2bde20f3348f795f7f928e5317090a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::type_analysis::numeric::is_provably_not_bigint (cyclomatic 20): perry_codegen::type_analysis::numeric::is_provably_not_bigint has cyclomatic complexity 20 (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/perry-codegen/src/type_analysis/numeric.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"9988e6ff51e248ef2e5a35c4903506d5039a975172819b0532e20b5759fef95f"}},{"ruleId":"D1","level":"warning","message":{"text":"DockerProtocol::run_args (cyclomatic 20): DockerProtocol::run_args 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/perry-container-compose/src/backend/docker.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf42357940588bfe93719d35532aa729272c2c47d066bb3a49946ec38dc38539"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_http::client_turnloop::protocol::process (cyclomatic 20): perry_ext_http::client_turnloop::protocol::process has cyclomatic complexity 20 (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/perry-ext-http/src/client_turnloop/protocol.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ab4d96f3b46749cc89737c5061863bb16e110b8769699441b136cb871d833c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_net::classes::parse_rule_string (cyclomatic 20): perry_ext_net::classes::parse_rule_string 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/perry-ext-net/src/classes.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8e50341c7c655e82a4758ec8a4df5b58d11dccd6a5b4681489db4e7bdcbdbd"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_net::payload_socket::connect (cyclomatic 20): perry_ext_net::payload_socket::connect 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/perry-ext-net/src/payload_socket.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b36fd50554fec46045dc995ed7ece3acb7795002e1f55d87662b3fe63ec3af"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_net::payload_socket::end (cyclomatic 20): perry_ext_net::payload_socket::end 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/perry-ext-net/src/payload_socket.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"445419f2e0c54ffb7418ae2ca1f1d70108312fee7a26a9b7ac2adbe6770297fc"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::analysis::substitute_lexical_this_in_stmt (cyclomatic 20): perry_hir::analysis::substitute_lexical_this_in_stmt 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/perry-hir/src/analysis.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fe378bbc5fc94e72c2ae72de0a1a3b7a07ed11739ed1eac944c6353a0a8eb0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::dynamic_import::collect_module_const_locals (cyclomatic 20): perry_hir::dynamic_import::collect_module_const_locals has cyclomatic complexity 20 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/dynamic_import.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38f73230d8aafe8eea5e5baf3b801fed9d5da88ffdf117d87e46f92fef663a3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::builder_fold::fold_module_stmt_run (cyclomatic 20): perry_hir::lower::builder_fold::fold_module_stmt_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. This is NOT this file\u0027s highest cyclomatic complexity: perry_hir::lower::builder_fold::scan_stmt (cyclomatic 21) 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/perry-hir/src/lower/builder_fold.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc05d09e750d60bddc6590d9b73e394026053b2e9fd15105588e510c78eaab55"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::closure_analysis::widen_mutable_captures_stmt (cyclomatic 20): perry_hir::lower::closure_analysis::widen_mutable_captures_stmt 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/perry-hir/src/lower/closure_analysis.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff8abe7de810cfa379e57127fee55c4c1837918dc8e5d3b1b0afd48c29119b3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::intrinsics::native_arena::try_native_arena_intrinsics (cyclomatic 20): perry_hir::lower::expr_call::intrinsics::native_arena::try_native_arena_intrinsics 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/perry-hir/src/lower/expr_call/intrinsics/native_arena.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff0e020cca9a1b86f2482a17af3037791a039f9e69df93f4cb22303b1b28df3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::fn_ctor_env::indirect_eval_factory_shape (cyclomatic 20): perry_hir::lower::fn_ctor_env::indirect_eval_factory_shape 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/perry-hir/src/lower/fn_ctor_env.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"288807f3b70567649e0154c425d38caa99bf879d9cb8ac0f445b8afa7dd6d3f6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::lower_module_fn::reflect_script_var_initializers (cyclomatic 20): perry_hir::lower::lower_module_fn::reflect_script_var_initializers 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/perry-hir/src/lower/lower_module_fn.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cfc46a8ecee086add8a930be2a21abab0f813a1a19db3049284521efc39feb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::module_tdz::rw_stmt (cyclomatic 20): perry_hir::lower::module_tdz::rw_stmt 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/perry-hir/src/lower/module_tdz.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"faac7bc70bd582a08f3fd35e6072e62a6e79c1ab8dcbf3cea9667879a0dc3705"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::widget_decl::try_parse_family_switch (cyclomatic 20): perry_hir::lower::widget_decl::try_parse_family_switch 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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef68542cbff250f355acbab090e239f77d7e414ad1dcc7ebb1d2f21daf7a562"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::widget_decl::parse_widget_config_param (cyclomatic 20): perry_hir::lower::widget_decl::parse_widget_config_param 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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"1916347cb646ceaf3640c148728e9ae56239e0af14dff000654752c25b4965de"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_parser::strip_comments_and_strings (cyclomatic 20): perry_parser::strip_comments_and_strings 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/perry-parser/src/lib.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"7477a8c0a0b641c1bb2417470fe8136e0a6000de762d072c1bf7081f9ca38792"}},{"ruleId":"D1","level":"warning","message":{"text":"WalkerImage::decode_row (cyclomatic 20): WalkerImage::decode_row 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/perry-runtime/src/eh_walker.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb5d9e665fabb79c58d9a28dc520976c9e136f40ee767755d31901fca7bb0a3"}},{"ruleId":"D1","level":"warning","message":{"text":"RootScanCycleState::step_current_subphase (cyclomatic 20): RootScanCycleState::step_current_subphase 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/perry-runtime/src/gc/cycle.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7ba9af43918c4966182446854ee019805aa4f949076fad4b78952241d6a53a"}},{"ruleId":"D1","level":"warning","message":{"text":"SlotIter::next (cyclomatic 20): SlotIter::next 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/perry-runtime/src/gc/roots/stack_maps_lazy.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"18401644b9e778bb3e4d8fabb4f3aa3963d65c61f5286f039ef48a6aec897fda"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::array (cyclomatic 20): Writer::array 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/perry-runtime/src/thread/clone_write.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"189faf3b519aeeb275a085ad1853a35921c2e14911f1caf05d2026cd1dbc4065"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::concat_reverse::js_array_fill_generic (cyclomatic 20): perry_runtime::array::concat_reverse::js_array_fill_generic 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/perry-runtime/src/array/concat_reverse.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95a1574c33d23fd4b137531ac27b0c9d6ac7f9c0237a2d8202abd90db5b5407"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::indexing::try_strict_dense_number_store (cyclomatic 20): perry_runtime::array::indexing::try_strict_dense_number_store 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/perry-runtime/src/array/indexing.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"6732156fa9fcccd4fc03168a10d99fb7e41f01df5e2ee45124a40151d11dc02c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::numeric_range::array_numeric_range_add_impl (cyclomatic 20): perry_runtime::array::numeric_range::array_numeric_range_add_impl 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/perry-runtime/src/array/numeric_range.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7060cd598330193943323eb640679f556a75125921709dc2034952add09d97b6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::bun_compat::string_width::width_utf16 (cyclomatic 20): perry_runtime::bun_compat::string_width::width_utf16 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/perry-runtime/src/bun_compat/string_width.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50b8a5d8cb3c2a0ce352839d6fffd02bde4b667526ecad9a86ea36e7c19b4ca"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::dyn_eval::interp::bind_pattern (cyclomatic 20): perry_runtime::dyn_eval::interp::bind_pattern 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: perry_runtime::dyn_eval::interp::exec_stmt (cyclomatic 22) 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/perry-runtime/src/dyn_eval/interp.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad5ea2a83b034ad114d8c22c9e0e84723e6fe9b29a3912a75293424393b6505"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::fs::cp::js_fs_cp_options_result (cyclomatic 20): perry_runtime::fs::cp::js_fs_cp_options_result 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/perry-runtime/src/fs/cp.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e113e6db2eb524b3400bae8a43539994161373b35eba138fb659f59b409fb6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::gc::copying::remembered_scan::scan_remembered_dirty_slots_copying (cyclomatic 20): perry_runtime::gc::copying::remembered_scan::scan_remembered_dirty_slots_copying 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/perry-runtime/src/gc/copying/remembered_scan.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"803c0a6d4a5eb63ac7a94a89f6be68dcb221a10794ab5718890c6ec802273657"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::gc::fromspace_scan::scan_object (cyclomatic 20): perry_runtime::gc::fromspace_scan::scan_object 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/perry-runtime/src/gc/fromspace_scan.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1db96bf1f4f63b29b4281ca1fe9e99e68c02d37f49719f867b6091782313aa"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::gc::roots::stack_maps::fp_chain::visit (cyclomatic 20): perry_runtime::gc::roots::stack_maps::fp_chain::visit 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/perry-runtime/src/gc/roots/stack_maps.rs"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"930b26e8da81eaab7a7aeab25c026053a4805b2c801bd64ee3a151b4f73abab9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json::stringify_data_record::try_emit_with_live (cyclomatic 20): perry_runtime::json::stringify_data_record::try_emit_with_live 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/perry-runtime/src/json/stringify_data_record.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"6399fc0e7dbb97d803cc6e12193675fae55438b85ea82f32b932ce1dd696f457"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json_tape::iterative::materialize_iterative (cyclomatic 20): perry_runtime::json_tape::iterative::materialize_iterative 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/perry-runtime/src/json_tape/iterative.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfc675aea333d59afba4b9ca9c577013429284f1fb7521bde688b0b1b48f4fe"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::assign::positional_assign_target_is_safe (cyclomatic 20): perry_runtime::object::assign::positional_assign_target_is_safe 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/perry-runtime/src/object/assign.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c38b14910fe48ccb565ba27296cb701bc81cab72090bf0a60064ba94c5b6f9d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::class_constructors::entry::call_class_object_captured_entry (cyclomatic 20): perry_runtime::object::class_constructors::entry::call_class_object_captured_entry 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/perry-runtime/src/object/class_constructors/entry.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d6119d56b594055a510ea49f91c135c415674ccaa213364ade021d64be48ea"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::descriptor_state::holder_word_blocks_store (cyclomatic 20): perry_runtime::object::descriptor_state::holder_word_blocks_store 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/perry-runtime/src/object/descriptor_state.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2206d9a53f9187e9549c2c734385e293e5af0dec154b9b0629199cdb2adf55"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::instanceof::static_dispatch::instanceof_dispatch (cyclomatic 20): perry_runtime::object::instanceof::static_dispatch::instanceof_dispatch 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: perry_runtime::object::instanceof::static_dispatch::heap_builtin_name (cyclomatic 27) 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/perry-runtime/src/object/instanceof/static_dispatch.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"17433cae83b88707a67ee15fdaf18073ae9339af046b937141d0fec55a3fa6e8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::layout_desc::image_matches (cyclomatic 20): perry_runtime::object::layout_desc::image_matches 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/perry-runtime/src/object/layout_desc.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"123a8c4914ae592c2de5d3f2ae76258332d19602edcefe6b67590045aeb2dccb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::method_call::prepare (cyclomatic 20): perry_runtime::object::method_call::prepare 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/perry-runtime/src/object/method_call.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"5992be98bde3a74a7297af5aaa8ad81fe4608bd64ca7cdc5f89a164feea46bbb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::object_ops::define_property::define_property_on_handle (cyclomatic 20): perry_runtime::object::object_ops::define_property::define_property_on_handle 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/perry-runtime/src/object/object_ops/define_property.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacc4e2e5f2c83f686a77465b39faa95e95097c2bab487917b9428848c9a10cf"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::prototype_chain::object_set_static_prototype_impl_with (cyclomatic 20): perry_runtime::object::prototype_chain::object_set_static_prototype_impl_with 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/perry-runtime/src/object/prototype_chain.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"762eb822d6b20073e895a56fbd0b6e9d98bc64e69c85b3d668b8263183e870c0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::shape_mint_census::classify_mint (cyclomatic 20): perry_runtime::object::shape_mint_census::classify_mint 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/perry-runtime/src/object/shape_mint_census.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"371980ca4f8926f01460e55d6927d28968eb1bb81f79a5909a058dc59cfaf247"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::proxy::reflect::proxy_get_own_property_descriptor (cyclomatic 20): perry_runtime::proxy::reflect::proxy_get_own_property_descriptor 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/perry-runtime/src/proxy/reflect.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7bece6a64dec3b84c95ead7a28c1aeba5d984914771a33c965acb598e513c1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::regex::perex_literal_search::ascii_positions (cyclomatic 20): perry_runtime::regex::perex_literal_search::ascii_positions 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/perry-runtime/src/regex/perex_literal_search.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0206328b95ca50ea550688c7bc30d2c7c330cfd512ac8b825d90e4337a26f95"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::string::concat::concat_chain_sized (cyclomatic 20): perry_runtime::string::concat::concat_chain_sized 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/perry-runtime/src/string/concat.rs"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de3d314a3a0f15b3114126c153e5ecd18b1013d4c13d971cc63a8697e2a4a19"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::timer::gc_scan::scan_store_step (cyclomatic 20): perry_runtime::timer::gc_scan::scan_store_step 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/perry-runtime/src/timer/gc_scan.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a849c5d5dd0776049ecaf8b420e2be133143f6ae7ce940f234a02cf8828332a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::timer::handle_object::try_timer_method_fast_dispatch (cyclomatic 20): perry_runtime::timer::handle_object::try_timer_method_fast_dispatch 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/perry-runtime/src/timer/handle_object.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6faa69edc1c09c528fd73b34ce5f25832dc7af1a1d82b5a07ccd12fda9f0e6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::url::node_compat::legacy_url_format_impl (cyclomatic 20): perry_runtime::url::node_compat::legacy_url_format_impl 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/perry-runtime/src/url/node_compat.rs"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3dee55cf1015aa8f0b9f03e49545ff75e4aa0d3f03f12d2c8f5e42ea1d82c5f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::url::parse::resolve_url (cyclomatic 20): perry_runtime::url::parse::resolve_url 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/perry-runtime/src/url/parse.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"53684d500bfd7103798399224e86a2de7aba87b68e6934bc4009ecc4eca501ea"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::validators::received::describe_received_js (cyclomatic 20): perry_runtime::validators::received::describe_received_js 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/perry-runtime/src/validators/received.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a996aefd807f36b72604efb17b1e35c73e732a97509eee87df2e27b32b2e41a8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::webcrypto::kdf::js_webcrypto_derive_key (cyclomatic 20): perry_stdlib::webcrypto::kdf::js_webcrypto_derive_key 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/perry-stdlib/src/webcrypto/kdf.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffc4be8f1d5eb723403d9c4efc8add415c04bd8e50bfebfa763aca3775d2d75"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::worker_threads::js_worker_threads_worker_new (cyclomatic 20): perry_stdlib::worker_threads::js_worker_threads_worker_new 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/perry-stdlib/src/worker_threads.rs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26ef199c064edf21ccc3934cbbd4d7a7adaa5eaea839f0a7442fd88b93d2e92"}},{"ruleId":"D1","level":"warning","message":{"text":"Rewriter::stmt (cyclomatic 20): Rewriter::stmt 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 shape REPEATS in the file: 2 other methods here (perry_transform::crypto_hash_chain::for_each_stmt_expr, perry_transform::crypto_hash_chain::rewrite_refs_stmt) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/perry-transform/src/crypto_hash_chain.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b75573d0c0f5f38fa358223e8c7c7ec8def45be59ea41f076323a796b41314a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::aggregate_scalar::scalarize_return_record_candidate (cyclomatic 20): perry_transform::aggregate_scalar::scalarize_return_record_candidate 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/perry-transform/src/aggregate_scalar.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"84772a111111d00d9da0b69f12a6c9c91791e3ed2f0fe3215d407b212295f9f2"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::aggregate_scalar::rewrite_stmts (cyclomatic 20): perry_transform::aggregate_scalar::rewrite_stmts 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/perry-transform/src/aggregate_scalar.rs"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02c0d9db29d56cff9a8462942201031d4284aecfe7122808f15ad37d05cffd6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::crypto_hash_chain::for_each_stmt_expr (cyclomatic 20): perry_transform::crypto_hash_chain::for_each_stmt_expr 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 shape REPEATS in the file: 2 other methods here (Rewriter::stmt, perry_transform::crypto_hash_chain::rewrite_refs_stmt) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/perry-transform/src/crypto_hash_chain.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbc492032f7f1eea3b0b70f110a6e9b6fc6ca558466baf5915c52c566d62025"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::crypto_hash_chain::rewrite_refs_stmt (cyclomatic 20): perry_transform::crypto_hash_chain::rewrite_refs_stmt 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 shape REPEATS in the file: 2 other methods here (perry_transform::crypto_hash_chain::for_each_stmt_expr, Rewriter::stmt) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/perry-transform/src/crypto_hash_chain.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c74890f499a1ace877819860ef88ea7376dd17a7fba989ae71328efd68f0f7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::deforest::detect::flag_producer_calls_in_stmt (cyclomatic 20): perry_transform::deforest::detect::flag_producer_calls_in_stmt 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/perry-transform/src/deforest/detect.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a519967e7c33911ec03ea8677cab4bd0639278217cea74b0480e0b0fc75fd86"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::deforest::scan::scan_stmt_for_closures (cyclomatic 20): perry_transform::deforest::scan::scan_stmt_for_closures 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 shape REPEATS in the file: one other method here (perry_transform::deforest::scan::scan_stmt_funcrefs) 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/perry-transform/src/deforest/scan.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a758daa6634654370b1942653324c9bfd052adf07e068d23a5437617c6c8c0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::deforest::scan::scan_stmt_funcrefs (cyclomatic 20): perry_transform::deforest::scan::scan_stmt_funcrefs 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 shape REPEATS in the file: one other method here (perry_transform::deforest::scan::scan_stmt_for_closures) 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/perry-transform/src/deforest/scan.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8aa19232b1d6591f664c7232aa2c3f08d0f5c59f2f21654d38926944c59ac96"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::extern_imports::visit_stmt (cyclomatic 20): perry_transform::inline::extern_imports::visit_stmt 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/perry-transform/src/inline/extern_imports.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"4304b8ace35fda440d52c13b4f1d012118a43c12a15479f6fe97407cc1e45496"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::factory_specialize::specialize_captured_class_factories::visit_stmts (cyclomatic 20): perry_transform::inline::factory_specialize::specialize_captured_class_factories::visit_stmts 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 shape REPEATS in the file: 3 other methods here (perry_transform::inline::factory_specialize::specialize_captured_class_factories, perry_transform::inline::factory_specialize::specialize_captured_class_factories::rewrite_call_init, perry_transform::inline::factory_specialize::specialize_captured_class_factories::rewrite_to_specialized_class) 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/perry-transform/src/inline/factory_specialize.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f00d83700dbe30399242311d2fb5c74bd1b3150658605dec1226ad13532f08"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::unroll::escape_analysis::count_local_refs_stmt (cyclomatic 20): perry_transform::unroll::escape_analysis::count_local_refs_stmt 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/perry-transform/src/unroll/escape_analysis.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa00cc6881296027ecce620b93e3a97918d8433c51cac80620fac774ea4901ae"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_ios::audio_playback::perry_audio_load_sound (cyclomatic 20): perry_ui_ios::audio_playback::perry_audio_load_sound 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/perry-ui-ios/src/audio_playback.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e1828a0ff2472d4e43378c6137f9637f7f69e7dd74bb602fb40e1ed820eefe"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_macos::audio_playback::perry_audio_load_sound (cyclomatic 20): perry_ui_macos::audio_playback::perry_audio_load_sound 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/perry-ui-macos/src/audio_playback.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e96e541ea3d38a1e0c25f702656a6572533ef59d5950982dc358320c86f61cb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_tvos::audio_playback::perry_audio_load_sound (cyclomatic 20): perry_ui_tvos::audio_playback::perry_audio_load_sound 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/perry-ui-tvos/src/audio_playback.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20eebab4f33dde00d115dd67b22f2c0174e768f97966200e2fe999f3e8eef8c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_tvos::state::state_set (cyclomatic 20): perry_ui_tvos::state::state_set 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/perry-ui-tvos/src/state.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee100b06e308e9bca92cb8dad03304d6152dfa83054562e0a6124bf0378fe885"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_visionos::audio_playback::perry_audio_load_sound (cyclomatic 20): perry_ui_visionos::audio_playback::perry_audio_load_sound 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/perry-ui-visionos/src/audio_playback.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ad55a67cbb6683668920a50a37fe132389a4d2ff7531bde18a38c0b983e8ec"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_visionos::state::state_set (cyclomatic 20): perry_ui_visionos::state::state_set 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/perry-ui-visionos/src/state.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1acedfe7069c2f151e94be935a34883c9ae1117c890d7ba7a6e731dad75835aa"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_watchos::audio_playback::perry_audio_load_sound (cyclomatic 20): perry_ui_watchos::audio_playback::perry_audio_load_sound 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/perry-ui-watchos/src/audio_playback.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc131e2fecd63251e75b7317cbecf48cb0d04917fd3df370fb6de4ba9b9d7bd"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_windows::widgets::hstack::container_wnd_proc (cyclomatic 20): perry_ui_windows::widgets::hstack::container_wnd_proc 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/perry-ui-windows/src/widgets/hstack.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"6360106f9baff50e060c15a27a174309679cef12a427e05b1af20f482b55989e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_windows::widgets::vstack::container_wnd_proc (cyclomatic 20): perry_ui_windows::widgets::vstack::container_wnd_proc 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/perry-ui-windows/src/widgets/vstack.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"203fd2ead0cdf14073669c8f257be7612661c5e0e96ca8cf354788d0ec79a196"}},{"ruleId":"D1","level":"warning","message":{"text":"Dir::open_at (cyclomatic 20): Dir::open_at 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. This is NOT this file\u0027s highest cyclomatic complexity: perry_wasi::filesystem::from_raw_os_error (cyclomatic 27) 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/perry-wasi/src/filesystem.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"3175d3ae76a92e366ad4eac2f6a47f3d2d0639fcfe22534f53a61bc585891667"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wasi::http::server::wire::request (cyclomatic 20): perry_wasi::http::server::wire::request 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/perry-wasi/src/http/server/wire.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8b2975bd38a516d6d0fe16a176744f297c6460ec29fbba2fa8b3b057885831"}},{"ruleId":"D1","level":"warning","message":{"text":"Converter::definition (cyclomatic 20): Converter::definition has cyclomatic complexity 20 (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/perry-wit/src/resolve.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28eef1b09fd9db4ee1ac6919e694926587bd4794b779f8c174af7eeee7ba3b7"}},{"ruleId":"D1","level":"warning","message":{"text":"Gen::widen_stand_in (cyclomatic 20): Gen::widen_stand_in 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/perry-wpfacts/src/gen/class_values.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"7270dc6d0709276e848c394bacbf9dd53aef7a6c7f9cfd45b79efdcb0ba3604c"}},{"ruleId":"D1","level":"warning","message":{"text":"Gen::const_eval (cyclomatic 20): Gen::const_eval has cyclomatic complexity 20 (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/perry-wpfacts/src/gen_const.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82b6789e6289b2ca3b570d428364d1eb7ac4b006b0d5acd6f8d69dbbcb31373"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::escape_summarized (cyclomatic 20): Model::escape_summarized 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: perry_wpfacts::summary::map_cons (cyclomatic 67) 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/perry-wpfacts/src/summary.rs"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4402b7d63d83e14051297766a9e9111a11093b48570c49bdbc50b9677466916"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::bindings::collect (cyclomatic 20): perry_wpfacts::bindings::collect has cyclomatic complexity 20 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 6 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/perry-wpfacts/src/bindings.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"b285c433e4a81c0780c20000855254777dd64a02cb59546227b25d0cce9ca746"}},{"ruleId":"D1","level":"warning","message":{"text":"gc-paired-instruction-domains-v1.run (cyclomatic 20): gc-paired-instruction-domains-v1.run 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":"docs/audits/gc-rss-instructions-2026-10-03/gc-paired-instruction-domains-v1.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f2e853a289522833b5cba5b196ea3c37dd42360b8835963631d8630f5e15fa"}},{"ruleId":"D1","level":"warning","message":{"text":"addr_class_inventory.main (cyclomatic 20): addr_class_inventory.main has cyclomatic complexity 20 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/addr_class_inventory.py"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41c700d15dd82c7cdf6addce88bff40e5dbdaf58e4896ec2b9736943f4b6be0"}},{"ruleId":"D1","level":"warning","message":{"text":"buffer_b1_validate.measure (cyclomatic 20): buffer_b1_validate.measure 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":"scripts/buffer_b1_validate.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a07e5b56258a5abafa50babdf5e1daedcb5bc51abfcf435fb251ec28f5eb8f8"}},{"ruleId":"D1","level":"warning","message":{"text":"buffer_b4_validate.measure (cyclomatic 20): buffer_b4_validate.measure 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":"scripts/buffer_b4_validate.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"446f8abe8dc9fc8aa0f5ed65418daef6e190d7be61812302d5d4e86cbfbcfcc1"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_root_dominance_check.parse_file (cyclomatic 20): gc_root_dominance_check.parse_file 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"3584c091c82d33ab482c3d1422fa220f4e927fe9665e690320c9d6867a6cd919"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_root_dominance_check.loop_carried_blocks (cyclomatic 20): gc_root_dominance_check.loop_carried_blocks 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":2138}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d1fa4f7edbd79e0bbfb10875abee00ad7e2a4db386ea66dca44a5284ce0176"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_store_site_inventory.run_self_tests (cyclomatic 20): gc_store_site_inventory.run_self_tests 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":"scripts/gc_store_site_inventory.py"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"102a72f370908844dbd6ad4839a7eb3e6a2726965a4cbbdc04a27723f7d7445c"}},{"ruleId":"D1","level":"warning","message":{"text":"node_suite_regression_check.main (cyclomatic 20): node_suite_regression_check.main has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/node_suite_regression_check.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4baafa80224e8745943b74fb97da52b599014430b39560e730439292ad0aaa2a"}},{"ruleId":"D1","level":"warning","message":{"text":"package_bench_attr.classify (cyclomatic 20): package_bench_attr.classify 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":"scripts/package_bench_attr.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d926a77b2dcfd107612e26385ffade013215220aa8295b413b1bfb2548e8cee"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime_abi_check.compare_slot (cyclomatic 20): runtime_abi_check.compare_slot 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":"scripts/runtime_abi_check.py"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b365a4e3cc3e34e463f63a7454375a3a9f3d15a1ffced6a049f10774bc16b2"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime_rss_ab.main (cyclomatic 20): runtime_rss_ab.main has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/runtime_rss_ab.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f236e144a860d5c2e1e3a395ca87c543d01e2fc18b2cbf052f11a4b805b0da"}},{"ruleId":"D1","level":"warning","message":{"text":"tokio_inventory.main (cyclomatic 20): tokio_inventory.main has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/tokio_inventory.py"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"708e1a1069b3eae8dd28dae31f347422220a81f3975e183ff0fbfc45838c5734"}},{"ruleId":"D1","level":"warning","message":{"text":"web_runtime.perry_ui_canvas_draw_image (cyclomatic 20): web_runtime.perry_ui_canvas_draw_image 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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6b234680ebdddd048f0cf86db7aa394ff08cd277834ffbe4b14c3e2beb1017"}},{"ruleId":"D1","level":"warning","message":{"text":"web_runtime._renderTokenizedLine (cyclomatic 20): web_runtime._renderTokenizedLine 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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":2642}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f36fa4fb63f03810463f2d7c9d85dd865a1506b12c471ce02b2e453cdaf1ff"}},{"ruleId":"D1","level":"warning","message":{"text":"wasm_runtime.perry_ui_canvas_draw_image (cyclomatic 20): wasm_runtime.perry_ui_canvas_draw_image 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/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":3554}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d2ffed2237bc76b5ffacc73fb91d867f09bdc8711db79ab7092ccf40e68934"}},{"ruleId":"D1","level":"warning","message":{"text":"platform-visibility.waitForPlatforms (cyclomatic 20): platform-visibility.waitForPlatforms 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":"scripts/publish/platform-visibility.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"833e83473a0dbade15fbecec1972539822a97dfce61cc84c7f821d85b770d166"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolve::visit_mut_expr (cyclomatic 19): Resolve::visit_mut_expr 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/perry/src/commands/compile/collect_modules/import_meta_resolve.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"59685d4b684c8171d6a4b237a469610a1366638521f4f7fa545a72c38df76a42"}},{"ruleId":"D1","level":"warning","message":{"text":"Fixer::find_any_in_ts_type (cyclomatic 19): Fixer::find_any_in_ts_type 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/perry/src/commands/fixer.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1937ac26127022f55721d97446629ffab408323ae8b12b5c1803ea332c4bce0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::bootstrap::named_exports::visit_stmt (cyclomatic 19): perry::commands::compile::bootstrap::named_exports::visit_stmt 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/perry/src/commands/compile/bootstrap/named_exports.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8dfeafdebf8c7253ce7664888570f53f5afd73cec629dd13b5c26360a1bd2b9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::link::harmonyos_objects::push_harmonyos_native_objects (cyclomatic 19): perry::commands::compile::link::harmonyos_objects::push_harmonyos_native_objects 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/perry/src/commands/compile/link/harmonyos_objects.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d6e1a46b0ffb0d2cbca7779f0de077794c34d600cdda8cdae977cf51a19317"}},{"ruleId":"D1","level":"warning","message":{"text":"Facts::expr (cyclomatic 19): Facts::expr 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/perry-codegen/src/codegen/opts/computed_names.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"672c9b631d1a46d0f0cdb92e8d76870a49c2c2c2ab5c87322deb04370fff3f21"}},{"ruleId":"D1","level":"warning","message":{"text":"Build::solve (cyclomatic 19): Build::solve has cyclomatic complexity 19 (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. This is NOT this file\u0027s highest cyclomatic complexity: Reason::name (cyclomatic 33) 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/perry-codegen/src/codegen/source_need/flow.rs"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ca36db183d7b3da7e19794ae1cfed8602edabbdf0b026c99cfe3cf56aff2a3"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayFactCollector::collect_stmt (cyclomatic 19): ArrayFactCollector::collect_stmt 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/perry-codegen/src/collectors/hir_facts.rs"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d8c844ce3c9de9aff074fc21afccac0d4224c3fc92299aca8222d0dc06922e"}},{"ruleId":"D1","level":"warning","message":{"text":"PrefixContainedParamUse::walk_stmt (cyclomatic 19): PrefixContainedParamUse::walk_stmt 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/perry-codegen/src/collectors/proven_args.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"462196dec913c20cf50e8c859fef89716c2d23eaf3d66a0679c69db3229b4b21"}},{"ruleId":"D1","level":"warning","message":{"text":"Fns::collect (cyclomatic 19): Fns::collect 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/perry-codegen/src/collectors/read_before_write.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81ea2a5021c0a67ecb242529e5d22affc1d88ac2ae8074075b5f021bc11e6bb"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::stmt (cyclomatic 19): Model::stmt 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/perry-codegen/src/collectors/repsel_benefit.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"860945ad2e0df42ee0c8a39cdd54262b74a10e9c9436ccb6162c1132e39d421e"}},{"ruleId":"D1","level":"warning","message":{"text":"LlFunction::define_header_with_size_attrs (cyclomatic 19): LlFunction::define_header_with_size_attrs 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/perry-codegen/src/function.rs"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"68214140d8aad5305219d898720f4f05caee1bf91ce20fed1a7b7db7846031b8"}},{"ruleId":"D1","level":"warning","message":{"text":"Walk::visit (cyclomatic 19): Walk::visit 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/perry-codegen/src/providers.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"7948e5d1389c703c9816d7cbaa386aa8788e59fcd9ef97824d590e336dc5229a"}},{"ruleId":"D1","level":"warning","message":{"text":"Plan::expression (cyclomatic 19): Plan::expression 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/perry-codegen/src/stmt/indexed_owner_loop.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd1a6e34e28f85e9b41b244708d8eb5cc357e91a37eb87c9b2ad0c6fac49186"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::boxed_locals::collect_module_local_types (cyclomatic 19): perry_codegen::codegen::boxed_locals::collect_module_local_types has cyclomatic complexity 19 (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/perry-codegen/src/codegen/boxed_locals.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38e8810d6131bc726af3fd38e573393b2c60cb27cb79395307c454ef4efe469"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::fn_info_facts::record_fn_info_facts (cyclomatic 19): perry_codegen::codegen::fn_info_facts::record_fn_info_facts 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/perry-codegen/src/codegen/fn_info_facts.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"1529b20246638c9979bfb4f552bdf578930d6f62fd797a81591288d47febaaa0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::static_constfn::literal_final (cyclomatic 19): perry_codegen::codegen::static_constfn::literal_final 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/perry-codegen/src/codegen/static_constfn.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"34363a5bd7ae5471c7e594202a4fb2052c743aab7126273b801d77234ed9ab37"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::int_valued_ta_locals::additive_flow_stmt (cyclomatic 19): perry_codegen::collectors::int_valued_ta_locals::additive_flow_stmt 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/perry-codegen/src/collectors/int_valued_ta_locals.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa8426403b34d9e87ecb46ab8b4ed1d4c45a946905cf42b96c67e5dcaa9f988"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::int_valued_ta_locals::collect_int_valued_ta_locals (cyclomatic 19): perry_codegen::collectors::int_valued_ta_locals::collect_int_valued_ta_locals 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/perry-codegen/src/collectors/int_valued_ta_locals.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e750b23b004e96ade0e27441bf06c8c6ef6a4b61514391d41c0762c060e2724"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::mutation::flat_const_stmts_are_safe (cyclomatic 19): perry_codegen::collectors::mutation::flat_const_stmts_are_safe 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/perry-codegen/src/collectors/mutation.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbf4dc03f8b58698aef0d4db15b322b4d61375d8bb6c123261ce6c4f6702010"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::param_ranges::visit_stmt (cyclomatic 19): perry_codegen::collectors::param_ranges::visit_stmt 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/perry-codegen/src/collectors/param_ranges.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee78517e118b4807f21485150d00a64c4bc2afdc0f55ec60ef4ae4bd4ab0a4c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_returns::producer_return_class (cyclomatic 19): perry_codegen::collectors::ptr_shape_returns::producer_return_class 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/perry-codegen/src/collectors/ptr_shape_returns.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb853f9959fe816d9d134b77f5df8b67a737319c54a9eb1b93645dbd7d397547"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::this_as_value::stmts_use_this_as_value (cyclomatic 19): perry_codegen::collectors::this_as_value::stmts_use_this_as_value 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/perry-codegen/src/collectors/this_as_value.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5884d0c51fa86e31e93760e688117f2a0ca8e7fa7c438909846f02b9dca9b1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::dialect::types::basic_type (cyclomatic 19): perry_codegen::dialect::types::basic_type 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/perry-codegen/src/dialect/types.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f24188093b58b7f867c5f4c5b987fcd9e769c87a51a10abded33f3c12aaa9a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::lower_bitwise_operand_i32 (cyclomatic 19): perry_codegen::expr::lower_bitwise_operand_i32 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/perry-codegen/src/expr/mod.rs"},"region":{"startLine":4075}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23a2901d48a0453c2e4fd664ac27fbf23b4fb297f9d0f689e9bd2919e083a22"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::binary::lower_arithmetic_operand (cyclomatic 19): perry_codegen::expr::binary::lower_arithmetic_operand 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/perry-codegen/src/expr/binary.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"600faad4c91419eb89769b67788e6ca381e94de9a4f65f98f730591902fa7587"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::method_site::emit_method_site (cyclomatic 19): perry_codegen::expr::method_site::emit_method_site 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/perry-codegen/src/expr/method_site.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26fdc0df6630105a50b3bf4e0818df7dc8fe2a7ca6e9bb194cac60676764204"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::linker::find_clang (cyclomatic 19): perry_codegen::linker::find_clang 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/perry-codegen/src/linker.rs"},"region":{"startLine":1794}}}],"partialFingerprints":{"codehealthFindingId/v1":"79056e0c61ba7e742027cdb75a20987d77e43196f16f53e6dad9a21c59c6eae0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::console_promise::try_lower_promise_static_call (cyclomatic 19): perry_codegen::lower_call::console_promise::try_lower_promise_static_call 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/perry-codegen/src/lower_call/console_promise.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d09836ae2ddb11dcb96b93b6d393aab9db581a1534512cc86ccd963969158e1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::class_first_loop::resolve_guards_in_stmt (cyclomatic 19): perry_codegen::stmt::class_first_loop::resolve_guards_in_stmt 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/perry-codegen/src/stmt/class_first_loop.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"426069bc9578923f0a6d472cd44f1918dfe0622f8c135e408977e9fbc9a30494"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::if_stmt::lower_if (cyclomatic 19): perry_codegen::stmt::if_stmt::lower_if 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/perry-codegen/src/stmt/if_stmt.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d28f59ba108d8f5df7bafeaf75c9d6ae24bf418fceb2fe0dc331f4d3a3d24b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::loops::match_numeric_range_add_loop (cyclomatic 19): perry_codegen::stmt::loops::match_numeric_range_add_loop 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc3d183a9c007619493de53bf9742783d82f547c99ab167363a6b434589f4b5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::loops::classify_for_length_hoist_rejection (cyclomatic 19): perry_codegen::stmt::loops::classify_for_length_hoist_rejection 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":8403}}}],"partialFingerprints":{"codehealthFindingId/v1":"631907ca46d67837771a80f438e2e26f16321021016abef95a342d8500276bc1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::masked_window_region::expr_is_number_under (cyclomatic 19): perry_codegen::stmt::masked_window_region::expr_is_number_under 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/perry-codegen/src/stmt/masked_window_region.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aec879b73365aa9880936eb119dec220447acec57a92ccc07397d78c4bb776c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::number_local_loop::produces_number (cyclomatic 19): perry_codegen::stmt::number_local_loop::produces_number 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/perry-codegen/src/stmt/number_local_loop.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"047bd6f7e795befe8dea5ed776f36073c1e23e805d981edf556d90785c68c7a5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::region_loop::verify::verify (cyclomatic 19): perry_codegen::stmt::region_loop::verify::verify 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/perry-codegen/src/stmt/region_loop/verify.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"1424ea6d608bfd8ab2cc350624b5dab50cbf4e0b3c11df5752d57015c9176c66"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_arkts::inline::inline_calls_in_expr (cyclomatic 19): perry_codegen_arkts::inline::inline_calls_in_expr 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/perry-codegen-arkts/src/inline.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada836f0c6a7e9d8f5dac98e962ae1a7bd2bce514e2bfef8fdf349a2911ea706"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_arkts::media::module_uses_media (cyclomatic 19): perry_codegen_arkts::media::module_uses_media has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 4 of the 19 points are its own statements and the rest belongs to 2 function items inside it that branch (stmt_uses, expr_uses). 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/perry-codegen-arkts/src/media.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75efa68d626375ef271818565d0d2e87c5238cd25ff5b0d396cb6703df5166e"}},{"ruleId":"D1","level":"warning","message":{"text":"AppleContainerProtocol::run_args (cyclomatic 19): AppleContainerProtocol::run_args has cyclomatic complexity 19 (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/perry-container-compose/src/backend/apple.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a400dc7f806bd553831bc599a80c55454aa85e32c147327d4edffc2190597ff9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_http::validation::validate_client_options (cyclomatic 19): perry_ext_http::validation::validate_client_options 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/perry-ext-http/src/validation.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ebb9ee550162334304a5f7ccf91176c2c6336e278cbc320f24412006ebc048"}},{"ruleId":"D1","level":"warning","message":{"text":"Encoder::step (cyclomatic 19): Encoder::step 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/perry-ext-zlib/src/stream/driver.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b1555f19816720190ca987d19f0c4e74f7c7ffc83dac3af58fc9ade5a9299e"}},{"ruleId":"D1","level":"warning","message":{"text":"Encoder::step (cyclomatic 19): Encoder::step 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/perry-ext-zlib/src/stream/zlib_encoder.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"117147e1fc3f0c01fc2308062551e269ac7dde586ebb5f5528a3c330c655fc9d"}},{"ruleId":"D1","level":"warning","message":{"text":"HirTypeEnv::collect_stmt_declarations (cyclomatic 19): HirTypeEnv::collect_stmt_declarations 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/perry-hir/src/analysis/value_types.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f2a2a8ecf6d6e287eafd4b9f5e6ee66da8fade3035b78e5ad81b1075c6c0f1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::js_transform::local_natives::scan_stmt_for_user_class_instances (cyclomatic 19): perry_hir::js_transform::local_natives::scan_stmt_for_user_class_instances has cyclomatic complexity 19 (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. This shape REPEATS in the file: one other method here (perry_hir::js_transform::local_natives::scan_stmt_for_field_native_instances) 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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4e8952a4b463f90c023345511ceb2724ad7267fd0ce25db20119dac4a39e6e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::js_transform::local_natives::scan_stmt_for_field_native_instances (cyclomatic 19): perry_hir::js_transform::local_natives::scan_stmt_for_field_native_instances has cyclomatic complexity 19 (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. This shape REPEATS in the file: one other method here (perry_hir::js_transform::local_natives::scan_stmt_for_user_class_instances) 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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"2890a6ede5954d48081b771276807a0ea4195a4dbf1eb31de1e3d70aa659b6d4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::builder_fold_width_hints::hint_walk_stmt (cyclomatic 19): perry_hir::lower::builder_fold_width_hints::hint_walk_stmt 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/perry-hir/src/lower/builder_fold_width_hints.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2be3c0ee124a6a808a3e16b2eca67fe06e04e90f23d2675acf110eef3a478d5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::const_fold_fn::try_const_fold_function_construct_kind (cyclomatic 19): perry_hir::lower::const_fold_fn::try_const_fold_function_construct_kind 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/perry-hir/src/lower/const_fold_fn.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6476548882a9c1fc2ebd6b576c8e20695355781b08e5791abb36a51208940d0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::const_fold_fn::try_const_fold_eval (cyclomatic 19): perry_hir::lower::const_fold_fn::try_const_fold_eval 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/perry-hir/src/lower/const_fold_fn.rs"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b19afb13f15be218173f3061244c3c9c916b45b6291741ca4f22231768560ef"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::eval_super_scan::check_eval_illegal_abrupt::walk (cyclomatic 19): perry_hir::lower::eval_super_scan::check_eval_illegal_abrupt::walk 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/perry-hir/src/lower/eval_super_scan.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"933291b4dc3ada629ba0a38b442a2d6baf8b8fbf187080a7c7554e7c2787d2ef"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::lower_expr::assignment::lower_expr_assignment (cyclomatic 19): perry_hir::lower::lower_expr::assignment::lower_expr_assignment 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/perry-hir/src/lower/lower_expr/assignment.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f6f0c8e8e6137dcb03c5d2e094fcd3fa00204e2242855bca2439b3d926e9a2"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::lower_expr::reactive_text::try_desugar_reactive_text (cyclomatic 19): perry_hir::lower::lower_expr::reactive_text::try_desugar_reactive_text 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/perry-hir/src/lower/lower_expr/reactive_text.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc76c6f995d51504f82fcae3e8cb84b8264d188a8805d0f3b84d6d862cbb461"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals (cyclomatic 19): perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals 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. This shape REPEATS in the file: 2 other methods here (perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals::walk_stmt, perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals::collect_shadowing_decls) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/perry-hir/src/lower/pre_scan/weakref_locals.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c046de321b047ad3c177c19af5e5a41b2c9559a460736604f9f6129c11394e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::widget_decl::try_parse_widget_format_expr (cyclomatic 19): perry_hir::lower::widget_decl::try_parse_widget_format_expr 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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"78311c3973b5999ae2358d6aef812d528e57890d42b82375688ba442984a3687"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::enum_decl::enum_value_binding (cyclomatic 19): perry_hir::lower_decl::enum_decl::enum_value_binding 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/perry-hir/src/lower_decl/enum_decl.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b70e0d051b2286e4b4dbebf9bc3b265df80eb6c126bb8d986124922e36da14"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::monomorph::driver::monomorphize_with_context (cyclomatic 19): perry_hir::monomorph::driver::monomorphize_with_context 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/perry-hir/src/monomorph/driver.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5342b9e8b67d48110ad87a2f3c14ba92778ee338383304998bc91cbda3687c10"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::type_alias_resolve::fix_stmts (cyclomatic 19): perry_hir::type_alias_resolve::fix_stmts 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/perry-hir/src/type_alias_resolve.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"603598fa6028e86feaa70bbe5a6dbc04993dc789bebe52f67e6c3211da8c5d84"}},{"ruleId":"D1","level":"warning","message":{"text":"DirectParser::decode_chunk (cyclomatic 19): DirectParser::decode_chunk 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/perry-runtime/src/json/parser_escape_chunk.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8fa144a528a5689d7c6a40c175ac64d76275acf6ba4f1bd641dd5b65eff41e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::arena::page_meta::unregister_old_objects_batch (cyclomatic 19): perry_runtime::arena::page_meta::unregister_old_objects_batch 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/perry-runtime/src/arena/page_meta/mod.rs"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfcd47a5b6fbaa6c71fd7b9e3dd54b8053ebe93cdf1f935592343e931c73197e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::generic::real_array_mutator (cyclomatic 19): perry_runtime::array::generic::real_array_mutator 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 is NOT this file\u0027s highest cyclomatic complexity: perry_runtime::array::generic::dispatch_arraylike_read_method (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/array/generic.rs"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f2ea82cc01c985a7cd959922821ffc743f99b9f21985d0b49404ece082ee6c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::indexing::array_spec_set (cyclomatic 19): perry_runtime::array::indexing::array_spec_set 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/perry-runtime/src/array/indexing.rs"},"region":{"startLine":1766}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66e5529942f435fc89dd529d07d054546ff9499525c311369d8dd5c0e0d74a7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::indexing_proto_chain::array_index_get_walk (cyclomatic 19): perry_runtime::array::indexing_proto_chain::array_index_get_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/perry-runtime/src/array/indexing_proto_chain.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"74893b0a7187f06e52c3deb05d5d62e35b488f179ed24a167f959b1345c0142e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::sort_indices::sort_indices (cyclomatic 19): perry_runtime::array::sort_indices::sort_indices 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/perry-runtime/src/array/sort_indices.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e3027a19b11bf22621e1821f3f70e1d0370ab71081e94ae55a4b15e7216ece"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::subclass_packed_index::js_packed_arraylike_index_get (cyclomatic 19): perry_runtime::array::subclass_packed_index::js_packed_arraylike_index_get 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/perry-runtime/src/array/subclass_packed_index.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ee2546dbf10e070467d2b1901148da4bce4a1bae8a928e5fbef0b234356492"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::buffer::query::js_buffer_byte_length_value (cyclomatic 19): perry_runtime::buffer::query::js_buffer_byte_length_value has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs 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/perry-runtime/src/buffer/query.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"4065a24419b02e5f6155d49b741e40bf241a544775878d86ae69c8174e5c93de"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::builtins::console::js_console_log_dynamic (cyclomatic 19): perry_runtime::builtins::console::js_console_log_dynamic 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/perry-runtime/src/builtins/console.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1313e4b27e7d16428cc5568809d1cfbcdc599723333dc3dfaff3d4fa3021eb9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::builtins::numbers::js_parse_int (cyclomatic 19): perry_runtime::builtins::numbers::js_parse_int 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/perry-runtime/src/builtins/numbers.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"04922e4e6e07c7d0f8574929e4543d8ca96ce136bd119267210bfb8a8b11f75c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::component::http::pump::step (cyclomatic 19): perry_runtime::component::http::pump::step 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/perry-runtime/src/component/http/pump.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab71440ed47df0ca027767bcca3d32e1e15e2c520fc94ce77ef92b2cf081310"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::dns::resolve_build::build_resolve_value (cyclomatic 19): perry_runtime::dns::resolve_build::build_resolve_value 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/perry-runtime/src/dns/resolve_build.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29e44dbd2ccf45b7cd70b02add668f5156af8a7260d35266aadb068e6f9294c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::fs::dir_glob_watch::glob::run_bun_glob_result (cyclomatic 19): perry_runtime::fs::dir_glob_watch::glob::run_bun_glob_result 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/perry-runtime/src/fs/dir_glob_watch/glob.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e85b7b5dbfbf0e88ee79bc8c05a8e023631461dae0418b9d1cb382b1e256b45"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::fs::dirent::js_fs_readdir_sync (cyclomatic 19): perry_runtime::fs::dirent::js_fs_readdir_sync 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/perry-runtime/src/fs/dirent.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2efcfb407999587f9b6b917b40a0f6bff068b68a2bb885a33dba2a657ad0b1c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::gc::native_stack_scan::run_native_stack_scan (cyclomatic 19): perry_runtime::gc::native_stack_scan::run_native_stack_scan 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/perry-runtime/src/gc/native_stack_scan.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ea698cf3570926fb721d3c7111166f5fdb17b4d50610fd71597678661d6caf"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::gc::types::validate_gc_type_info (cyclomatic 19): perry_runtime::gc::types::validate_gc_type_info 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/perry-runtime/src/gc/types.rs"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"5017b7648b8dd04875755cdcd2ac8c5ad125702fd43d36574be82ecf60a32db9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::intl::duration_format::get_duration_unit_options (cyclomatic 19): perry_runtime::intl::duration_format::get_duration_unit_options 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/perry-runtime/src/intl/duration_format.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0c03f7b0da7fdc4a3baccb91a47988d0af026f3c81dc2fe379b2edb4c0a54d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json::parse_scalar::try_parse_scalar (cyclomatic 19): perry_runtime::json::parse_scalar::try_parse_scalar 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/perry-runtime/src/json/parse_scalar.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f625dfe980002a926fe5cc5e3eba564abcc693c2d477592a49eefa452b2c6d91"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json::stringify_flat::try_object (cyclomatic 19): perry_runtime::json::stringify_flat::try_object 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/perry-runtime/src/json/stringify_flat.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"76bd83b06229e71eeef8b9650925249151e4b804c413a4808f6cb0bb0b959d4b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json::stringify_record_output::emit_record (cyclomatic 19): perry_runtime::json::stringify_record_output::emit_record 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/perry-runtime/src/json/stringify_record_output.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"714b8f0860aef7d0ba52897793fa88a4d36c2986dc2d6745443756e06ed2d1df"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::node_stream_pipeline::run_collected_pipeline (cyclomatic 19): perry_runtime::node_stream_pipeline::run_collected_pipeline 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/perry-runtime/src/node_stream_pipeline.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"8944ba204cc95c667c9aa42bef96a7190b351a325644f2919f2103326d079812"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::node_stream_readwrite::drain_readable_from_events (cyclomatic 19): perry_runtime::node_stream_readwrite::drain_readable_from_events 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/perry-runtime/src/node_stream_readwrite.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a916c08cc7ed9f5d13f67b30ebbd68fd0c4ae7586e7a13adcacf493dc546e4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::builtin_method::js_bm_lookup (cyclomatic 19): perry_runtime::object::builtin_method::js_bm_lookup 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/perry-runtime/src/object/builtin_method.rs"},"region":{"startLine":1913}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebeedff975a217579883498628fb443d937d3cb7a94384b8716a3405df0b9b31"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::canonical_keys::static_seed::link_image_list (cyclomatic 19): perry_runtime::object::canonical_keys::static_seed::link_image_list has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/canonical_keys/static_seed.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd055c19a1e789023e65e8bb96b34b6b685449cb96f8ea5ef3908b75abf39d39"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::class_registry::gc_roots::class_side_table_root_snapshot (cyclomatic 19): perry_runtime::object::class_registry::gc_roots::class_side_table_root_snapshot 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/perry-runtime/src/object/class_registry/gc_roots.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2368897e21cbd09ee3c50a4da7e72c15740aa3b5f14f99e7a82480e5f3a593"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::class_registry::parent_static::js_register_class_computed_accessor (cyclomatic 19): perry_runtime::object::class_registry::parent_static::js_register_class_computed_accessor 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/perry-runtime/src/object/class_registry/parent_static.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2ec009bc39193d41ce1704ac0e7f5e324c5d7dcdcaa3a0748d64a322e6fa71"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::define_own_data::definition_admitted (cyclomatic 19): perry_runtime::object::define_own_data::definition_admitted 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/perry-runtime/src/object/define_own_data.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"78be73e361f436bbd6c2ca1b7f0ad96d93a5336e0b64643b4ae08e9a74a84fc4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::layout_probe::probe_accessor_word (cyclomatic 19): perry_runtime::object::layout_probe::probe_accessor_word 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/perry-runtime/src/object/layout_probe.rs"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebef707440c43cccda9158a15306046f6b9342c589d365c47e6af8fea7dc72a1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_call_method::class_receiver_fast_guard (cyclomatic 19): perry_runtime::object::native_call_method::class_receiver_fast_guard 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/perry-runtime/src/object/native_call_method.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2581114367fc9664bf68dbef004754387409006bf622211fae753337f55ca5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_call_method::compiled_target::compiled_target_call (cyclomatic 19): perry_runtime::object::native_call_method::compiled_target::compiled_target_call 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/perry-runtime/src/object/native_call_method/compiled_target.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ac9874e3466eddc79a32650746d5da5c5c06fdc5c47bd7dfa062d8d6f482ac"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_module::vtable_impls::vt_get_own_field (cyclomatic 19): perry_runtime::object::native_module::vtable_impls::vt_get_own_field 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/perry-runtime/src/object/native_module/vtable_impls.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8011b44964e3edfdf2a8ec797a7a60003a01ac526e73f5049715545309b524"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::shapes_integrity::transition_object_integrity (cyclomatic 19): perry_runtime::object::shapes_integrity::transition_object_integrity 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/perry-runtime/src/object/shapes_integrity.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfe807889a75759d4b0dfcc99cb54cf0fa8d131d91e2e83170728fdd2e619c9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::string::provenance::valid_wtf8_metadata (cyclomatic 19): perry_runtime::string::provenance::valid_wtf8_metadata 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/perry-runtime/src/string/provenance.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da7dcd9f6e6617533e0fb111a457fbd652a42404a1e0a0747ae87b1fa6efa4b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::url::parse::create_url_object (cyclomatic 19): perry_runtime::url::parse::create_url_object 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/perry-runtime/src/url/parse.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"785deb9d27e2fbe775bf38bce9a85de884f6f9456507cd7bf57aae29f0be5d60"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::url::parse::is_valid_absolute_url (cyclomatic 19): perry_runtime::url::parse::is_valid_absolute_url 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/perry-runtime/src/url/parse.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"0546e069a24aa8a81dd2ddf4cb7f3d7ce9fb62748e1b813b56ebb85a3812ac98"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::util_parse_args::parse_long_option (cyclomatic 19): perry_runtime::util_parse_args::parse_long_option 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/perry-runtime/src/util_parse_args.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c70d564038593a54dcc99963fd9e2ad1eb2063ac3eb8f005b0fa87da15f16a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::wpfacts_check::perry_wpfacts_check_field (cyclomatic 19): perry_runtime::wpfacts_check::perry_wpfacts_check_field 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/perry-runtime/src/wpfacts_check.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"887b2c3dff05194e51f61bbdd5622b7323e9658270670eff20fc3101c0f51a17"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::common::net_method_values::dispatch_property (cyclomatic 19): perry_stdlib::common::net_method_values::dispatch_property 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 is NOT this file\u0027s highest cyclomatic complexity: perry_stdlib::common::net_method_values::net_socket_method_name (cyclomatic 34) 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/perry-stdlib/src/common/net_method_values.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e73f4eea32c512536e913fd313b186d7896cdd11db07aba976cc50fc0aba932"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::readline::pump::js_readline_has_active (cyclomatic 19): perry_stdlib::readline::pump::js_readline_has_active 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. This is NOT this file\u0027s highest cyclomatic complexity: perry_stdlib::readline::pump::parse_keypress (cyclomatic 20) 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/perry-stdlib/src/readline/pump.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76a067cc5ac4984e7dcbdb5a23965b2cf822060477c6d5bf8dd2f01f8a94b78"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::streams::js_readable_stream_controller_enqueue (cyclomatic 19): perry_stdlib::streams::js_readable_stream_controller_enqueue 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/perry-stdlib/src/streams.rs"},"region":{"startLine":2088}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cde5f7b4966c0bc6c0e02e45ea9a32d947860f6f3fbcc962cd837ca1ce2486c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::turnloop_client::exchange::on_data (cyclomatic 19): perry_stdlib::turnloop_client::exchange::on_data 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/perry-stdlib/src/turnloop_client/exchange.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"59765d4c7dc2efc81ae92848c078a03d7fc5b16db5100cc7def6dcf9abe68d51"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::webcrypto::jwk::jwk_import_key_bytes (cyclomatic 19): perry_stdlib::webcrypto::jwk::jwk_import_key_bytes 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/perry-stdlib/src/webcrypto/jwk.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9984aeff14afe8c8d5d2e3f91f4c724d37341715143b60c5fa0d457bd7dff1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::async_to_generator::rewrite_stmt (cyclomatic 19): perry_transform::async_to_generator::rewrite_stmt 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/perry-transform/src/async_to_generator.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"61126dfe3b7db6046e3484ff26a52afb2bfd6a32b8f315a04a2d8352e4abead6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::finally_inline::inline_finally_into_returns (cyclomatic 19): perry_transform::finally_inline::inline_finally_into_returns 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/perry-transform/src/finally_inline.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ece46aafad4180d3fc5665421a764fbb5676f01d6433d0785b2d8a422d3c9e3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::generator::transform_generators (cyclomatic 19): perry_transform::generator::transform_generators 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/perry-transform/src/generator/mod.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ed65392f60643bca949974ac9f985ae308e79ca74da20e5508a72fb29e8cdc"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::generator::hoist_yields::hoist_yields_in_stmt (cyclomatic 19): perry_transform::generator::hoist_yields::hoist_yields_in_stmt 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/perry-transform/src/generator/hoist_yields.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f8b03cfbebcea667421f7e10509cc333bc9ef0be300d01ee9ff7aaa583119c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::generator::lower::fixed_state::record_step_kinds (cyclomatic 19): perry_transform::generator::lower::fixed_state::record_step_kinds has cyclomatic complexity 19 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 3 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/perry-transform/src/generator/lower/fixed_state.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5911205e480a7af1f46e6e01af4f5824f9ed23c3987da2eb58a44eaeaf154fa6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::analysis::body_calls_func::check_expr (cyclomatic 19): perry_transform::inline::analysis::body_calls_func::check_expr 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/perry-transform/src/inline/analysis.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"b625af397cba2fbde0a9e9faee1453dd7b023006c9ab48e9a6d500ec2cb0a6bf"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::state_desugar::rewrite_stmt (cyclomatic 19): perry_transform::state_desugar::rewrite_stmt 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/perry-transform/src/state_desugar.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d5ceba318ba67860739d590ce792f4fcf1c56cd8a20370f538a020327ceb98"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui::bin::styling-matrix::cmd_gen (cyclomatic 19): perry_ui::bin::styling-matrix::cmd_gen has cyclomatic complexity 19 (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/perry-ui/src/bin/styling-matrix.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f85bbd037fc35e579cf8694b040632895169db394aa1b1d73a19f6278be48b8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_windows::widgets::scrollview::scroll_wnd_proc (cyclomatic 19): perry_ui_windows::widgets::scrollview::scroll_wnd_proc 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/perry-ui-windows/src/widgets/scrollview.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccc5e1f57736e5680a5e16a3d09cb2a99283e0ceb1340af9e00ceb4f19da763"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator::generate (cyclomatic 19): Generator::generate 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/perry-wit/src/guest_c.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d5832c958713c6b0dab2be9c46d47f39cd702a65176bc5e72f975b6154626d"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator::function (cyclomatic 19): Generator::function 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/perry-wit/src/guest_c.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf1608ecbf1017fe5f2ff6e3022b6174c66d895c5856d72b8e486943444d154"}},{"ruleId":"D1","level":"warning","message":{"text":"Gen::closed_params (cyclomatic 19): Gen::closed_params 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/perry-wpfacts/src/gen/export.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b6f4c7dbc0ae5fe0eacc91559b7d91ff21c3b1643ebbbc3c95c3c49bafbbe1"}},{"ruleId":"D1","level":"warning","message":{"text":"Gen::compute_birth_keys (cyclomatic 19): Gen::compute_birth_keys 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/perry-wpfacts/src/gen/walk.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"282c2c30ecd44e6ae4de37e49dd8e447b493bb5c9a65dc507804d0c81f225b20"}},{"ruleId":"D1","level":"warning","message":{"text":"Gen::override_reports (cyclomatic 19): Gen::override_reports 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/perry-wpfacts/src/gen.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbbab9564ab49e43b5f3a9721d4a7087ec488202d7d5134657a8e488352123c"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::bind_args (cyclomatic 19): Model::bind_args 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/perry-wpfacts/src/solve/call_and_construct.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a344bc419f138721dc8225b288eb640c48a4768b96eb1105d44b8aa228de5e9"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::method_on (cyclomatic 19): Model::method_on 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/perry-wpfacts/src/solve/call_and_construct.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"97233bf6b78343e30575f6aa1e2371566a9d8ae99818fefc54d21268d61fd37a"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::wire_args (cyclomatic 19): Model::wire_args 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 is NOT this file\u0027s highest cyclomatic complexity: perry_wpfacts::summary::map_cons (cyclomatic 67) 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/perry-wpfacts/src/summary.rs"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d2972fc3e2f7ef9e63c3a1749e2d9441840dd4ee1d49e79a8e4bc595b44f3e"}},{"ruleId":"D1","level":"warning","message":{"text":"FnContract::join (cyclomatic 19): FnContract::join 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/perry-wpfacts/src/units.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f708a019c2c7b1e616a972d40740cb8de6af4345f743efb7d58e9654dbee6dc"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::builtins::collections::function_method (cyclomatic 19): perry_wpfacts::builtins::collections::function_method 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/perry-wpfacts/src/builtins/collections.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4661ea3a114a7edeb4b7dc1754cb76e4d584213f2a9fd4ab6831e82b4bd91730"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::dump::dump_text (cyclomatic 19): perry_wpfacts::dump::dump_text has cyclomatic complexity 19 (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/perry-wpfacts/src/dump.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"59491bce2c3f0fec762a581919781efdfc9f26ca255c7570a3bad0447180c573"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::dump::apply_sabotage (cyclomatic 19): perry_wpfacts::dump::apply_sabotage 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/perry-wpfacts/src/dump.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0997da98efe9d5d44f9b7ba2f1ce0c1663865cd901da32f8285ce01f680f93"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::summary::compose::compose (cyclomatic 19): perry_wpfacts::summary::compose::compose 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/perry-wpfacts/src/summary/compose.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71afc220616f980501a9884cb74216965ead079286aec14ecb0eabc7ab06eff"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-gc-window-v6r1-inputs.main (cyclomatic 19): verify-gc-window-v6r1-inputs.main 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":"docs/audits/gc-rss-instructions-2026-10-03/verify-gc-window-v6r1-inputs.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bcd031b448d594fdc8483b076edc5419f62ca02fd17bcf1667f3cd6edc06fb4"}},{"ruleId":"D1","level":"warning","message":{"text":"check_ext_net_socket_open_invariant.evaluate (cyclomatic 19): check_ext_net_socket_open_invariant.evaluate 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":"scripts/check_ext_net_socket_open_invariant.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c786b36b7e969296180f148d17738e990ba34c61f5dc9031077a9544a74d4d63"}},{"ruleId":"D1","level":"warning","message":{"text":"check_gc_scanner_latches.scan_source (cyclomatic 19): check_gc_scanner_latches.scan_source 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":"scripts/check_gc_scanner_latches.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac0ff89ad9c76ba12149fa6d658c8f7f49ce04b2ddd5eb1698b942bed3b1e54"}},{"ruleId":"D1","level":"warning","message":{"text":"class_id_collisions.main (cyclomatic 19): class_id_collisions.main has cyclomatic complexity 19 (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":"scripts/class_id_collisions.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a1a8ea351cb1b527efd1f7cc723d82446fea34324855a513d72f35ecb7671a"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_gate_wiring_check.main (cyclomatic 19): gc_gate_wiring_check.main 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":"scripts/gc_gate_wiring_check.py"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"83cf7538a6d3f77c292606a25996fd5a6963e614acfaabdafefeaf0d4f77fd92"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_rekeyed_key_tables.check (cyclomatic 19): gc_rekeyed_key_tables.check 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":"scripts/gc_rekeyed_key_tables.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"3232a413400d40743f8fb0594b0d9d56a32f5a966521ef13afc48ea37fb32302"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_runtime_root_holders.report (cyclomatic 19): gc_runtime_root_holders.report 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":"scripts/gc_runtime_root_holders.py"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca968e97aa0797f7c0f105b80c9d7ce4008a5724058aeada291ce5d41f54ede"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_store_site_inventory.check_codegen_claims (cyclomatic 19): gc_store_site_inventory.check_codegen_claims 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":"scripts/gc_store_site_inventory.py"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9252c8b12b0121d384c049984dc5b1407a26168d5ba3f9f21f043bd8da81d4"}},{"ruleId":"D1","level":"warning","message":{"text":"native_abi_evidence_report.explain_lowering_accounting (cyclomatic 19): native_abi_evidence_report.explain_lowering_accounting 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":"scripts/native_abi_evidence_report.py"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4129a0e541ee65fb5c559d641e89fa06533e55b46dd4e4aaac0eb21bd276c1"}},{"ruleId":"D1","level":"warning","message":{"text":"native_abi_evidence_report.packet_workload_contract (cyclomatic 19): native_abi_evidence_report.packet_workload_contract 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":"scripts/native_abi_evidence_report.py"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"572790076c8bea70fe799e5fc0545144828f22c1570b981448379c93cf997728"}},{"ruleId":"D1","level":"warning","message":{"text":"parity_report_merge.merge (cyclomatic 19): parity_report_merge.merge 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":"scripts/parity_report_merge.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"be04292f45790cc1bb256940723427abdbf7e4da6910a74fc0fd1eba67155993"}},{"ruleId":"D1","level":"warning","message":{"text":"raw_handle_debt.main (cyclomatic 19): raw_handle_debt.main 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":"scripts/raw_handle_debt.py"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"e061114b40d3ab085aca1108e8ea374c777b3a4500f1e60048d5632e15536a1f"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime_abi_check.expand_signature_macros (cyclomatic 19): runtime_abi_check.expand_signature_macros 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":"scripts/runtime_abi_check.py"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca963a98c430ca3dca7b271e92aa27f723f6403781be4e89af4debe52395f4b"}},{"ruleId":"D1","level":"warning","message":{"text":"subsystem_slots.main (cyclomatic 19): subsystem_slots.main 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":"scripts/subsystem_slots.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c661cfcb4e3cb31d488668e598eaf2235daaebc9fc2debc510db0c727e2b1c2"}},{"ruleId":"D1","level":"warning","message":{"text":"server_ab.main (cyclomatic 19): server_ab.main 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":"scripts/turnloop/server_ab.py"},"region":{"startLine":1795}}}],"partialFingerprints":{"codehealthFindingId/v1":"a580aedc7362204089ff03789f1b40ae28f4a59a38ccca9b709757748aaf389a"}},{"ruleId":"D1","level":"warning","message":{"text":"wasi_image_selftest.main (cyclomatic 19): wasi_image_selftest.main 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":"scripts/wasi_image_selftest.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9d5e49033932986204a2ff1aac7ca23714119d6d8232b05353307085f7a6a5"}},{"ruleId":"D1","level":"warning","message":{"text":"Solver.escape (cyclomatic 19): Solver.escape 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":"scripts/wpfacts_recompute.py"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"825d6c80bfcb436b0f885fbc4d1aad972549349150a2572bef0e74c14d89a8a8"}},{"ruleId":"D1","level":"warning","message":{"text":"wasm_runtime._perry_audio_start_voice (cyclomatic 19): wasm_runtime._perry_audio_start_voice has cyclomatic complexity 19 (threshold 15). 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, 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/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4263}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8965455e62fd2dd16dee2a0b897ea97db6fc5e96b94e0005c0b03a181a6a467"}},{"ruleId":"D1","level":"warning","message":{"text":"binding_pins.checkOffline (cyclomatic 19): binding_pins.checkOffline 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":"scripts/binding_pins.mjs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0f6e836856ddb15b9b3f91405c701c3b54b070b5b40ef81e1ee1e07f397adf"}},{"ruleId":"D1","level":"warning","message":{"text":"nightly.main (cyclomatic 19): nightly.main has cyclomatic complexity 19 (threshold 15). 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, 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":"scripts/publish/nightly.mts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d133b4de028d7c24e90af8b56b2155d8b78907094e34aa3c4610bc3d6c9de6d5"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline.main (cyclomatic 19): pipeline.main 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":"scripts/publish/pipeline.mts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeedce7fcc6ac6f78a73b688fa0f78fd2f8b951e7b372db1ca3314e1205383a8"}},{"ruleId":"D1","level":"warning","message":{"text":"objects-cache.measureTree (cyclomatic 19): objects-cache.measureTree 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":"upstream/actions/jdx/mr-boxington-action/src/objects-cache.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c98b27e7213c5f369f7e27639418250ad03e92a8f72536a59a3ef9ebe38ea3"}},{"ruleId":"D1","level":"warning","message":{"text":"BuildCacheProbe::probe (cyclomatic 18): BuildCacheProbe::probe 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/perry/src/commands/compile/build_cache.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72dfcfa307bedd08c1d9429a319d82775e2a373b59371e32c39f8bc2a8ee1a4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::detect::has_top_level_esm (cyclomatic 18): perry::commands::compile::cjs_wrap::detect::has_top_level_esm 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 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/perry/src/commands/compile/cjs_wrap/detect.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb51831c07032c21943d17673114e26e97aedec26b85e345396d3968ae3fe1d8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::extract_exports::extract_object_literal_keys (cyclomatic 18): perry::commands::compile::cjs_wrap::extract_exports::extract_object_literal_keys 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/perry/src/commands/compile/cjs_wrap/extract_exports.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0efc5d6edc1241e2708f902f80dd67735b68c3fe6e219f3a425eb93a4b02b35"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::hoist_classes::top_level_class_names (cyclomatic 18): perry::commands::compile::cjs_wrap::hoist_classes::top_level_class_names 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/perry/src/commands/compile/cjs_wrap/hoist_classes.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc263411856d6a9b49f8066d9ad63cbb315b1d427a2d8928c3133cd4a36d9253"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::env_fold::eval_compare (cyclomatic 18): perry::commands::compile::env_fold::eval_compare 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/perry/src/commands/compile/env_fold.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"caedd010b47fa715aa57e4093c228b842edc1c73f32073d959a1622f82e227b2"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::targets::compile_for_ios_widget (cyclomatic 18): perry::commands::compile::targets::compile_for_ios_widget has cyclomatic complexity 18 (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/perry/src/commands/compile/targets.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ab1ae32f146d9da8b5db6fb1439a95f884cb74993085ce704732fadf83324f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::init::run (cyclomatic 18): perry::commands::init::run has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/init.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9482bf49f2651b53524784b5daab7931160fc0483286e00d2e63b50a010ce52d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::typecheck::parse_type_string (cyclomatic 18): perry::commands::typecheck::parse_type_string 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/perry/src/commands/typecheck.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36fbf18fed527e9aab1b98e1e4decc4345e3f905d0a9aa7bd017db926fa3605"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::update_policy::run_teardown_action (cyclomatic 18): perry::update_policy::run_teardown_action 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/perry/src/update_policy.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c29149cdd2809337ab1f4d3a916301f86f6178373eadb22f67ad5819b4142d"}},{"ruleId":"D1","level":"warning","message":{"text":"ThisFlowAnalysis::stmt_this_safe (cyclomatic 18): ThisFlowAnalysis::stmt_this_safe 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/perry-codegen/src/collectors/ptr_shape_this_flow.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d57f38b9fc103a49d79ce31bfcddb21d2b211cfbbb938cfd34586bebdb60e6e"}},{"ruleId":"D1","level":"warning","message":{"text":"FnReader::value_inst (cyclomatic 18): FnReader::value_inst 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/perry-codegen/src/dialect/mod.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"00139c158a92223af6a5b08d9b8dcb488f50dc7e5a21a7bf4bf8b8674878afde"}},{"ruleId":"D1","level":"warning","message":{"text":"Factories::walk_classes (cyclomatic 18): Factories::walk_classes 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/perry-codegen/src/layout_families/late.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f0d8c557d5a526c0b4651c42fec2e542241ad7c4e4728ba64bf9f88e9f0704"}},{"ruleId":"D1","level":"warning","message":{"text":"Planner::stmt (cyclomatic 18): Planner::stmt 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/perry-codegen/src/stmt/region_loop/plan.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec187848a2b936f8b3756d711f8a63e40f235621733e85b6ca8d4b3fa91b296d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::boxed_vars::collect_compiler_private_async_control_locals_in_stmts_inner (cyclomatic 18): perry_codegen::boxed_vars::collect_compiler_private_async_control_locals_in_stmts_inner 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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b269c50d5f457b50cf3db6e256352405c3822c6500f5c05492af2bb72eabb5e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::split_regions::split_large_bodies_with_cost (cyclomatic 18): perry_codegen::codegen::split_regions::split_large_bodies_with_cost 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/perry-codegen/src/codegen/split_regions.rs"},"region":{"startLine":1850}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f729fd6a3a151008fa020c7905143a8435fbf5392cc5e8eca9d953c26eba83d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::static_constfn::static_method_lanes (cyclomatic 18): perry_codegen::codegen::static_constfn::static_method_lanes 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/perry-codegen/src/codegen/static_constfn.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"194306b85ce96a51d5db7c7b1222c362f8f61d4096f56faf8e001aa1477d3dbe"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::typed_abi::typed_receiver_chain_fields (cyclomatic 18): perry_codegen::codegen::typed_abi::typed_receiver_chain_fields 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. This is NOT this file\u0027s highest cyclomatic complexity: TypedCloneRejectionReason::as_str (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/perry-codegen/src/codegen/typed_abi.rs"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"613a832b7c5efd97af337228578a90b987977bdddc298a9f5e45bfc1114722e2"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::definite_init::for_each_stmt_expr (cyclomatic 18): perry_codegen::collectors::definite_init::for_each_stmt_expr 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/perry-codegen/src/collectors/definite_init.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"8761630e693f00f106d4a6b51353fc5165b3ca6624c98b258605611e605b2793"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::escape_check::find_new_candidates (cyclomatic 18): perry_codegen::collectors::escape_check::find_new_candidates 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/perry-codegen/src/collectors/escape_check.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"10adb08ac5e7311767aeb6687b0b98c479ab68d0e14bb1e5c768372778195685"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::hir_facts::collect_owned_buffer_lets (cyclomatic 18): perry_codegen::collectors::hir_facts::collect_owned_buffer_lets 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/perry-codegen/src/collectors/hir_facts.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02bcde52aff2792b3375e383849a8e116d0c26ea07c78a65ce440c13ea6c65c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::hot_callees::count_alloc_sites_in_stmts (cyclomatic 18): perry_codegen::collectors::hot_callees::count_alloc_sites_in_stmts 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/perry-codegen/src/collectors/hot_callees.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"458328907d38d539b4f6d75170c0989d99ff926ee67dffd0017dc201dcd3ad5b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::i32_locals::is_strictly_i32_bounded_expr (cyclomatic 18): perry_codegen::collectors::i32_locals::is_strictly_i32_bounded_expr 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/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d533697e2d3c4c7c4cc500f662a445fb6860177c4cb3262eaaa1a71f089f64"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::i32_locals::collect_integer_let_ids (cyclomatic 18): perry_codegen::collectors::i32_locals::collect_integer_let_ids 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/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"5001c983c8345dea2f2b22d7ea3fc50dc6413645583e01449d11e6569079c6d2"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_returns::collect_return_outcomes (cyclomatic 18): perry_codegen::collectors::ptr_shape_returns::collect_return_outcomes 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/perry-codegen/src/collectors/ptr_shape_returns.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed20284b50ec33f946cfe10df456dd0196cc90cda8bfa578af32369e5c364ca"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::scalar_method_dispatch::for_each_expr_in_stmt (cyclomatic 18): perry_codegen::collectors::scalar_method_dispatch::for_each_expr_in_stmt 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/perry-codegen/src/collectors/scalar_method_dispatch.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eee778ce1ef42e41f3938d228e07c53bd8d3f635de81f0edfa8f1476fa3e678"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::segview::classify_segment_uses_in_expr (cyclomatic 18): perry_codegen::collectors::segview::classify_segment_uses_in_expr 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/perry-codegen/src/collectors/segview.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7f7ded7431d404c9fba8f1b61abee40b2c20d8804a84f0dad9d3ab3027be73"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::typed_locals::collect_live_writes (cyclomatic 18): perry_codegen::collectors::typed_locals::collect_live_writes 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/perry-codegen/src/collectors/typed_locals.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f900cff05b83d9ab6d75fedd55c595517066a4a9c65199a9388a4e8cc3c544c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::dyn_extern_i18n::emit_i18n_template (cyclomatic 18): perry_codegen::expr::dyn_extern_i18n::emit_i18n_template 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/perry-codegen/src/expr/dyn_extern_i18n.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"443fc4680691a48a9131d8d4707ccee2ca98b75322c7dfbbd04f031471900960"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::i32_fast_path::region_i32_chain_magnitude_bits (cyclomatic 18): perry_codegen::expr::i32_fast_path::region_i32_chain_magnitude_bits 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. This is NOT this file\u0027s highest cyclomatic complexity: perry_codegen::expr::i32_fast_path::lower_expr_native (cyclomatic 19) 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/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b886fea54daa9be05d8ce9a8cf29e6ed14b6ef1448d8d52328b3ec05798574b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::layout_desc::create_families::binding_family (cyclomatic 18): perry_codegen::layout_desc::create_families::binding_family 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/perry-codegen/src/layout_desc/create_families.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfd67c1e6b0f7b0e9e7db233201a4ace9a80c3d6ba38ed679c4117fc7ce9d3c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::layout_desc::create_families::descriptor_attrs (cyclomatic 18): perry_codegen::layout_desc::create_families::descriptor_attrs 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/perry-codegen/src/layout_desc/create_families.rs"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d78febdaa01956239feca1c3b73a80569b930512a68adacd5e5852b2d9b4209"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::layout_families::visit_stmt (cyclomatic 18): perry_codegen::layout_families::visit_stmt 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/perry-codegen/src/layout_families.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb057337fffbcb271726c5f42beec2f28fac70709334d2607199d72c18c9b8d7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::new_helpers::emit_native_instance_base_init (cyclomatic 18): perry_codegen::lower_call::new_helpers::emit_native_instance_base_init 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. This is NOT this file\u0027s highest cyclomatic complexity: perry_codegen::lower_call::new_helpers::native_instance_base (cyclomatic 27) 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/perry-codegen/src/lower_call/new_helpers.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8bc0e52a21cafce3933e2ca4b9a9f834265d6c4e268494fc4a7f6f268df3d5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::property_get::lower_method_call_chain (cyclomatic 18): perry_codegen::lower_call::property_get::lower_method_call_chain 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/perry-codegen/src/lower_call/property_get.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"4404e7fae1faa3c365ac190fd050b33361fb83eea66f3cc5ce044c4f2b700b5f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::scalar_method::try_lower_scalar_replaced_method_call (cyclomatic 18): perry_codegen::lower_call::scalar_method::try_lower_scalar_replaced_method_call 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/perry-codegen/src/lower_call/scalar_method.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1b139e79901a6cfde1026595164b6057e17273a8338fe74192eba4caca60c2"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::if_stmt::try_const_fold_condition (cyclomatic 18): perry_codegen::stmt::if_stmt::try_const_fold_condition 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/perry-codegen/src/stmt/if_stmt.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"297303eeb638874fec2650bb16b7536dd3f390c0b0231675d668a7a7c2c648d1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_arkts::view_builders::rewrite_view_builder_calls_in_expr (cyclomatic 18): perry_codegen_arkts::view_builders::rewrite_view_builder_calls_in_expr 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/perry-codegen-arkts/src/view_builders.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7eb0cf384b916bf29a73fb841294354c1f6681d2d5537dc67416d016e73b644"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_arkts::widget_walks::walk_for_set_hidden_targets_in_expr (cyclomatic 18): perry_codegen_arkts::widget_walks::walk_for_set_hidden_targets_in_expr 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/perry-codegen-arkts/src/widget_walks.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"43573e9ea05b0753f5bc9393b3931462a7a86c93df052509411c1aee4cf78896"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_glance::emit::emit_node (cyclomatic 18): perry_codegen_glance::emit::emit_node 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/perry-codegen-glance/src/emit.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2548a02854f65ca6f86df9e061b071db48042e80c595c2071089df0f045a38"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_wasm::emit::scoped_js::scoped_js_names::visit (cyclomatic 18): perry_codegen_wasm::emit::scoped_js::scoped_js_names::visit 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/perry-codegen-wasm/src/emit/scoped_js.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e924321f0f5855ad6949867f537fa65ae998f45d480148844273eee4bf9e56"}},{"ruleId":"D1","level":"warning","message":{"text":"State::open_at (cyclomatic 18): State::open_at 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/perry-component-host/src/sync_wasi/filesystem.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e09cca381376017cfbd3a8f18f3c98d4f3b0ea03eadacd3d55be2ffc2628a4"}},{"ruleId":"D1","level":"warning","message":{"text":"Driver::new (cyclomatic 18): Driver::new 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/perry-component-io/src/lib.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8bd07dad988b6e28e22dcefb5d022593ea6de307afc6a15464082524dbae25a"}},{"ruleId":"D1","level":"warning","message":{"text":"AppleContainerProtocol::create_args (cyclomatic 18): AppleContainerProtocol::create_args has cyclomatic complexity 18 (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/perry-container-compose/src/backend/apple.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ecd254f618ef7473147a99589949ac418fa8ececdff5c741dbb670711e3fa3"}},{"ruleId":"D1","level":"warning","message":{"text":"ComposeEngine::down (cyclomatic 18): ComposeEngine::down 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/perry-container-compose/src/compose.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f45d9f1981af2dbd0337b13183a698a26059203fc73baecc3241f6fdb99b8ea"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_diagnostics::compat_report::verify_redaction_invariants (cyclomatic 18): perry_diagnostics::compat_report::verify_redaction_invariants 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/perry-diagnostics/src/compat_report.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1676174e906dd353a2d263214591f1a03a37dfa8de6cb73f8957bbed302808e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_http::agent::release_request (cyclomatic 18): perry_ext_http::agent::release_request 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/perry-ext-http/src/agent.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"959427be935f6a313642b9d1a860c90a3df5393eab10c0d1156e5e24bc33cbc7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_http::server::turnloop_h2::conn::pump (cyclomatic 18): perry_ext_http::server::turnloop_h2::conn::pump 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/perry-ext-http/src/server/turnloop_h2/conn.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"578594db1ce387a677c4977987e2b1b61f3ce02dd50bfd3ad900ca2a70901f08"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_http::server::turnloop_h2::stream::pump_outbox (cyclomatic 18): perry_ext_http::server::turnloop_h2::stream::pump_outbox 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/perry-ext-http/src/server/turnloop_h2/stream.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca9bce02d1afdaa65e7333492922bbe98c3b822d60320ce3931c3764c5400b9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_pdf::serde_json_lite::parse_string (cyclomatic 18): perry_ext_pdf::serde_json_lite::parse_string 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/perry-ext-pdf/src/lib.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee6916bcb8ae1c2801e99903cacb1d5ececa72aba198d432a26df548431f4c8"}},{"ruleId":"D1","level":"warning","message":{"text":"CensusScanner::visit_class (cyclomatic 18): CensusScanner::visit_class 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/perry-hir/src/proto_census.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"241af45d34de302d45e7af40b7e12526bec022d4047371dbf96ea24096cbd304"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::analysis::fn_infer::unit_stats (cyclomatic 18): perry_hir::analysis::fn_infer::unit_stats 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/perry-hir/src/analysis/fn_infer.rs"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1809e833e911506a38467c7af7fff2f70de47bc8d275ad0ed34bc37756f95e8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::analysis::value_types::infer_binary_type (cyclomatic 18): perry_hir::analysis::value_types::infer_binary_type 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/perry-hir/src/analysis/value_types.rs"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bfd2386a83f38e3304363560a7d96c52e8c50cb2776821d8e94e913a5c3491"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::js_transform::cross_module_natives::scan_expr_for_closure_returns (cyclomatic 18): perry_hir::js_transform::cross_module_natives::scan_expr_for_closure_returns 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/perry-hir/src/js_transform/cross_module_natives.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17d49b6cb5856b23cc355e3713817b37d65460dcadb5e9dcf9ebac271acd3b2"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::js_transform::local_natives::scan_stmt_for_native_instances (cyclomatic 18): perry_hir::js_transform::local_natives::scan_stmt_for_native_instances has cyclomatic complexity 18 (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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2e9c4a4f695d9e3208dbe9826928fb25a8a2f02b1946d584290e682050a073"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_assign::lower_ident_assignment (cyclomatic 18): perry_hir::lower::expr_assign::lower_ident_assignment 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/perry-hir/src/lower/expr_assign.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"252c963935a4d1d28d425c5947da0b3fa22754946d2c9caa5fa5206069f5a068"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_assign::compound_member_assign_once (cyclomatic 18): perry_hir::lower::expr_assign::compound_member_assign_once 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/perry-hir/src/lower/expr_assign.rs"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83e8555ab061f96886e2437867e984df74c27da47b60d38394d947d4f8d16e0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::post_args_dispatch::try_object_prototype_call (cyclomatic 18): perry_hir::lower::expr_call::post_args_dispatch::try_object_prototype_call 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/perry-hir/src/lower/expr_call/post_args_dispatch.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b44129dcc2a9bdfd5d1d74f032b274d9decb1c61ee7b020f0692e147bb3ddea"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_function::insert_class_capture_refresh_after_assignments (cyclomatic 18): perry_hir::lower::expr_function::insert_class_capture_refresh_after_assignments 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/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":1780}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4664fd4fb6995f0533602500ee88f6d8452cd5ec99201ae4d91ae5aaf8c654a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_member::stdlib_guard::stdlib_namespace_receiver (cyclomatic 18): perry_hir::lower::expr_member::stdlib_guard::stdlib_namespace_receiver 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/perry-hir/src/lower/expr_member/stdlib_guard.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"238aae755668a8bdff344844c4f592879d4244f4c9df578e2cf8da3036bbc261"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_new_builtins::global_member_constructor_name (cyclomatic 18): perry_hir::lower::expr_new_builtins::global_member_constructor_name 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/perry-hir/src/lower/expr_new_builtins.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"96538c1f0ceb1f2195672565cac574bc5c86651af3816a9257df591c214f7267"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_object::lower_accessor_prop (cyclomatic 18): perry_hir::lower::expr_object::lower_accessor_prop 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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3c07a1ffac6db70eafd2f1af3f190e1fdf1e6f9867e49f2e6f781d67fb86f5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::for_head::rewrite_collection_view_for_of (cyclomatic 18): perry_hir::lower::for_head::rewrite_collection_view_for_of 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/perry-hir/src/lower/for_head.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"f463c5c5abc6ea6e71c526b2d2dd626453cd8358384db59f03a6a08638edc032"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::global_eval_hoist::collect_nested_fn_decl_names_inner (cyclomatic 18): perry_hir::lower::global_eval_hoist::collect_nested_fn_decl_names_inner 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. This is NOT this file\u0027s highest cyclomatic complexity: perry_hir::lower::global_eval_hoist::var_hoisted_binds::stmt_has (cyclomatic 19) 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/perry-hir/src/lower/global_eval_hoist.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"03190e250bd34fb3ce1ef860dc1cb7a8c33f768b543325b51550c393564429b9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::pre_scan::pre_scan_mixin_functions (cyclomatic 18): perry_hir::lower::pre_scan::pre_scan_mixin_functions has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to one function item inside it that branches (try_record_fn). 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/perry-hir/src/lower/pre_scan.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"471c023b130d7e71d5bdea9b464d326bf8989b3e0597ed82eed3db5388469396"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::widget_decl::parse_widget_field_type (cyclomatic 18): perry_hir::lower::widget_decl::parse_widget_field_type 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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17e66d3cf7cae9717719279a2e029469dd9f9158ad97f14fd2597c7b3a8a4b2"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::widget_decl::reactive_animate::try_desugar_reactive_animate (cyclomatic 18): perry_hir::lower::widget_decl::reactive_animate::try_desugar_reactive_animate 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/perry-hir/src/lower/widget_decl/reactive_animate.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5d16ad4bbf82de2b87b1f4716a1593c012acadca16f97095dbeac1861e53a9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_types::collect_return_types (cyclomatic 18): perry_hir::lower_types::collect_return_types 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/perry-hir/src/lower_types.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa8c517d4a595679f5a7109e3b815f7c6ef03dbe123cc09e836292020504089"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::static_dynamic_code::specialize (cyclomatic 18): perry_hir::static_dynamic_code::specialize 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/perry-hir/src/static_dynamic_code.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"2874a6505e8443c6bb92737311a88aa3d373f4de602915e3e88f4bc3670f892e"}},{"ruleId":"D1","level":"warning","message":{"text":"GcCycleState::step_sweep (cyclomatic 18): GcCycleState::step_sweep 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/perry-runtime/src/gc/cycle.rs"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8e3bacdfe8a489bfea2fa3daec449835c2fa8c97f0ed686cbdc6d62a3006d2"}},{"ruleId":"D1","level":"warning","message":{"text":"ValidPointerSetBuilder::walk_census_block (cyclomatic 18): ValidPointerSetBuilder::walk_census_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/perry-runtime/src/gc/trace.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"4961af3b7d74ed0866a1e3467c0401943acc07814ad9d26d9265db36936eee6c"}},{"ruleId":"D1","level":"warning","message":{"text":"NamedStateKey::write_existing (cyclomatic 18): NamedStateKey::write_existing 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/perry-runtime/src/runtime_state_key.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb3f6ee5846a01ff3bf08ef9b6eb04308850d96740f8eb518dfd1cc03853851"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::arena::page_meta::unregister_block_generation (cyclomatic 18): perry_runtime::arena::page_meta::unregister_block_generation 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/perry-runtime/src/arena/page_meta/mod.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"e182f2be3a976ca138986aff828b3e95bf1a52d7f9ad693f1123893b53683fc2"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::from_concat::populate_from_iterable (cyclomatic 18): perry_runtime::array::from_concat::populate_from_iterable 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/perry-runtime/src/array/from_concat.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"917529073a8b5d4e271ca1d9b6c4f372d38a4be0d1afa99741e50f107937ab0b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::header::clean_arr_ptr_resolve (cyclomatic 18): perry_runtime::array::header::clean_arr_ptr_resolve 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/perry-runtime/src/array/header.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d92407d38470138c97c9b7e8492f7b22bcbe6c0620042cef8104de65b50b1cc"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::indexing_keyed::js_array_set_string_key (cyclomatic 18): perry_runtime::array::indexing_keyed::js_array_set_string_key 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/perry-runtime/src/array/indexing_keyed.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19fc6a218517ea51ece02693a31fdd5857201f3d538446b6f6c7322d9fd6963"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::iter_object::dispatch_array_iterator_method_inner (cyclomatic 18): perry_runtime::array::iter_object::dispatch_array_iterator_method_inner 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/perry-runtime/src/array/iter_object.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51f8522f5e73e10f31e74ebf33ab29119fe0d94ec5d6358378b537106d9729f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::buffer::dataview::js_data_view_get (cyclomatic 18): perry_runtime::buffer::dataview::js_data_view_get 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/perry-runtime/src/buffer/dataview.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2728acdb8baa0e0b1d576a55fe9d0dd362ea1bf394a244c00826c37f694fbf"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::builtins::console::decode_dir_depth_option (cyclomatic 18): perry_runtime::builtins::console::decode_dir_depth_option 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/perry-runtime/src/builtins/console.rs"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b7afdb39ae32b2837ea81efadc1a9272212fb6c2b491bbb6cf94eda0b38469"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::bun_ffi::call::convert_int_return (cyclomatic 18): perry_runtime::bun_ffi::call::convert_int_return 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/perry-runtime/src/bun_ffi/call.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"da97968fb6a547ca29225c786b4558367b1660f4ccacce7abca8b9fa11756bad"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::child_process::registry::js_child_process_spawn_background (cyclomatic 18): perry_runtime::child_process::registry::js_child_process_spawn_background 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/perry-runtime/src/child_process/registry.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8d4247c48eb2fa68107d99a82c04c3b7bbc35efb64ef79ad8cba671386ac3d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::closure::props::bag_born_with_attrs (cyclomatic 18): perry_runtime::closure::props::bag_born_with_attrs 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/perry-runtime/src/closure/props.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c78bf9fca5821fa5fd93b38f6856768808b64c245ccc2fb1fef4f53668b3af"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::date::js_date_apply_setter (cyclomatic 18): perry_runtime::date::js_date_apply_setter 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/perry-runtime/src/date.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c402092b8bfa5f1de491a155e42a6ea6519cd4ac30a8dd3b1a2c4faa79469b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::fs::fd_ops::js_fs_readv_sync (cyclomatic 18): perry_runtime::fs::fd_ops::js_fs_readv_sync 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/perry-runtime/src/fs/fd_ops.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"2178f92d7f94d10a4778018b846e3681ef16617938ca678bf4264aa049e9a8f4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::fs::stream::stream_on_common (cyclomatic 18): perry_runtime::fs::stream::stream_on_common 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/perry-runtime/src/fs/stream.rs"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9ff03a5104faa443490e8d0b5e167fd481c69298cb81ee96c0096f619c3a44"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::gc::layout_slot_visit::visit_object_layout_slots (cyclomatic 18): perry_runtime::gc::layout_slot_visit::visit_object_layout_slots 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/perry-runtime/src/gc/layout_slot_visit.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d3b0da8f1d8fc1241bdc0d2db6208549364e7a4772393e9929ba5c3f3281ba"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::gc::roots::stack_maps_sections::loaded_stack_map_sections::collect (cyclomatic 18): perry_runtime::gc::roots::stack_maps_sections::loaded_stack_map_sections::collect 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/perry-runtime/src/gc/roots/stack_maps_sections.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"77424331a32516d70585251890c7a909be4ee831b45dc4629b48d4ae561ec19f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::gc::roots::stack_maps_sections::read_elf_section_table (cyclomatic 18): perry_runtime::gc::roots::stack_maps_sections::read_elf_section_table has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 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/perry-runtime/src/gc/roots/stack_maps_sections.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2c3bbb14ff291b9e5f78ac499cf44a697c7490fb6a0d913e12d8ad07d7701d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::gc::tenuring::retune_nursery_cap_scale (cyclomatic 18): perry_runtime::gc::tenuring::retune_nursery_cap_scale 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/perry-runtime/src/gc/tenuring.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08067c19ebf9f3a4c23f824f704dcd3a12078ef5619fd6478d0f0566c935fe7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::node_stream_event_emitter::emit_stream_event_rooted (cyclomatic 18): perry_runtime::node_stream_event_emitter::emit_stream_event_rooted 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/perry-runtime/src/node_stream_event_emitter.rs"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bd9a621cb589c250ca7bd82e56add4d110b395e87b5568a4aeb7a67a3628a9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::node_submodules::zlib::js_zlib_stream_option (cyclomatic 18): perry_runtime::node_submodules::zlib::js_zlib_stream_option 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/perry-runtime/src/node_submodules/zlib.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"89847b175044724da6226ea7c323a9b94648fe825289fbafea9f21ad8c2c3af6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::alloc::js_object_copy_own_fields (cyclomatic 18): perry_runtime::object::alloc::js_object_copy_own_fields 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/perry-runtime/src/object/alloc.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"22243dde18ae6210e85d8b1b44e8f38eccab45b4e5118ed40d4ebf7e87b50b1d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::class_registry::parent_static::js_register_class_computed_method (cyclomatic 18): perry_runtime::object::class_registry::parent_static::js_register_class_computed_method 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/perry-runtime/src/object/class_registry/parent_static.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e93851114362d23ca002fa4075dc07deccc2d41b522753750e7c03b3038e063"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::class_registry::parent_static::class_method_bind_length_bytes (cyclomatic 18): perry_runtime::object::class_registry::parent_static::class_method_bind_length_bytes 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/perry-runtime/src/object/class_registry/parent_static.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e9c00b375fd7f913aa6d581c3714e2f35e768243e6b07e292a3b948fbe008b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_get_set::ic_miss::class_field_chain::learn (cyclomatic 18): perry_runtime::object::field_get_set::ic_miss::class_field_chain::learn 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/perry-runtime/src/object/field_get_set/ic_miss/class_field_chain.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2239fc266c7b808c6980fb14463ea5c3490d548f661d4a96e22c676027f8002"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::layout_probe::computed::perry_probe_get_value::perry_family_run_admits (cyclomatic 18): perry_runtime::object::layout_probe::computed::perry_probe_get_value::perry_family_run_admits 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/perry-runtime/src/object/layout_probe/computed.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"101d5b46ea0648a205d26461b0c8b7a6ff4d9862ee5926827cde67a2aa2730cb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::layout_probe::write::chain_admits_add (cyclomatic 18): perry_runtime::object::layout_probe::write::chain_admits_add 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/perry-runtime/src/object/layout_probe/write.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf704f91d3f866d36fb1c7ed835141df86ef1318287f392e1e07ab75eb390d51"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_call_method::object_proto::js_object_default_to_locale_string (cyclomatic 18): perry_runtime::object::native_call_method::object_proto::js_object_default_to_locale_string 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/perry-runtime/src/object/native_call_method/object_proto.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc02aeb938546272e5da23dd3ec539a00e67a120ced54863c958475456b816bb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::object_ops::define_symbol_property::define_symbol_property (cyclomatic 18): perry_runtime::object::object_ops::define_symbol_property::define_symbol_property 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/perry-runtime/src/object/object_ops/define_symbol_property.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67ec568acb7d8670098d92cbc24ea0624e77039f4231440752def7a50bcee9b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::object_ops_frozen::js_object_freeze (cyclomatic 18): perry_runtime::object::object_ops_frozen::js_object_freeze 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: one other method here (perry_runtime::object::object_ops_frozen::js_object_seal) 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/perry-runtime/src/object/object_ops_frozen.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"d431d48464f34adcf6b40753ec14f1c4a31677c241d42cb32fdaab13393bf906"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::object_ops_frozen::js_object_seal (cyclomatic 18): perry_runtime::object::object_ops_frozen::js_object_seal 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: one other method here (perry_runtime::object::object_ops_frozen::js_object_freeze) 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/perry-runtime/src/object/object_ops_frozen.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"643f93a7a9a1efadf1e5716e689713e9bda195eac0d2d9f573ad6369fda63b21"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::property_ops::reflect::js_reflect_get_impl (cyclomatic 18): perry_runtime::object::property_ops::reflect::js_reflect_get_impl 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/perry-runtime/src/object/property_ops/reflect.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce89f70f6c4ab0164bf4532b1b144e1cf95956efcfa7cbc9f2d6ad1241445d7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::property_ops::set::prototype_of_for_set (cyclomatic 18): perry_runtime::object::property_ops::set::prototype_of_for_set 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/perry-runtime/src/object/property_ops/set.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ab11219a1c35d62e256e1e178aec44c1a38409a0c459d36670fb7da4147e7d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::shape_mint_census::dump (cyclomatic 18): perry_runtime::object::shape_mint_census::dump has cyclomatic complexity 18 (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/perry-runtime/src/object/shape_mint_census.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"36fe0ba55ed422430459202780e4941c1fce6977f91a8c7eadd0cbcda2a6e9bd"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::shape_store::try_function_store (cyclomatic 18): perry_runtime::object::shape_store::try_function_store 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/perry-runtime/src/object/shape_store.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a0fbaa570f6558712de32b6ad949208a2894acc80fdefa8938e3cd87e85aa8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::regex::perex_results::materialize (cyclomatic 18): perry_runtime::regex::perex_results::materialize 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/perry-runtime/src/regex/perex_results.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3978b966b5a75d9a988ec1d58f1d96d8ad74feffa61dc296086319b1253de134"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::regex::perex_split::regexp (cyclomatic 18): perry_runtime::regex::perex_split::regexp 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/perry-runtime/src/regex/perex_split.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"15848bf7df1761c6ebe70002330d7ba1de68d74a567599459aa13f9f6cdf2f73"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::regex::perex_substitution::scan (cyclomatic 18): perry_runtime::regex::perex_substitution::scan has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/regex/perex_substitution.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c232657a46df7e216b07bebec9e1141cb3a0de53e91ead736f1f3d6023e06a9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::string::concat::append_chain_all_heap_strings (cyclomatic 18): perry_runtime::string::concat::append_chain_all_heap_strings 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/perry-runtime/src/string/concat.rs"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2e298dcf25ec6d973d515c204f473aada259667a4eab7edafdd9d389ea81e6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::string::split::js_string_split_n (cyclomatic 18): perry_runtime::string::split::js_string_split_n 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/perry-runtime/src/string/split.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"b771596e3f23c344483b04dbbb8c13e7842167a4ebae4c4657e763bf5f50a0db"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::value::dynamic_arith::to_primitive_default_for_add (cyclomatic 18): perry_runtime::value::dynamic_arith::to_primitive_default_for_add 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/perry-runtime/src/value/dynamic_arith.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c904d7b4e82dc5af7a685b1fdf507757e5ea47229955603e9845d5656448f2"}},{"ruleId":"D1","level":"warning","message":{"text":"Value::encode (cyclomatic 18): Value::encode has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 2 function items inside it that branch (write, quoted). 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/perry-runtime-manifest/src/realm_json.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92f919feba06854f5e25b490d14a699bed576e0c578e34ea53a6be7bc640a0c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::streams::byob::js_reader_read_with_view (cyclomatic 18): perry_stdlib::streams::byob::js_reader_read_with_view 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/perry-stdlib/src/streams/byob.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd433f25de7f43488f5eff8d2a93b89a00a538cf2576facb92d0bff1b0931ec5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::turnloop_client::exchange::finish_response (cyclomatic 18): perry_stdlib::turnloop_client::exchange::finish_response 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/perry-stdlib/src/turnloop_client/exchange.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60f275e6865ea4341eab297c3e3dca3dad2c35e7d29b2a9e58c0310339ff3eb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::async_to_generator::transform_async_to_generator (cyclomatic 18): perry_transform::async_to_generator::transform_async_to_generator has cyclomatic complexity 18 (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/perry-transform/src/async_to_generator.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3bbd7f87cff4da8ae49793b89604700d886b9382baf32acfb31df39aeb410fe"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::async_to_generator::rewrite_async_closures_in_stmt (cyclomatic 18): perry_transform::async_to_generator::rewrite_async_closures_in_stmt 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: one other method here (perry_transform::async_to_generator::scan_stmt_for_async_closures) 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/perry-transform/src/async_to_generator.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"70356b2ae04941ce95ea7e8a9cf54e988ece9c90677805ebd26e61dc4760f9ac"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::async_to_generator::scan_stmt_for_async_closures (cyclomatic 18): perry_transform::async_to_generator::scan_stmt_for_async_closures 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: one other method here (perry_transform::async_to_generator::rewrite_async_closures_in_stmt) 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/perry-transform/src/async_to_generator.rs"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b8473f8fb46b14cc48fbb56547f65fe797c75d7dc04428bce2444f370c03f2"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::deforest::call_sites::match_consume_loop (cyclomatic 18): perry_transform::deforest::call_sites::match_consume_loop 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/perry-transform/src/deforest/call_sites.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"5001e1745b75b33fb4c6fc5a49721fe41e12ee444d08a470d389f8262ebe86e5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::generator::rewrite_returns::body_contains_return (cyclomatic 18): perry_transform::generator::rewrite_returns::body_contains_return 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/perry-transform/src/generator/rewrite_returns.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"82dbbbeb37988851a53413d0a9a9fdffd0c9975b1f3c024bd30232836dd5003f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::exact_receivers::collect_module_prototype_facts::visit_stmt (cyclomatic 18): perry_transform::inline::exact_receivers::collect_module_prototype_facts::visit_stmt 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/perry-transform/src/inline/exact_receivers.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d485275dfc1b3c20925b57412b44455c139a1324cb3cbf76f7bac63610d94168"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_ios::audio_playback::perry_audio_play (cyclomatic 18): perry_ui_ios::audio_playback::perry_audio_play 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/perry-ui-ios/src/audio_playback.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"605c49164b5edbd210c7b8e0a7fb0cc8e81f3f812c85adfc399935d11637e9a4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_ios::drag_drop::perform_drop_impl (cyclomatic 18): perry_ui_ios::drag_drop::perform_drop_impl has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 7 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/perry-ui-ios/src/drag_drop.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"5918f266a11f7c1d85106f4b77b2bd9fb680d62dcbba61879a784ce01b69a35e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_ios::widgets::alert::topmost_view_controller (cyclomatic 18): perry_ui_ios::widgets::alert::topmost_view_controller 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/perry-ui-ios/src/widgets/alert.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"77566fee853aced2c8a4107bfc6f38e3d7b624b99fe2a835ebf773839f349ee0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_macos::audio_playback::perry_audio_play (cyclomatic 18): perry_ui_macos::audio_playback::perry_audio_play 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/perry-ui-macos/src/audio_playback.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef105e167532d7153eacf999e6e55b76642beb679e1f46ccab83a40b6ebc491f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_tvos::audio_playback::perry_audio_play (cyclomatic 18): perry_ui_tvos::audio_playback::perry_audio_play 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/perry-ui-tvos/src/audio_playback.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedfdc03631c8285403998b3ba9122e3e1f5f52b126a7fb4c9830a1a38beda79"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_tvos::widgets::alert::topmost_view_controller (cyclomatic 18): perry_ui_tvos::widgets::alert::topmost_view_controller 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/perry-ui-tvos/src/widgets/alert.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48fc52079baaea14c1aa2c47f8c3a396fb2921279813f17944c82ed2940c5da"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_visionos::audio_playback::perry_audio_play (cyclomatic 18): perry_ui_visionos::audio_playback::perry_audio_play 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/perry-ui-visionos/src/audio_playback.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d362e86533369c5bacad171c3f67ac37f7242ad977aaad021dc1191cec5149a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_visionos::drag_drop::perform_drop_impl (cyclomatic 18): perry_ui_visionos::drag_drop::perform_drop_impl has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 7 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/perry-ui-visionos/src/drag_drop.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8c743c32d71da625181d642b698be7bb7f0e058a6ab213142636a7f78364f4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_visionos::widgets::alert::topmost_view_controller (cyclomatic 18): perry_ui_visionos::widgets::alert::topmost_view_controller 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/perry-ui-visionos/src/widgets/alert.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2837f9024c7b21cb208cac4e0d22197f645a0f284e2c3e3b1d7b175d4fa4cb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_watchos::audio_playback::perry_audio_play (cyclomatic 18): perry_ui_watchos::audio_playback::perry_audio_play 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/perry-ui-watchos/src/audio_playback.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72b87adab57790c5d792d408e20565d29d2b76897b3beb0fcf5fb5d3acf6af6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wasm_host::externals::perry_wasm_host_func_call (cyclomatic 18): perry_wasm_host::externals::perry_wasm_host_func_call 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/perry-wasm-host/src/externals.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"8895096a199e90ae3911e84c5d8e27c6a342b8ae22559832b053535322bde41a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wasm_host::tables::perry_wasm_host_instance_table_get (cyclomatic 18): perry_wasm_host::tables::perry_wasm_host_instance_table_get 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/perry-wasm-host/src/tables.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cc8959c07422ead667fc863b9ee05b2e705f551d66a26f5ea120f6be614e35"}},{"ruleId":"D1","level":"warning","message":{"text":"Gen::check_toks (cyclomatic 18): Gen::check_toks 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/perry-wpfacts/src/gen/export.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"836009a38006343b663672de7eccd5d1b6f1b541f490dfb62408febc47fb6cd3"}},{"ruleId":"D1","level":"warning","message":{"text":"Gen::fill_described (cyclomatic 18): Gen::fill_described 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/perry-wpfacts/src/gen/import_values.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6269ceba391d318b316c910793c88e50603c030bd2b91dda4a4d04e043f84f"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::escape_fn_params (cyclomatic 18): Model::escape_fn_params 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/perry-wpfacts/src/solve/call_and_construct.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b51ea9daca6eca0b98064d0903af5421951a6e0c39dcf09f3bcfa3417caa8d"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::fill_instance (cyclomatic 18): Model::fill_instance 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. This is NOT this file\u0027s highest cyclomatic complexity: perry_wpfacts::summary::map_cons (cyclomatic 67) 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/perry-wpfacts/src/summary.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e4e728dbfb78f10edb6acd81ba618c33445e19ab2ea45eda80d9492bc8e60c"}},{"ruleId":"D1","level":"warning","message":{"text":"primary-mainad0-v79-auto.build_arm (cyclomatic 18): primary-mainad0-v79-auto.build_arm 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":"docs/audits/gc-rss-instructions-2026-10-03/primary-mainad0-v79-auto.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f12722d0fca073747f23fde19311cc55d7c44133e76d29fcbbafd8703938121"}},{"ruleId":"D1","level":"warning","message":{"text":"buffer_b5_validate.measure (cyclomatic 18): buffer_b5_validate.measure 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":"scripts/buffer_b5_validate.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"30845d8d246397a7056ac246c669dd14be6139762a14bd7632fb9814eb278ac6"}},{"ruleId":"D1","level":"warning","message":{"text":"check_js_body_call_funnel.entry_abi_violations (cyclomatic 18): check_js_body_call_funnel.entry_abi_violations 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":"scripts/check_js_body_call_funnel.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"d281ca111edfe303feb4c762fb3955b5e6eb9a5d880d124f6675f7af5a5607d4"}},{"ruleId":"D1","level":"warning","message":{"text":"check_npm_publish_freshness.main (cyclomatic 18): check_npm_publish_freshness.main 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":"scripts/check_npm_publish_freshness.py"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"137cf90dba5c4498ff2a9d5ad65f5f90cc23385f907f0e42f9046945215437d8"}},{"ruleId":"D1","level":"warning","message":{"text":"_CfgParser._expr (cyclomatic 18): _CfgParser._expr 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":"scripts/check_thread_locals.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"764bcd73bf36aca8195f7d89053cee9b44a27ce8498296cfdbf2026042d4afa6"}},{"ruleId":"D1","level":"warning","message":{"text":"constfn_executable_gates.guarded_fast_body (cyclomatic 18): constfn_executable_gates.guarded_fast_body 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":"scripts/constfn_executable_gates.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"beea910b8657160ff30b8577d56f14ad07d77cbc54191da0f534d0a400113c47"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_root_dominance_check.between_blocks (cyclomatic 18): gc_root_dominance_check.between_blocks 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":2047}}}],"partialFingerprints":{"codehealthFindingId/v1":"446d68e6e80920a248fed97700d6523139979efeeecb46e0d5e2cc9f8b35f175"}},{"ruleId":"D1","level":"warning","message":{"text":"native_export_collisions.cfg_without_tests (cyclomatic 18): native_export_collisions.cfg_without_tests 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":"scripts/native_export_collisions.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed81c0fbf8a9bcd839e163cea8bbb1dbea8e0290931955e1b022e76d11daf654"}},{"ruleId":"D1","level":"warning","message":{"text":"package_bench_attr.cmd_floor (cyclomatic 18): package_bench_attr.cmd_floor 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":"scripts/package_bench_attr.py"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b8d77b5b053c68ca72394a14cd72020a1f74aaf46e8fc4f54d4c3092659d6f"}},{"ruleId":"D1","level":"warning","message":{"text":"perf_12015_lane.compare (cyclomatic 18): perf_12015_lane.compare 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":"scripts/perf_12015_lane.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e2135eeac835f1dd8e95a715c5ea37b93d02ecf21b90df0326f44b8a96281f"}},{"ruleId":"D1","level":"warning","message":{"text":"perf_tscwall_lane.run (cyclomatic 18): perf_tscwall_lane.run 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":"scripts/perf_tscwall_lane.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cf140717276d5bf022d868f931ce378cbfa0e5030cb2ffa8fdf10246a2ba1e"}},{"ruleId":"D1","level":"warning","message":{"text":"test262_subset.discover (cyclomatic 18): test262_subset.discover 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":"scripts/test262_subset.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"627b104302e2c7f551f56a70062d6389b6b8ad79b62c68de87dc2a8d65c9ca26"}},{"ruleId":"D1","level":"warning","message":{"text":"unrooted_local_shape.self_test (cyclomatic 18): unrooted_local_shape.self_test 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":"scripts/unrooted_local_shape.py"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"536a59671552141c20d39b12ce30a003abb47810aab6afb47ce2ea25708b52bb"}},{"ruleId":"D1","level":"warning","message":{"text":"unrooted_local_shape.main (cyclomatic 18): unrooted_local_shape.main 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":"scripts/unrooted_local_shape.py"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"6778a0a284248480f0d8a090965d02c5ebb90f308039b56e943874b813677686"}},{"ruleId":"D1","level":"warning","message":{"text":"Solver.load_from (cyclomatic 18): Solver.load_from 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":"scripts/wpfacts_recompute.py"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"af751237cacaeb129d0d4ff9efc7eb77b071add84211915f1bacd8ba16e7613d"}},{"ruleId":"D1","level":"warning","message":{"text":"web_runtime.perry_ui_menubar_attach (cyclomatic 18): web_runtime.perry_ui_menubar_attach has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 8 function items inside it that branch (renderMenuItems, a function literal at line 1712, dismissAll, \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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"498e1184abdb409e434dcd410f4773a36e9c37e57763ec59fbdeb0fb4459b28f"}},{"ruleId":"D1","level":"warning","message":{"text":"web_runtime._perry_media_wire_session (cyclomatic 18): web_runtime._perry_media_wire_session has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 4 of the 18 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 3450, 3458, 3446, \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":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":3433}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eee70fb2dfd961e6e14e7016b0371e57b42857bcb84438e9f1eab88a515dab4"}},{"ruleId":"D1","level":"warning","message":{"text":"wasm_runtime._perry_media_wire_session (cyclomatic 18): wasm_runtime._perry_media_wire_session has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 4 of the 18 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 3961, 3969, 3957, \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":3944}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fc8c11212d8098bcfcac4f101d769cb9ec123e61993cc56236c1b8f34b109d"}},{"ruleId":"D1","level":"warning","message":{"text":"wasm_runtime.perry_audio_stop (cyclomatic 18): wasm_runtime.perry_audio_stop has cyclomatic complexity 18 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 9 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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4440}}}],"partialFingerprints":{"codehealthFindingId/v1":"8440a3c982aa910871b5c603cf2ada0c02af542a0c4d71574aac80cc63b329e8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::audit::display_audit_results (cyclomatic 17): perry::commands::audit::display_audit_results 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/perry/src/commands/audit.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc168d1d0cfa469170b7d1ad66337509b4fd2e63b75be538c4045cb976374a0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::detect::has_top_level_module_exports_assignment (cyclomatic 17): perry::commands::compile::cjs_wrap::detect::has_top_level_module_exports_assignment has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 belong to 3 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":"crates/perry/src/commands/compile/cjs_wrap/detect.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b14401311d56b07a1d5303db098ec08f2a70800f0f9502cb1b5b7960682516"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::fallback_diag::emit (cyclomatic 17): perry::commands::compile::fallback_diag::emit 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/perry/src/commands/compile/fallback_diag.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"20392c91e141b2ad5ca7c0123532dd169da064b8709729858d90a9bd9e4a6908"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::link::wasi::link_wasi (cyclomatic 17): perry::commands::compile::link::wasi::link_wasi 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/perry/src/commands/compile/link/wasi.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3ae8a6fc83322ba5d9ed9fe1c7b808483f1576022310a7d182f3948d285a08"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::targets::compile_for_wasm (cyclomatic 17): perry::commands::compile::targets::compile_for_wasm has cyclomatic complexity 17 (threshold 15). Of this number, 13 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":"crates/perry/src/commands/compile/targets.rs"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09c70980b083e0eef6d76c2044913aa64fa0605d732b918c4633c517afc587f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::tiny_program::build_eligibility (cyclomatic 17): perry::commands::compile::tiny_program::build_eligibility has cyclomatic complexity 17 (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/perry/src/commands/compile/tiny_program/mod.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"11212b265a560b706622fa0496f4e6b0fd6af03ae58149f9fbd6f59c51c10edc"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::install::runner::install (cyclomatic 17): perry::commands::install::runner::install 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/perry/src/commands/install/runner.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab32096759c16c606b8e8f6d7a28b000bd74a028c4a38c843dcfdf5feebe843"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::publish::preflight::macos_preflight_validation (cyclomatic 17): perry::commands::publish::preflight::macos_preflight_validation 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/perry/src/commands/publish/preflight.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"d915b7a831012cdf0d4136256aab2e67db207e65758f00ba44ae78229f2713bb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::verify::run_verify_check (cyclomatic 17): perry::commands::verify::run_verify_check 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/perry/src/commands/verify.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4bb8de15b0bffdda9065226346e7eee4dcf3cfc3a9c50cd7a6a077b15b4a49"}},{"ruleId":"D1","level":"warning","message":{"text":"LlFunction::for_each_final_item (cyclomatic 17): LlFunction::for_each_final_item 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/perry-codegen/src/function.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"4781b78e0cb649c37678574d353b882a199ce4bd6c2ef7fd5f6f9aea0003cf87"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::boxed_vars::collect_closure_let_types_in_expr (cyclomatic 17): perry_codegen::boxed_vars::collect_closure_let_types_in_expr 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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":1737}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fa660b9ea36385c719c2b837bdde3d82c3c767a4361ab8dd573b37e40a2cd5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::artifact_display_names::extend_body_symbol_display_names (cyclomatic 17): perry_codegen::codegen::artifact_display_names::extend_body_symbol_display_names 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/perry-codegen/src/codegen/artifact_display_names.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb9d02fef74610e8d7440179598fa786837a088031906aa6de7f9524aa4d81e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::helpers::emit_namespace_populator (cyclomatic 17): perry_codegen::codegen::helpers::emit_namespace_populator has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: perry_codegen::codegen::helpers::resolve_target_triple (cyclomatic 26) 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/perry-codegen/src/codegen/helpers.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5692e94f4fb890c1c28699a61633d323a1ca777de7c50abe6e40e7001cf2de"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::helpers::emit_callee_binding_resolutions (cyclomatic 17): perry_codegen::codegen::helpers::emit_callee_binding_resolutions has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: perry_codegen::codegen::helpers::resolve_target_triple (cyclomatic 26) 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/perry-codegen/src/codegen/helpers.rs"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"149dd34d2d32d56183bda9d6d3ad9b42fdfed79b4d1878ba708573fb6501fbc9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::method_static::compile_static_method (cyclomatic 17): perry_codegen::codegen::method_static::compile_static_method 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/perry-codegen/src/codegen/method_static.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef061f923cc9e24446bcb563b956c64e98500bc23049166a65369dba8efb21d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::param_guard::guarded_falsy_field_default_method_candidate::scan_only_direct_conditions (cyclomatic 17): perry_codegen::codegen::param_guard::guarded_falsy_field_default_method_candidate::scan_only_direct_conditions 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. This is NOT this file\u0027s highest cyclomatic complexity: perry_codegen::codegen::param_guard::encode_node (cyclomatic 21) 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/perry-codegen/src/codegen/param_guard.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b085bfa368aa7814e7093222b7e81f947355a10a0f31f76a58b0b6f1f2bc2fd"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::reach_report::executable_references (cyclomatic 17): perry_codegen::codegen::reach_report::executable_references 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/perry-codegen/src/codegen/reach_report.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"595890e79f2e092d9d5c13c6fcd48836f76ac934855d8192157b150c8e6f479b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::static_fields::collect_inline_invoked_static_blocks::walk_stmt (cyclomatic 17): perry_codegen::codegen::static_fields::collect_inline_invoked_static_blocks::walk_stmt 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/perry-codegen/src/codegen/static_fields.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ee485d29b09df503bde0d585e350f06c52b90a7901c93d2f3bd2b3ee10df60"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::anon_key_adds::visit_stmt (cyclomatic 17): perry_codegen::collectors::anon_key_adds::visit_stmt 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/perry-codegen/src/collectors/anon_key_adds.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d99ed46c7ef2ebc468be8474e258e0ae92c9f4e76ae2f0103ca24638212a5d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::byte_read_key::collect_numeric_typed_locals (cyclomatic 17): perry_codegen::collectors::byte_read_key::collect_numeric_typed_locals has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to one function item inside it that branches (walk). 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/perry-codegen/src/collectors/byte_read_key.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"5100307d380556454d1d53d54c2eb3eca2a84564dba437ce6632ba079e56b5ff"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::hir_facts::collect_type_facts (cyclomatic 17): perry_codegen::collectors::hir_facts::collect_type_facts 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/perry-codegen/src/collectors/hir_facts.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"e280dca0c50d05733b47eb8d764d0bd62aa385f83392ce0cab455a66d2f028dd"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::int_valued_ta_locals::observe (cyclomatic 17): perry_codegen::collectors::int_valued_ta_locals::observe 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/perry-codegen/src/collectors/int_valued_ta_locals.rs"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0aa20c74f7ab709237300952ea2e69f5807c4b5c8b8d2680a285acf5e88cffc"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::integer_locals::static_index_window (cyclomatic 17): perry_codegen::collectors::integer_locals::static_index_window has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. 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/perry-codegen/src/collectors/integer_locals.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e478eea8355d3afba6d6094f44593897c45effebf47eefddb2da587722219ae5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::loop_bounded_i32::scan_level_writes (cyclomatic 17): perry_codegen::collectors::loop_bounded_i32::scan_level_writes 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/perry-codegen/src/collectors/loop_bounded_i32.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"695300f276b1a345fb36e9be45a3b80b9cc13e34abe4b863ab99052f0c5358d0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::object_literal_exports::object_literal_facts (cyclomatic 17): perry_codegen::collectors::object_literal_exports::object_literal_facts 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/perry-codegen/src/collectors/object_literal_exports.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d2edcdaf9109c2049e561bdec0e8aae454c73747e1464024313cda49952c44"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::walk (cyclomatic 17): perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::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. This shape REPEATS in the file: 4 other methods here (perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals, perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::expr_value_type, perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::collect_expr_writes_in_closure_stmts, \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/perry-codegen/src/collectors/pointer_locals.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66986fa8891d57e436b6bff4a6c242a34ae03b0908c870ea1182df44d60647c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_numeric::prove_group_numeric_fields (cyclomatic 17): perry_codegen::collectors::ptr_shape_numeric::prove_group_numeric_fields 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/perry-codegen/src/collectors/ptr_shape_numeric.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94ecd2ad4de0bc5881a5a3e8c890954238016df7774ef10b95414d19489db25"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_returns::collect_return_shape_functions (cyclomatic 17): perry_codegen::collectors::ptr_shape_returns::collect_return_shape_functions 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/perry-codegen/src/collectors/ptr_shape_returns.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f37dc69ab8995ab5562276a11a57cb46e7ea028451b13984e1b0a7818ad3569"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::segview::rewrite_site (cyclomatic 17): perry_codegen::collectors::segview::rewrite_site 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/perry-codegen/src/collectors/segview.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f02da07afa1ddc938f3fac1b0d4d86174ff5f17dbac8751077010217b96513d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::this_as_value::class_uses_this_as_value (cyclomatic 17): perry_codegen::collectors::this_as_value::class_uses_this_as_value 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/perry-codegen/src/collectors/this_as_value.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea634e561d0662d6b9eab9a88047b3ed403f0dd9a285cd9e20559d2b1fb2d17"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::typed_locals::iife_return_kind (cyclomatic 17): perry_codegen::collectors::typed_locals::iife_return_kind has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 5 of the 17 points are its own statements and the rest belongs to one function item inside it that branches (returns). 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/perry-codegen/src/collectors/typed_locals.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed9b5210aa4cfab1a633d2c6111f598c9169247959541188e6e2e732632fdec"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::call_spread_short::try_lower (cyclomatic 17): perry_codegen::expr::call_spread_short::try_lower has cyclomatic complexity 17 (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/perry-codegen/src/expr/call_spread_short.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe50669848d69fd2339cf76b23be40e022bc610bee8647795ebdde7ab0a9eab"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::element_shape_guard::emit_element_shape_loop_preheader_check (cyclomatic 17): perry_codegen::expr::element_shape_guard::emit_element_shape_loop_preheader_check 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/perry-codegen/src/expr/element_shape_guard.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c109ec324ec24879e94ba66afb072e211711700f4d433556d721e55a40f434"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::gc_map::parse_block (cyclomatic 17): perry_codegen::gc_map::parse_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/perry-codegen/src/gc_map.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19afbbd02df574851881c134ca3ad1011fbaf153925b8f16b51589ca6d78124"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::layout_desc::walk_stmts (cyclomatic 17): perry_codegen::layout_desc::walk_stmts 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/perry-codegen/src/layout_desc.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff25610b138a4a99184f15da82c8ea54fbb35d216bbefb7c999dc79ba001de8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::layout_desc::array_families::stmts_mut (cyclomatic 17): perry_codegen::layout_desc::array_families::stmts_mut 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/perry-codegen/src/layout_desc/array_families.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fee7621a592d5f8f3a304a566c0d1a73a648108f291b0fcb6d1ece709b4312"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::console_promise::lower_closure_call_rooted (cyclomatic 17): perry_codegen::lower_call::console_promise::lower_closure_call_rooted 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/perry-codegen/src/lower_call/console_promise.rs"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"630b19d61e69fca66aa752ff2e22000046f1b24d15806d6d087cf668635426ec"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::counter_range::classify_for_counter_range (cyclomatic 17): perry_codegen::stmt::counter_range::classify_for_counter_range 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/perry-codegen/src/stmt/counter_range.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"500544de1b2b39e0c569fbf56f4e3a5849d038057f8eb5efb9a820d419353a1f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::region_loop::bare::nothing_collects_since (cyclomatic 17): perry_codegen::stmt::region_loop::bare::nothing_collects_since 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/perry-codegen/src/stmt/region_loop/bare.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed0bfea09c63c2406c23190e0bbac4dae494cc0eb6ba41244b36dcde90d9145"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_arkts::set_hidden::rewrite_set_hidden_in_closures_in_expr (cyclomatic 17): perry_codegen_arkts::set_hidden::rewrite_set_hidden_in_closures_in_expr has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-arkts/src/set_hidden.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2d1f243854cc58616da6e67ee3e2f2de53319cdecdd7d8a3a5d3c821cf4419"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_arkts::widget_walks::walk_init_for_closure_targets_in_expr (cyclomatic 17): perry_codegen_arkts::widget_walks::walk_init_for_closure_targets_in_expr has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-arkts/src/widget_walks.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96572eef2f7cd6206b0e5ef41830cad952c197df1b19f65789ab510cd4d7e65"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_js::minify::copy_template_literal (cyclomatic 17): perry_codegen_js::minify::copy_template_literal has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/minify.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ec75bc6becb9a649d243000e9ee1e27661d91e3de11108a6bfac13f933ad56"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_wasm::minify::copy_template_literal (cyclomatic 17): perry_codegen_wasm::minify::copy_template_literal has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/minify.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"93af1a39771715df0f767f1ec5b5e4fce5de75357113e1627f2438bd8c2110db"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_wear_tiles::emit::emit_node (cyclomatic 17): perry_codegen_wear_tiles::emit::emit_node 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/perry-codegen-wear-tiles/src/emit.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"63693c9523cb0f793ed3f28bb59045d95199ddae0093b2bee3884e9835d9ef0b"}},{"ruleId":"D1","level":"warning","message":{"text":"DockerProtocol::create_args (cyclomatic 17): DockerProtocol::create_args 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/perry-container-compose/src/backend/docker.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"aece3d1b5877e666323352f4d7f01399201699c6b54c3d954c8487ddfe6e9f1e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_better_sqlite3::dispatch_ext::property_of (cyclomatic 17): perry_ext_better_sqlite3::dispatch_ext::property_of 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/perry-ext-better-sqlite3/src/dispatch_ext.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7538ae073c0997b8cffcacdd00a53cf33ea3df68a24a58a9463b867ecd6321"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_http::server::http2_server::dispatch::js_ext_http2_stream_dispatch_method (cyclomatic 17): perry_ext_http::server::http2_server::dispatch::js_ext_http2_stream_dispatch_method 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/perry-ext-http/src/server/http2_server/dispatch.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee32269f28c467287260f299aa01429e9c8bf9af7418523f16ff4c8261e39c7"}},{"ruleId":"D1","level":"warning","message":{"text":"Cfg::slot_pinned (cyclomatic 17): Cfg::slot_pinned 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/perry-gc-effects/src/instructions.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e79fd2e2bbfa4cc5b52c282ca96cd97ff0d291d2f7172d6a85cc62e5928948"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_gc_effects::archive::parse_section (cyclomatic 17): perry_gc_effects::archive::parse_section 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/perry-gc-effects/src/archive.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe42d878ff08f9f8f8a4662b8b772d0a4ea3be02f380246ba7cf44e90b4252fb"}},{"ruleId":"D1","level":"warning","message":{"text":"Pruner::stmt (cyclomatic 17): Pruner::stmt 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/perry-hir/src/lower/class_capture_scope.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"3272caf553594f4671d6523e60de80660f52e1054e6a63ff78e2eaf748daa348"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::analysis::fn_infer::callee::val (cyclomatic 17): perry_hir::analysis::fn_infer::callee::val 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/perry-hir/src/analysis/fn_infer/callee.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2807fcd0eda457954b36367580c3d2bf837bc1bce07cd53c6998fbad1168174d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::js_transform::local_natives::fix_local_native_instances (cyclomatic 17): perry_hir::js_transform::local_natives::fix_local_native_instances has cyclomatic complexity 17 (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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e918218b991a42479df738e42737b8244ff9e0ed2f7733a9341caf508c8910a7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::const_fold_fn::try_direct_eval_simple_assignment_fold (cyclomatic 17): perry_hir::lower::const_fold_fn::try_direct_eval_simple_assignment_fold 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/perry-hir/src/lower/const_fold_fn.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ecf9086e8c607252a45a01f804150eb34c622d075e23997a9dcb26c4f551e37"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::regex_string::try_regex_string_methods (cyclomatic 17): perry_hir::lower::expr_call::regex_string::try_regex_string_methods 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/perry-hir/src/lower/expr_call/regex_string.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72480a0e3022d74ba97c3fcc4ba13a0b738d4003d3c365475a8c7723e075bbc"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_new::non_ident::lower_new_non_ident (cyclomatic 17): perry_hir::lower::expr_new::non_ident::lower_new_non_ident 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/perry-hir/src/lower/expr_new/non_ident.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0924c337a01d37b571c0d89e06586214260e0cba021219cbbfed24b16ca3d282"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::fn_ctor_env::wrapper_const_string (cyclomatic 17): perry_hir::lower::fn_ctor_env::wrapper_const_string 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/perry-hir/src/lower/fn_ctor_env.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"86721d703c1fb2b1fe913625c9e38cfe7e39ea0e4066aef847e9a2982f49a998"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::widget_decl::scan_provider_stmt_for_reload_policy (cyclomatic 17): perry_hir::lower::widget_decl::scan_provider_stmt_for_reload_policy 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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"883912a2d439ef0eaa2e17a59310cb1d7d8470950a28673062828ff9560d0d90"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::class_members::collect_method_captures (cyclomatic 17): perry_hir::lower_decl::class_members::collect_method_captures has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to one function item inside it that branches (collect_let_ids). 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/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d69c3c726c5a3c376be7c6c257577269032c5a83f73beedf3d5140c870ccc0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_patterns::collect_implicit_assignment_target_names (cyclomatic 17): perry_hir::lower_patterns::collect_implicit_assignment_target_names 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/perry-hir/src/lower_patterns.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b64b08ddfeb0d8931cb94c433dee5edc9837c5889b4261a1e68cb99119341e7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_patterns::predeclare_implicit_assignment_targets (cyclomatic 17): perry_hir::lower_patterns::predeclare_implicit_assignment_targets 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/perry-hir/src/lower_patterns.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d376c0144284e30b8481542922818720741db7048035736ba08de80c95d7d94"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::type_alias_resolve::resolve_type_inner (cyclomatic 17): perry_hir::type_alias_resolve::resolve_type_inner 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/perry-hir/src/type_alias_resolve.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ecd3edf57e11c42beef74e6f871c137b35a607668c89743bf6fcbe4772a10a"}},{"ruleId":"D1","level":"warning","message":{"text":"Connection::fill_from_socket (cyclomatic 17): Connection::fill_from_socket 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/perry-http-client/src/transport.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3b3fcddfcbce61791d65b639dcebb84e438584da1325b4aedd0456184da2e0"}},{"ruleId":"D1","level":"warning","message":{"text":"Decoder::step (cyclomatic 17): Decoder::step 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/perry-http-client/src/ws/frame.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3708361f3e2618ee999ebb30039dec02fb08dfad48373cc65be269d7e65b0a1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_perex::tooling::dialect::class (cyclomatic 17): perry_perex::tooling::dialect::class 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/perry-perex/src/tooling/dialect.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab5e469141a1341a5bd6a88593850111a0823a2b8c3a3017e558613aae8696f"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader::value (cyclomatic 17): Reader::value 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/perry-runtime/src/array/literal_descriptor.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d2d202c410348d0b9b71326f9f873db9da9a1f8ac69760b1e430b4a3e62da1"}},{"ruleId":"D1","level":"warning","message":{"text":"CopyingNurseryCollector::move_young (cyclomatic 17): CopyingNurseryCollector::move_young 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/perry-runtime/src/gc/copying.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc58ee828765008279d78cf8bcb0fee99b7f25aaa091e167732ad9f3028dad85"}},{"ruleId":"D1","level":"warning","message":{"text":"ValidPointerSetBuilder::step (cyclomatic 17): ValidPointerSetBuilder::step 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/perry-runtime/src/gc/trace.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"025c00ab9c34802e420427a668fd6afd25c574a29132d47c0570953515b0c3dd"}},{"ruleId":"D1","level":"warning","message":{"text":"FullWeakProcessingState::step (cyclomatic 17): FullWeakProcessingState::step 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/perry-runtime/src/weakref/sliced.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa08f915891bbb557827f8be01e1600051031e42b13de480b1a494c7a36ba12f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::fill_extend::js_array_fill_f64_const_extend (cyclomatic 17): perry_runtime::array::fill_extend::js_array_fill_f64_const_extend has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/array/fill_extend.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"de984e3abab8607c403ae0bd888065ee774408ef49845001affe60af468be1f4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::immutable::js_array_to_spliced (cyclomatic 17): perry_runtime::array::immutable::js_array_to_spliced 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/perry-runtime/src/array/immutable.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"4016208e26d4e711492b761ba748c120f48c0af329be04247ed2dae5e94e0ee8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::join::join_values (cyclomatic 17): perry_runtime::array::join::join_values 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/perry-runtime/src/array/join.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bcc408c9c8b3c5f00fff89b1d395f537e003ec101b26d3ce9d3f4bb515ddee"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::numeric_range::js_array_fill_range_strided_tagged (cyclomatic 17): perry_runtime::array::numeric_range::js_array_fill_range_strided_tagged 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/perry-runtime/src/array/numeric_range.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"133fd1f105c795772b54af922aa23501f9a845cac8c0d2b6578a363e1b1776db"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::builtins::formatting::deep_equal::js_util_deep_strict_equal_bool (cyclomatic 17): perry_runtime::builtins::formatting::deep_equal::js_util_deep_strict_equal_bool 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/perry-runtime/src/builtins/formatting/deep_equal.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec93b7081b19f23374f753b4534953d8adc3d4875725ad180ea397c4b4056eab"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::bun_compat::cli_utils::hard_wrap_word (cyclomatic 17): perry_runtime::bun_compat::cli_utils::hard_wrap_word 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/perry-runtime/src/bun_compat/cli_utils.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f3ea3f88347838c00fc658da9f1bf722bd039e90983d0fe7572ff7c1362a57"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::bun_compat::cli_utils::jsonl_parse_chunk (cyclomatic 17): perry_runtime::bun_compat::cli_utils::jsonl_parse_chunk 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/perry-runtime/src/bun_compat/cli_utils.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"7543713735b50bcff87b20385fc429e6945feba7c7a28bd38a1b229ad7d4fd8d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::bun_compat::spawn::stdio_spec (cyclomatic 17): perry_runtime::bun_compat::spawn::stdio_spec 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/perry-runtime/src/bun_compat/spawn.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa5fb85137bd731594eec0f82369ff7920f4d53a3462e806b991da89c241913"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::child_process::options::cp_apply_live_stdio (cyclomatic 17): perry_runtime::child_process::options::cp_apply_live_stdio 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/perry-runtime/src/child_process/options.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9717cdd920f0e176c43332d1510f3bde4db30e19fd262eab11ba9bb0ff97ad"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::eh_walker_trace::parse_cie (cyclomatic 17): perry_runtime::eh_walker_trace::parse_cie 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/perry-runtime/src/eh_walker_trace.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56ec73c7a8a8ae6b7cd4902fbe740d6fc0c3be963387010af1d7a2075fd27a9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::fs::stream::utf8_stream::utf8_stream_flush_by_id (cyclomatic 17): perry_runtime::fs::stream::utf8_stream::utf8_stream_flush_by_id 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/perry-runtime/src/fs/stream/utf8_stream.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f28ec659fe123f5173a788f4d7fc47140c85c8a43ca061f0a4416414ceb950"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::gc::policy::gc_safepoint_moving_minor (cyclomatic 17): perry_runtime::gc::policy::gc_safepoint_moving_minor 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/perry-runtime/src/gc/policy.rs"},"region":{"startLine":3871}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b010aa878c7871ac88510a9166d251d69b9a8588780ad9dfb1d21c29435100f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::gc::roots::stack_maps::visit_record_slots (cyclomatic 17): perry_runtime::gc::roots::stack_maps::visit_record_slots 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/perry-runtime/src/gc/roots/stack_maps.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c226343fe40e91c62ed311c515e3996d86118610a23104f9d87e5251fae274"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::intl::date_collator::format_ms_with_dtf_obj (cyclomatic 17): perry_runtime::intl::date_collator::format_ms_with_dtf_obj 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/perry-runtime/src/intl/date_collator.rs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ae8ebf980a9b7b2f8d6cd056764b27c94e67d67e714ac1480bcd775d481cdd"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json::parse_api::parse_slow (cyclomatic 17): perry_runtime::json::parse_api::parse_slow 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/perry-runtime/src/json/parse_api.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"c966a6142891dc37cf5aed8c3fd38a665bf8f89846ccbeb1ca2beac4631d2111"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json::stringify_small::try_primitive (cyclomatic 17): perry_runtime::json::stringify_small::try_primitive 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/perry-runtime/src/json/stringify_small.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c34f9848aa7c2ea8f8995bedc35ac6d9cedba8ca3bef64c6856b1d00bcaded"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json_tape::materialize_number (cyclomatic 17): perry_runtime::json_tape::materialize_number has cyclomatic complexity 17 (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/perry-runtime/src/json_tape.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05326d2a98d424bea94c4a2f19a0d96f4679ae54f8b3ca330d03c33498d980f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json_tape::force_materialize_lazy_impl (cyclomatic 17): perry_runtime::json_tape::force_materialize_lazy_impl 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/perry-runtime/src/json_tape.rs"},"region":{"startLine":1791}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb55eac28e19e834a1e47d042018c91043513185874307274760e70f55593527"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::node_api_host::scan_node_api_roots_mut (cyclomatic 17): perry_runtime::node_api_host::scan_node_api_roots_mut 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/perry-runtime/src/node_api_host/mod.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffcecd111591f87ea4d0f1b36113c8078125cc259af823799f3cea01cd99d755"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::node_stream_event_emitter::remove_stream_listener_for_event (cyclomatic 17): perry_runtime::node_stream_event_emitter::remove_stream_listener_for_event 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/perry-runtime/src/node_stream_event_emitter.rs"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"36701c6bcf9bff98e6e0c2e96ae949b8e9da0ce6807987eb21fbacaeb2351722"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::canonical_keys::extend_token (cyclomatic 17): perry_runtime::object::canonical_keys::extend_token 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/perry-runtime/src/object/canonical_keys.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab8785597711668a382878ecedd3b7af800a3a7b3b3eb0bedef338a4e11fc1b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_get_set::field_ops::js_object_set_field (cyclomatic 17): perry_runtime::object::field_get_set::field_ops::js_object_set_field 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/perry-runtime/src/object/field_get_set/field_ops.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7b2ace73f26cb3b948c777266052b3a7abdf1c200a34efdeff73240117ef4d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_get_set::ic_miss::private_member_access::js_private_brand_check (cyclomatic 17): perry_runtime::object::field_get_set::ic_miss::private_member_access::js_private_brand_check 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/perry-runtime/src/object/field_get_set/ic_miss/private_member_access.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"03cea37e78fb939a1873d7b62d9d4ebc7e9d6f9623802e29d1c34dbbf1eb7f05"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_set_by_name::fast_paths::try_readd_stable_tombstone_sso_no_grow (cyclomatic 17): perry_runtime::object::field_set_by_name::fast_paths::try_readd_stable_tombstone_sso_no_grow 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/perry-runtime/src/object/field_set_by_name/fast_paths.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9f2093ec8ffc77269d253e637155944933b4b7b80609c5b18679fec3ce432a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::iterator_prototypes::call_overridden_iterator_next (cyclomatic 17): perry_runtime::object::iterator_prototypes::call_overridden_iterator_next has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/iterator_prototypes.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c2b25561a88bb3c30a74451cd3ac3c603f7ef5dd2e350f72f943e096659bff"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::layout_probe::perry_probe_set (cyclomatic 17): perry_runtime::object::layout_probe::perry_probe_set 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/perry-runtime/src/object/layout_probe.rs"},"region":{"startLine":1738}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fcf62d1c7ec94d050c114e3684c745950b8a51b59c42d1a5195faa6317d79cf"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::object_ops::accessors::js_object_get_own_field_or_undef (cyclomatic 17): perry_runtime::object::object_ops::accessors::js_object_get_own_field_or_undef 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/perry-runtime/src/object/object_ops/accessors.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ca5a7f5be50dbc7200f6824d8c5d4da5c07b9129ddb83fa7a9cbd915bf88f7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::shape_store::try_own_store (cyclomatic 17): perry_runtime::object::shape_store::try_own_store 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/perry-runtime/src/object/shape_store.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9f488df87306b71741e0b2582f47ddd6b183cd3be9be9ec6290afca3cb2aef"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::shapes_last_key_rollback::publish_object_shape_last_key_rollback (cyclomatic 17): perry_runtime::object::shapes_last_key_rollback::publish_object_shape_last_key_rollback 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/perry-runtime/src/object/shapes_last_key_rollback.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17580bbb91995cec89e252c37ba81fe69630c7482d71561a3cb73b5b91ff841"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::shapes_own_data::plain_receiver_miss_is_final (cyclomatic 17): perry_runtime::object::shapes_own_data::plain_receiver_miss_is_final has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/shapes_own_data.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a952aeddb9b44278de35f624470150a661409b0470dd2b813beaa8db7ec25af9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::path::split_win32 (cyclomatic 17): perry_runtime::path::split_win32 has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/path.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"34da32dc3cfac0cf15e9295b149c8d6735568afcd6f10d703eb040643eccf877"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::promise::combinators::combinator_iterable_to_array (cyclomatic 17): perry_runtime::promise::combinators::combinator_iterable_to_array 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/perry-runtime/src/promise/combinators.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b348c3a8ca69be57ca824d29be13396b6b32f2aa15fb3522e4d5e3f02ffd02"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::promise::then_probe::prove_no_then (cyclomatic 17): perry_runtime::promise::then_probe::prove_no_then 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/perry-runtime/src/promise/then_probe.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5c98262d1bee6d2a6ebaee1e3d9598e753c9bae3e858deafc2ced3e6390213"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::regex::perex_replace::string (cyclomatic 17): perry_runtime::regex::perex_replace::string 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/perry-runtime/src/regex/perex_replace.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d70b606e6b2c0d500fdba2790f15a6420a01f2fc65e1ef4a05214f0edc57c7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::string::compare::locale_compare_numeric_raw (cyclomatic 17): perry_runtime::string::compare::locale_compare_numeric_raw has cyclomatic complexity 17 (threshold 15). Of this number, 15 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/perry-runtime/src/string/compare.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4ec950159e112e47501064b4a73fa320e59fcea5ae498e16f2fe503247e624"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::string::slice_ops::case_convert (cyclomatic 17): perry_runtime::string::slice_ops::case_convert 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/perry-runtime/src/string/slice_ops.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d6d86c3a3d07396fe12c3c3821534921482cf42d1924625af7b995f2279e6a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::util_parse_args::js_util_parse_args (cyclomatic 17): perry_runtime::util_parse_args::js_util_parse_args 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/perry-runtime/src/util_parse_args.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"f429d14ffd19383a7552775f14e8a6b65ba5135b08232dfdfd5f44e859a3c574"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::value::to_string_radix::double_to_radix_string (cyclomatic 17): perry_runtime::value::to_string_radix::double_to_radix_string 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/perry-runtime/src/value/to_string_radix.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe422b12be9c14192ba86afafc3d34deb55ee2406b77feb45a9380bc439a744"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::wasi::validate_options (cyclomatic 17): perry_runtime::wasi::validate_options 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/perry-runtime/src/wasi.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a7a211f24f6136d9392ebeafdb497efa62b386279e2597f3a0076d40d43761"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::yoga::js_yoga_set_enum (cyclomatic 17): perry_runtime::yoga::js_yoga_set_enum 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/perry-runtime/src/yoga.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"66cd7dd6ebdbd82a07a522da3dc4a9cd47684b329d549f58d4ee69163128f8d7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::common::dispatch_http::dispatch_client_incoming_property (cyclomatic 17): perry_stdlib::common::dispatch_http::dispatch_client_incoming_property 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/perry-stdlib/src/common/dispatch_http.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee545159b382d210ccb26ca2882803795551df756cd84a9b218490a5b1b0e963"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::events::module_helpers::js_events_native_dispatch (cyclomatic 17): perry_stdlib::events::module_helpers::js_events_native_dispatch 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/perry-stdlib/src/events/module_helpers.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82281d4cb0d6f0db2272eb1316b03fd84f8f32be9744824b6ef77444ae10428"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::tls::validate_server_options (cyclomatic 17): perry_stdlib::tls::validate_server_options 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/perry-stdlib/src/tls.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5dfe3ff8dfb6b5c180985f35568cabcb1f5dff0ae5ed0809646820c3b36f99"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::tls::turnloop_server::sink (cyclomatic 17): perry_stdlib::tls::turnloop_server::sink 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/perry-stdlib/src/tls/turnloop_server.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"234ebddfbb28f5d49a42a21cb72a5a4f0aa4288d657cd878a279edfda50f8d52"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::webcrypto::hmac::argon2_derive (cyclomatic 17): perry_stdlib::webcrypto::hmac::argon2_derive 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/perry-stdlib/src/webcrypto/hmac.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4b7f3fc99cbc90b57257630a24b2a132ce3aa0657e54356f383e1a946f9bca"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::aggregate_scalar::scalarize_stmts (cyclomatic 17): perry_transform::aggregate_scalar::scalarize_stmts 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/perry-transform/src/aggregate_scalar.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1ab6cea84adc2d9064461fa45e7a98300496304b1128e866d9d4141b65d87f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::crypto_hash_chain::for_each_let (cyclomatic 17): perry_transform::crypto_hash_chain::for_each_let has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to 3 function items inside it that branch (stmt, stmts, closures_in). 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/perry-transform/src/crypto_hash_chain.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"6597eb18d7b5e75105cef9f0856b06e7d385da4cd03f27efb68cb502329547ab"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::generator::id_scan::scan_stmt_for_max_func (cyclomatic 17): perry_transform::generator::id_scan::scan_stmt_for_max_func 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/perry-transform/src/generator/id_scan.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b222783d87204abae05902dfda2ffd0431b9c5e115604316252817eea39481"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::generator::lower::yield_await::await_async_generator_yield_operands (cyclomatic 17): perry_transform::generator::lower::yield_await::await_async_generator_yield_operands 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/perry-transform/src/generator/lower/yield_await.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f1d145c53512f24086e0ef8fa8df04135208735ae6def7e433d669f317db8e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::i18n::collect_keys_from_stmt (cyclomatic 17): perry_transform::i18n::collect_keys_from_stmt has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (perry_transform::i18n::replace_in_stmt) 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/perry-transform/src/i18n.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d00dff84df6720b5b400a5b0fb5e22fd59c9e6fba332b1f092872a9725d10d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::i18n::replace_in_stmt (cyclomatic 17): perry_transform::i18n::replace_in_stmt has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (perry_transform::i18n::collect_keys_from_stmt) 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/perry-transform/src/i18n.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d01ec8a85b5892b231522c50d8628034bcca34bae844a6ea34de34ab315428e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::closure_analysis::collect_declared_local_ids (cyclomatic 17): perry_transform::inline::closure_analysis::collect_declared_local_ids has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: perry_transform::inline::closure_analysis::is_pure_function::expr_is_pure (cyclomatic 23) 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/perry-transform/src/inline/closure_analysis.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"af57e7d2fa6a8d49f676f494a4a64047911fd443210ca8f4fb11355ce425b01c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::substitute::substitute_locals_in_stmts_inner (cyclomatic 17): perry_transform::inline::substitute::substitute_locals_in_stmts_inner 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/perry-transform/src/inline/substitute.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50694bbfd2fb83a4b9c4b4e1a53c1f63dcf36aa66cb2bf597c95eba7e78aa3d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_android::widgets::add_child (cyclomatic 17): perry_ui_android::widgets::add_child 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/perry-ui-android/src/widgets/mod.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac753d0e70b2bd939fd4ea396ba9b9ffcb919647b75076c8b16fac8cf38c0847"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_geisterhand::chaos::start (cyclomatic 17): perry_ui_geisterhand::chaos::start 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/perry-ui-geisterhand/src/chaos.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7288d23c6aada19a9ae750aabef22ccf19ada6694f52c2ca64eb09024d87878"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_macos::app::register_global_hotkey (cyclomatic 17): perry_ui_macos::app::register_global_hotkey 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/perry-ui-macos/src/app.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"370d4b26a09976477997b60ca83d6ccd41701ebb64f65163dba1e968eeb78685"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_macos::pointer::handle_event (cyclomatic 17): perry_ui_macos::pointer::handle_event 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/perry-ui-macos/src/pointer.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d66d9b81300ec8348fa483e7e551dd0746ecf39700e71f97b7bfab9bfcfbe0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_macos::widgets::max_width::set_max_width (cyclomatic 17): perry_ui_macos::widgets::max_width::set_max_width has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-macos/src/widgets/max_width.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e380d2e5f0fe118050fd98b7f20e09e631b69d5c7771f0eae19994d4afb547b4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_watchos::state::state_set (cyclomatic 17): perry_ui_watchos::state::state_set 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/perry-ui-watchos/src/state.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"028e9285de9e412193e49ea7ab5bb98075d120a1c52366e6fd317e06a2a3dc53"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_windows::media_playback::set_now_playing (cyclomatic 17): perry_ui_windows::media_playback::set_now_playing 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/perry-ui-windows/src/media_playback.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0187bcbf1b6e717147e9072fba7781eac93d3344d0b5776e85e41216b42bdad"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_windows::widgets::webview::install_navigation_handlers (cyclomatic 17): perry_ui_windows::widgets::webview::install_navigation_handlers 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/perry-ui-windows/src/widgets/webview.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e381929a97a5a15654e5edb18248d1465004e07e89981c4acc2e8c4845ba65"}},{"ruleId":"D1","level":"warning","message":{"text":"Emitter::discard_owned (cyclomatic 17): Emitter::discard_owned has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wit/src/guest_c/values/discard.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2928cae63ba707fc6587b040abf41a1cb5e4709cc6d584ac0c53c742ee2b50"}},{"ruleId":"D1","level":"warning","message":{"text":"Flat::call (cyclomatic 17): Flat::call 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/perry-wpfacts/src/decl_units.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd639e456e489282e74732c3160fc2b07006b2fd45295375e4c514df676200a"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::call_tok (cyclomatic 17): Model::call_tok 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/perry-wpfacts/src/solve/call_and_construct.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc85a73696fa4bb79e733fdc0f54ecd739f96e79e11cb141dfdaa76cae60b6c"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::escape_inner (cyclomatic 17): Model::escape_inner 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/perry-wpfacts/src/solve/call_and_construct.rs"},"region":{"startLine":1529}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6ab2a036d5e3527a8d2816ecb8071a6ea15d2b310dac5bb0fa1255a6ae1d44"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::proto_node (cyclomatic 17): Model::proto_node 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. This is NOT this file\u0027s highest cyclomatic complexity: Model::cons_line (cyclomatic 67) 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/perry-wpfacts/src/solve.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"da54c2cf28a01872aa9cd1487a9f437866216634a26da4e8d90db623e5277e85"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::builtins::collections::iterator_method (cyclomatic 17): perry_wpfacts::builtins::collections::iterator_method 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/perry-wpfacts/src/builtins/collections.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"94444844644547146f108df1c8a0c33f34e6e61222a288bf99a93eb4c292938a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_wpfacts::units::module_exports (cyclomatic 17): perry_wpfacts::units::module_exports has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/units.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"3507b1fe29592628f12a575a2c2a1d1d8cfd00d4f8b019a99875aac2e84432fe"}},{"ruleId":"D1","level":"warning","message":{"text":"DG-fallback-gap.check_native_calls (cyclomatic 17): DG-fallback-gap.check_native_calls 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":"scripts/DG-fallback-gap.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2197716eacf0c3b950e2fb2dae8a09f48cb95a5c500dee07be868fadaa2c52ff"}},{"ruleId":"D1","level":"warning","message":{"text":"check_buffer_layout.inventory (cyclomatic 17): check_buffer_layout.inventory 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":"scripts/check_buffer_layout.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f7eeb2cdedf34c118f55c6f9d788124840fb0cf6dc50a9612120e990ff5c6a"}},{"ruleId":"D1","level":"warning","message":{"text":"check_gc_env_knobs.self_test (cyclomatic 17): check_gc_env_knobs.self_test 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":"scripts/check_gc_env_knobs.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ade1235b5d6f3ebfd55e9fa918273fef4f3e735ef1d42c6c4d681984d8ecea7"}},{"ruleId":"D1","level":"warning","message":{"text":"check_npm_publish_freshness.evaluate_package (cyclomatic 17): check_npm_publish_freshness.evaluate_package 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":"scripts/check_npm_publish_freshness.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9480ad5462ffd600dd36154ef847a3e6936d19ff9736de5e4b490cdc56ed5f"}},{"ruleId":"D1","level":"warning","message":{"text":"compiler_output_step_liveness.check_workflow (cyclomatic 17): compiler_output_step_liveness.check_workflow 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":"scripts/compiler_output_step_liveness.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0bd19ee5af6ffe1f84f67ba087e9f292c45300735987338ebfff31eb803e6c"}},{"ruleId":"D1","level":"warning","message":{"text":"component_host_acceptance.main (cyclomatic 17): component_host_acceptance.main 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":"scripts/component_host_acceptance.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd0b925ad2dc64b71f2cd2da03651e9c2be3286a6abb35e6f76ac829fa5f1f4"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_1090_evidence_report.gc_store_inventory_summary (cyclomatic 17): gc_1090_evidence_report.gc_store_inventory_summary 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":"scripts/gc_1090_evidence_report.py"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2293ddc010d0886a32676e75297a56070ebff63d676edca5a9898e8fc39fe4"}},{"ruleId":"D1","level":"warning","message":{"text":"link_absence.witness_options (cyclomatic 17): link_absence.witness_options has cyclomatic complexity 17 (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":"scripts/link_absence.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b7f47d71ccb0a2343c28d687a5b94a9497bbd9408269babf6a7af5631e24f4"}},{"ruleId":"D1","level":"warning","message":{"text":"measure_readpath3.measure (cyclomatic 17): measure_readpath3.measure 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":"scripts/measure_readpath3.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5b5be075fa21eddd50da7c0e1ff19d7956e8c1ed431ba7ecf3e6e563086e26"}},{"ruleId":"D1","level":"warning","message":{"text":"native_export_collisions.literal_exports (cyclomatic 17): native_export_collisions.literal_exports 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":"scripts/native_export_collisions.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"404bc5724d5192266209513f6264b4496ad9ac33479c1e438f3d1fbdc967e309"}},{"ruleId":"D1","level":"warning","message":{"text":"native_handle_ledger.self_test (cyclomatic 17): native_handle_ledger.self_test 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":"scripts/native_handle_ledger.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"52dfc9bfd2df79bfbe938b464c5a3175de57e95e68136e5a4b6f240a54bb25ee"}},{"ruleId":"D1","level":"warning","message":{"text":"native_result_ledger.scan_rows (cyclomatic 17): native_result_ledger.scan_rows 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":"scripts/native_result_ledger.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30c8be256b5f3bd689cc53ffbe804e2513f9cbba23e72fa0037629c2a43b232"}},{"ruleId":"D1","level":"warning","message":{"text":"parity_known_failures.validate_entry (cyclomatic 17): parity_known_failures.validate_entry 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":"scripts/parity_known_failures.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe5e6327ecf94f7fd7bb529f5f5556daef2e709f23fabd9162b37f661e23fe1"}},{"ruleId":"D1","level":"warning","message":{"text":"perf_tscwall_lane.measure (cyclomatic 17): perf_tscwall_lane.measure 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":"scripts/perf_tscwall_lane.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc39209b6d6a34424aa0d60fe47f706367d55634386d36ee1ab9f24bae782dd7"}},{"ruleId":"D1","level":"warning","message":{"text":"record_function_order.main (cyclomatic 17): record_function_order.main 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":"scripts/record_function_order.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2120bff6e5f9296817de5db306260b5517e4fdf12ed42cff41f9a691794534"}},{"ruleId":"D1","level":"warning","message":{"text":"sso_unbox_inventory.main (cyclomatic 17): sso_unbox_inventory.main 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":"scripts/sso_unbox_inventory.py"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5141aa29346146b31b4a26f634bd786f249338bd35c710ee45e3d461d2ce80e"}},{"ruleId":"D1","level":"warning","message":{"text":"stackmap_anatomy.extract_section (cyclomatic 17): stackmap_anatomy.extract_section 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":"scripts/stackmap_anatomy.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9eda13ee54aefc99185de1d79b27b6bc844ac8e1dd5e2a18e69c594c2f7bc05"}},{"ruleId":"D1","level":"warning","message":{"text":"wasm_runtime.__classDispatch (cyclomatic 17): wasm_runtime.__classDispatch 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/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4896}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0c1a588446d7da97e2cee717542b728900d044825f2548615f9025921470da"}},{"ruleId":"D1","level":"warning","message":{"text":"node_compat_matrix.resolveNode (cyclomatic 17): node_compat_matrix.resolveNode 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":"scripts/node_compat_matrix.mjs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cd8b5f1db4d0faba6843bee6dcb83f503d45c4ae49eaf9664c32a5c5783b0c"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline.dispatchPublishWorkflow (cyclomatic 17): pipeline.dispatchPublishWorkflow has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 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":"scripts/publish/pipeline.mts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a33402848d64cfc908fe04654c31fe9e79261203c3910072f22ad9a9df9756"}},{"ruleId":"D1","level":"warning","message":{"text":"Fixer::collect_usages_in_expr (cyclomatic 16): Fixer::collect_usages_in_expr 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/perry/src/commands/fixer.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc0aee8de175e0363456a42a8e85e08eb8c904102f8a18ffed44cc0505d0d99"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::hoist_classes::identifier_used_as_value_outside (cyclomatic 16): perry::commands::compile::cjs_wrap::hoist_classes::identifier_used_as_value_outside has cyclomatic complexity 16 (threshold 15). Of this number, 15 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/perry/src/commands/compile/cjs_wrap/hoist_classes.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"688c540083d013596741edc49fee872407c2f3b3e7a3c5178a3bbd4a62b40b7f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::collect_modules::dynamic_glob::expand_dynamic_import_glob (cyclomatic 16): perry::commands::compile::collect_modules::dynamic_glob::expand_dynamic_import_glob 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/perry/src/commands/compile/collect_modules/dynamic_glob.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb311e768b44cb2969c6ee1894bd41ee2fbcaa8b09bd585addbfcbeb2b510434"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::collect_modules::import_meta_require::rewrite_import_meta_require_addons (cyclomatic 16): perry::commands::compile::collect_modules::import_meta_require::rewrite_import_meta_require_addons 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/perry/src/commands/compile/collect_modules/import_meta_require.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"3418f2c8c258ecab1db8180b252ca3654002afd2b1a29d7a71d0f1a54327cce6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::collect_modules::source_prep::prepare_from_raw (cyclomatic 16): perry::commands::compile::collect_modules::source_prep::prepare_from_raw 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/perry/src/commands/compile/collect_modules/source_prep.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"590186627929d5f3dac9698f408ffe796e2050b3218a2aa8f9af093217899c34"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::embed::generate_embedded_asset_object (cyclomatic 16): perry::commands::compile::embed::generate_embedded_asset_object 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/perry/src/commands/compile/embed.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3f8c6b7103d020ea120e3c27f273d8c69286524dfcb30c63c83d55f64f6f77"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::native_addon_sidecar::runtime_payload_file (cyclomatic 16): perry::commands::compile::native_addon_sidecar::runtime_payload_file 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/perry/src/commands/compile/native_addon_sidecar.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e2778a1687fc55f055aad2dcfbcbe6b328e972f986aecf5e17904f7bd3a107"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::program_facts::run (cyclomatic 16): perry::commands::compile::program_facts::run 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/perry/src/commands/compile/program_facts.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5e7418e684c8bcaf316a5d4db08352072dffa9eb0caddcad2dc822b5a3d4c1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::strip_dedup::find_nightly_llvm_tool (cyclomatic 16): perry::commands::compile::strip_dedup::find_nightly_llvm_tool 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/perry/src/commands/compile/strip_dedup.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6f5576cb339ea0f41ea063a236894a74e67d8df661e48e2305fe3819fe1de0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::compile::widget_build::build_declared_widgets_android (cyclomatic 16): perry::commands::compile::widget_build::build_declared_widgets_android 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/perry/src/commands/compile/widget_build.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0516db668658aa2969bcd2c712a8ac90ca3c4d6618473eefde61a9fef3ac1f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::deps::package_declares_types (cyclomatic 16): perry::commands::deps::package_declares_types 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/perry/src/commands/deps.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72ab10b039af31fad9b454c6b88f9f18faa0135238552b894371382e20b0457"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::dev::run (cyclomatic 16): perry::commands::dev::run 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/perry/src/commands/dev.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"8849dca5b1edd77270a55e576cf96481d29beb757234e60baec554ef222d6724"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::harmonyos_hap::compile_ets_to_abc (cyclomatic 16): perry::commands::harmonyos_hap::compile_ets_to_abc 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/perry/src/commands/harmonyos_hap.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0b02e346be4d7a8a00d85b262250dc827b5047d6001f9e177ba391f795dca8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::i18n::run_extract (cyclomatic 16): perry::commands::i18n::run_extract 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/perry/src/commands/i18n.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5630ff7414356e618aa13c7eeb9ccf70a5c1110c619c3e65906b046b3bcc69e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::publish::credentials::auto_export_p12_from_keychain (cyclomatic 16): perry::commands::publish::credentials::auto_export_p12_from_keychain 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/perry/src/commands/publish/credentials.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61574ba9a983bbaa736bd9045a682a005194679dcd6b999ca74dfb74155adbe"}},{"ruleId":"D1","level":"warning","message":{"text":"perry::commands::update::run (cyclomatic 16): perry::commands::update::run 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/perry/src/commands/update.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"123363c2030f59be827658ebe530955293673bd2d68eafa31b8ab0afecfd0de2"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_audio_miniaudio::perry_audio_play (cyclomatic 16): perry_audio_miniaudio::perry_audio_play 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/perry-audio-miniaudio/src/lib.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"4568a4a334334fcfaca3e3cc33d10501de1ddd7a4343dcae4b3072d5dc6a377e"}},{"ruleId":"D1","level":"warning","message":{"text":"GeneralPurpose::decode (cyclomatic 16): GeneralPurpose::decode 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/perry-base64/src/lib.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"411d77187fd36fa6e65c8f2834edfb3f97e5868471700c7ed2fa6006513229d4"}},{"ruleId":"D1","level":"warning","message":{"text":"Census::precise_nodes (cyclomatic 16): Census::precise_nodes 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/perry-codegen/src/codegen/reach_report.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"34beb3dfaf9b513a45285695e89ac99d5e63ce0b6ca58c9da30967b164352999"}},{"ruleId":"D1","level":"warning","message":{"text":"Build::resolve_name (cyclomatic 16): Build::resolve_name 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: Reason::name (cyclomatic 33) 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/perry-codegen/src/codegen/source_need/flow.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2b4454590a6550d8bbb739559ed1cbcf822f80b584bb5f9a42758c07293201"}},{"ruleId":"D1","level":"warning","message":{"text":"FnReader::call_asm (cyclomatic 16): FnReader::call_asm 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/perry-codegen/src/dialect/mod.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a26be24d2edb281d1768f31d1bf1c1fb3ee4f1192c51d1e0575e048513aa847"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::boxed_vars::collect_prealloc_box_ids_in_stmts (cyclomatic 16): perry_codegen::boxed_vars::collect_prealloc_box_ids_in_stmts 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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"6216392a86cdf7dad42ad2271a2b52eafbc65e84b333d77e0cc4fd7588ae70f1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::boxed_vars::collect_let_types_in_stmts (cyclomatic 16): perry_codegen::boxed_vars::collect_let_types_in_stmts 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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecc989d6e6c668f4592a82d26132b90365deb3aae22a58aebf28ffcee207869"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::entry_outline::outlined_entry_global_let_ids (cyclomatic 16): perry_codegen::codegen::entry_outline::outlined_entry_global_let_ids has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 6 belong to one function item 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/perry-codegen/src/codegen/entry_outline.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"b549a12482e75bb37dfa3969df28646e45f0b20ca6756dac53e1375949fb4765"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::integer_contract::prove (cyclomatic 16): perry_codegen::codegen::integer_contract::prove 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/perry-codegen/src/codegen/integer_contract.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"e759a2e40c91a1e832ae27ced0a9c8f6a8ea230e818e02cd49c38389c1b41136"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::opts::computed_names::collect (cyclomatic 16): perry_codegen::codegen::opts::computed_names::collect has cyclomatic complexity 16 (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/perry-codegen/src/codegen/opts/computed_names.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"92bcf7da27e9acf1025bb521af234578548438c92d856425990adda3619aaf9f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::split_regions::split_closures_in::in_stmt (cyclomatic 16): perry_codegen::codegen::split_regions::split_closures_in::in_stmt 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: perry_codegen::codegen::split_regions::pin_reason::control (cyclomatic 17) 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/perry-codegen/src/codegen/split_regions.rs"},"region":{"startLine":1729}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f62392c3d74f88db3c01da6e209956bd1122abe4d8c4087844111b2cb26b14b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::string_pool::image_uses::fold (cyclomatic 16): perry_codegen::codegen::string_pool::image_uses::fold 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/perry-codegen/src/codegen/string_pool/image_uses.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaea43aa4474bf816636c84f252464bceb38a53e87842c34dbd254e302924dbd"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::typed_abi::typed_i32_closure_rejection_reason_with_types (cyclomatic 16): perry_codegen::codegen::typed_abi::typed_i32_closure_rejection_reason_with_types 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. This is NOT this file\u0027s highest cyclomatic complexity: TypedCloneRejectionReason::as_str (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/perry-codegen/src/codegen/typed_abi.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac51b3e842436fb8743b6cb17e80231ee352ccd9b64adfb7fe2dcb4e4771406"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::codegen::typed_abi::typed_string_closure_rejection_reason_with_types (cyclomatic 16): perry_codegen::codegen::typed_abi::typed_string_closure_rejection_reason_with_types 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: TypedCloneRejectionReason::as_str (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/perry-codegen/src/codegen/typed_abi.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce41d8c79ba19391849f41537a298c3e6f9175b22497b9d11117afc373a26200"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::clamp_detect::detect_clamp3 (cyclomatic 16): perry_codegen::collectors::clamp_detect::detect_clamp3 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/perry-codegen/src/collectors/clamp_detect.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f13455d24ac8c0ee7702a5e30818e5abfafcb78a6f5324780d07a74e7c14c10"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::escape_arrays::find_array_candidates (cyclomatic 16): perry_codegen::collectors::escape_arrays::find_array_candidates 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/perry-codegen/src/collectors/escape_arrays.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"1022aa35ef94fc47b11293c47edcb283e47d579d10ff146e4b808ee67bfd2c57"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::hir_facts::array_kind_from_initializer (cyclomatic 16): perry_codegen::collectors::hir_facts::array_kind_from_initializer 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/perry-codegen/src/collectors/hir_facts.rs"},"region":{"startLine":2049}}}],"partialFingerprints":{"codehealthFindingId/v1":"8168befbeb0fb3683742a5213e306106287fd5d327a047ee201ac0679103ee12"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::integer_locals::collect_flat_row_aliases (cyclomatic 16): perry_codegen::collectors::integer_locals::collect_flat_row_aliases 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/perry-codegen/src/collectors/integer_locals.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fdcc6ca54fc29c181da9770dc91c1493e2c7b11dd1188dbc40793df6228ebd1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_returns::find_return_shape_candidates (cyclomatic 16): perry_codegen::collectors::ptr_shape_returns::find_return_shape_candidates 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/perry-codegen/src/collectors/ptr_shape_returns.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0045d41ea25e67b17841607b4f057bd0d7648b3063a3a198683d043fb6268e6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::straight_line_stores::count_in_stmt (cyclomatic 16): perry_codegen::collectors::straight_line_stores::count_in_stmt has cyclomatic complexity 16 (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/perry-codegen/src/collectors/straight_line_stores.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbbd991c61bf93b9d8ed8503ae20da15deea790b077f9376da1c4f8cf70e969"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::typed_locals::int32_writer_range (cyclomatic 16): perry_codegen::collectors::typed_locals::int32_writer_range 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/perry-codegen/src/collectors/typed_locals.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd12d4085fd0050bf66c127352145dc05828a22ec2dd6fd564245729f43149a0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::collectors::typed_locals::lets_in_loops::walk (cyclomatic 16): perry_codegen::collectors::typed_locals::lets_in_loops::walk 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/perry-codegen/src/collectors/typed_locals.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"404a733b788829f47606a35ad7988b56c24e5e09bc8b09ba44765fd59961790a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::element_shape_loop_fact_for_property_get (cyclomatic 16): perry_codegen::expr::element_shape_loop_fact_for_property_get 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/perry-codegen/src/expr/mod.rs"},"region":{"startLine":2553}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8369487d2eab0ec48fbf86818806787cff94a5c6e5c92476538dbb422384eac"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::lower_numeric_binary_value (cyclomatic 16): perry_codegen::expr::lower_numeric_binary_value 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/perry-codegen/src/expr/mod.rs"},"region":{"startLine":3887}}}],"partialFingerprints":{"codehealthFindingId/v1":"69853c0dd5118a465c480dc2d4a8b05501c7e3be850e7d9c94a114e04eb63f34"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::binary::lower_guarded_numeric_arith (cyclomatic 16): perry_codegen::expr::binary::lower_guarded_numeric_arith 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/perry-codegen/src/expr/binary.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"682944c62e7ddfd16c631afd22ee8329476a3f8ca56d2a11a7ae88fd6ce9d005"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::child_proc::lower (cyclomatic 16): perry_codegen::expr::child_proc::lower 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/perry-codegen/src/expr/child_proc.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"82069c9d78b81d230e285cff5fa722b235716a4ce4c04c7bab57ee018754f468"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::object_literal::lower_object_literal (cyclomatic 16): perry_codegen::expr::object_literal::lower_object_literal 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/perry-codegen/src/expr/object_literal.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a5cb1e68050480922f33f2e1bc68430d3425cfff9165e8e87cb3d0f43f634f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::range_facts::bounds_for_buffer_access_width (cyclomatic 16): perry_codegen::expr::range_facts::bounds_for_buffer_access_width 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/perry-codegen/src/expr/range_facts.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05801a8136d1141bfc384b68dc89a1f6f857d49dbdbcbc8c237c4acd10b1959"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::expr::slot_rep::collect_canonical_str_ineligible_locals::scan_declared (cyclomatic 16): perry_codegen::expr::slot_rep::collect_canonical_str_ineligible_locals::scan_declared 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 (perry_codegen::expr::slot_rep::collect_canonical_str_ineligible_locals) 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/perry-codegen/src/expr/slot_rep.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"466730392a97391627e9f4292e9f1f85652718f5e3a3cc4fc0b43d7c85fffdde"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::gc_map::verify_roundtrip (cyclomatic 16): perry_codegen::gc_map::verify_roundtrip 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/perry-codegen/src/gc_map.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d316e3ebec2f3e99f6de21f471e44a0610fd208a63e314d03e52075e2fea7f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::capture_writeback::emit_class_capture_writeback (cyclomatic 16): perry_codegen::lower_call::capture_writeback::emit_class_capture_writeback 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/perry-codegen/src/lower_call/capture_writeback.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1459775dea558d43af716bb28a89af28f429e838c66a68fe776e63719c3c8869"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::closure_analysis::find_outer_writes_expr (cyclomatic 16): perry_codegen::lower_call::closure_analysis::find_outer_writes_expr 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/perry-codegen/src/lower_call/closure_analysis.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0e4b01d4091f0ca652c0874898466686ab8012c7bcfdbcdaa6b73830358b88"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::lower_call::private_method::try_lower_private_method_call (cyclomatic 16): perry_codegen::lower_call::private_method::try_lower_private_method_call 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/perry-codegen/src/lower_call/private_method.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ec0870495370e718fbdb715c8ce1078820bba9b61aeb429c87a15c6ea0f774"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::module::linkage::external_decl_for_global (cyclomatic 16): perry_codegen::module::linkage::external_decl_for_global 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/perry-codegen/src/module/linkage.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"3033ac7640dce8fec30d5dcd0d1f3af7dbd8c657d3d570d6c1e3c04156a66176"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::providers::program_providers (cyclomatic 16): perry_codegen::providers::program_providers 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/perry-codegen/src/providers.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06770def0d1ad79e47d516e8ba12f308fb5f90681323789aef90763e0a00857"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::loops::lower_for (cyclomatic 16): perry_codegen::stmt::loops::lower_for 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. This is NOT this file\u0027s highest cyclomatic complexity: perry_codegen::stmt::loops::stmt_mutates_local (cyclomatic 17) 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":6940}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59691cad7ee17c0fcf2b21d7701bd80f0b766fe5a35b0eface04b1434c5f17c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::loops::i32_counter::prepare (cyclomatic 16): perry_codegen::stmt::loops::i32_counter::prepare 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/perry-codegen/src/stmt/loops/i32_counter.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9f73b41b873948adf26b5fb6c53b4ac5c64dec06088204a0ff30bb725a5480"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::region_loop::plan::assigned (cyclomatic 16): perry_codegen::stmt::region_loop::plan::assigned has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 2 function items inside it that branch (s_walk, e_walk). 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/perry-codegen/src/stmt/region_loop/plan.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"85640629480036637f0542ad29954bc68d0bb05cc311fe3b7db38b9c921aafab"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::stable_packed_typed_array::collect_stmt_uses (cyclomatic 16): perry_codegen::stmt::stable_packed_typed_array::collect_stmt_uses 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/perry-codegen/src/stmt/stable_packed_typed_array.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4b7eb18bd165d43b709086d097e9a00f2c97a0a34e8b9f5e1bd4215ad1cd9b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen::stmt::string_length_loop::match_loop (cyclomatic 16): perry_codegen::stmt::string_length_loop::match_loop 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/perry-codegen/src/stmt/string_length_loop.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc426b205872aacdfa2238284a4ea233ac3ee01141d7000bc094e40d3a8fbf2"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_codegen_arkts::mutations::collect_mutations_in_stmt (cyclomatic 16): perry_codegen_arkts::mutations::collect_mutations_in_stmt has cyclomatic complexity 16 (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/perry-codegen-arkts/src/mutations.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"413dc76e7690554074e48566521eda7158d9c96aac3dfaf1720fcd7c73d4127e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_component_host::async_values::reader_cleanup::visitors::emit (cyclomatic 16): perry_component_host::async_values::reader_cleanup::visitors::emit 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/perry-component-host/src/async_values/reader_cleanup.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b96a339085a5c9fb91b96aa10a577df9d1fc75bb33335becf6eb93a6725c443"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_http::client_events::handle_response_event (cyclomatic 16): perry_ext_http::client_events::handle_response_event 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/perry-ext-http/src/client_events.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f8783ddd7a14681f9211a5bbbfba23f48456f240fc43242a63cae9b1a527f6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_http::root_scanner::scan_http_roots (cyclomatic 16): perry_ext_http::root_scanner::scan_http_roots 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/perry-ext-http/src/root_scanner.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6976b4e27f26793603c7c75c2f3cc6ba4d9c84b573c8d54a384143089db63b2b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_http::server::scan_http_server_roots (cyclomatic 16): perry_ext_http::server::scan_http_server_roots 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, 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/perry-ext-http/src/server/mod.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"24dff0270ce6567e28a0181f8983a75428180d08c5fd864b3eef5f1b0ea52305"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_http::server::dispatch_ext::http_server_method_dispatch_ext (cyclomatic 16): perry_ext_http::server::dispatch_ext::http_server_method_dispatch_ext 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. This shape REPEATS in the file: one other method here (perry_ext_http::server::dispatch_ext::http_server_property_dispatch_ext) 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/perry-ext-http/src/server/dispatch_ext.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"47913ef37ea434ae2c1aaec3175e0d409dc8d16bcf698bfcbc89ebee4a8470be"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_http::server::dispatch_ext::http_server_property_dispatch_ext (cyclomatic 16): perry_ext_http::server::dispatch_ext::http_server_property_dispatch_ext 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. This shape REPEATS in the file: one other method here (perry_ext_http::server::dispatch_ext::http_server_method_dispatch_ext) 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/perry-ext-http/src/server/dispatch_ext.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6108233f3e0d9d82affabd739cbbb5387fa7a369eb6e45f80cd4ab0df1dee00"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_http::server::server::process_pending (cyclomatic 16): perry_ext_http::server::server::process_pending 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/perry-ext-http/src/server/server.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"429c642d433666ecb10727a59477510ec704607228cc4f53b2ab6e8b0e915976"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ext_http::server::turnloop_h2::native_server::sink (cyclomatic 16): perry_ext_http::server::turnloop_h2::native_server::sink 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/perry-ext-http/src/server/turnloop_h2/native_server.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f670cc6b7a7d2be930e647c35af030660e411cdaf140de802d41ac6e7f73b13"}},{"ruleId":"D1","level":"warning","message":{"text":"Gzip::read (cyclomatic 16): Gzip::read has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-zlib/src/stream/driver.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b98285e9686765400e1cc89103ba481230827611641d1142a6ccdab8b94f4f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_gc_effects::instructions::flow (cyclomatic 16): perry_gc_effects::instructions::flow 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/perry-gc-effects/src/instructions.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1f4a2bd61d91f74820f0d5bd4d1b4faa03b30c3173fc09de2c4d0396ac63b7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::analysis::fn_infer::layout::infer_layouts (cyclomatic 16): perry_hir::analysis::fn_infer::layout::infer_layouts 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/perry-hir/src/analysis/fn_infer/layout.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8dbc3c9fe3ecbf60cbcf1f4437e6061d4ce9ba36119dc6bdaadfd7d23724526"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::js_transform::imports::transform_js_imports (cyclomatic 16): perry_hir::js_transform::imports::transform_js_imports 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/perry-hir/src/js_transform/imports.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"737e42e90b40f4afd50ded59be5ac51b89cb4827c54d592d4dbddc98b98fb26e"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::builder_fold::walk_class (cyclomatic 16): perry_hir::lower::builder_fold::walk_class 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: perry_hir::lower::builder_fold::scan_stmt (cyclomatic 21) 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/perry-hir/src/lower/builder_fold.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1fadfd847846df119daef842f774452c1a33edd6051e60317bc4e89f2228838"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::const_fold_fn::resolve_fn_ctor_arg (cyclomatic 16): perry_hir::lower::const_fold_fn::resolve_fn_ctor_arg 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/perry-hir/src/lower/const_fold_fn.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa3c5c5a0670a9892b4c7520c139f562a544fbc2d424198f357444a25f8b5f2"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::const_fold_fn::try_indirect_eval_general (cyclomatic 16): perry_hir::lower::const_fold_fn::try_indirect_eval_general 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/perry-hir/src/lower/const_fold_fn.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce2145b55455df0dce3c5464c859bdf7e59e64bf4844636218e6a33a3565c64"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::const_fold_fn::try_eval_function_member_call_fold (cyclomatic 16): perry_hir::lower::const_fold_fn::try_eval_function_member_call_fold 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/perry-hir/src/lower/const_fold_fn.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50be3b247ea284eaf192c3ecc858cbf4f55ff33797323d3d55c154a6b98e72c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::eval_super_scan::scan_class (cyclomatic 16): perry_hir::lower::eval_super_scan::scan_class 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/perry-hir/src/lower/eval_super_scan.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"330672add2aff10b1135a96173c56e82a71974bd686e7973a03ab1fa1ceaee77"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::intrinsics::require::try_import_meta_require (cyclomatic 16): perry_hir::lower::expr_call::intrinsics::require::try_import_meta_require 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/perry-hir/src/lower/expr_call/intrinsics/require.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"819c6f459d09c47b27ec1a8d3b422aea2f0bae4c6f2df07d5bc6c9ce6ddea1db"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_call::nested_namespace::try_path_subnamespace (cyclomatic 16): perry_hir::lower::expr_call::nested_namespace::try_path_subnamespace 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/perry-hir/src/lower/expr_call/nested_namespace.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc91ad73338b3f5554c9af185a54cba0df4da544ed404ce4ce950d8eb5c5a1b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::expr_function::insert_class_capture_refresh_inside_expressions::visit_stmt (cyclomatic 16): perry_hir::lower::expr_function::insert_class_capture_refresh_inside_expressions::visit_stmt 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/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1021bedb63b2468f160d49a49a66a226ce761ea896a596957e24b7285cd774"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::fn_ctor_env::eval_const_expr (cyclomatic 16): perry_hir::lower::fn_ctor_env::eval_const_expr 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/perry-hir/src/lower/fn_ctor_env.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf64a49b498dcf2c25c40e647636396580b77da1dc233fa1e7e27b07f4f4a76"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::lower_module_fn::should_enable_react_automatic_jsx (cyclomatic 16): perry_hir::lower::lower_module_fn::should_enable_react_automatic_jsx 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/perry-hir/src/lower/lower_module_fn.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5b3be4e62f83044edd6f732f63ac349213118ba6a704442b94ca8ebe9d0842"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::misc::number_to_js_key (cyclomatic 16): perry_hir::lower::misc::number_to_js_key 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/perry-hir/src/lower/misc.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a5ae8e90e3a88a3b627c35635604ad65b21392f5a77b5903b610bccc2f7fdf"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::misc::is_ast_string_expr (cyclomatic 16): perry_hir::lower::misc::is_ast_string_expr 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/perry-hir/src/lower/misc.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4879082f61d6f9b9a2657035433c69fdfc1ab4b3797c23a400775f7234345f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::widget_decl::parse_widget_node (cyclomatic 16): perry_hir::lower::widget_decl::parse_widget_node 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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"102be0d797dbf45806517d527dd6de5c284321d1faf6a281a0b3a49596826dcd"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower::widget_decl::parse_reload_policy_seconds (cyclomatic 16): perry_hir::lower::widget_decl::parse_reload_policy_seconds 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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":1493}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cea2a6c202075692078830fba790c7df9fc9bffdc4d807d95148ead82925de6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::block::push_nested_block_stmt_lists (cyclomatic 16): perry_hir::lower_decl::block::push_nested_block_stmt_lists 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/perry-hir/src/lower_decl/block.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"90caeb1c3ae257710623e594c8ac0ab76ebea8691bdd01ab18b81f7abc1f8c19"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::body_stmt::find_native_return_in_stmts (cyclomatic 16): perry_hir::lower_decl::body_stmt::find_native_return_in_stmts 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/perry-hir/src/lower_decl/body_stmt.rs"},"region":{"startLine":2540}}}],"partialFingerprints":{"codehealthFindingId/v1":"32778cf4a5d2062da3dd406e2b72d3b0a37c145a4ed37377c1b0726d4228bd39"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_decl::class_validation::validate_class_element_early_errors (cyclomatic 16): perry_hir::lower_decl::class_validation::validate_class_element_early_errors 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/perry-hir/src/lower_decl/class_validation.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"339eaa710a6e66c9557c174ea17972c53cea3d56582746f669988b9998001f70"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::lower_patterns::lower_assign_target_to_expr (cyclomatic 16): perry_hir::lower_patterns::lower_assign_target_to_expr 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/perry-hir/src/lower_patterns.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2436febd7db66701adf7e5f3abe34698b0579f3645c5f8f9649c11876af2e47"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_hir::monomorph::infer::unify_types (cyclomatic 16): perry_hir::monomorph::infer::unify_types 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/perry-hir/src/monomorph/infer.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c677f9476dc0bcfd5b254015734e3f5ba58962bfc24f8f87e9b3093d673d01"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphemeState::width (cyclomatic 16): GraphemeState::width 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/perry-runtime/src/bun_compat/string_width.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"758a2db0eacba018b20360a76f252753096472e2da1aee305638cea43d981c66"}},{"ruleId":"D1","level":"warning","message":{"text":"PathModuleRegistry::require_with (cyclomatic 16): PathModuleRegistry::require_with 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/perry-runtime/src/module_require/path_registry.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba55b30c5a670dcd04892c85aa46b17947e68e7cc76a3d257c3e2eb3cb6d8d26"}},{"ruleId":"D1","level":"warning","message":{"text":"Api::inventory_with_clock (cyclomatic 16): Api::inventory_with_clock 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/perry-runtime/src/tls/roots/macos.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"4943ff0ae68a32f5e7d679b9f20cc822a843bf7a0e8d4ea4656e92cb06284096"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::arena::page_meta::retag_block_space_inner (cyclomatic 16): perry_runtime::arena::page_meta::retag_block_space_inner 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/perry-runtime/src/arena/page_meta/mod.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab033414cdb949c23da7b11de276b227484876ad217588c7ff18071592c94c0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::arena::quarantine::report_stale_address_holders (cyclomatic 16): perry_runtime::arena::quarantine::report_stale_address_holders 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/perry-runtime/src/arena/quarantine.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f1fd7eb6d8a283732ed40ae75468df6ea58722c72f2c428a5c8e9cc52ae273"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::concat_reverse::js_array_fill_range (cyclomatic 16): perry_runtime::array::concat_reverse::js_array_fill_range 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/perry-runtime/src/array/concat_reverse.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"3966a140152a6141590274a7f7333027db4e24f5d8e8072bc955c128f36647f9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::from_concat::array_from_full (cyclomatic 16): perry_runtime::array::from_concat::array_from_full 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/perry-runtime/src/array/from_concat.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"33febad449a30a37389438dc176887942391fb6ab4477d1677e7f3164d460f26"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::generic::al_get (cyclomatic 16): perry_runtime::array::generic::al_get 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: perry_runtime::array::generic::dispatch_arraylike_read_method (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/array/generic.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04706578124bdc2f6230c30e2db665cae0565c024bb65e4327700a96bd43635"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::immutable::js_array_copy_within_value (cyclomatic 16): perry_runtime::array::immutable::js_array_copy_within_value 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/perry-runtime/src/array/immutable.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"83eadf0d0f84b4dc3cf35a9b3f201fc7a58a5a0a407b84ef612cfb649abbe6d0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::iter_methods::js_array_reduce (cyclomatic 16): perry_runtime::array::iter_methods::js_array_reduce 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/perry-runtime/src/array/iter_methods.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"8627682c761845e24db92a950673280ecbbc116508f8da60f6e01d773036bd88"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::iterator::js_for_of_to_array (cyclomatic 16): perry_runtime::array::iterator::js_for_of_to_array 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/perry-runtime/src/array/iterator.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b83d5a35c61e27f74f77ad52e7a0501439ecebd657dc8dcc5d6a8ceb05bc49"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::reduce_right::js_array_reduce_right (cyclomatic 16): perry_runtime::array::reduce_right::js_array_reduce_right 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/perry-runtime/src/array/reduce_right.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9f9337ca2a152744a53643928fa9476f4692b321db6a60abd75667b6ba0cc5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::search::js_array_indexOf_jsvalue (cyclomatic 16): perry_runtime::array::search::js_array_indexOf_jsvalue 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/perry-runtime/src/array/search.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"182064a07c4f2803fbf38b231d50d32d8c53ea5c1a775f91c9d523b0c159cd32"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::array::subclass::ensure_subclass_numeric_prefix (cyclomatic 16): perry_runtime::array::subclass::ensure_subclass_numeric_prefix 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/perry-runtime/src/array/subclass.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"494d2b615f9cfdfe727ad7acc8c570001b35d6279991d90fe99f6605fa31a7e1"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::buffer::store::store_alloc (cyclomatic 16): perry_runtime::buffer::store::store_alloc 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/perry-runtime/src/buffer/store.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f109f20d96266f221c9f90f6df2c1b3b76bfa44113fa81137c30e8e417e6e0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::builtins::console::try_console_instance_method_dispatch (cyclomatic 16): perry_runtime::builtins::console::try_console_instance_method_dispatch 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/perry-runtime/src/builtins/console.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a62b240106113fa044112466f152c5093c6c943680854eeb17f0cc3e947b86c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::builtins::console::decode_dir_bool_option (cyclomatic 16): perry_runtime::builtins::console::decode_dir_bool_option 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/perry-runtime/src/builtins/console.rs"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f866972ec8330abea2830a6dba16ad7134e825e735ac3da0f7b0b31ac3a788"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::date::jsvalue_to_number (cyclomatic 16): perry_runtime::date::jsvalue_to_number 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/perry-runtime/src/date.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d988cb78dc639148dfe7f7d0016caaa06acee65b7382cb4be4fd09024ebaec"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::fs::dir_glob_watch::glob::parse_glob_chars (cyclomatic 16): perry_runtime::fs::dir_glob_watch::glob::parse_glob_chars 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/perry-runtime/src/fs/dir_glob_watch/glob.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b5606372debf0a27cccd19d6bef59c92ac55940329280d6defa406278691c7"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::fs::stream::write_turn::write_stream_drain_step (cyclomatic 16): perry_runtime::fs::stream::write_turn::write_stream_drain_step 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/perry-runtime/src/fs/stream/write_turn.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08dffe020b5b7b77406400c446de7f5b442bf85d91f7c496c6eacdba9210a5c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::intl::icu_dtf::format (cyclomatic 16): perry_runtime::intl::icu_dtf::format 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/perry-runtime/src/intl/icu_dtf.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f35440d0e68fd0f9bc806c874e057035f7dcadc4f7b1e91a75694189e6d90cc"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::json::stringify_api::try_stringify_lazy_array (cyclomatic 16): perry_runtime::json::stringify_api::try_stringify_lazy_array 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/perry-runtime/src/json/stringify_api.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f7ede7f5a2fe373098a45b0ecdcef67c255f967ee23952ca45b8bced452817"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::module_require::resolve_file (cyclomatic 16): perry_runtime::module_require::resolve_file 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/perry-runtime/src/module_require.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af1c8718a3754ea9db06fafcd4d9bf15ae7bd08bad7bbe26d9b5e436a2584ec"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::module_require::require_path (cyclomatic 16): perry_runtime::module_require::require_path 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/perry-runtime/src/module_require.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"96955e763f31810f1a1c35077e4fc6f3f38fabf26161efa05700d5eec5cf38fb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::node_stream_constructors::builders::init_duplex_in_place (cyclomatic 16): perry_runtime::node_stream_constructors::builders::init_duplex_in_place 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/perry-runtime/src/node_stream_constructors/builders.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1bfa3164aae273beb0333336b801fe0f593bd9a561179bc8e6f72168eeaf7d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::node_stream_event_emitter::add_stream_listener_for_event_with_options (cyclomatic 16): perry_runtime::node_stream_event_emitter::add_stream_listener_for_event_with_options 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/perry-runtime/src/node_stream_event_emitter.rs"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ab57e8e250e6873fb4f48e5d1bca8c31d5b46fe37b11300be730ac6fd2789c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::builtin_proto::receiver_fact (cyclomatic 16): perry_runtime::object::builtin_proto::receiver_fact 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/perry-runtime/src/object/builtin_proto.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbb59cdc129f4f7efeebd73b652ce035922363daaa137941e1a8cd98198f7bf"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::class_registry::class_registry_census (cyclomatic 16): perry_runtime::object::class_registry::class_registry_census 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/perry-runtime/src/object/class_registry.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b759cf3bf041d5366e4912879612c210e51e189471b743bb5bb43fa2145827"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::class_registry::construct::extends_target_must_throw (cyclomatic 16): perry_runtime::object::class_registry::construct::extends_target_must_throw 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/perry-runtime/src/object/class_registry/construct.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0a16cfdfb5b675d3405c1adf5af7fda9599e9f614496ae4e6d59ecfb34a06a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::exotic_expando::exotic_set_property (cyclomatic 16): perry_runtime::object::exotic_expando::exotic_set_property 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/perry-runtime/src/object/exotic_expando.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"501dd88a18e74e0d8928ffddc0f828acba699ac0a9c546816f5f22c091891220"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_get_set::class_object_template::record_prototype_template (cyclomatic 16): perry_runtime::object::field_get_set::class_object_template::record_prototype_template 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/perry-runtime/src/object/field_get_set/class_object_template.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6f1f9614227e3f507b3d6dc14f7c1acd745b55bd485b13c540b0cf3bd90781"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::field_get_set::class_object_template::evaluation_chain_lost_method (cyclomatic 16): perry_runtime::object::field_get_set::class_object_template::evaluation_chain_lost_method 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/perry-runtime/src/object/field_get_set/class_object_template.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62ef72bd6e4cb42d56f2d37db1495f1c73cd62909e5f49b140df12c08334dd0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::layout_desc::store::family_overwrite (cyclomatic 16): perry_runtime::object::layout_desc::store::family_overwrite 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/perry-runtime/src/object/layout_desc/store.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc57c81443fa8cd59bad7b7be52bb788075aecb21b2183e4bd5df71a3a42453"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::layout_probe::probe_get_at (cyclomatic 16): perry_runtime::object::layout_probe::probe_get_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/perry-runtime/src/object/layout_probe.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4cada6334531fcd3e0961121d2eeef885521cc34c6a854daef2c6382fd572a"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::layout_probe_site_memo::prime (cyclomatic 16): perry_runtime::object::layout_probe_site_memo::prime 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/perry-runtime/src/object/layout_probe_site_memo.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7611dad8926fc6f9573091920748415b9d6c4c0d761abbe54016e0a11d7ed0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_call_method::class_holder::class_instance_inherited_read (cyclomatic 16): perry_runtime::object::native_call_method::class_holder::class_instance_inherited_read 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/perry-runtime/src/object/native_call_method/class_holder.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a6797c0f7c3db8443a759816aa29a7d12370dcce0e45f80649620c4de5c0bc"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_call_method::disposal::try_disposable_stack_method_dispatch (cyclomatic 16): perry_runtime::object::native_call_method::disposal::try_disposable_stack_method_dispatch 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/perry-runtime/src/object/native_call_method/disposal.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"0311036dd247baf1e14921d2e03622126d641e04c827f79df3bd88205e354f95"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_module::constructor_shapes::attach (cyclomatic 16): perry_runtime::object::native_module::constructor_shapes::attach 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. This is NOT this file\u0027s highest cyclomatic complexity: perry_runtime::object::native_module::constructor_shapes::native_parent (cyclomatic 23) 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/perry-runtime/src/object/native_module/constructor_shapes.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2762dc0bfaa8620390366b84291996ee5de17ff18ada67747fbdb1f27c4fab"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::native_module_dispatch::dispatch_a_c::nm_dispatch_crypto (cyclomatic 16): perry_runtime::object::native_module_dispatch::dispatch_a_c::nm_dispatch_crypto 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. This is NOT this file\u0027s highest cyclomatic complexity: perry_runtime::object::native_module_dispatch::dispatch_a_c::nm_dispatch_bun (cyclomatic 30) 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/perry-runtime/src/object/native_module_dispatch/dispatch_a_c.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca4ebd4385a95f8c3ecd41cc436d483b7f9572a8446f936d09dda431d31dfed"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::object_ops::define_properties::js_object_define_properties (cyclomatic 16): perry_runtime::object::object_ops::define_properties::js_object_define_properties 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/perry-runtime/src/object/object_ops/define_properties.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1e57c91225c37440d83a7e6da2c0319b1b3477dc53280fd777c68b8e749f92"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::object_ops_frozen::js_object_is_frozen (cyclomatic 16): perry_runtime::object::object_ops_frozen::js_object_is_frozen 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/perry-runtime/src/object/object_ops_frozen.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"93090912b19590490d24de5cb87e697c6e9d3a0b9988ade3a507bf2e17547d51"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::object_ops_frozen::js_object_is_extensible (cyclomatic 16): perry_runtime::object::object_ops_frozen::js_object_is_extensible 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/perry-runtime/src/object/object_ops_frozen.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"974bc875600270ef2ee8e78f644e15599907e68aabce95f5e32bb2e9a27c2878"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::property_ops::common::create_list_from_array_like (cyclomatic 16): perry_runtime::object::property_ops::common::create_list_from_array_like 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/perry-runtime/src/object/property_ops/common.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4869b01af4a1a945dffa26fdccf97f7ea2ce3bebdec1f7df98799cb23663263"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::prototype_chain::resolve_inherited_field_from_prototype (cyclomatic 16): perry_runtime::object::prototype_chain::resolve_inherited_field_from_prototype 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/perry-runtime/src/object/prototype_chain.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e3ee9547c4be71fde378f7eb6ac86f69226d96654f648ffd7d8d688f66a5ba"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::shape_store::try_store_with_refresh (cyclomatic 16): perry_runtime::object::shape_store::try_store_with_refresh 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/perry-runtime/src/object/shape_store.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d5736af09733da27af7b4334884e0ecd1537ad22bf3981c386c55fbf9e1bf0"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::object::shapes::shape_descriptor_intern_with_special_mode (cyclomatic 16): perry_runtime::object::shapes::shape_descriptor_intern_with_special_mode 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/perry-runtime/src/object/shapes.rs"},"region":{"startLine":1938}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f55050cce2585cc8896e6e5b4f44c362c32de8938e8d79aa4074b64199d2634"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::os::js_os_cpus::host_cpu_infos (cyclomatic 16): perry_runtime::os::js_os_cpus::host_cpu_infos 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/perry-runtime/src/os.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ea879faeb4e501ed3a9d7c7725f307173f3157284d5ac801921874d7865581"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::proxy::get::proxy_get_with_receiver_impl (cyclomatic 16): perry_runtime::proxy::get::proxy_get_with_receiver_impl 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/perry-runtime/src/proxy/get.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6725e196591302975f28d17ffbb1924e1f028176f806f1c5297b7ce8817f590c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::punycode::encode (cyclomatic 16): perry_runtime::punycode::encode 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/perry-runtime/src/punycode.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4523cb6acb2d0b5d34a4113fd8ee7eb9199562fd32729007727aad22d3181d8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::regex::perex_literal_search::each_readers (cyclomatic 16): perry_runtime::regex::perex_literal_search::each_readers 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/perry-runtime/src/regex/perex_literal_search.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"5485c6d3e093bdbbfe148ae8b46e835dcb0e0e17c380f2aa3d6971a6d39a909f"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::string::compare::js_string_to_well_formed (cyclomatic 16): perry_runtime::string::compare::js_string_to_well_formed 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/perry-runtime/src/string/compare.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba8341ad7504bec7b1a81486587e21f2452c49d0c0c5bf13a670dc955efe628"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::string::concat::canonicalize_surrogate_pairs (cyclomatic 16): perry_runtime::string::concat::canonicalize_surrogate_pairs 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/perry-runtime/src/string/concat.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66a2e274eddf99aa19ab54e37fb656a9f29ef1337dbb0cc7f398b6ea905e912"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::string::concat::concat_byte_parts (cyclomatic 16): perry_runtime::string::concat::concat_byte_parts 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/perry-runtime/src/string/concat.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ef347107400bb3b0a82c71549cc28773c111daad2d04f130d960e91fde0aad"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::string::concat::js_string_concat (cyclomatic 16): perry_runtime::string::concat::js_string_concat 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/perry-runtime/src/string/concat.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed479934b39b0628e67f4af0f443846a1bea25840943bcd6b90d2b3815cf645"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::symbol::get::explicit_prototype_symbol_lookup (cyclomatic 16): perry_runtime::symbol::get::explicit_prototype_symbol_lookup 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/perry-runtime/src/symbol/get.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3a6b3ef8478df528e400bb52199adf1e88c90a4618e44fba02c99a6c196ae6"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::symbol::iterator::js_to_primitive (cyclomatic 16): perry_runtime::symbol::iterator::js_to_primitive 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/perry-runtime/src/symbol/iterator.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3760b681bfe347c52a4b182088f33add4ba8c5261ec5c891a7924acc162a46d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::typed_feedback::classify_array (cyclomatic 16): perry_runtime::typed_feedback::classify_array 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/perry-runtime/src/typed_feedback.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"454eab3d503945af49344bde97ff0312abad4c3547297c89082cfda0b1d86a07"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::typedarray::access::js_typed_array_set_from (cyclomatic 16): perry_runtime::typedarray::access::js_typed_array_set_from 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/perry-runtime/src/typedarray/access.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa68b1e07349581c0db1df30c4e6c3bd682ab7c8b6619beaae59ec1063737bf9"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_runtime::typedarray_named::get (cyclomatic 16): perry_runtime::typedarray_named::get 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/perry-runtime/src/typedarray_named.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afa06b58ebad3038c1a5646d704dae6d00426721667066fc0f24509c17503d4"}},{"ruleId":"D1","level":"warning","message":{"text":"ContentDecoder::next_chunk (cyclomatic 16): ContentDecoder::next_chunk 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/perry-stdlib/src/turnloop_client/content_decoding.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ab5f2bc75d8626f4a956210919a78f7b84c62167860b438871ee12f923c44c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::streams::tee::tee_pull_microtask (cyclomatic 16): perry_stdlib::streams::tee::tee_pull_microtask 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/perry-stdlib/src/streams/tee.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b42903447cfdfa0a404f688365212d888c869b9d242e3a2c9d33e0ec452d717"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::webcrypto::jwk::okp_jwk_export_object (cyclomatic 16): perry_stdlib::webcrypto::jwk::okp_jwk_export_object 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/perry-stdlib/src/webcrypto/jwk.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3d3b8759bdceaa14e93b85e636afda6d5244d2832d71a15504c1afc8507fd3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_stdlib::worker_threads::channel_pump::js_worker_threads_channels_has_pending (cyclomatic 16): perry_stdlib::worker_threads::channel_pump::js_worker_threads_channels_has_pending 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/perry-stdlib/src/worker_threads/channel_pump.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07c84d2e27c690650bb6ffc3a2cf640b001f82eff503f9e36a38e5e77c7a3e4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::closure_local_inline::for_each_expr_in_stmt (cyclomatic 16): perry_transform::closure_local_inline::for_each_expr_in_stmt 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 (perry_transform::closure_local_inline::for_each_expr_in_stmt_mut) 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/perry-transform/src/closure_local_inline.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"343b6c2ac550bfad2a8f5dde80fefcb29dffa997dc3d68f050f1dd909ae7d2c8"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::closure_local_inline::for_each_expr_in_stmt_mut (cyclomatic 16): perry_transform::closure_local_inline::for_each_expr_in_stmt_mut 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 (perry_transform::closure_local_inline::for_each_expr_in_stmt) 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/perry-transform/src/closure_local_inline.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"782222e3ef4243838c9de2cafd67cc3738fdab0ef3b0bfe68cf41d2044adad14"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::deforest::call_sites::rewrite_call_sites_in_stmts_with_local_pass (cyclomatic 16): perry_transform::deforest::call_sites::rewrite_call_sites_in_stmts_with_local_pass 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/perry-transform/src/deforest/call_sites.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36356d23d985d7c329f406d3e6e3d6093caeee2060d66f3a5df6ed1f2ae9944"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::generator::id_scan::compute_max_local_id (cyclomatic 16): perry_transform::generator::id_scan::compute_max_local_id has cyclomatic complexity 16 (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/perry-transform/src/generator/id_scan.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6a2e12f61448c5e03564dd06df4c03184877333f9132ed4ca6028fb076f53d"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::generator::per_iteration::each_expr (cyclomatic 16): perry_transform::generator::per_iteration::each_expr 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 (perry_transform::generator::per_iteration::each_expr_mut) 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/perry-transform/src/generator/per_iteration.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c17f39684b3c9351362d72859c4b64fed2f628e1cb85883296bb7e14b4ef001"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::generator::per_iteration::each_expr_mut (cyclomatic 16): perry_transform::generator::per_iteration::each_expr_mut 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 (perry_transform::generator::per_iteration::each_expr) 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/perry-transform/src/generator/per_iteration.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff957298e96ef91e2a09e13872294faaec694f3714d6dc81a755ddce7c491a4"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::generator::private_frame::lower_list::ids (cyclomatic 16): perry_transform::generator::private_frame::lower_list::ids 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 (perry_transform::generator::private_frame::lower_list) 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/perry-transform/src/generator/private_frame.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd25da679957e7e329727bca9a61b4926de6e18c7443479a98d690cd7cc5bae5"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::call_inliner::returns_only_anonymous_records::inspect (cyclomatic 16): perry_transform::inline::call_inliner::returns_only_anonymous_records::inspect 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/perry-transform/src/inline/call_inliner.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0b8c32e0a75b65a5d7ccb0f291fe1cbc7cba7f44cac64f7a09318da7eab506"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::closure_analysis::body_references_dynamic_this (cyclomatic 16): perry_transform::inline::closure_analysis::body_references_dynamic_this has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 2 function items inside it that branch (check_stmt, check_expr). 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. This is NOT this file\u0027s highest cyclomatic complexity: perry_transform::inline::closure_analysis::is_pure_function::expr_is_pure (cyclomatic 23) 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/perry-transform/src/inline/closure_analysis.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ba3c455930e90ccec7f2057ee84feb061573de80846366d4bef501e8546f20"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::cross_module::gather_cross_module_functions (cyclomatic 16): perry_transform::inline::cross_module::gather_cross_module_functions 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: perry_transform::inline::cross_module::is_cross_module_safe::check_stmt (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/perry-transform/src/inline/cross_module.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"038cf6d8b53501712c17b6db93367bfa434764acca3311dda03947ed063b5994"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::inline::imul::rewrite_imul_calls_in_expr (cyclomatic 16): perry_transform::inline::imul::rewrite_imul_calls_in_expr 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/perry-transform/src/inline/imul.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"479ea7c755c766cce4a74e691a2076b5b94aaf514ef2edc3e2f7220461c8ff37"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::local_occurrences::count_expr (cyclomatic 16): perry_transform::local_occurrences::count_expr 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/perry-transform/src/local_occurrences.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"726676587651477508b2612697d02f9a6310d59cb9eb1768ad2c90c2210b6f66"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_transform::unroll::unroll_static_loops (cyclomatic 16): perry_transform::unroll::unroll_static_loops 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: perry_transform::unroll::stmt_is_unrollable (cyclomatic 19) 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/perry-transform/src/unroll/mod.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2fdd756ce2da9596ac56172ef3b18b9731030191b4a7c5d5be5f455dac50fb"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_android::widgets::image::create_file (cyclomatic 16): perry_ui_android::widgets::image::create_file 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/perry-ui-android/src/widgets/image.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d993b4161d3cd79c69f1c92af13f0fd540cec60597740b656cc323d2d82e336"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_gtk4::drag_drop::deliver_drop (cyclomatic 16): perry_ui_gtk4::drag_drop::deliver_drop 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/perry-ui-gtk4/src/drag_drop.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ba4d2e6de2d74864fac9c78ae8cd5e6c1323547ee3ce952db5a004f25e8f45"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_gtk4::widgets::webview::install_signal_handlers (cyclomatic 16): perry_ui_gtk4::widgets::webview::install_signal_handlers 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/perry-ui-gtk4/src/widgets/webview.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4a7af844a6fbb4d90b317edc9976804c12469af4c8cb0c0d94031a709e1f98"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_ios::adaptive_layout::current_snapshot (cyclomatic 16): perry_ui_ios::adaptive_layout::current_snapshot 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/perry-ui-ios/src/adaptive_layout.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77eaa8d58cc47d9d66f62e43464da138b6d92cbab3fdbdb13c266a438f3e03c"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_ios::app::key_window_root_vc (cyclomatic 16): perry_ui_ios::app::key_window_root_vc 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/perry-ui-ios/src/app.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77ff809466befd79ba18d96a2fd26d74735fceac22370c781dca15e48f2bf89"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_ios::widgets::rich_tooltip::find_key_window (cyclomatic 16): perry_ui_ios::widgets::rich_tooltip::find_key_window 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/perry-ui-ios/src/widgets/rich_tooltip.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"785eb144f64dec11f587873961ec1205252edda6b97909525b35f2b0cf4ef1a3"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_visionos::widgets::rich_tooltip::find_key_window (cyclomatic 16): perry_ui_visionos::widgets::rich_tooltip::find_key_window 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/perry-ui-visionos/src/widgets/rich_tooltip.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51596dcde59f1551acb7d3d7aa8c89df217ded11f57dd97848f393cbe537d8b"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_ui_windows::widgets::image::image_wnd_proc (cyclomatic 16): perry_ui_windows::widgets::image::image_wnd_proc 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/perry-ui-windows/src/widgets/image.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"82db882a39e023aa585ecad39117ff564a6b79c0ed7cd74ae862ebb7eb0a623f"}},{"ruleId":"D1","level":"warning","message":{"text":"Gen::walk_all (cyclomatic 16): Gen::walk_all has cyclomatic complexity 16 (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/perry-wpfacts/src/gen/walk.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16af75867730c3efb43602ffe6ff3ee19d455dd5abbbe97fcfec22d540c0e62"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::mark_use (cyclomatic 16): Model::mark_use 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/perry-wpfacts/src/model/operations.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f0ec5ef59e9545f8be867164e01b2d2770d3728cb7b5fac5e0f7b53ac7e347"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::settle_members_from (cyclomatic 16): Model::settle_members_from 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/perry-wpfacts/src/model/operations.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"1721b6bc8b196a92e758e06162bd5eeaa32c48d1fbf07ed8c689d180694a17a9"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::mark_hard (cyclomatic 16): Model::mark_hard 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/perry-wpfacts/src/solve/call_and_construct.rs"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"77da0295cd326f168988148099e1418770a17bd4dec715172d5ad59568d064cd"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::implicit (cyclomatic 16): Model::implicit 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. This is NOT this file\u0027s highest cyclomatic complexity: Model::cons_line (cyclomatic 67) 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/perry-wpfacts/src/solve.rs"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"d856c997807422ee6d08bf69811eb105f680d105d9ccfc0cd3aeed489b469f3a"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::escape_this (cyclomatic 16): Model::escape_this has cyclomatic complexity 16 (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. This is NOT this file\u0027s highest cyclomatic complexity: perry_wpfacts::summary::map_cons (cyclomatic 67) 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/perry-wpfacts/src/summary.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"7194e34461858947bd1d0aae38c8d6c3c627900d99f6134fce4746f5013c86f7"}},{"ruleId":"D1","level":"warning","message":{"text":"gc-currentc170-regression-profile-v23.run (cyclomatic 16): gc-currentc170-regression-profile-v23.run 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":"docs/audits/gc-rss-instructions-2026-10-03/gc-currentc170-regression-profile-v23.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f68342aceb9ed49a7ceeaabad39868e8810515f361c5ff760545a636e193f90"}},{"ruleId":"D1","level":"warning","message":{"text":"latest-main2026-normal-auto-driver.build_arm (cyclomatic 16): latest-main2026-normal-auto-driver.build_arm 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":"docs/audits/gc-rss-instructions-2026-10-03/latest-main2026-normal-auto-driver.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51f7dff47d1924d287cc894f46f3772b9403bf5d79d4306ad23eaa84be8bd04"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-gc-paired-instruction-domains-v1.main (cyclomatic 16): verify-gc-paired-instruction-domains-v1.main 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":"docs/audits/gc-rss-instructions-2026-10-03/verify-gc-paired-instruction-domains-v1.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2565cb7441c23dac30ae867e135edd79f57e27c2cf7b1b1226faed6e27fffd1a"}},{"ruleId":"D1","level":"warning","message":{"text":"ci_plan.plan (cyclomatic 16): ci_plan.plan 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":"scripts/ci_plan.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aca510480addf6db1738c6a3ebf80c4f4aa41154f2b1bb9cb1ed24b52dbd0bb"}},{"ruleId":"D1","level":"warning","message":{"text":"analyzers.runtime_counter_summary (cyclomatic 16): analyzers.runtime_counter_summary 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":"scripts/compiler_output_harness/analyzers.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0be31f63867b84f8caa2553b6900900c750c29226d0c051a58c6bf634a5116"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_root_dominance_check._seed_sites (cyclomatic 16): gc_root_dominance_check._seed_sites 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":2641}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7c529d60f16744c7dd09af32fe1502e11229f4f1d8be6430532fab482732df"}},{"ruleId":"D1","level":"warning","message":{"text":"gc_root_dominance_check._constant_based (cyclomatic 16): gc_root_dominance_check._constant_based 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":5199}}}],"partialFingerprints":{"codehealthFindingId/v1":"677da8405e2ed4a1d508b10742aa21b9cc37e9c07866c5a73def687496ab2f15"}},{"ruleId":"D1","level":"warning","message":{"text":"global_sink_isolation.audit (cyclomatic 16): global_sink_isolation.audit 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":"scripts/global_sink_isolation.py"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d3aa672a7cb1f7a5f7da146fc3bd74b2c72cbd0b0ceb343cc8f7c69e76709e"}},{"ruleId":"D1","level":"warning","message":{"text":"native_abi_evidence_report.packet_record_matches (cyclomatic 16): native_abi_evidence_report.packet_record_matches 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":"scripts/native_abi_evidence_report.py"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"e048d6e2b8062a6b8f6203faf9dd713ee7faeeed4acb6bb774e905082357b5b6"}},{"ruleId":"D1","level":"warning","message":{"text":"native_abi_evidence_report.material_accounting_rows (cyclomatic 16): native_abi_evidence_report.material_accounting_rows 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":"scripts/native_abi_evidence_report.py"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14232368498d5dd81d7375ff6b02ee58a59a55cedd2449738fa2fd9b0026707"}},{"ruleId":"D1","level":"warning","message":{"text":"perf_frontier_report.main (cyclomatic 16): perf_frontier_report.main 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":"scripts/perf_frontier_report.py"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4fc45d3c554f14996b8388c51c914bd54364bb85482736cfe1b65641a13336e"}},{"ruleId":"D1","level":"warning","message":{"text":"realm_manifest_coverage.resolve_cell (cyclomatic 16): realm_manifest_coverage.resolve_cell 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":"scripts/realm_manifest_coverage.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"9371cf2d487dce28c82dfc5f1f3775026753b0daba8c3898d74fa994484a9f5f"}},{"ruleId":"D1","level":"warning","message":{"text":"string_payload_access_inventory.main (cyclomatic 16): string_payload_access_inventory.main 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":"scripts/string_payload_access_inventory.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"a066173b1f1f69c4c068468a346f57d232e569e2d18194a45ed9139f38c363cf"}},{"ruleId":"D1","level":"warning","message":{"text":"string_validator_inventory.check (cyclomatic 16): string_validator_inventory.check 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":"scripts/string_validator_inventory.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccaaed943bd950c6355274bbd50d213cd2ae8df6558b4784ab8ef093720bb999"}},{"ruleId":"D1","level":"warning","message":{"text":"server_ab.run_load (cyclomatic 16): server_ab.run_load 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":"scripts/turnloop/server_ab.py"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d76332f29d43bd86c55401f872b1630c51a7ee441e609d47d28a26204dbc0c"}},{"ruleId":"D1","level":"warning","message":{"text":"unrooted_local_shape.scan_function (cyclomatic 16): unrooted_local_shape.scan_function 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":"scripts/unrooted_local_shape.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ef4fd6bea6398829b0480f8029a6cb0e4a920d7f16448ce44292ae0e350777"}},{"ruleId":"D1","level":"warning","message":{"text":"wpfacts_precision.main (cyclomatic 16): wpfacts_precision.main 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":"scripts/wpfacts_precision.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e32e9b214f5d26d26aff263c80773ebddc788a10488a125a6e7af3ec417d78"}},{"ruleId":"D1","level":"warning","message":{"text":"web_runtime.hone_editor_render_line (cyclomatic 16): web_runtime.hone_editor_render_line 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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":2313}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4da52b3de4f2f42631c295d3f614c219dca23f645a400e1d525accc570e5618"}},{"ruleId":"D1","level":"warning","message":{"text":"update-actions.inspectActionPins (cyclomatic 16): update-actions.inspectActionPins 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":"scripts/update-actions.mts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb472ac3d658fa18ed30cf56d9b57401311e607c65d4bc51e833dd9485593925"}},{"ruleId":"D1","level":"warning","message":{"text":"node_compat_matrix.runMatrix (cyclomatic 16): node_compat_matrix.runMatrix 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":"scripts/node_compat_matrix.mjs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2767d2de195c5a2b1f7f493b4c66be770d58243e402235be51edf71b8d212a"}},{"ruleId":"D1","level":"warning","message":{"text":"node_compat_matrix.baselineValidationError (cyclomatic 16): node_compat_matrix.baselineValidationError 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":"scripts/node_compat_matrix.mjs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae77e20eb96518d111c2c12d9eee514aa9ff0648e9b5a378d0cbe3f9c9ed78b8"}},{"ruleId":"D1","level":"warning","message":{"text":"scan.scanTarball (cyclomatic 16): scan.scanTarball 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":"scripts/publish/scan.mts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2216e6e058e1b7c565521f3fb5b7b65a7b6bdd90daf9e57d3a5b84b672af88"}},{"ruleId":"D1","level":"warning","message":{"text":"perry_audio_play (cyclomatic 16): perry_audio_play 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 cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4392}}}],"partialFingerprints":{"codehealthFindingId/v1":"843b962a78eee4448dae5d6577ec715f99c8502f483be347b65129599b42a04c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::run_pipeline::run_with_parse_cache (cognitive 2499): perry::commands::compile::run_pipeline::run_with_parse_cache has cognitive complexity 2499 (threshold 15). Drivers by points: if/else 610 (1796 pts), loops 178 (410 pts), match/switch 70 (174 pts), boolean chains 119 (nesting depth added 1522). 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/perry/src/commands/compile/run_pipeline.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ddab38f8bc70b71e09e0b1c7d1c00791d260b95191a67233de9cd7e448cfe0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::module_decl::lower_module_decl (cognitive 883): perry_hir::lower::module_decl::lower_module_decl has cognitive complexity 883 (threshold 15). Drivers by points: if/else 150 (710 pts), match/switch 22 (113 pts), loops 10 (37 pts), boolean chains 23 (nesting depth added 678). 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/perry-hir/src/lower/module_decl.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f951ad5a4a9697f7249888b550191d09a1134494b11e4b1d9051e6da8f72e38"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::get_field_by_name_tail::get_field_by_name_object_tail (cognitive 798): perry_runtime::object::field_get_set::get_field_by_name_tail::get_field_by_name_object_tail has cognitive complexity 798 (threshold 15). Drivers by points: if/else 258 (729 pts), boolean chains 41, match/switch 7 (23 pts), loops 2 (5 pts) (nesting depth added 490). 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/perry-runtime/src/object/field_get_set/get_field_by_name_tail.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18955c0c00db3c3e46982891e534ce5157e5c46b765792647e293878a422742"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::lower_module (cognitive 781): perry_codegen::codegen::lower_module has cognitive complexity 781 (threshold 15). Drivers by points: if/else 216 (528 pts), loops 94 (156 pts), boolean chains 49, match/switch 20 (48 pts) (nesting depth added 402). 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/perry-codegen/src/codegen/mod.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1451be341ba32e9ebd90688be10c2e3904be415c9534c43953a83c76cb26ec"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::link::build_and_run::build_and_run_link (cognitive 754): perry::commands::compile::link::build_and_run::build_and_run_link has cognitive complexity 754 (threshold 15). Drivers by points: if/else 188 (516 pts), loops 34 (138 pts), boolean chains 65, match/switch 15 (35 pts) (nesting depth added 452). 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/perry/src/commands/compile/link/build_and_run.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"218ab3c63ed1c070c1e72535c2096fb83de6418227fd6b02c9daaaeca534287c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::body_stmt::lower_body_stmt_impl (cognitive 746): perry_hir::lower_decl::body_stmt::lower_body_stmt_impl has cognitive complexity 746 (threshold 15). Drivers by points: if/else 212 (552 pts), match/switch 29 (90 pts), loops 17 (64 pts), boolean chains 40 (nesting depth added 448). 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/perry-hir/src/lower_decl/body_stmt.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb41abcd48291362924964b642ec9d8270a012696690ccadbb748bbde88afd0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::stmt::lower_stmt_inner (cognitive 657): perry_hir::lower::stmt::lower_stmt_inner has cognitive complexity 657 (threshold 15). Drivers by points: if/else 109 (505 pts), match/switch 15 (75 pts), loops 17 (72 pts), boolean chains 5 (nesting depth added 511). 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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"5834b232d8f1f6b8d154e6c786758a044667e075e59df64dc9e4a9ab6e058a49"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::publish::run_async (cognitive 594): perry::commands::publish::run_async has cognitive complexity 594 (threshold 15). Drivers by points: if/else 298 (506 pts), boolean chains 36, match/switch 15 (36 pts), loops 6 (16 pts) (nesting depth added 239). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/publish/mod.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"001f0f18c5bd5ba5d605b8d61966123916a0008f8879acca4acc7a7fc2b9fe26"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::module_static::try_module_static_methods (cognitive 585): perry_hir::lower::expr_call::module_static::try_module_static_methods has cognitive complexity 585 (threshold 15). Drivers by points: if/else 106 (447 pts), match/switch 17 (86 pts), loops 4 (27 pts), boolean chains 25 (nesting depth added 433). 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/perry-hir/src/lower/expr_call/module_static.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc67ef6cc5b63f1d727ea061a6ae23cb91e999257ffb6b9e446243aef080ccb6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::collect_modules::collect_module_one (cognitive 569): perry::commands::compile::collect_modules::collect_module_one has cognitive complexity 569 (threshold 15). Drivers by points: if/else 153 (404 pts), match/switch 32 (80 pts), loops 18 (49 pts), boolean chains 36 (nesting depth added 330). 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/perry/src/commands/compile/collect_modules.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"0910d66b8fb27e900827c28cd90de9ed9b20ccd76a40fd4e805c1b1233fca5f9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::host_config::apply_pkg_and_toml_config (cognitive 563): perry::commands::compile::host_config::apply_pkg_and_toml_config has cognitive complexity 563 (threshold 15). Drivers by points: if/else 118 (395 pts), loops 22 (98 pts), match/switch 21 (51 pts), boolean chains 19 (nesting depth added 383). Of this number, 536 points are the body\u0027s own statements and 27 belong to 2 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/host_config.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9d94795ebeda98d3cd5b5061f8bbf5e7a5e1d9941a7393cbc64a89670cbaaa"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::destructuring::var_decl::native_fetch::register_native_fetch_and_streams (cognitive 528): perry_hir::destructuring::var_decl::native_fetch::register_native_fetch_and_streams has cognitive complexity 528 (threshold 15). Drivers by points: if/else 106 (467 pts), match/switch 9 (49 pts), boolean chains 12 (nesting depth added 401). 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/perry-hir/src/destructuring/var_decl/native_fetch.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"4711d9cf24c1f1247f7a930b6dec9f6ad74585cd98862286d8632dacfce7d2e9"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::apply_inner (cognitive 527): Model::apply_inner has cognitive complexity 527 (threshold 15). Drivers by points: if/else 104 (282 pts), loops 65 (145 pts), match/switch 23 (64 pts), boolean chains 36 (nesting depth added 299). 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/perry-wpfacts/src/solve/apply.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"223a88096aaec81c1e13c18d1977098c6044560af5b9e0e82c35cf82e6c6df99"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_member::lower_member_inner (cognitive 521): perry_hir::lower::expr_member::lower_member_inner has cognitive complexity 521 (threshold 15). Drivers by points: if/else 147 (375 pts), match/switch 23 (98 pts), boolean chains 46, loops 2 (nesting depth added 303). Of this number, 515 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_member.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c7f65b752cff5457af3ec13a3b0d2f1a636a7ec6592af9f0b69bc10170ca7f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::property_get::dynamic_dispatch::try_lower_instance_method_call (cognitive 490): perry_codegen::lower_call::property_get::dynamic_dispatch::try_lower_instance_method_call has cognitive complexity 490 (threshold 15). Drivers by points: if/else 103 (321 pts), loops 24 (83 pts), boolean chains 50, match/switch 9 (36 pts) (nesting depth added 304). 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/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76e31f8c563ffcb2acca7dbe4f0dd5047bb0b08aad051f7c32d25f25e1507be"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::get_field_by_name::get_field_by_name_past_data_probe (cognitive 471): perry_runtime::object::field_get_set::get_field_by_name::get_field_by_name_past_data_probe has cognitive complexity 471 (threshold 15). Drivers by points: if/else 141 (419 pts), boolean chains 27, match/switch 5 (25 pts) (nesting depth added 298). 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/perry-runtime/src/object/field_get_set/get_field_by_name.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae2ca165743ccc08d6a29d0d89b109d70c0656fad4c799cbf6ef68851bbbfd3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_new::lower_new (cognitive 470): perry_hir::lower::expr_new::lower_new has cognitive complexity 470 (threshold 15). Drivers by points: if/else 134 (337 pts), match/switch 22 (66 pts), boolean chains 55, loops 3 (12 pts) (nesting depth added 256). 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/perry-hir/src/lower/expr_new.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f110032d7b41c1d6ec1574573e56c595279ff1f6a01deab89364275ac94a7f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::let_stmt::lower_let (cognitive 382): perry_codegen::stmt::let_stmt::lower_let has cognitive complexity 382 (threshold 15). Drivers by points: if/else 144 (299 pts), boolean chains 32, loops 10 (28 pts), match/switch 9 (23 pts) (nesting depth added 187). 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/perry-codegen/src/stmt/let_stmt.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0637813a21ea56ba8852e2ac2d20b55f2e384f8ad4aba7a1d60667b19f1049"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::has_property::object_has_property_generic (cognitive 382): perry_runtime::object::field_get_set::has_property::object_has_property_generic has cognitive complexity 382 (threshold 15). Drivers by points: if/else 134 (360 pts), boolean chains 18, match/switch 2 (4 pts) (nesting depth added 228). 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/perry-runtime/src/object/field_get_set/has_property.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f6e24949d63d5acaf5a08dbf6b1f20f3289c1455d3db135868d2f5af9d65fd"}},{"ruleId":"D2","level":"warning","message":{"text":"WasmModuleEmitter::compile (cognitive 377): WasmModuleEmitter::compile has cognitive complexity 377 (threshold 15). Drivers by points: if/else 65 (189 pts), loops 92 (184 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 217). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/emit/compile.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"527afaab1894f166c6678bb15e237876540044d83623b0688d66c2aaf387b698"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::local_array_methods::try_local_array_methods (cognitive 369): perry_hir::lower::expr_call::local_array_methods::try_local_array_methods has cognitive complexity 369 (threshold 15). Drivers by points: if/else 58 (267 pts), match/switch 10 (70 pts), boolean chains 32 (nesting depth added 269). 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/perry-hir/src/lower/expr_call/local_array_methods.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa5e158a5085ca0a015b5c70d596ec20e8283fb409e3808a1d0fb43fa810ba7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::lower_module_fn::lower_module_full_with_platform_globals (cognitive 367): perry_hir::lower::lower_module_fn::lower_module_full_with_platform_globals has cognitive complexity 367 (threshold 15). Drivers by points: if/else 81 (252 pts), loops 44 (79 pts), match/switch 10 (21 pts), boolean chains 15 (nesting depth added 217). 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/perry-hir/src/lower/lower_module_fn.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0914ffaf435a02548d9dd7e6c742379289942334d957969680ecb49d5b182bb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::symbol::get::js_object_get_symbol_property_with_receiver (cognitive 365): perry_runtime::symbol::get::js_object_get_symbol_property_with_receiver has cognitive complexity 365 (threshold 15). Drivers by points: if/else 123 (350 pts), boolean chains 15 (nesting depth added 227). 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/perry-runtime/src/symbol/get.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25e05735de6884d33c359e454db3c9fa49c3961ca475fa98c0ad5dc545331d5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_call_method::handle_methods::dispatch_handle (cognitive 364): perry_runtime::object::native_call_method::handle_methods::dispatch_handle has cognitive complexity 364 (threshold 15). Drivers by points: if/else 106 (318 pts), boolean chains 37, loops 1 (5 pts), match/switch 1 (4 pts) (nesting depth added 219). 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/perry-runtime/src/object/native_call_method/handle_methods.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"130c71c8acf15e63af8f311dd5c8dd2424682622aba33f3e3f0955e01197cbaf"}},{"ruleId":"D2","level":"warning","message":{"text":"wasm_runtime.buildImports (cognitive 356): wasm_runtime.buildImports has cognitive complexity 356 (threshold 15). Drivers by points: if/else 157 (190 pts), ternaries 81 (83 pts), boolean chains 65, loops 12 (15 pts), error handling 3 (nesting depth added 38). Most of this is not in the body itself: 3 of the 356 points are its own statements and the rest belongs to 158 function literals inside it that branch (lines 668, 759, 777, \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda297c8494b90bc276cc5b37aefb1638f6a056369f7d757990b7a86867b2d73"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::instanceof::static_dispatch::native_instanceof (cognitive 354): perry_runtime::object::instanceof::static_dispatch::native_instanceof has cognitive complexity 354 (threshold 15). Drivers by points: if/else 178 (314 pts), boolean chains 29, match/switch 5 (11 pts) (nesting depth added 142). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/instanceof/static_dispatch.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f5b39a983ff08b5a6ba740628383223432ba5c8eb865eae555d137d0d79570"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::descriptors::own_property (cognitive 339): perry_runtime::object::descriptors::own_property has cognitive complexity 339 (threshold 15). Drivers by points: if/else 131 (317 pts), boolean chains 14, match/switch 3 (8 pts) (nesting depth added 191). 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/perry-runtime/src/object/descriptors.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e740d42cd48dd63db24322b64c3f43b0ea692d3ee1a5737a873e109231e17f8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::units::driver::run (cognitive 339): perry_wpfacts::units::driver::run has cognitive complexity 339 (threshold 15). Drivers by points: loops 61 (166 pts), if/else 39 (127 pts), match/switch 6 (28 pts), boolean chains 18 (nesting depth added 215). 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/perry-wpfacts/src/units/driver.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c1e13ec0ccfc173165273c64037518c20dcd9702c1748abacb834e18f81688"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::method::compile_method (cognitive 333): perry_codegen::codegen::method::compile_method has cognitive complexity 333 (threshold 15). Drivers by points: if/else 112 (231 pts), loops 14 (50 pts), boolean chains 30, match/switch 7 (22 pts) (nesting depth added 170). 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/perry-codegen/src/codegen/method.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39708752dc34f730b407a5f66e3aa69e692c53cac31a84e0c2a401fc2ccbe3b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::class_decl::lower_class_decl (cognitive 325): perry_hir::lower_decl::class_decl::lower_class_decl has cognitive complexity 325 (threshold 15). Drivers by points: if/else 86 (214 pts), match/switch 25 (55 pts), loops 17 (33 pts), boolean chains 23 (nesting depth added 174). 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/perry-hir/src/lower_decl/class_decl.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"176a40cc11780f27ce1f2c0890b50f6bfeab09584208083cd8032529412acfcb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::this_super_call::lower_impl (cognitive 320): perry_codegen::expr::this_super_call::lower_impl has cognitive complexity 320 (threshold 15). Drivers by points: if/else 75 (208 pts), loops 17 (56 pts), match/switch 26 (47 pts), boolean chains 9 (nesting depth added 193). 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/perry-codegen/src/expr/this_super_call.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffbc0136ceb1321d1de37a8a1107c75c119824c2c5f208cbe661d8fe949601d0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::object_ops::prototype::get_prototype_of_resolved (cognitive 312): perry_runtime::object::object_ops::prototype::get_prototype_of_resolved has cognitive complexity 312 (threshold 15). Drivers by points: if/else 137 (292 pts), boolean chains 17, match/switch 1 (3 pts) (nesting depth added 157). 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/perry-runtime/src/object/object_ops/prototype.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"babdaba94aef425c8a8569a560624a41ebac4ac3841e84737d0f5c51d9c567c3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::new::lower_new_impl_inner (cognitive 305): perry_codegen::lower_call::new::lower_new_impl_inner has cognitive complexity 305 (threshold 15). Drivers by points: if/else 105 (221 pts), boolean chains 39, loops 11 (30 pts), match/switch 8 (15 pts) (nesting depth added 142). 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/perry-codegen/src/lower_call/new.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c6daae8b93dac9a4c1cd9816e78664dbdcd16b9bf76d37694eb0ef635139e9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::property_get::lower (cognitive 304): perry_codegen::expr::property_get::lower has cognitive complexity 304 (threshold 15). Drivers by points: if/else 93 (261 pts), boolean chains 33, match/switch 4 (6 pts), loops 1 (4 pts) (nesting depth added 173). 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/perry-codegen/src/expr/property_get.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d736fef4ae92767f6c01b9cd633421135ef2f94af7c69a13fa35175cbdca36b0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_set_by_name::tail::set_field_by_name_object_tail (cognitive 297): perry_runtime::object::field_set_by_name::tail::set_field_by_name_object_tail has cognitive complexity 297 (threshold 15). Drivers by points: if/else 119 (256 pts), boolean chains 33, match/switch 3 (8 pts) (nesting depth added 142). 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/perry-runtime/src/object/field_set_by_name/tail.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b15c53634e2402e1489813b4322faf40494daa68464a9327a6a17ec4e27f150"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::new_dynamic::lower (cognitive 291): perry_codegen::expr::new_dynamic::lower has cognitive complexity 291 (threshold 15). Drivers by points: if/else 71 (242 pts), loops 9 (33 pts), match/switch 4 (11 pts), boolean chains 5 (nesting depth added 202). 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/perry-codegen/src/expr/new_dynamic.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"cede4761152d79ec22a787e6eea7aedc64f4f4bf907706f122e5d8b997faf11b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::lower_expr::arm_unary::lower_unary_expr (cognitive 287): perry_hir::lower::lower_expr::arm_unary::lower_unary_expr has cognitive complexity 287 (threshold 15). Drivers by points: if/else 69 (238 pts), boolean chains 35, match/switch 2 (8 pts), loops 3 (6 pts) (nesting depth added 178). 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/perry-hir/src/lower/lower_expr/arm_unary.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ef8882007d969e4897dd305efcf87fe2cad56a3cb5d8839e4c323a4248dc00"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::stmt_loops::lower_stmt_for_of_inner (cognitive 286): perry_hir::lower::stmt_loops::lower_stmt_for_of_inner has cognitive complexity 286 (threshold 15). Drivers by points: if/else 121 (201 pts), match/switch 20 (38 pts), boolean chains 25, loops 7 (22 pts) (nesting depth added 113). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2df2f32e98748b1b7866befc907137dbf61799573c163d49aa8cce46f048aa"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::literals_vars::lower (cognitive 277): perry_codegen::expr::literals_vars::lower has cognitive complexity 277 (threshold 15). Drivers by points: if/else 105 (256 pts), boolean chains 11, match/switch 9 (10 pts) (nesting depth added 152). 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/perry-codegen/src/expr/literals_vars.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fdfbba20e202930551931022e34f1536c5247c2f1e59c5a6cb6075c2a2d080d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::globals::try_global_builtins (cognitive 269): perry_hir::lower::expr_call::globals::try_global_builtins has cognitive complexity 269 (threshold 15). Drivers by points: if/else 86 (212 pts), match/switch 8 (30 pts), loops 5 (20 pts), boolean chains 7 (nesting depth added 163). 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/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c001165dc363becf66e59e8f2a210db279c7c181491ba94b60a2653dd32ca067"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_call_method::native_call_method_tower (cognitive 269): perry_runtime::object::native_call_method::native_call_method_tower has cognitive complexity 269 (threshold 15). Drivers by points: if/else 123 (233 pts), boolean chains 31, match/switch 3 (5 pts) (nesting depth added 112). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/native_call_method.rs"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"641b0912368d32e368962b4796b8ccd8bc724ed10b1d3fb2c9371c04ca722dd8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::early_branches::try_lower_closure_typed_local_call (cognitive 268): perry_codegen::lower_call::early_branches::try_lower_closure_typed_local_call has cognitive complexity 268 (threshold 15). Drivers by points: if/else 50 (191 pts), loops 10 (54 pts), match/switch 8 (20 pts), boolean chains 3 (nesting depth added 197). 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/perry-codegen/src/lower_call/early_branches.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a1ad8fcbccd54c648b3fc4a361cce94dbf79b9eec1212715b7df4a84a19c52"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::string_pool::emit_string_pool (cognitive 265): perry_codegen::codegen::string_pool::emit_string_pool has cognitive complexity 265 (threshold 15). Drivers by points: if/else 90 (173 pts), loops 43 (59 pts), boolean chains 22, match/switch 6 (11 pts) (nesting depth added 104). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/string_pool.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4435128c2b5213737f580e980acf6b5087bc748aa2e7b22f65ba33e963bca2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::object_ops::define_property::apply_property_descriptor (cognitive 256): perry_runtime::object::object_ops::define_property::apply_property_descriptor has cognitive complexity 256 (threshold 15). Drivers by points: if/else 115 (225 pts), boolean chains 29, match/switch 1 (2 pts) (nesting depth added 111). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/object_ops/define_property.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c3b35bbf7b28faf2e0e9601815d0173d646141a887308910d4488b9c836fcd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::instanceof::dynamic_dispatch::js_instanceof_dynamic (cognitive 252): perry_runtime::object::instanceof::dynamic_dispatch::js_instanceof_dynamic has cognitive complexity 252 (threshold 15). Drivers by points: if/else 98 (205 pts), boolean chains 33, match/switch 5 (13 pts), loops 1 (nesting depth added 115). 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/perry-runtime/src/object/instanceof/dynamic_dispatch.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba32f886bedf7b10332270916a660ce8b175d4f3775d5c55d423b7058cd3027b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_function::lower_fn_expr_anon (cognitive 251): perry_hir::lower::expr_function::lower_fn_expr_anon has cognitive complexity 251 (threshold 15). Drivers by points: if/else 63 (183 pts), loops 18 (56 pts), boolean chains 8, match/switch 1 (4 pts) (nesting depth added 161). 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/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"7744ba8d91ebe2a8c510b5c19bc9ce7b8bce31fa96349491d7d343ecfa90b2a9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_member::member_tail::lower_member_tail (cognitive 251): perry_hir::lower::expr_member::member_tail::lower_member_tail has cognitive complexity 251 (threshold 15). Drivers by points: if/else 49 (160 pts), match/switch 18 (54 pts), boolean chains 32, loops 2 (5 pts) (nesting depth added 150). 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/perry-hir/src/lower/expr_member/member_tail.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b918b5d841e13669dc810e87547628b1b57444fed9a6ea4d1174021938e1d042"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::walker::expr_mut::walk_expr_children_mut (cognitive 246): perry_hir::walker::expr_mut::walk_expr_children_mut has cognitive complexity 246 (threshold 15). Drivers by points: if/else 77 (149 pts), loops 44 (88 pts), match/switch 5 (9 pts) (nesting depth added 120). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/walker/expr_mut.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dfe628d7c353c40a879f3cdc028bfed5f50a20e6f3e0f55bd233fba8515f0d6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::walker::expr_ref::walk_expr_children (cognitive 246): perry_hir::walker::expr_ref::walk_expr_children has cognitive complexity 246 (threshold 15). Drivers by points: if/else 77 (149 pts), loops 44 (88 pts), match/switch 5 (9 pts) (nesting depth added 120). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/walker/expr_ref.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d365b61664cfff0fdd589d9b4ffdc590f6fc241d5ab524b7a0d703fa6435597"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::compute_in (cognitive 243): perry_wpfacts::compute_in has cognitive complexity 243 (threshold 15). Drivers by points: if/else 81 (126 pts), loops 26 (47 pts), boolean chains 46, match/switch 14 (24 pts) (nesting depth added 76). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/lib.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e91b65edee9ddebd09f6b7b20d1c56939b20aeb81eb00dda42393c9f1e9cbe6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::builtins::table::js_console_table_with_properties (cognitive 241): perry_runtime::builtins::table::js_console_table_with_properties has cognitive complexity 241 (threshold 15). Drivers by points: if/else 52 (148 pts), loops 25 (85 pts), boolean chains 5, match/switch 1 (3 pts) (nesting depth added 158). 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/perry-runtime/src/builtins/table.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31816bd07a8d8067c3736b4131d12e4d5e1b57c319e56f8892488baf5e36e8e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::array_only_methods::try_array_only_methods (cognitive 236): perry_hir::lower::expr_call::array_only_methods::try_array_only_methods has cognitive complexity 236 (threshold 15). Drivers by points: if/else 42 (163 pts), match/switch 8 (39 pts), boolean chains 34 (nesting depth added 152). 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/perry-hir/src/lower/expr_call/array_only_methods.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0aa0b3321f282898c74f143ad9831bf5446c8102b177a8a3da93a821e69248"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::promise::microtasks::pump_protected (cognitive 232): perry_runtime::promise::microtasks::pump_protected has cognitive complexity 232 (threshold 15). Drivers by points: if/else 76 (219 pts), boolean chains 6, match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 146). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/promise/microtasks.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"473d02d19d641718a873043f78486b90d658e445e36d7d8e907ffc498b3afb5e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_geisterhand::server::run_server (cognitive 232): perry_ui_geisterhand::server::run_server has cognitive complexity 232 (threshold 15). Drivers by points: if/else 48 (152 pts), match/switch 25 (64 pts), loops 3 (11 pts), boolean chains 5 (nesting depth added 151). 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/perry-ui-geisterhand/src/server.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bea6c6e5ea8e8d01a5e2f6b658edc05900e18b582a1bb21c0b50c338a307d8d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::index_set::lower (cognitive 228): perry_codegen::expr::index_set::lower has cognitive complexity 228 (threshold 15). Drivers by points: if/else 69 (212 pts), boolean chains 15, match/switch 1 (nesting depth added 143). 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/perry-codegen/src/expr/index_set.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b023168874e3877412e769e64d061d00d3712cc6fa4605749fe204f9746133d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::escape_check::check_escapes_in_expr (cognitive 226): perry_codegen::collectors::escape_check::check_escapes_in_expr has cognitive complexity 226 (threshold 15). Drivers by points: if/else 69 (176 pts), loops 20 (40 pts), match/switch 4 (9 pts), boolean chains 1 (nesting depth added 132). 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/perry-codegen/src/collectors/escape_check.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43aa26d985b3379fb873b61b7bd703d7c506b890c85139bedead2ed1c4f5b2d"}},{"ruleId":"D2","level":"warning","message":{"text":"Census::compute (cognitive 218): Census::compute has cognitive complexity 218 (threshold 15). Drivers by points: if/else 33 (115 pts), loops 37 (83 pts), match/switch 3 (12 pts), boolean chains 8 (nesting depth added 137). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/reach_report.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2be4d5913fe628948f3acdbd9774594b83324992a83301ec04773c0aa2e168"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::buffer_dispatch::dispatch_buffer_method (cognitive 218): perry_runtime::object::buffer_dispatch::dispatch_buffer_method has cognitive complexity 218 (threshold 15). Drivers by points: if/else 112 (192 pts), boolean chains 23, match/switch 2 (3 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/buffer_dispatch.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6286ae6ef1a79edadc6c2aa6dbf9f76e433953d1897f8848f4e20d2b2104d01"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_gc_effects::graph::classify (cognitive 216): perry_gc_effects::graph::classify has cognitive complexity 216 (threshold 15). Drivers by points: if/else 50 (134 pts), loops 31 (61 pts), boolean chains 21 (nesting depth added 114). 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/perry-gc-effects/src/graph.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"e115e26b26b4bab386c658f0f1f2919a72fed6e3406c80ad46061708d75bb9ac"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::destructuring::var_decl::native_new::register_native_from_new_and_calls (cognitive 214): perry_hir::destructuring::var_decl::native_new::register_native_from_new_and_calls has cognitive complexity 214 (threshold 15). Drivers by points: if/else 43 (182 pts), match/switch 4 (30 pts), boolean chains 2 (nesting depth added 165). 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/perry-hir/src/destructuring/var_decl/native_new.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4997921eaa5401833cd2f20a45761356d2c990a2526b8f7ebe113c2d32246a03"}},{"ruleId":"D2","level":"warning","message":{"text":"JsEmitter::emit_expr (cognitive 212): JsEmitter::emit_expr has cognitive complexity 212 (threshold 15). Drivers by points: if/else 75 (152 pts), match/switch 14 (29 pts), loops 14 (28 pts), boolean chains 3 (nesting depth added 106). 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/perry-codegen-js/src/emit/exprs.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e861bd9ff3104078465622d481bb6ef9af2710c1898fb80edc609210529aff9d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_set_by_name::js_object_set_field_by_name (cognitive 211): perry_runtime::object::field_set_by_name::js_object_set_field_by_name has cognitive complexity 211 (threshold 15). Drivers by points: if/else 86 (187 pts), boolean chains 24 (nesting depth added 101). 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/perry-runtime/src/object/field_set_by_name.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b39ddc2fc34ee1f4e2fa6cb6a37741235717db369a3229eb9265ecf106cc18c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_types::infer_call_return_type (cognitive 208): perry_hir::lower_types::infer_call_return_type has cognitive complexity 208 (threshold 15). Drivers by points: if/else 38 (121 pts), match/switch 19 (81 pts), boolean chains 6 (nesting depth added 145). 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/perry-hir/src/lower_types.rs"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0371171a6db46352282e450460b403d63a8235ff5c0e2a2d0a8cb218f45c5a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::descriptors::js_object_get_own_property_names_shape (cognitive 206): perry_runtime::object::descriptors::js_object_get_own_property_names_shape has cognitive complexity 206 (threshold 15). Drivers by points: if/else 55 (120 pts), loops 23 (62 pts), boolean chains 19, match/switch 3 (5 pts) (nesting depth added 106). 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/perry-runtime/src/object/descriptors.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed5c0d9ec1292b409db2e5c8e00d458b0b292a7961dcb80027f91aa70e7248c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::builtin::lower_builtin_new (cognitive 204): perry_codegen::lower_call::builtin::lower_builtin_new has cognitive complexity 204 (threshold 15). Drivers by points: if/else 50 (87 pts), match/switch 41 (68 pts), loops 21 (49 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/perry-codegen/src/lower_call/builtin.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6654efc6360936ee20c87dc7ff4f700affc9897feccc5ee485a1ceac2adc2ec"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::lower_call_inner (cognitive 203): perry_hir::lower::expr_call::lower_call_inner has cognitive complexity 203 (threshold 15). Drivers by points: if/else 53 (112 pts), match/switch 31 (81 pts), loops 2 (7 pts), boolean chains 3 (nesting depth added 114). 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/perry-hir/src/lower/expr_call/mod.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a400db6b2cfcb618e23dde159efc62a5fd79ef5a2ea836af13bf1907bd19b4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::wrap::wrap_commonjs_with_addon_paths (cognitive 202): perry::commands::compile::cjs_wrap::wrap::wrap_commonjs_with_addon_paths has cognitive complexity 202 (threshold 15). Drivers by points: if/else 122 (172 pts), loops 18 (27 pts), boolean chains 24, match/switch 4 (6 pts) (nesting depth added 61). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (perry::commands::compile::cjs_wrap::wrap::wrap_commonjs_with_addon_paths::require_site_in_try) 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/perry/src/commands/compile/cjs_wrap/wrap.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4ec8b9d21fdaa3ed2bbcfe95fb2f5be6a542eee9ee57d0e16583358224cc4f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::crypto::cipher::cipher_step (cognitive 197): perry_stdlib::crypto::cipher::cipher_step has cognitive complexity 197 (threshold 15). Drivers by points: match/switch 48 (102 pts), if/else 47 (89 pts), boolean chains 6 (nesting depth added 96). 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/perry-stdlib/src/crypto/cipher.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"d737178d40a9626946112692e711832d7d8f2aca267c97b88dde3a7081a410bc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::widget_decl::try_lower_widget_decl (cognitive 196): perry_hir::lower::widget_decl::try_lower_widget_decl has cognitive complexity 196 (threshold 15). Drivers by points: if/else 42 (156 pts), match/switch 10 (22 pts), loops 5 (17 pts), boolean chains 1 (nesting depth added 138). 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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"866e35911a22fcc49eae2ea02c8e8609f3e0d2da3ce7e525c379ce6a12836879"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::delete_rest::js_object_delete_field (cognitive 196): perry_runtime::object::delete_rest::js_object_delete_field has cognitive complexity 196 (threshold 15). Drivers by points: if/else 78 (180 pts), boolean chains 14, loops 1, match/switch 1 (nesting depth added 102). 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/perry-runtime/src/object/delete_rest.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d92294274f38239cbdf20afd17c4c3755373e8e66262f7c549c732c2eb6c001"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::handle_dispatch::js_ext_http_server_dispatch_method (cognitive 194): perry_ext_http::server::handle_dispatch::js_ext_http_server_dispatch_method has cognitive complexity 194 (threshold 15). Drivers by points: if/else 91 (179 pts), boolean chains 12, loops 1 (2 pts), match/switch 1 (nesting depth added 89). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-http/src/server/handle_dispatch.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4988c2e939976d343d1aeba61a110b2a50195909aaa3b633f87aef865cc3c3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::module_globals_emit::emit_module_globals (cognitive 193): perry_codegen::codegen::module_globals_emit::emit_module_globals has cognitive complexity 193 (threshold 15). Drivers by points: if/else 34 (100 pts), loops 31 (54 pts), match/switch 6 (28 pts), boolean chains 11 (nesting depth added 111). Of this number, 184 points are the body\u0027s own statements and 9 belong to one function item 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":"crates/perry-codegen/src/codegen/module_globals_emit.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde07359548b4f9d66d277afe3cbffe2fd1106b460edacfc3db9476c77d40e6f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::method_override::emit_guarded_direct_method_call (cognitive 193): perry_codegen::lower_call::method_override::emit_guarded_direct_method_call has cognitive complexity 193 (threshold 15). Drivers by points: if/else 76 (118 pts), loops 20 (37 pts), boolean chains 20, match/switch 10 (18 pts) (nesting depth added 67). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/method_override.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46edca72b4b803e877851bfbffe7d33e60e30f2dbd20dba5b1f5c9e0d46a699"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::index_get::lower (cognitive 192): perry_codegen::expr::index_get::lower has cognitive complexity 192 (threshold 15). Drivers by points: if/else 58 (170 pts), boolean chains 12, match/switch 4 (10 pts) (nesting depth added 118). 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/perry-codegen/src/expr/index_get.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"12529f31f6728176669443e436637ba5474daa341a973b6d39ffc11c6e219824"}},{"ruleId":"D2","level":"warning","message":{"text":"Solver.apply (cognitive 190): Solver.apply has cognitive complexity 190 (threshold 15). Drivers by points: if/else 41 (108 pts), loops 29 (59 pts), ternaries 4 (12 pts), boolean chains 11 (nesting depth added 105). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wpfacts_recompute.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"4adb079324fbc80967a526595045fca5d86f6fbb1555c3c0e3c23178da9167c0"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.self_test (cognitive 188): gc_root_dominance_check.self_test has cognitive complexity 188 (threshold 15). Drivers by points: if/else 85 (120 pts), loops 29 (35 pts), boolean chains 18, ternaries 6 (12 pts), error handling 2 (3 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":6812}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc7dae2308568bcd4a282b6f6307022ba5217dff6dbffd891aed46e61c4a349"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_call_method::primitive_methods::dispatch_primitive (cognitive 186): perry_runtime::object::native_call_method::primitive_methods::dispatch_primitive has cognitive complexity 186 (threshold 15). Drivers by points: if/else 69 (145 pts), match/switch 8 (21 pts), boolean chains 20 (nesting depth added 89). 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/perry-runtime/src/object/native_call_method/primitive_methods.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3717ed2189fa6ed6ec9c525f8ef9aec7a5ad598a11910d2a8fa2576a6ad498"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::js_transform::imports::transform_expr (cognitive 181): perry_hir::js_transform::imports::transform_expr has cognitive complexity 181 (threshold 15). Drivers by points: if/else 44 (103 pts), loops 28 (73 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 106). 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/perry-hir/src/js_transform/imports.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9acfb1b8540b2e432b995bdff08cee3ea5e723d146ed4c6d448b62514abbeb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::native_module::try_native_module_methods (cognitive 179): perry_hir::lower::expr_call::native_module::try_native_module_methods has cognitive complexity 179 (threshold 15). Drivers by points: if/else 34 (123 pts), match/switch 12 (49 pts), boolean chains 7 (nesting depth added 126). 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/perry-hir/src/lower/expr_call/native_module.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be93906454336906e0cfa4dc83da56ac256baed0e77364206dbff40bc21aed8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::extern_func::try_lower_extern_func_call (cognitive 178): perry_codegen::lower_call::extern_func::try_lower_extern_func_call has cognitive complexity 178 (threshold 15). Drivers by points: if/else 75 (133 pts), match/switch 8 (24 pts), boolean chains 11, loops 5 (10 pts) (nesting depth added 79). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/extern_func.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d865a0666b0321322ac2c6723161c3a13629ed0e156a309c2a2a889674f6b9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::options::fetch::lower_fetch_native_method (cognitive 178): perry_codegen::lower_call::options::fetch::lower_fetch_native_method has cognitive complexity 178 (threshold 15). Drivers by points: if/else 75 (144 pts), match/switch 14 (31 pts), boolean chains 3 (nesting depth added 86). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/options/fetch.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e7b36960494e277a40e23e7e1f6593d4378200529f4a37a9e64d81d43a00d1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::root_reload::apply_to_function (cognitive 178): perry_codegen::root_reload::apply_to_function has cognitive complexity 178 (threshold 15). Drivers by points: if/else 30 (87 pts), loops 24 (50 pts), match/switch 6 (22 pts), boolean chains 19 (nesting depth added 99). Of this number, 175 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":"crates/perry-codegen/src/root_reload.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6272cf021ff0aaa0b537954175ec2d3e555426857b3fe6e7c5d7da4e736bb7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_object::lower_object (cognitive 177): perry_hir::lower::expr_object::lower_object has cognitive complexity 177 (threshold 15). Drivers by points: if/else 51 (116 pts), match/switch 19 (62 pts), loops 9 (15 pts), boolean chains 7 (nesting depth added 114). To reduce it, split the body into named stages: move each independent 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 (perry_hir::lower::expr_object::lower_object::is_closed_shape) 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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"33342b9389d68d77f43dfda4322faa06a5ba1a942091b820bf147c8bb98ef94a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::class_decl::from_ast::lower_class_from_ast (cognitive 176): perry_hir::lower_decl::class_decl::from_ast::lower_class_from_ast has cognitive complexity 176 (threshold 15). Drivers by points: if/else 50 (122 pts), match/switch 18 (34 pts), boolean chains 15, loops 5 (nesting depth added 88). 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/perry-hir/src/lower_decl/class_decl/from_ast.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d5ceaee359bf50232f204e6bc4ec34759973788fb8d1c0aed4682895127225"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::child_process::reactor::cp_reactor_pump_inner (cognitive 175): perry_runtime::child_process::reactor::cp_reactor_pump_inner has cognitive complexity 175 (threshold 15). Drivers by points: if/else 43 (139 pts), match/switch 6 (22 pts), loops 6 (11 pts), boolean chains 3 (nesting depth added 117). 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/perry-runtime/src/child_process/reactor.rs"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"71496551e228a7baf956263331a13bb047f66e0c0df1300dee49b2cce2fe38c4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::webcrypto::jwk::js_webcrypto_import_key (cognitive 173): perry_stdlib::webcrypto::jwk::js_webcrypto_import_key has cognitive complexity 173 (threshold 15). Drivers by points: if/else 80 (110 pts), boolean chains 43, match/switch 12 (20 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/perry-stdlib/src/webcrypto/jwk.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4e9a857135b89b0b1541ebbca1b3529570850b52ab9bf662636dd5559020be"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::static_method::lower (cognitive 172): perry_codegen::expr::static_method::lower has cognitive complexity 172 (threshold 15). Drivers by points: if/else 43 (121 pts), loops 8 (31 pts), boolean chains 12, match/switch 3 (8 pts) (nesting depth added 106). 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/perry-codegen/src/expr/static_method.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02e9ed07b28c82b759133584cb526f79ab151f103eff41886392908179ca261"}},{"ruleId":"D2","level":"warning","message":{"text":"package_bench.cmd_run (cognitive 171): package_bench.cmd_run has cognitive complexity 171 (threshold 15). Drivers by points: if/else 36 (98 pts), loops 16 (49 pts), boolean chains 15, ternaries 4 (9 pts) (nesting depth added 100). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/package_bench.py"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9c1a19a37b47abf131ddb9c787842376bea797e43dfdc3258d225efe29c611"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::hoist_classes::extract_top_level_class_decls_with_exports (cognitive 170): perry::commands::compile::cjs_wrap::hoist_classes::extract_top_level_class_decls_with_exports has cognitive complexity 170 (threshold 15). Drivers by points: if/else 24 (89 pts), loops 16 (54 pts), boolean chains 21, match/switch 1 (6 pts) (nesting depth added 108). 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/perry/src/commands/compile/cjs_wrap/hoist_classes.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c6a682b3846c39e6e9c94dacb7b72066f35565c8ceb16c380f683f3502a5fe"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_new::member::lower_new_member_native (cognitive 170): perry_hir::lower::expr_new::member::lower_new_member_native has cognitive complexity 170 (threshold 15). Drivers by points: if/else 40 (115 pts), boolean chains 49, match/switch 2 (6 pts) (nesting depth added 79). 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/perry-hir/src/lower/expr_new/member.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b724befeb08a93537b5d6a1f6ccaca2c0b87e57a38ca754256d11ae312226b86"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::call_inliner::try_inline_simple_call (cognitive 170): perry_transform::inline::call_inliner::try_inline_simple_call has cognitive complexity 170 (threshold 15). Drivers by points: if/else 29 (137 pts), loops 3 (20 pts), match/switch 2 (10 pts), boolean chains 3 (nesting depth added 133). 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/perry-transform/src/inline/call_inliner.rs"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"079f1bd9f407ea87d8862afed4121f39c647b38bcf3ec916554474041786d644"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::call_spread::lower (cognitive 169): perry_codegen::expr::call_spread::lower has cognitive complexity 169 (threshold 15). Drivers by points: if/else 38 (119 pts), loops 6 (25 pts), match/switch 5 (14 pts), boolean chains 11 (nesting depth added 109). 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/perry-codegen/src/expr/call_spread.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8127d74624c1b13be584a0d1aea67757de16b6352b26122a6a7045123fbd291"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::function::compile_function (cognitive 167): perry_codegen::codegen::function::compile_function has cognitive complexity 167 (threshold 15). Drivers by points: if/else 76 (120 pts), boolean chains 20, loops 12 (16 pts), match/switch 6 (11 pts) (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/function.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"076ad952275f9b02802734cbc0fb5a9f1e59249294a6ec9e1ea34f723abe0f87"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::split_regions::try_extract (cognitive 167): perry_codegen::codegen::split_regions::try_extract has cognitive complexity 167 (threshold 15). Drivers by points: if/else 59 (107 pts), loops 19 (27 pts), boolean chains 23, match/switch 7 (10 pts) (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/split_regions.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf468da62f9e60742465499052d3586235dd7a3959170545033d0174874b06b4"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.check_func_unrooted_allocas (cognitive 166): gc_root_dominance_check.check_func_unrooted_allocas has cognitive complexity 166 (threshold 15). Drivers by points: if/else 33 (114 pts), loops 18 (34 pts), boolean chains 14, ternaries 1 (4 pts) (nesting depth added 100). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gc_root_dominance_check.py"},"region":{"startLine":3979}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f31c89f51f8403d4dc0e3a821c1228980fd4ab17f0ae390e2cccdff38ee5fa"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_assign::lower_assignment_target (cognitive 163): perry_hir::lower::expr_assign::lower_assignment_target has cognitive complexity 163 (threshold 15). Drivers by points: if/else 38 (129 pts), match/switch 8 (27 pts), boolean chains 7 (nesting depth added 110). 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/perry-hir/src/lower/expr_assign.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"531caaea63ff736c6df894ef8c06f55c9a9ff3b612ae709b20f7699abfc45f57"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.main (cognitive 162): gc_root_dominance_check.main has cognitive complexity 162 (threshold 15). Drivers by points: if/else 53 (85 pts), loops 19 (44 pts), ternaries 5 (17 pts), boolean chains 14, error handling 1 (2 pts) (nesting depth added 70). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gc_root_dominance_check.py"},"region":{"startLine":8076}}}],"partialFingerprints":{"codehealthFindingId/v1":"97904ed66c8085edf24fe4f0680970b342bf6fa6d42b02b395753d19a1e74029"}},{"ruleId":"D2","level":"warning","message":{"text":"measure_linux_rss_ab.main (cognitive 162): measure_linux_rss_ab.main has cognitive complexity 162 (threshold 15). Drivers by points: if/else 34 (97 pts), loops 14 (32 pts), ternaries 7 (23 pts), boolean chains 10 (nesting depth added 97). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/measure_linux_rss_ab.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"e853a4a0ab2c061d09f413522cc206bb4914d1d41319166cc2cb3c3c43f53a95"}},{"ruleId":"D2","level":"warning","message":{"text":"FuncEmitCtx::try_emit_expr_calls (cognitive 158): FuncEmitCtx::try_emit_expr_calls has cognitive complexity 158 (threshold 15). Drivers by points: loops 17 (75 pts), if/else 21 (64 pts), match/switch 6 (18 pts), boolean chains 1 (nesting depth added 113). 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/perry-codegen-wasm/src/emit/expr/calls.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df8e93414b9d18677f69e74a1527476b5b70b4855c4675e862c150dcbe2c2c5"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::nested_fields (cognitive 157): Gen::nested_fields has cognitive complexity 157 (threshold 15). Drivers by points: if/else 18 (75 pts), loops 13 (53 pts), match/switch 3 (21 pts), boolean chains 8 (nesting depth added 115). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/gen/export.rs"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"0363fb0da2b3c550f95fe76d82260204984695a82bd1b69b2510e1538c52eb30"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::bundle_ios::build_ios_app_bundle (cognitive 155): perry::commands::compile::bundle_ios::build_ios_app_bundle has cognitive complexity 155 (threshold 15). Drivers by points: if/else 57 (119 pts), loops 12 (26 pts), match/switch 3 (8 pts), boolean chains 2 (nesting depth added 81). Of this number, 145 points are the body\u0027s own statements and 10 belong to one function item 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":"crates/perry/src/commands/compile/bundle_ios.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"53131184db8cc80cef0706544a6a7547883e70fe5d1879c9a64a04d3eea499fd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::artifacts::emit_module_artifacts (cognitive 155): perry_codegen::codegen::artifacts::emit_module_artifacts has cognitive complexity 155 (threshold 15). Drivers by points: if/else 49 (98 pts), loops 23 (34 pts), boolean chains 15, match/switch 3 (8 pts) (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/artifacts.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b96dbdda2875e74e1403c6f3e23bff0ae5eb7c742a4cb4766d1edb89e9bc11c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::compare::lower (cognitive 155): perry_codegen::expr::compare::lower has cognitive complexity 155 (threshold 15). Drivers by points: if/else 49 (108 pts), boolean chains 36, match/switch 6 (11 pts) (nesting depth added 64). 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/perry-codegen/src/expr/compare.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f3be870e63c7e6435c1a2c2191fb5826fd2a499d29ae6f8721a6bbc15471a2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_types::infer_type_from_expr_inner (cognitive 154): perry_hir::lower_types::infer_type_from_expr_inner has cognitive complexity 154 (threshold 15). Drivers by points: if/else 44 (103 pts), match/switch 14 (39 pts), boolean chains 8, loops 2 (4 pts) (nesting depth added 86). 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/perry-hir/src/lower_types.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7c828e928b4a252f3d6fd2ba930c26776a0ef57bf864a3dacfd5e958c5b2ac"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::global_this::fetch_globals::js_fetch_or_value_super (cognitive 154): perry_runtime::object::global_this::fetch_globals::js_fetch_or_value_super has cognitive complexity 154 (threshold 15). Drivers by points: if/else 77 (127 pts), boolean chains 19, match/switch 6 (8 pts) (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/perry-runtime/src/object/global_this/fetch_globals.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b32c1aed8ec5279aae5628a3b8422eccc00623d25724f0b705bfce572c61076"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::webcrypto::keys::js_webcrypto_generate_key (cognitive 153): perry_stdlib::webcrypto::keys::js_webcrypto_generate_key has cognitive complexity 153 (threshold 15). Drivers by points: if/else 55 (90 pts), match/switch 28 (49 pts), boolean chains 14 (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/webcrypto/keys.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"717eb842ece7fcd3a57bb9b9187f9973404888d6573b3f0fc0df8636e972cf18"}},{"ruleId":"D2","level":"warning","message":{"text":"GuardState::matches (cognitive 150): GuardState::matches has cognitive complexity 150 (threshold 15). Drivers by points: if/else 50 (107 pts), boolean chains 27, loops 6 (12 pts), match/switch 2 (4 pts) (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/param_type_guard.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"19631f39a9c73b447c748f440b66383dd7f66f7c05800b0e73576218c4f82095"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::lib::contracts::describe_nodes (cognitive 150): perry_wpfacts::lib::contracts::describe_nodes has cognitive complexity 150 (threshold 15). Drivers by points: if/else 30 (120 pts), match/switch 4 (17 pts), loops 4 (9 pts), boolean chains 4 (nesting depth added 108). 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/perry-wpfacts/src/lib/contracts.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89399ce4519e2205e5cc0b3eb74410c7b30de6013e2a824bbdc5e18afa4cb4e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::entry::compile_module_entry (cognitive 149): perry_codegen::codegen::entry::compile_module_entry has cognitive complexity 149 (threshold 15). Drivers by points: if/else 56 (104 pts), loops 14 (32 pts), boolean chains 13 (nesting depth added 66). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/entry.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1763c9621ba0c3c65913df5497388989e4f9ecd594f07b42ee47fa18375c8b0"}},{"ruleId":"D2","level":"warning","message":{"text":"constfn_executable_gates.main (cognitive 149): constfn_executable_gates.main has cognitive complexity 149 (threshold 15). Drivers by points: if/else 23 (77 pts), loops 17 (37 pts), ternaries 6 (23 pts), boolean chains 12 (nesting depth added 91). 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":"scripts/constfn_executable_gates.py"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"49566ed4eaa9b2a38ce6257a3d8bde7d758855d1e77a245d75510b4056fdff6e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::link::platform_cmd::select_linker_command (cognitive 147): perry::commands::compile::link::platform_cmd::select_linker_command has cognitive complexity 147 (threshold 15). Drivers by points: if/else 73 (121 pts), boolean chains 14, loops 4 (9 pts), match/switch 1 (3 pts) (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/link/platform_cmd.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f205ed4a5e659265fd7a9c3d847c98632a5b611a4b638d86e4cdb221b55d7df"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::linearize::linearize_body (cognitive 147): perry_transform::generator::linearize::linearize_body has cognitive complexity 147 (threshold 15). Drivers by points: if/else 34 (95 pts), loops 9 (31 pts), match/switch 4 (12 pts), boolean chains 9 (nesting depth added 91). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/generator/linearize.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"927fe7265ef37af8297d036fb0a678d2156295d8031fe643d01605ae093c32f5"}},{"ruleId":"D2","level":"warning","message":{"text":"JsEmitter::emit_native_method_call (cognitive 146): JsEmitter::emit_native_method_call has cognitive complexity 146 (threshold 15). Drivers by points: if/else 24 (82 pts), loops 20 (56 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 97). 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/perry-codegen-js/src/emit/native.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"125b7a3d4be49e78be00af8d2cfd05e49041fa69c45b6fb9602e1f9e39e90dea"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::global_this::populate::populate_global_this_builtins_inner (cognitive 146): perry_runtime::object::global_this::populate::populate_global_this_builtins_inner has cognitive complexity 146 (threshold 15). Drivers by points: if/else 54 (124 pts), loops 7 (10 pts), match/switch 3 (8 pts), boolean chains 4 (nesting depth added 78). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/global_this/populate.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd0b68bb691a4a97c57d73106a037267e9e58d252c2c405c670e7b484def5b3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_call_method::string_methods::dispatch_string (cognitive 145): perry_runtime::object::native_call_method::string_methods::dispatch_string has cognitive complexity 145 (threshold 15). Drivers by points: if/else 31 (83 pts), match/switch 13 (53 pts), boolean chains 5, loops 1 (4 pts) (nesting depth added 95). 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/perry-runtime/src/object/native_call_method/string_methods.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"45659478c24177f8ffca0bb16bd2ccbdd61f65131e7a7d235270bc46b9619a4b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::get_field_by_name::class_value_get_field (cognitive 142): perry_runtime::object::field_get_set::get_field_by_name::class_value_get_field has cognitive complexity 142 (threshold 15). Drivers by points: if/else 51 (120 pts), boolean chains 15, match/switch 1 (4 pts), loops 1 (3 pts) (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/perry-runtime/src/object/field_get_set/get_field_by_name.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"087adb1cc94f8467d414c5368a8fae1da41eab73051a7f73d1d8c3c81b204230"}},{"ruleId":"D2","level":"warning","message":{"text":"native_export_collisions.source_exports (cognitive 142): native_export_collisions.source_exports has cognitive complexity 142 (threshold 15). Drivers by points: if/else 24 (78 pts), loops 14 (38 pts), ternaries 3 (14 pts), boolean chains 12 (nesting depth added 89). 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":"scripts/native_export_collisions.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bb0a6111e127f48188ccc84fd3e7f57ca422b7065039a45f6b228d5131fc7a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::decl_units::views (cognitive 141): perry_wpfacts::decl_units::views has cognitive complexity 141 (threshold 15). Drivers by points: if/else 20 (69 pts), loops 23 (47 pts), match/switch 8 (23 pts), boolean chains 2 (nesting depth added 88). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/decl_units.rs"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70d43f18c65c0d466c9ea77970f251c85576c71d8274a9fa1cf15670f9f365d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::setup::ios::ios_wizard (cognitive 140): perry::commands::setup::ios::ios_wizard has cognitive complexity 140 (threshold 15). Drivers by points: if/else 69 (131 pts), boolean chains 4, loops 1 (4 pts), match/switch 1 (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/setup/ios.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a20f6d1d5d4c00bb856cae66060abf6df1fcea3c6afcb7f61a85c6a8b84934"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::binary::lower (cognitive 140): perry_codegen::expr::binary::lower has cognitive complexity 140 (threshold 15). Drivers by points: if/else 39 (107 pts), boolean chains 27, match/switch 3 (6 pts) (nesting depth added 71). 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/perry-codegen/src/expr/binary.rs"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"62792c354938a9ce8f2646a492b41f0272a42245c23f8daef18fb094b3370ec0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::static_field_meta::lower (cognitive 140): perry_codegen::expr::static_field_meta::lower has cognitive complexity 140 (threshold 15). Drivers by points: if/else 51 (108 pts), loops 5 (14 pts), match/switch 5 (11 pts), boolean chains 7 (nesting depth added 72). 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/perry-codegen/src/expr/static_field_meta.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d6022b26836ff9b69c125cd81ca3cf1f8e80ca8009d4e85462d4173835c631"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::store_into (cognitive 140): Model::store_into has cognitive complexity 140 (threshold 15). Drivers by points: if/else 45 (80 pts), match/switch 16 (30 pts), boolean chains 20, loops 3 (10 pts) (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/solve/store.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"786b66b9a0cec1bfe644eed9d2f8189f509b599cb0fde4fff03e7aa47a04e362"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::static_and_instance::try_static_method_and_instance (cognitive 139): perry_hir::lower::expr_call::static_and_instance::try_static_method_and_instance has cognitive complexity 139 (threshold 15). Drivers by points: if/else 36 (110 pts), boolean chains 21, match/switch 2 (8 pts) (nesting depth added 80). 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/perry-hir/src/lower/expr_call/static_and_instance.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"6725f4b863d068792892cb7f5e7f98194f9a2aab080de436c626df5873a26dba"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_get::try_data_lookup_key (cognitive 139): perry_runtime::object::native_get::try_data_lookup_key has cognitive complexity 139 (threshold 15). Drivers by points: if/else 46 (117 pts), boolean chains 21, loops 1 (nesting depth added 71). 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/perry-runtime/src/object/native_get.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4f2a82bc296e21f28324ba021657b2fd3612050088202246f87339a2b65397"}},{"ruleId":"D2","level":"warning","message":{"text":"check_actions_topology.main (cognitive 139): check_actions_topology.main has cognitive complexity 139 (threshold 15). Drivers by points: if/else 36 (90 pts), boolean chains 31, loops 10 (18 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":"scripts/check_actions_topology.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2769a2f56b86dd416760b43e98a344dca5f8f556d3db0ecc49f9699cd370c1e9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::loops::match_object_array_write_loop (cognitive 136): perry_codegen::stmt::loops::match_object_array_write_loop has cognitive complexity 136 (threshold 15). Drivers by points: if/else 33 (102 pts), match/switch 6 (18 pts), boolean chains 11, loops 3 (5 pts) (nesting depth added 83). Of this number, 133 points are the body\u0027s own statements and 3 belong to one function item 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":"crates/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":4574}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52ae429fe0b28b7e6186b7423fa658f40f8a2c47a056e49a5957f615c309205"}},{"ruleId":"D2","level":"warning","message":{"text":"FuncEmitCtx::try_emit_expr_classes (cognitive 136): FuncEmitCtx::try_emit_expr_classes has cognitive complexity 136 (threshold 15). Drivers by points: if/else 35 (74 pts), loops 14 (54 pts), match/switch 4 (8 pts) (nesting depth added 83). 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/perry-codegen-wasm/src/emit/expr/classes.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb3b90e81304242a64df207856f199aaba7f063572445ae22813df4be301f1c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_ws::js_ws_process_pending (cognitive 136): perry_ext_ws::js_ws_process_pending has cognitive complexity 136 (threshold 15). Drivers by points: if/else 26 (89 pts), loops 13 (45 pts), match/switch 1 (2 pts) (nesting depth added 96). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-ws/src/lib.rs"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cefe8a3606e1bc0d48f0d35a72d1437c9cd41246c4d09bfca95845e424a490d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::value::to_string::js_jsvalue_to_string_impl (cognitive 136): perry_runtime::value::to_string::js_jsvalue_to_string_impl has cognitive complexity 136 (threshold 15). Drivers by points: if/else 47 (121 pts), match/switch 3 (12 pts), boolean chains 3 (nesting depth added 83). 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/perry-runtime/src/value/to_string.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6474ed60041fa28bc5812211ac4d8b6f14cec480668333c472f462538da9912"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::prototype_objects::resolve_proto_chain_field_inner (cognitive 135): perry_runtime::object::class_registry::prototype_objects::resolve_proto_chain_field_inner has cognitive complexity 135 (threshold 15). Drivers by points: if/else 34 (123 pts), boolean chains 6, match/switch 2 (5 pts), loops 1 (nesting depth added 92). 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/perry-runtime/src/object/class_registry/prototype_objects.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7a97116a15ac84a29136db9fc38df556615d853efdfe6a372b0d248d19341d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::call_inliner::inline_calls_in_stmts (cognitive 135): perry_transform::inline::call_inliner::inline_calls_in_stmts has cognitive complexity 135 (threshold 15). Drivers by points: if/else 31 (97 pts), loops 5 (18 pts), match/switch 5 (15 pts), boolean chains 5 (nesting depth added 89). 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/perry-transform/src/inline/call_inliner.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef18637b915f13a687062530aa27815832847808bd3109ccd8b2c22ed33011f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::js_transform::local_natives::fix_native_instance_expr_with_locals (cognitive 133): perry_hir::js_transform::local_natives::fix_native_instance_expr_with_locals has cognitive complexity 133 (threshold 15). Drivers by points: if/else 25 (79 pts), loops 13 (47 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 90). 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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd23fddb0750aa7372cbd0f08d3585b0a9dec3a63cd4e81f2348b7f35e8351fd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::lower::transform_generator_function_with_extra_captures (cognitive 133): perry_transform::generator::lower::transform_generator_function_with_extra_captures has cognitive complexity 133 (threshold 15). Drivers by points: if/else 67 (107 pts), loops 15 (16 pts), boolean chains 9, match/switch 1 (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/perry-transform/src/generator/lower.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"61be1c7a61c939cccd28c9d56534b7eaa31cbf401921ed942e579f72ca381ea8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::native::lower_native_method_call (cognitive 132): perry_codegen::lower_call::native::lower_native_method_call has cognitive complexity 132 (threshold 15). Drivers by points: if/else 36 (71 pts), loops 8 (32 pts), match/switch 5 (20 pts), boolean chains 9 (nesting depth added 74). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/native/mod.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"319305a570fc2dedaa97299e1572a50e8935e72ca1f690749ed919be10c71a74"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::class_captures::synthesize_class_captures (cognitive 132): perry_hir::lower_decl::class_captures::synthesize_class_captures has cognitive complexity 132 (threshold 15). Drivers by points: if/else 47 (76 pts), loops 34 (51 pts), boolean chains 4, match/switch 1 (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/perry-hir/src/lower_decl/class_captures.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32f21e90dda7218844a13f495725726970e4ce23b86c28db8e5650ff042284d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::check::run (cognitive 131): perry::commands::check::run has cognitive complexity 131 (threshold 15). Drivers by points: if/else 50 (87 pts), match/switch 10 (21 pts), boolean chains 13, loops 4 (10 pts) (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/check.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14c81de797803c36a5154714763a60f370c069d97c9a2cc53591ac65a3a7731"}},{"ruleId":"D2","level":"warning","message":{"text":"ComposeEngine::up (cognitive 131): ComposeEngine::up has cognitive complexity 131 (threshold 15). Drivers by points: if/else 34 (81 pts), match/switch 11 (26 pts), loops 7 (23 pts), boolean chains 1 (nesting depth added 78). 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/perry-container-compose/src/compose.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc2f5586b40924743e8a0a2b4800741070bb44195cdfb3e86675008ae62136d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_module::constants::get_native_module_constant (cognitive 131): perry_runtime::object::native_module::constants::get_native_module_constant has cognitive complexity 131 (threshold 15). Drivers by points: match/switch 42 (78 pts), if/else 29 (48 pts), boolean chains 5 (nesting depth added 55). 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/perry-runtime/src/object/native_module/constants.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"0882c5c14c925da9e7199ff42564ec4f7624dd774d727b49a34880f349abba1b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::split_regions::split_list (cognitive 130): perry_codegen::codegen::split_regions::split_list has cognitive complexity 130 (threshold 15). Drivers by points: if/else 29 (94 pts), match/switch 5 (16 pts), loops 8 (13 pts), boolean chains 7 (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/perry-codegen/src/codegen/split_regions.rs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8a581284f5516b04c4004fabbe26afbd6683bed7eedae7c16c960109db7ac9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::property_set::lower (cognitive 130): perry_codegen::expr::property_set::lower has cognitive complexity 130 (threshold 15). Drivers by points: if/else 38 (118 pts), boolean chains 11, match/switch 1 (nesting depth added 80). 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/perry-codegen/src/expr/property_set.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"48433dab9ba9daa2a3ecd2a1499fae2959c2b11f829d03cb583f676dff36265c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::loops::lower_for_after_init_impl (cognitive 130): perry_codegen::stmt::loops::lower_for_after_init_impl has cognitive complexity 130 (threshold 15). Drivers by points: if/else 70 (98 pts), boolean chains 12, match/switch 5 (12 pts), loops 3 (8 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":7176}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c2159fd79567240125e1dcf415b660f0f660ed60a8456a50bcaa263fbd69eb"}},{"ruleId":"D2","level":"warning","message":{"text":"JsEmitter::emit_expr_continued (cognitive 129): JsEmitter::emit_expr_continued has cognitive complexity 129 (threshold 15). Drivers by points: if/else 42 (94 pts), loops 15 (32 pts), match/switch 2 (3 pts) (nesting depth added 70). 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/perry-codegen-js/src/emit/exprs_more.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eba598fc90555e0eb9f2c921e0f6e961eb2325bb401f97a4466add37cdc3db3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::native_module::imported_module_dispatch::try_imported_module_dispatch (cognitive 129): perry_hir::lower::expr_call::native_module::imported_module_dispatch::try_imported_module_dispatch has cognitive complexity 129 (threshold 15). Drivers by points: if/else 31 (102 pts), boolean chains 18, match/switch 2 (9 pts) (nesting depth added 78). 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/perry-hir/src/lower/expr_call/native_module/imported_module_dispatch.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0947f895ee182befe81181f8c3ec1afe9efdf31b2bae72a897cd30b3cc0d1c5a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::collect_modules::finish::collect_module_finish (cognitive 128): perry::commands::compile::collect_modules::finish::collect_module_finish has cognitive complexity 128 (threshold 15). Drivers by points: if/else 17 (61 pts), loops 14 (57 pts), match/switch 2 (8 pts), boolean chains 2 (nesting depth added 93). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/collect_modules/finish.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ae91a4612af1163970d73dfaecaf98c9131059037477007428a7a0c57b71e8"}},{"ruleId":"D2","level":"warning","message":{"text":"UseWalk::walk_expr (cognitive 128): UseWalk::walk_expr has cognitive complexity 128 (threshold 15). Drivers by points: if/else 35 (100 pts), loops 6 (17 pts), match/switch 4 (8 pts), boolean chains 3 (nesting depth added 80). 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/perry-codegen/src/collectors/ptr_shape.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"317128c5e3c347195af6c2e77be3db282293941956f3b28bb42802d276e40ee8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::region_loop::lower_split (cognitive 128): perry_codegen::stmt::region_loop::lower_split has cognitive complexity 128 (threshold 15). Drivers by points: if/else 58 (98 pts), boolean chains 14, loops 5 (10 pts), match/switch 4 (6 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/region_loop/mod.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd7feb15cffd7da93ba14f93360f5a4b266563520628fc873b10df02dc0d554"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::value::dyn_index::js_dyn_index_get (cognitive 128): perry_runtime::value::dyn_index::js_dyn_index_get has cognitive complexity 128 (threshold 15). Drivers by points: if/else 61 (109 pts), boolean chains 15, match/switch 1 (4 pts) (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/value/dyn_index.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"12530b8f40111b2d5cffa59fad44990201864ef0a036180940c014a22c7f6147"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::expr_inner (cognitive 128): Gen::expr_inner has cognitive complexity 128 (threshold 15). Drivers by points: if/else 32 (61 pts), loops 19 (39 pts), match/switch 12 (26 pts), boolean chains 2 (nesting depth added 63). 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/perry-wpfacts/src/gen_expr.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"8855d645cb9c71d75636828ce1f171c20a261ff0bec1585853bd2fc36c6b7894"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::destructuring::var_decl::lower_var_decl_with_destructuring (cognitive 127): perry_hir::destructuring::var_decl::lower_var_decl_with_destructuring has cognitive complexity 127 (threshold 15). Drivers by points: if/else 43 (96 pts), match/switch 9 (22 pts), boolean chains 9 (nesting depth added 66). 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/perry-hir/src/destructuring/var_decl.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd14532ca86fa788dd7e180c4eca27847f6831b616c17ef4d7ba55669f4f510"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_new::non_ident::register_stream_controller_params (cognitive 127): perry_hir::lower::expr_new::non_ident::register_stream_controller_params has cognitive complexity 127 (threshold 15). Drivers by points: if/else 12 (82 pts), match/switch 5 (39 pts), loops 1 (6 pts) (nesting depth added 109). 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/perry-hir/src/lower/expr_new/non_ident.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"640601a4be132e02dcd48eaecf2176a18d900f9e07bfe47d946acbd5086bf79e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::enumeration::js_object_keys_shape (cognitive 127): perry_runtime::object::field_get_set::enumeration::js_object_keys_shape has cognitive complexity 127 (threshold 15). Drivers by points: if/else 36 (87 pts), loops 8 (23 pts), boolean chains 12, match/switch 3 (5 pts) (nesting depth added 68). 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/perry-runtime/src/object/field_get_set/enumeration.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5041a663fe323fd5ce39df2ddbe478640ebf5e7372101a6fc9b26e2304c772"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::logical_collections::lower (cognitive 126): perry_codegen::expr::logical_collections::lower has cognitive complexity 126 (threshold 15). Drivers by points: if/else 48 (87 pts), match/switch 10 (25 pts), loops 5 (11 pts), boolean chains 3 (nesting depth added 60). 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/perry-codegen/src/expr/logical_collections.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe6db9a1f5f24bcdb77525bf18534a22d12eabb22d02dbd4fecc9526de38f4b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::destructuring::var_decl::type_infer::infer_decl_type (cognitive 126): perry_hir::destructuring::var_decl::type_infer::infer_decl_type has cognitive complexity 126 (threshold 15). Drivers by points: if/else 40 (98 pts), boolean chains 11, match/switch 2 (10 pts), loops 1 (7 pts) (nesting depth added 72). 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/perry-hir/src/destructuring/var_decl/type_infer.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b18e8a4894842b36d2d67823351a602d77db6c0eebe6af047eee410d40b4b89"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::stringify_object::stringify_object_walk (cognitive 126): perry_runtime::json::stringify_object::stringify_object_walk has cognitive complexity 126 (threshold 15). Drivers by points: if/else 56 (101 pts), boolean chains 20, match/switch 3, loops 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/perry-runtime/src/json/stringify_object.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b64f411aeb36d9342faf24f529b906e07d999f89b1838a6b3a6e19352f0ba5c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::runtime_layouts::runtime_layout_word (cognitive 126): perry_runtime::object::runtime_layouts::runtime_layout_word has cognitive complexity 126 (threshold 15). Drivers by points: if/else 124 (125 pts), loops 1 (nesting depth added 1). Of this number, 122 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/perry-runtime/src/object/runtime_layouts.rs"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"365217199e39f9d38fc5c4b8e8f1744cd427dab027167cb64ddb4ef1d81aaeac"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::hoist_classes::collect_top_level_let_const_var_names (cognitive 125): perry::commands::compile::cjs_wrap::hoist_classes::collect_top_level_let_const_var_names has cognitive complexity 125 (threshold 15). Drivers by points: if/else 15 (46 pts), loops 14 (44 pts), boolean chains 29, match/switch 2 (6 pts) (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/cjs_wrap/hoist_classes.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9e18967f2e748d585a8e5b34d7f18bd6e2251f65362d54b17123ed55710074"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::publish::preflight::ios_preflight_validation (cognitive 123): perry::commands::publish::preflight::ios_preflight_validation has cognitive complexity 123 (threshold 15). Drivers by points: if/else 31 (113 pts), loops 2 (6 pts), boolean chains 4 (nesting depth added 86). 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/perry/src/commands/publish/preflight.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"e129f06758ed8884d7919a298d81fdce3251033eae3a39a346ce9165ca3c61e6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::date_collator::build_parts_from_components (cognitive 123): perry_runtime::intl::date_collator::build_parts_from_components has cognitive complexity 123 (threshold 15). Drivers by points: if/else 51 (110 pts), boolean chains 10, match/switch 1 (3 pts) (nesting depth added 61). 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/perry-runtime/src/intl/date_collator.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b588328a18b8f971b4902a9832189f64fd5b22c6f1a31ccfdb0e45d2141e9f9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_call_method::native_call_method_value_inner (cognitive 123): perry_runtime::object::native_call_method::native_call_method_value_inner has cognitive complexity 123 (threshold 15). Drivers by points: if/else 38 (109 pts), boolean chains 14 (nesting depth added 71). 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/perry-runtime/src/object/native_call_method.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8d8825b9be5c672339429d5e59a04b24bf772b267489a117d5bc21d36f56f8"}},{"ruleId":"D2","level":"warning","message":{"text":"package_bench.cmd_report (cognitive 123): package_bench.cmd_report has cognitive complexity 123 (threshold 15). Drivers by points: if/else 25 (45 pts), loops 20 (31 pts), boolean chains 25, ternaries 12 (22 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":"scripts/package_bench.py"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f803b4fd27707ea9084bc1d7f47c2bfe81da6b8289525e0fc7a11048f4690f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_arkts::widgets::text::emit_style_modifiers (cognitive 122): perry_codegen_arkts::widgets::text::emit_style_modifiers has cognitive complexity 122 (threshold 15). Drivers by points: if/else 24 (93 pts), match/switch 5 (19 pts), loops 3 (9 pts), boolean chains 1 (nesting depth added 89). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-arkts/src/widgets/text.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d35b6e3bc53acbaae8dc31ff3965802d0fa32b4ef16af76fa5e5a5270d30b0c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::destructuring::pattern_binding::lower_pattern_binding_into (cognitive 122): perry_hir::destructuring::pattern_binding::lower_pattern_binding_into has cognitive complexity 122 (threshold 15). Drivers by points: if/else 22 (99 pts), match/switch 5 (14 pts), loops 2 (7 pts), boolean chains 2 (nesting depth added 91). 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/perry-hir/src/destructuring/pattern_binding.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd2014889c0d6c47d4832abd2e6a40116f47fe630f05781950a75f9a636b268"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::js_transform::cross_module_natives::fix_cross_module_native_instances (cognitive 122): perry_hir::js_transform::cross_module_natives::fix_cross_module_native_instances has cognitive complexity 122 (threshold 15). Drivers by points: loops 30 (76 pts), if/else 13 (40 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 76). 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/perry-hir/src/js_transform/cross_module_natives.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d143e1a5a5d321be0bfe74fdfd5726f7e825a849cc61ce61d406b967557e27a3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime_manifest::realm_source::declarations (cognitive 122): perry_runtime_manifest::realm_source::declarations has cognitive complexity 122 (threshold 15). Drivers by points: if/else 28 (91 pts), loops 6 (22 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 80). 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/perry-runtime-manifest/src/realm_source.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaaf05e4b246b2989be3969572fb621710b1fe3970844f671cb90203c19e1a73"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::block::pre_register_forward_captured_lets (cognitive 120): perry_hir::lower_decl::block::pre_register_forward_captured_lets has cognitive complexity 120 (threshold 15). Drivers by points: if/else 18 (90 pts), loops 8 (28 pts), boolean chains 2 (nesting depth added 92). 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/perry-hir/src/lower_decl/block.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5bb03ab57015af13bb2519776a3d9f71e4719bc8bd8fa4510b54bde64e5847"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::object_ops::keys_array::ensure_key_in_keys_array_inner (cognitive 120): perry_runtime::object::object_ops::keys_array::ensure_key_in_keys_array_inner has cognitive complexity 120 (threshold 15). Drivers by points: if/else 49 (96 pts), boolean chains 18, match/switch 2 (4 pts), loops 1 (2 pts) (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/perry-runtime/src/object/object_ops/keys_array.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"c543cdd1ce180f042b3d6a08cf1a5c1771e242530cfeab31b3ddd30f39aa3bce"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::to_string_tag::js_object_to_string (cognitive 120): perry_runtime::object::to_string_tag::js_object_to_string has cognitive complexity 120 (threshold 15). Drivers by points: if/else 62 (101 pts), boolean chains 12, match/switch 3 (5 pts), loops 1 (2 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/perry-runtime/src/object/to_string_tag.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3df7075ab985e71e69cbb0982a0e4f9c966eda8eb0b099fd822195fd1ac2eb7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::bigint_set::lower (cognitive 119): perry_codegen::expr::bigint_set::lower has cognitive complexity 119 (threshold 15). Drivers by points: if/else 58 (91 pts), boolean chains 18, match/switch 5 (10 pts) (nesting depth added 38). 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/perry-codegen/src/expr/bigint_set.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08415ad23e42580449deabd2ae1f81fc1f5411a040010cc015c36a4bfd668b0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_string_method::lower_string_method_dispatch (cognitive 119): perry_codegen::lower_string_method::lower_string_method_dispatch has cognitive complexity 119 (threshold 15). Drivers by points: if/else 41 (67 pts), loops 14 (29 pts), match/switch 12 (23 pts) (nesting depth added 52). 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/perry-codegen/src/lower_string_method.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc59e38fd4c19c1975c42890749dc81f00ffcd8c861dc58ac8d81c9e197c98d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::closure::compile_closure (cognitive 118): perry_codegen::codegen::closure::compile_closure has cognitive complexity 118 (threshold 15). Drivers by points: if/else 68 (87 pts), boolean chains 17, loops 10 (12 pts), match/switch 2 (nesting depth added 21). 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fef58c2510264f0f14ae14cdeda3132e26720be107bd32c74a9d9df6317a097"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::summary::compose::compress (cognitive 117): perry_wpfacts::summary::compose::compress has cognitive complexity 117 (threshold 15). Drivers by points: if/else 21 (57 pts), loops 28 (54 pts), boolean chains 4, match/switch 2 (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/perry-wpfacts/src/summary/compose.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9aeb8ece1b10068a90ab98c40b521a19fdad534281946e78162e8949d264153"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::let_scalar_new::try_lower_scalar_replaced_new (cognitive 116): perry_codegen::stmt::let_scalar_new::try_lower_scalar_replaced_new has cognitive complexity 116 (threshold 15). Drivers by points: if/else 25 (85 pts), loops 5 (24 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 82). 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/perry-codegen/src/stmt/let_scalar_new.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0650a7013da62e9d60fc2acd902c404e41275a4d8de84bdb58c49a27d127165e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_call_method::typed_array::dispatch_typed_array_method (cognitive 116): perry_runtime::object::native_call_method::typed_array::dispatch_typed_array_method has cognitive complexity 116 (threshold 15). Drivers by points: if/else 57 (87 pts), boolean chains 17, match/switch 4 (9 pts), loops 1 (3 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/native_call_method/typed_array.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0824203d07b8e57aab5d8cc25ffc3a71d00a484878cf2d602913876f617bbac9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_module::class_method_bind::js_class_method_bind (cognitive 116): perry_runtime::object::native_module::class_method_bind::js_class_method_bind has cognitive complexity 116 (threshold 15). Drivers by points: if/else 25 (111 pts), boolean chains 5 (nesting depth added 86). 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/perry-runtime/src/object/native_module/class_method_bind.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5ffedc77f9560929e04cb71ca93ae44dc6c894d6a5b2f160b5719c0e450fd9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::object_ops_frozen::object_integrity_level (cognitive 116): perry_runtime::object::object_ops_frozen::object_integrity_level has cognitive complexity 116 (threshold 15). Drivers by points: if/else 44 (91 pts), loops 7 (12 pts), boolean chains 11, match/switch 1 (2 pts) (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/object_ops_frozen.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c79a2464ac99568266956c9893c90ef9e8bb06e3604561db83d73d712d2cbf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::class_artifacts::emit_class_artifacts (cognitive 115): perry_codegen::codegen::class_artifacts::emit_class_artifacts has cognitive complexity 115 (threshold 15). Drivers by points: if/else 42 (93 pts), loops 9 (17 pts), boolean chains 5 (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/class_artifacts.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4325d2da4929ea2a44f16f8b656f4c1c67538f9a7f6bb2e686b8562739ceb7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::eval_super_scan::scan_expr (cognitive 115): perry_hir::lower::eval_super_scan::scan_expr has cognitive complexity 115 (threshold 15). Drivers by points: if/else 16 (53 pts), loops 12 (35 pts), match/switch 11 (24 pts), boolean chains 3 (nesting depth added 73). 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/perry-hir/src/lower/eval_super_scan.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2dc83973ecbe3d0b38b7d4cc13a9db7f1e458064dc65f552e84787c91230237"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::analysis::fn_infer::round (cognitive 114): perry_hir::analysis::fn_infer::round has cognitive complexity 114 (threshold 15). Drivers by points: if/else 26 (80 pts), loops 14 (26 pts), match/switch 4 (6 pts), boolean chains 2 (nesting depth added 68). 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/perry-hir/src/analysis/fn_infer.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40b6e26d0c7489b6f95b7cdcce72d35d67ce2fa67f4e46adf6f25b8607d7e89"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::url_date_instance::try_url_date_weakref_instance (cognitive 114): perry_hir::lower::expr_call::url_date_instance::try_url_date_weakref_instance has cognitive complexity 114 (threshold 15). Drivers by points: if/else 26 (79 pts), match/switch 7 (30 pts), boolean chains 5 (nesting depth added 76). 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/perry-hir/src/lower/expr_call/url_date_instance.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dcd35d41c449a298e80acf17066c025b727a82a0231e9e515f2eebdcc5f8d02"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::lib::contracts::arg_contract_of (cognitive 114): perry_wpfacts::lib::contracts::arg_contract_of has cognitive complexity 114 (threshold 15). Drivers by points: if/else 25 (86 pts), match/switch 3 (14 pts), boolean chains 7, loops 4 (7 pts) (nesting depth added 75). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/lib/contracts.rs"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5b2328c504a72adf7ed4eccd16ffe07a06ae4869abd2d738e9817b455a081b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::escape_news::collect_used_new_fields_in_expr (cognitive 113): perry_codegen::collectors::escape_news::collect_used_new_fields_in_expr has cognitive complexity 113 (threshold 15). Drivers by points: if/else 37 (73 pts), loops 16 (32 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/escape_news.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1f1e8868ab64481e80d8ed5cd0758ea9bd68a5ffc749a80059b8815f17ed0e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::console_promise::try_lower_console_call (cognitive 113): perry_codegen::lower_call::console_promise::try_lower_console_call has cognitive complexity 113 (threshold 15). Drivers by points: if/else 25 (67 pts), loops 6 (26 pts), match/switch 5 (14 pts), boolean chains 6 (nesting depth added 71). 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/perry-codegen/src/lower_call/console_promise.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d5f6b05c21f92c3d60edf16ba2a28da1436cd6e7d7c8f2d4cb550cf5768b48"}},{"ruleId":"D2","level":"warning","message":{"text":"Need::compute (cognitive 112): Need::compute has cognitive complexity 112 (threshold 15). Drivers by points: loops 28 (57 pts), if/else 15 (45 pts), match/switch 2 (7 pts), boolean chains 3 (nesting depth added 64). 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/perry-codegen/src/codegen/source_need/flow.rs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c588fe3932be021edd17a62f279728099717bcc64612455a7159fdeea73ae83"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::gc_map::decode_v3 (cognitive 112): perry_codegen::gc_map::decode_v3 has cognitive complexity 112 (threshold 15). Drivers by points: if/else 15 (66 pts), loops 9 (33 pts), match/switch 2 (8 pts), boolean chains 5 (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/gc_map.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"b988ca28166f448c68ff092621893f5750dd314422649a7ba6c4f3040e273403"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_component_host::task_exit::instrument::instrument (cognitive 112): perry_component_host::task_exit::instrument::instrument has cognitive complexity 112 (threshold 15). Drivers by points: if/else 24 (62 pts), loops 10 (22 pts), match/switch 8 (22 pts), boolean chains 6 (nesting depth added 64). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-component-host/src/task_exit/instrument.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d18a3b545cbc474bb95c06592abe4e74c1a9571a031d4fa9101f8ffb39601f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::array_object_ops::define_array_property (cognitive 112): perry_runtime::object::array_object_ops::define_array_property has cognitive complexity 112 (threshold 15). Drivers by points: if/else 54 (99 pts), boolean chains 13 (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/perry-runtime/src/object/array_object_ops.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6018e0806cb22b56c74418603067c294d4bd38a09c1ca88e6da194b66af373"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::extract_exports::extract_object_literal_exports_from_require (cognitive 111): perry::commands::compile::cjs_wrap::extract_exports::extract_object_literal_exports_from_require has cognitive complexity 111 (threshold 15). Drivers by points: if/else 22 (58 pts), loops 12 (28 pts), boolean chains 19, match/switch 4 (6 pts) (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/cjs_wrap/extract_exports.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"c455e6ae442e0e7892dc7ea55499af75c4f016f3e3ed6a1969fd75e0e0b87f43"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::escape_objects::check_object_literal_escapes_in_expr (cognitive 110): perry_codegen::collectors::escape_objects::check_object_literal_escapes_in_expr has cognitive complexity 110 (threshold 15). Drivers by points: if/else 28 (79 pts), loops 11 (22 pts), match/switch 4 (9 pts) (nesting depth added 67). 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/perry-codegen/src/collectors/escape_objects.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"7288e1cf7ec4d8a396a20e8ada2fb4eb6ec67f01a63a36f5bf2c96e27e8a7ad6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::closure::lower (cognitive 110): perry_codegen::expr::closure::lower has cognitive complexity 110 (threshold 15). Drivers by points: if/else 37 (73 pts), loops 7 (18 pts), boolean chains 13, match/switch 2 (6 pts) (nesting depth added 51). 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/perry-codegen/src/expr/closure.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7677e167099a8fb8e89a06302b20531d70f6bd958a75f3257b360140b9af8e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::builtins::formatting::format_jsvalue (cognitive 110): perry_runtime::builtins::formatting::format_jsvalue has cognitive complexity 110 (threshold 15). Drivers by points: if/else 65 (107 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/perry-runtime/src/builtins/formatting.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb829176273d774a32acc47fa4f194dee22e9796318ee35cbe93a1ce8fd5058c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::assign::object_assign_one (cognitive 110): perry_runtime::object::assign::object_assign_one has cognitive complexity 110 (threshold 15). Drivers by points: if/else 40 (84 pts), loops 6 (13 pts), boolean chains 12, match/switch 1 (nesting depth added 51). 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/perry-runtime/src/object/assign.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb01ba35b352f38fe4f3984ec3fcfb80d10bafea1dafe54e75274ccc5aaa987"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::refs::refs_expr (cognitive 109): perry_codegen::collectors::refs::refs_expr has cognitive complexity 109 (threshold 15). Drivers by points: if/else 27 (54 pts), loops 24 (48 pts), match/switch 3 (7 pts) (nesting depth added 55). 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/perry-codegen/src/collectors/refs.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bb5c786b59fc44b2a1654a9801ff921ef7ca305cd134dbc7e36ba1e44b01eb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::instance_misc1::lower (cognitive 109): perry_codegen::expr::instance_misc1::lower has cognitive complexity 109 (threshold 15). Drivers by points: if/else 33 (74 pts), match/switch 11 (25 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 59). 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/perry-codegen/src/expr/instance_misc1.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"a917d48dc935cdfcbad32fe78ba068ed6c6d012f51961a6cabaa7a4af170fadb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::stringify::stringify_array_depth (cognitive 109): perry_runtime::json::stringify::stringify_array_depth has cognitive complexity 109 (threshold 15). Drivers by points: if/else 49 (97 pts), boolean chains 6, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/json/stringify.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"da53031a5f922c2e68be68ce78d0c0e02fb505bbe6fc1561c4565334e2c4936c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json_tape::build_tape_into (cognitive 109): perry_runtime::json_tape::build_tape_into has cognitive complexity 109 (threshold 15). Drivers by points: if/else 24 (89 pts), boolean chains 11, match/switch 3 (8 pts), loops 1 (nesting depth added 70). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/json_tape.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d30f1c05ff83abf0786fd000b54df997a84aa672cef72ea10a5b45ee9c1cd5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::func_ref::try_lower_func_ref_call (cognitive 107): perry_codegen::lower_call::func_ref::try_lower_func_ref_call has cognitive complexity 107 (threshold 15). Drivers by points: if/else 46 (63 pts), loops 10 (20 pts), match/switch 7 (14 pts), boolean chains 10 (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/perry-codegen/src/lower_call/func_ref.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e3e381869ba064a741ef024115aef1b2e8c70b07cd3460230781dae5b45668"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::inline_birth_invariant::check (cognitive 107): perry_codegen::lower_call::inline_birth_invariant::check has cognitive complexity 107 (threshold 15). Drivers by points: if/else 17 (76 pts), loops 9 (26 pts), boolean chains 5 (nesting depth added 76). 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/perry-codegen/src/lower_call/inline_birth_invariant.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"90cd917568d0e4341cde72dc12f6e1ce800bf5e2d1d25e574dd295c39810b426"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::indexed_owner_loop::lower (cognitive 107): perry_codegen::stmt::indexed_owner_loop::lower has cognitive complexity 107 (threshold 15). Drivers by points: if/else 50 (75 pts), boolean chains 18, loops 11, match/switch 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/perry-codegen/src/stmt/indexed_owner_loop.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"8293a3dfc964c20510580ef3a5397fd691a5a73d8c0c842bef69075f6410abfb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::object_ops::has_own::object_has_own_generic (cognitive 107): perry_runtime::object::object_ops::has_own::object_has_own_generic has cognitive complexity 107 (threshold 15). Drivers by points: if/else 61 (96 pts), boolean chains 8, match/switch 2 (3 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/object_ops/has_own.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9fa0e2992246bd94f0d0b27af140727c4eb9432cd5497ce11f55b82add7c9ad"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::webcrypto::hmac::js_webcrypto_verify (cognitive 107): perry_stdlib::webcrypto::hmac::js_webcrypto_verify has cognitive complexity 107 (threshold 15). Drivers by points: if/else 29 (55 pts), match/switch 20 (42 pts), boolean chains 10 (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/perry-stdlib/src/webcrypto/hmac.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf1ae273deb30147d08495b4a682cbd57523010168734bb7c90765eb914e1e3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::element_shape_loop::match_element_shape_versioned_loop (cognitive 106): perry_codegen::stmt::element_shape_loop::match_element_shape_versioned_loop has cognitive complexity 106 (threshold 15). Drivers by points: if/else 41 (67 pts), boolean chains 18, match/switch 13 (17 pts), loops 4 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/element_shape_loop.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a2656ea242fc4755b8b3f40c5ee4026c8ee4b0f9f44f5336cea1d75f4b9f8a"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::expr_rest (cognitive 106): Gen::expr_rest has cognitive complexity 106 (threshold 15). Drivers by points: if/else 23 (49 pts), loops 13 (30 pts), match/switch 13 (25 pts), boolean chains 2 (nesting depth added 55). 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/perry-wpfacts/src/gen_rest.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3f3831b316738648fb072739048283ef11f9bc8601c28cfaa09d316c14fe25"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape::collect_shape_proven_ptr_locals_impl (cognitive 105): perry_codegen::collectors::ptr_shape::collect_shape_proven_ptr_locals_impl has cognitive complexity 105 (threshold 15). Drivers by points: if/else 32 (61 pts), loops 14 (26 pts), boolean chains 15, match/switch 2 (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/perry-codegen/src/collectors/ptr_shape.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4d3b4f04cc10bac5189767f4895d63da5dd1b9c7baf9bd042680f2f8f5d4cc"}},{"ruleId":"D2","level":"warning","message":{"text":"actions_plan._matches_event (cognitive 105): actions_plan._matches_event has cognitive complexity 105 (threshold 15). Drivers by points: if/else 26 (59 pts), boolean chains 23, ternaries 5 (15 pts), loops 4 (8 pts) (nesting depth added 47). 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":"scripts/actions_plan.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c501f7854c0ca184d6dd7c18ffa31a9d68929c6cd03dcc2f6c99ee9c8302e283"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::copying::run_copied_minor_attempt (cognitive 104): perry_runtime::gc::copying::run_copied_minor_attempt has cognitive complexity 104 (threshold 15). Drivers by points: if/else 68 (86 pts), match/switch 5 (10 pts), boolean chains 6, loops 2 (nesting depth added 23). 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/perry-runtime/src/gc/copying.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0f020e0cf6a36af2ed92f901bcccb9d483796f2ab4a6e0c99e774d09428872"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::property_ops::set::ordinary_set_with_receiver (cognitive 103): perry_runtime::object::property_ops::set::ordinary_set_with_receiver has cognitive complexity 103 (threshold 15). Drivers by points: if/else 20 (65 pts), match/switch 5 (27 pts), boolean chains 11 (nesting depth added 67). 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/perry-runtime/src/object/property_ops/set.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25229423df1023b64363617b00f529ebff1cb82b56c30a1418ae3cf653275b2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::builtins::tok_load (cognitive 103): perry_wpfacts::builtins::tok_load has cognitive complexity 103 (threshold 15). Drivers by points: if/else 27 (69 pts), match/switch 12 (25 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 56). 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/perry-wpfacts/src/builtins.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4f5fac9dac511fa803fcfffe7a0d1f93c77c802829b7eb2557fec376640368"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::builtins::formatting::format_jsvalue_for_json (cognitive 102): perry_runtime::builtins::formatting::format_jsvalue_for_json has cognitive complexity 102 (threshold 15). Drivers by points: if/else 55 (99 pts), boolean chains 3 (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/perry-runtime/src/builtins/formatting.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4cf758a1f2907ad9fb82ec00a9f7ae120c4d6e68c360fa5cf7ebfbd18f9df5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::value::dynamic_object::js_dynamic_object_get_property (cognitive 102): perry_runtime::value::dynamic_object::js_dynamic_object_get_property has cognitive complexity 102 (threshold 15). Drivers by points: if/else 52 (90 pts), match/switch 4 (7 pts), boolean chains 5 (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/perry-runtime/src/value/dynamic_object.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1363fd8a8f3fd9ba6aec06cc92561843cfc6bdc64b2ba5054b41923366e169"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::call_inliner::try_inline_call (cognitive 102): perry_transform::inline::call_inliner::try_inline_call has cognitive complexity 102 (threshold 15). Drivers by points: if/else 19 (65 pts), loops 6 (27 pts), boolean chains 7, match/switch 1 (3 pts) (nesting depth added 69). 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/perry-transform/src/inline/call_inliner.rs"},"region":{"startLine":2051}}}],"partialFingerprints":{"codehealthFindingId/v1":"703e796b4e8d4f18ded48ba851c1897445974e7f9e659d79d3ad4382b125176d"}},{"ruleId":"D2","level":"warning","message":{"text":"Build::expr (cognitive 101): Build::expr has cognitive complexity 101 (threshold 15). Drivers by points: if/else 22 (46 pts), loops 13 (30 pts), match/switch 9 (19 pts), boolean chains 6 (nesting depth added 51). 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/perry-codegen/src/codegen/source_need/flow.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"31df990d0a7d0fcbebb78dea96fdfb1cdc724d3ece055d70aa94da456e1aca15"}},{"ruleId":"D2","level":"warning","message":{"text":"FuncEmitCtx::emit_stmt (cognitive 101): FuncEmitCtx::emit_stmt has cognitive complexity 101 (threshold 15). Drivers by points: if/else 38 (70 pts), loops 11 (29 pts), boolean chains 1, match/switch 1 (nesting depth added 50). 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/perry-codegen-wasm/src/emit/stmt.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd8f0ae88e9e1a2d621f795ca6e15bb5ac5aa3d111178eb919ebfb3857c34b3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::builtins::formatting::format_object_as_json (cognitive 101): perry_runtime::builtins::formatting::format_object_as_json has cognitive complexity 101 (threshold 15). Drivers by points: if/else 45 (82 pts), boolean chains 9, loops 3 (5 pts), match/switch 4 (5 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/builtins/formatting.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c403ecf708bd34ed50b6a094c7481a40b46e544e72f2d7c968c9813c7799ad7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::object_ops::has_own::js_object_property_is_enumerable (cognitive 101): perry_runtime::object::object_ops::has_own::js_object_property_is_enumerable has cognitive complexity 101 (threshold 15). Drivers by points: if/else 59 (96 pts), boolean chains 4, match/switch 1 (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/perry-runtime/src/object/object_ops/has_own.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae89c7a2536ff50341bb44ed6b69d50e049acaad8877ac98656d40b3ec6902b5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::collect_modules::feature_detect::detect_optional_feature_usage (cognitive 100): perry::commands::compile::collect_modules::feature_detect::detect_optional_feature_usage has cognitive complexity 100 (threshold 15). Drivers by points: boolean chains 53, if/else 46 (47 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/perry/src/commands/compile/collect_modules/feature_detect.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7ba35154989a7ef4b47d6fe6191236f4d607ab932961c4cc600fa3628124e9"}},{"ruleId":"D2","level":"warning","message":{"text":"LlModule::layout_codegen_units (cognitive 100): LlModule::layout_codegen_units has cognitive complexity 100 (threshold 15). Drivers by points: if/else 25 (60 pts), loops 20 (32 pts), boolean chains 8 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/module.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"382eade045560bf94c6f6301f10af9dcff70b714e67b5830cd6d0954a525a304"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::family_syntax::analyze (cognitive 99): perry::commands::compile::cjs_wrap::family_syntax::analyze has cognitive complexity 99 (threshold 15). Drivers by points: if/else 23 (59 pts), match/switch 5 (21 pts), loops 7 (14 pts), boolean chains 5 (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/cjs_wrap/family_syntax.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"59480b8e27f81917fc3a6dd16a14ed0c33014966b8b05f87d8d3a838e77ec332"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::widgets::canvas::paint_canvas (cognitive 99): perry_ui_windows::widgets::canvas::paint_canvas has cognitive complexity 99 (threshold 15). Drivers by points: if/else 24 (84 pts), loops 3 (10 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 69). 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/perry-ui-windows/src/widgets/canvas.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"693a745563347de64f053093bfb97bab91a45b0e6666ab81da278e9159b2da41"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::decl_units::decl_units (cognitive 99): perry_wpfacts::decl_units::decl_units has cognitive complexity 99 (threshold 15). Drivers by points: if/else 17 (48 pts), loops 19 (42 pts), match/switch 3 (8 pts), boolean chains 1 (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/decl_units.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1c6d0c41628eb1c752e6048839cde60ad35e5b7263995cae61f4d30065ebeb"}},{"ruleId":"D2","level":"warning","message":{"text":"link_absence.main (cognitive 99): link_absence.main has cognitive complexity 99 (threshold 15). Drivers by points: if/else 16 (48 pts), ternaries 9 (32 pts), boolean chains 13, loops 2 (4 pts), error handling 1 (2 pts) (nesting depth added 58). 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":"scripts/link_absence.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed08d131509e991eb432893b738ada05f4a964a861b954d0d59ca74e2942bbd8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::member_update::lower (cognitive 98): perry_codegen::expr::member_update::lower has cognitive complexity 98 (threshold 15). Drivers by points: if/else 39 (82 pts), match/switch 6 (10 pts), boolean chains 6 (nesting depth added 47). 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/perry-codegen/src/expr/member_update.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e8efa71b44426424aa16f7a4ca2b8fe0e5542b7e30156fbc3455b6f0b9deb7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::date::parse::parse_slash_date (cognitive 98): perry_runtime::date::parse::parse_slash_date has cognitive complexity 98 (threshold 15). Drivers by points: if/else 36 (74 pts), boolean chains 15, match/switch 4 (7 pts), loops 2 (nesting depth added 41). 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/perry-runtime/src/date/parse.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"7611a976b876c5602c8388229b44518dc2c0e2915a7788dd1ca748ff2446a1bf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::shared_mutable_capture::desugar_shared_mutable_captures (cognitive 97): perry_hir::lower::shared_mutable_capture::desugar_shared_mutable_captures has cognitive complexity 97 (threshold 15). Drivers by points: if/else 26 (60 pts), loops 19 (37 pts) (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/perry-hir/src/lower/shared_mutable_capture.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"7720f5241680ca16f8a820925b705a0f7f7f95429ff2bc84797eb6e5d2d8eb26"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.statepoint_self_test (cognitive 97): gc_root_dominance_check.statepoint_self_test has cognitive complexity 97 (threshold 15). Drivers by points: if/else 49 (66 pts), loops 11 (12 pts), boolean chains 11, ternaries 2 (6 pts), error handling 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":6087}}}],"partialFingerprints":{"codehealthFindingId/v1":"d225b3cc1d30571079f5d1506024d02eddfdc7cd5380d9a273fe3b82ec9ba868"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::dyn_extern_i18n::lower (cognitive 96): perry_codegen::expr::dyn_extern_i18n::lower has cognitive complexity 96 (threshold 15). Drivers by points: if/else 38 (89 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (nesting depth added 52). 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/perry-codegen/src/expr/dyn_extern_i18n.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c68aaf404e5c611f58f85d44ffdce6ca9bbd99b8f1cbf55a9c5f60d75ba699"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::new_alloc::emit_instance_alloc_inner (cognitive 96): perry_codegen::lower_call::new_alloc::emit_instance_alloc_inner has cognitive complexity 96 (threshold 15). Drivers by points: if/else 37 (67 pts), boolean chains 16, loops 5 (10 pts), match/switch 1 (3 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/new_alloc.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39278fcc462f056add43ec8122af70ed5f436859116a0cdbeaf348c624e1ff3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_constructors::js_super_construct_apply (cognitive 96): perry_runtime::object::class_constructors::js_super_construct_apply has cognitive complexity 96 (threshold 15). Drivers by points: if/else 36 (72 pts), loops 6 (19 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/class_constructors.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"417edc090a8dff9ef973133e2b133d82bd73f7a9be3afe96a36bc8fdb9bb61ed"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::resolve::resolve_import_with_bunfs (cognitive 95): perry::commands::compile::resolve::resolve_import_with_bunfs has cognitive complexity 95 (threshold 15). Drivers by points: if/else 34 (82 pts), boolean chains 8, loops 2 (3 pts), match/switch 1 (2 pts) (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/perry/src/commands/compile/resolve.rs"},"region":{"startLine":1580}}}],"partialFingerprints":{"codehealthFindingId/v1":"a102eed00b6477659ff507f3c3cb725065ff74eefc5ef2dfdd85bfb22cb3e08e"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.flag_path_feasible (cognitive 95): gc_root_dominance_check.flag_path_feasible has cognitive complexity 95 (threshold 15). Drivers by points: if/else 17 (56 pts), loops 7 (23 pts), ternaries 3 (11 pts), boolean chains 5 (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gc_root_dominance_check.py"},"region":{"startLine":3871}}}],"partialFingerprints":{"codehealthFindingId/v1":"904f69de47ceac6498a1afd6172799dddd77a4b0846eb2e14ccd1d632b9efc66"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::extract_exports::extract_exports_from_source (cognitive 94): perry::commands::compile::cjs_wrap::extract_exports::extract_exports_from_source has cognitive complexity 94 (threshold 15). Drivers by points: if/else 18 (39 pts), loops 13 (29 pts), boolean chains 20, match/switch 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/perry/src/commands/compile/cjs_wrap/extract_exports.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"76491c2ebfb15fb399d2f46fadbe3c6e48a4b49c3a6716d3fc99a07b3ac782be"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::field_init::apply_field_initializers_recursive (cognitive 94): perry_codegen::lower_call::field_init::apply_field_initializers_recursive has cognitive complexity 94 (threshold 15). Drivers by points: if/else 33 (69 pts), match/switch 4 (10 pts), loops 5 (9 pts), boolean chains 6 (nesting depth added 46). 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/perry-codegen/src/lower_call/field_init.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a07ddae34720b392353ee568f25d7b4199e868ba143eafc80b644917f81951"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::module_class_static::try_module_class_static (cognitive 94): perry_hir::lower::expr_call::module_class_static::try_module_class_static has cognitive complexity 94 (threshold 15). Drivers by points: if/else 18 (74 pts), match/switch 2 (14 pts), boolean chains 6 (nesting depth added 68). 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/perry-hir/src/lower/expr_call/module_class_static.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c528b125025a49bb0941dc69459e922c9dded72be3cc6e03f19b4c7fd26b726f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::path::push_glob_regex (cognitive 94): perry_runtime::path::push_glob_regex has cognitive complexity 94 (threshold 15). Drivers by points: if/else 24 (67 pts), loops 4 (12 pts), boolean chains 9, match/switch 2 (6 pts) (nesting depth added 55). 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/perry-runtime/src/path.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d66675a14b9629a14deb46332610ab4e155c420d7df9c0432b776e404f2ae0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::url::node_compat::legacy_url_parse_impl (cognitive 94): perry_runtime::url::node_compat::legacy_url_parse_impl has cognitive complexity 94 (threshold 15). Drivers by points: if/else 34 (63 pts), match/switch 6 (15 pts), boolean chains 12, loops 3 (4 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/url/node_compat.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a7077d83c80d4b664070ebfcc5a3d043be362d48945b78146a0b6d48e3084f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::wasi_net::pump (cognitive 94): perry_runtime::wasi_net::pump has cognitive complexity 94 (threshold 15). Drivers by points: if/else 28 (80 pts), loops 5 (10 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/wasi_net/mod.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54a83779dd320375632e64f4798d11a555ef2e68884380ab77f76a63099e006"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::type_analysis::predicates::static_type_of (cognitive 93): perry_codegen::type_analysis::predicates::static_type_of has cognitive complexity 93 (threshold 15). Drivers by points: if/else 22 (71 pts), match/switch 5 (10 pts), loops 2 (8 pts), boolean chains 4 (nesting depth added 60). 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/perry-codegen/src/type_analysis/predicates.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca260ff7c225de70940f1e2e30bc2930d4d6d6a103fdca03f708b8cfaa71b194"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::stringify::stringify_value (cognitive 93): perry_runtime::json::stringify::stringify_value has cognitive complexity 93 (threshold 15). Drivers by points: if/else 43 (90 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 48). 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/perry-runtime/src/json/stringify.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"9825c3e6cd5ce20cabc8cdba7159bb0a181b0bccc42b12c2ea5acd7f40439a89"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::property_ops::put_value::js_put_value_set (cognitive 93): perry_runtime::object::property_ops::put_value::js_put_value_set has cognitive complexity 93 (threshold 15). Drivers by points: if/else 42 (84 pts), boolean chains 8, match/switch 1 (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/perry-runtime/src/object/property_ops/put_value.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5554070c0ad3e9ec478a0878757f7071791874ada7f96c6248fe1e3a6d95ab3d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::inline_functions_inner (cognitive 93): perry_transform::inline::inline_functions_inner has cognitive complexity 93 (threshold 15). Drivers by points: if/else 31 (66 pts), loops 32 (63 pts), boolean chains 5, match/switch 1 (nesting depth added 66). To reduce it, split the body into named stages: move each independent 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 (perry_transform::inline::inline_functions_inner::walk_stmt_exprs) 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/perry-transform/src/inline/mod.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e8fbeb39f6d6d1cb4df90c18bae8789733779c13c5eb8a30c3acbed4eb74f0"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.check_func_stale (cognitive 93): gc_root_dominance_check.check_func_stale has cognitive complexity 93 (threshold 15). Drivers by points: if/else 14 (61 pts), loops 11 (28 pts), boolean chains 4 (nesting depth added 64). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gc_root_dominance_check.py"},"region":{"startLine":3165}}}],"partialFingerprints":{"codehealthFindingId/v1":"42740e8c11ae53bd6233b25d18aaf5b1ff2d5eb8e8d694826792ed129988537e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_diagnostics::compat_report::redact_snippet (cognitive 92): perry_diagnostics::compat_report::redact_snippet has cognitive complexity 92 (threshold 15). Drivers by points: if/else 23 (54 pts), loops 8 (20 pts), boolean chains 18 (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/perry-diagnostics/src/compat_report.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"077917a5eeb4e3a685e8887ba7ff2412962dfc713a496b11ecc5e435f961ead0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::layout_slot_visit::visit_gc_rewrite_slot_descriptors_with (cognitive 92): perry_runtime::gc::layout_slot_visit::visit_gc_rewrite_slot_descriptors_with has cognitive complexity 92 (threshold 15). Drivers by points: if/else 38 (79 pts), loops 4 (9 pts), boolean chains 3, match/switch 1 (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/perry-runtime/src/gc/layout_slot_visit.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd23ba065cc16dfcdcbec5f171d8ad5c36a7d5189a19fc78558cf37791eaa9d2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::timer::mock::scan_mock_timers_step (cognitive 92): perry_runtime::timer::mock::scan_mock_timers_step has cognitive complexity 92 (threshold 15). Drivers by points: if/else 23 (73 pts), loops 6 (16 pts), boolean chains 3 (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/perry-runtime/src/timer/mock.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"05444df1c89a4fea9da9e033715cfd2ae7ae99996013fe47ee09ec44c0f5de4c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::property_get::static_dispatch::try_lower_static_dispatch (cognitive 91): perry_codegen::lower_call::property_get::static_dispatch::try_lower_static_dispatch has cognitive complexity 91 (threshold 15). Drivers by points: if/else 23 (57 pts), loops 6 (19 pts), boolean chains 8, match/switch 2 (7 pts) (nesting depth added 52). 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/perry-codegen/src/lower_call/property_get/static_dispatch.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cca6da7002ab85510905bc6c494f1ea1e6868fd91f2aa00d73502dcc22fec07"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_call_method::common_methods::dispatch_common (cognitive 91): perry_runtime::object::native_call_method::common_methods::dispatch_common has cognitive complexity 91 (threshold 15). Drivers by points: if/else 36 (72 pts), boolean chains 9, match/switch 3 (7 pts), loops 1 (3 pts) (nesting depth added 42). 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/perry-runtime/src/object/native_call_method/common_methods.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a78beba84b87cc57ead27a034d8dcd6f1cdd14873626a07d9de356d8dba40d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::escape_arrays::check_array_escapes_in_expr (cognitive 90): perry_codegen::collectors::escape_arrays::check_array_escapes_in_expr has cognitive complexity 90 (threshold 15). Drivers by points: if/else 21 (56 pts), loops 10 (20 pts), match/switch 5 (13 pts), boolean chains 1 (nesting depth added 53). 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/perry-codegen/src/collectors/escape_arrays.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ac17b7bbfd4ba786011297c1c3c56d8d034e5ede2b73f1644832d3215040ab"}},{"ruleId":"D2","level":"warning","message":{"text":"Proof::expr (cognitive 90): Proof::expr has cognitive complexity 90 (threshold 15). Drivers by points: if/else 36 (66 pts), match/switch 9 (20 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 42). 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/perry-hir/src/analysis/numeric_order.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7fff1a6fb09168d1ffcb4a39a841f868eb23f0b4363e68abeb906d583bdd55"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::construct::construct_function_impl (cognitive 90): perry_runtime::object::class_registry::construct::construct_function_impl has cognitive complexity 90 (threshold 15). Drivers by points: if/else 40 (70 pts), boolean chains 13, loops 2 (7 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/perry-runtime/src/object/class_registry/construct.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9502c3ab41585838e12a4bf20ff26797056420d52b390cfc127329a3eb426e8"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::stand_in_fn_of (cognitive 90): Gen::stand_in_fn_of has cognitive complexity 90 (threshold 15). Drivers by points: match/switch 17 (39 pts), if/else 15 (25 pts), loops 14 (24 pts), boolean chains 2 (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/perry-wpfacts/src/gen/import_values.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d210f67dd4a79ce0a81f1fb4187b187469553c51010e53b333ab7738201720f"}},{"ruleId":"D2","level":"warning","message":{"text":"node_core_subset.main (cognitive 90): node_core_subset.main has cognitive complexity 90 (threshold 15). Drivers by points: if/else 29 (52 pts), ternaries 8 (18 pts), boolean chains 8, error handling 3 (7 pts), loops 4 (5 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":"scripts/node_core_subset.py"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34a7bc1b45ac6ff6d2bb98695a14c8663fdb318a981106da059f4d13092a823"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::arrays_finds::lower (cognitive 89): perry_codegen::expr::arrays_finds::lower has cognitive complexity 89 (threshold 15). Drivers by points: if/else 33 (66 pts), match/switch 8 (16 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 43). 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/perry-codegen/src/expr/arrays_finds.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07da80b53b1c83b15a058250a74b8e8e5445132919c133c44597e1c822b9dca"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.check_func_statepoints (cognitive 89): gc_root_dominance_check.check_func_statepoints has cognitive complexity 89 (threshold 15). Drivers by points: if/else 20 (72 pts), loops 6 (13 pts), boolean chains 4 (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gc_root_dominance_check.py"},"region":{"startLine":5075}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6bc8d7cd215a1f5cd4c21f5737eae15d4336d3115eb293f83c633513d132e63"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::native_emit::compile_module_units_native_with_workers (cognitive 88): perry_codegen::native_emit::compile_module_units_native_with_workers has cognitive complexity 88 (threshold 15). Drivers by points: if/else 36 (66 pts), match/switch 3 (9 pts), loops 6 (7 pts), boolean chains 6 (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/perry-codegen/src/native_emit.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c5ae650a7a7bda4595e28319c92e958fe61b38b96d006f7b5089eff130ec98"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::textencoder::try_textencoder_decoder (cognitive 88): perry_hir::lower::expr_call::textencoder::try_textencoder_decoder has cognitive complexity 88 (threshold 15). Drivers by points: if/else 20 (82 pts), boolean chains 6 (nesting depth added 62). 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/perry-hir/src/lower/expr_call/textencoder.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37f00742399e5d3a3041db2dae8a43857214adbfc42df52f34650232bc9af35"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::strip_dedup::strip_duplicate_objects_from_lib_with_evidence (cognitive 87): perry::commands::compile::strip_dedup::strip_duplicate_objects_from_lib_with_evidence has cognitive complexity 87 (threshold 15). Drivers by points: if/else 51 (72 pts), loops 4 (9 pts), boolean chains 4, match/switch 2 (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/perry/src/commands/compile/strip_dedup.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07e4185ed04f3b2a8ea5e1cc429b32cfaa31c6b02079abdeb2f919234fa2c72"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::masked_window_region::lower_region_copy (cognitive 87): perry_codegen::stmt::masked_window_region::lower_region_copy has cognitive complexity 87 (threshold 15). Drivers by points: if/else 19 (70 pts), loops 6 (7 pts), match/switch 2 (6 pts), boolean chains 4 (nesting depth added 56). 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/perry-codegen/src/stmt/masked_window_region.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca323b27afc8246d919807487ca9d39e764172960925da8d2957ea6128af0c9"}},{"ruleId":"D2","level":"warning","message":{"text":"verification.native_rep_contract_results (cognitive 87): verification.native_rep_contract_results has cognitive complexity 87 (threshold 15). Drivers by points: if/else 26 (51 pts), boolean chains 32, loops 2 (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":"scripts/compiler_output_harness/verification.py"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a28143a0263d1a4eb9f4e8b0695a7bf64a854ba1ebf63228f437214088af023"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::run::remote::remote_build_and_launch (cognitive 86): perry::commands::run::remote::remote_build_and_launch has cognitive complexity 86 (threshold 15). Drivers by points: if/else 40 (66 pts), match/switch 8 (12 pts), boolean chains 7, loops 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/run/remote.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b796b81aa34bc29869ce1f51f808be105ff41901a4df46399813c515f19b21"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_js::minify::minify_js (cognitive 86): perry_codegen_js::minify::minify_js has cognitive complexity 86 (threshold 15). Drivers by points: if/else 17 (46 pts), loops 8 (24 pts), boolean chains 14, match/switch 1 (2 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/perry-codegen-js/src/minify.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"af04abebd027a66c61c8002cc45d502dffb9df1cc3ec21b90054f38f9da220f9"}},{"ruleId":"D2","level":"warning","message":{"text":"WasmModuleEmitter::collect_strings_in_expr (cognitive 86): WasmModuleEmitter::collect_strings_in_expr has cognitive complexity 86 (threshold 15). Drivers by points: loops 20 (40 pts), if/else 19 (38 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 43). 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/perry-codegen-wasm/src/emit/string_collection.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"762448d902fec265ae638701e066c0b2e00509ad2dc2a1a24491fad4f3c13bc7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_wasm::minify::minify_js (cognitive 86): perry_codegen_wasm::minify::minify_js has cognitive complexity 86 (threshold 15). Drivers by points: if/else 17 (46 pts), loops 8 (24 pts), boolean chains 14, match/switch 1 (2 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/perry-codegen-wasm/src/minify.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ab0cd1e9a00ab1613f1ecd8f36c08c7d13ea8dd4032a071794855e2686c00a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::cross_module::localize_cross_module_functions (cognitive 86): perry_transform::inline::cross_module::localize_cross_module_functions has cognitive complexity 86 (threshold 15). Drivers by points: if/else 20 (55 pts), loops 13 (26 pts), match/switch 1 (3 pts), boolean chains 2 (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/perry-transform/src/inline/cross_module.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9091e94a5d84daa19e9e7f7bac275b71070c660ba533bda6a24cf264678402e"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr::hash (cognitive 85): Expr::hash has cognitive complexity 85 (threshold 15). Drivers by points: loops 16 (32 pts), if/else 19 (29 pts), match/switch 12 (24 pts) (nesting depth added 38). 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/perry-hir/src/stable_hash/expr.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff52105899f4dad73c49f4319051422bb472de6fa1bf191236390f7d65d7c50"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::stringify_shape_template::try_emit_shape_element (cognitive 85): perry_runtime::json::stringify_shape_template::try_emit_shape_element has cognitive complexity 85 (threshold 15). Drivers by points: if/else 43 (71 pts), boolean chains 10, loops 3 (4 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/perry-runtime/src/json/stringify_shape_template.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcfae92ae02326b173398e271c9fabeee99d20bd4d2e46033be7909df840a46"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::typed_array_proto_thunks::dispatch_uint8_buffer_method (cognitive 85): perry_runtime::object::typed_array_proto_thunks::dispatch_uint8_buffer_method has cognitive complexity 85 (threshold 15). Drivers by points: if/else 27 (51 pts), loops 14 (30 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 41). 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/perry-runtime/src/object/typed_array_proto_thunks.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cab032d5e1376ede4f9fa65c5792cd9209eb316b1952c1fff8c55733d877d8"}},{"ruleId":"D2","level":"warning","message":{"text":"actions_plan.select (cognitive 85): actions_plan.select has cognitive complexity 85 (threshold 15). Drivers by points: if/else 29 (56 pts), boolean chains 18, ternaries 3 (9 pts), loops 1 (2 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/actions_plan.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"131d22a261cd4db8dde8dfdde997ce056bc2985c9de05e7e702e63471407b367"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::indexed_owner_loop::emit_body (cognitive 84): perry_codegen::stmt::indexed_owner_loop::emit_body has cognitive complexity 84 (threshold 15). Drivers by points: if/else 26 (75 pts), loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/indexed_owner_loop.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"4900af6aa3878e0c34cd34ee6b30826d2ac6cdab534802e1f01ff924db878e32"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::testing::temp_slots::slot_traffic (cognitive 84): perry_codegen::testing::temp_slots::slot_traffic has cognitive complexity 84 (threshold 15). Drivers by points: if/else 26 (78 pts), boolean chains 3, loops 2 (3 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/perry-codegen/src/testing/temp_slots.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"573851940d5ee9c1ce638466b5c59c0721b8773bea0b4cfb6511883c677928e4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::analysis::fn_infer::infer_module (cognitive 84): perry_hir::analysis::fn_infer::infer_module has cognitive complexity 84 (threshold 15). Drivers by points: if/else 23 (51 pts), loops 16 (23 pts), match/switch 6 (9 pts), boolean chains 1 (nesting depth added 38). 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/perry-hir/src/analysis/fn_infer.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"01925aab3b0cd5fe859697e8b84108be04e16320f9aa0f120351f018e76e6a04"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::instanceof::shape_ancestry::class_shape_reaches (cognitive 84): perry_runtime::object::instanceof::shape_ancestry::class_shape_reaches has cognitive complexity 84 (threshold 15). Drivers by points: if/else 35 (79 pts), boolean chains 4, loops 1 (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/perry-runtime/src/object/instanceof/shape_ancestry.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9de630dec2e8a741a6f3dbd55d805c621ae995d519389fe95d53d9b287bed2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::object_cache::compute_object_cache_key_with_env (cognitive 83): perry::commands::compile::object_cache::compute_object_cache_key_with_env has cognitive complexity 83 (threshold 15). Drivers by points: if/else 53 (67 pts), loops 9 (13 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 19). 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/perry/src/commands/compile/object_cache.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f8367a553e1f4c706e39db70ce97a3b228a52efae4b5c63da10978b039a909"}},{"ruleId":"D2","level":"warning","message":{"text":"Planner::expr (cognitive 83): Planner::expr has cognitive complexity 83 (threshold 15). Drivers by points: if/else 21 (61 pts), loops 3 (10 pts), boolean chains 6, match/switch 4 (6 pts) (nesting depth added 49). 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/perry-codegen/src/stmt/region_loop/plan.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4d2a0f89de1e9464d47ccb761ea8cfa67b537ee56ebbf3da0d462236fcf97b"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalEvalHoist::rewrite_list_inner (cognitive 83): GlobalEvalHoist::rewrite_list_inner has cognitive complexity 83 (threshold 15). Drivers by points: if/else 19 (57 pts), loops 5 (13 pts), match/switch 3 (10 pts), boolean chains 3 (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/global_eval_hoist.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43e8ac6f8828b6fc3f5a10a3ac5f938de02db288c8acd362ea3b48e46457d1f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::value::equality::js_jsvalue_loose_equals (cognitive 83): perry_runtime::value::equality::js_jsvalue_loose_equals has cognitive complexity 83 (threshold 15). Drivers by points: if/else 47 (72 pts), boolean chains 11 (nesting depth added 25). Of this number, 70 points are the body\u0027s own statements and 13 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/perry-runtime/src/value/equality.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b5291869b43318833a4c5a05a734a519672febd21215854fffcb73cf2fccf5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::layout::layout_stack (cognitive 83): perry_ui_windows::layout::layout_stack has cognitive complexity 83 (threshold 15). Drivers by points: if/else 36 (68 pts), boolean chains 6, loops 5 (6 pts), match/switch 2 (3 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-windows/src/layout.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d86dcda175c12b73899c94180314b0a676e660c8f2ab61ceb9079efc169f108"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime_abi_check.parse_codegen (cognitive 83): runtime_abi_check.parse_codegen has cognitive complexity 83 (threshold 15). Drivers by points: if/else 12 (35 pts), ternaries 9 (29 pts), loops 8 (15 pts), boolean chains 4 (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":"scripts/runtime_abi_check.py"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff1870e3728e9e8bbff876542ba5138f868e57ad81b93daa3c685fce8690c97"}},{"ruleId":"D2","level":"warning","message":{"text":"UseWalk::walk_stmt (cognitive 82): UseWalk::walk_stmt has cognitive complexity 82 (threshold 15). Drivers by points: if/else 25 (66 pts), match/switch 3 (8 pts), loops 2 (6 pts), boolean chains 2 (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/perry-codegen/src/collectors/ptr_shape.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0d292a20a01716eef8b4d3105a29a7c6ece1b16b04596e27ca4d9fdd2200d8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::mutation::any_top_level_expr (cognitive 82): perry_codegen::collectors::mutation::any_top_level_expr has cognitive complexity 82 (threshold 15). Drivers by points: if/else 22 (76 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/mutation.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cd53dc40606abef5e2963c2ecd9a835304c78cd54053a47817e02bd9aafe5c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_arkts::mutations::collect_mutations_in_expr (cognitive 82): perry_codegen_arkts::mutations::collect_mutations_in_expr has cognitive complexity 82 (threshold 15). Drivers by points: if/else 33 (58 pts), match/switch 11 (22 pts), loops 1 (2 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-arkts/src/mutations.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bebd3020240f3a4a864796d63afb462d94e0dab255d090ecea1d097ab44fce"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_gc_effects::archive::build_graph (cognitive 82): perry_gc_effects::archive::build_graph has cognitive complexity 82 (threshold 15). Drivers by points: if/else 15 (52 pts), loops 5 (13 pts), match/switch 3 (11 pts), boolean chains 6 (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-gc-effects/src/archive.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b75cf74a2df27c6e3d1c19a1183a3777346f5822b4c065f2f6fd163cbfa0b3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::monomorph::driver::collect_instantiations_in_expr (cognitive 82): perry_hir::monomorph::driver::collect_instantiations_in_expr has cognitive complexity 82 (threshold 15). Drivers by points: if/else 18 (50 pts), loops 14 (28 pts), match/switch 2 (4 pts) (nesting depth added 48). 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/perry-hir/src/monomorph/driver.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cedba4bbd25ace4629744a2051119396672f409d29f1cd37dd81cb479441e86"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::parent_static::js_class_static_method_call (cognitive 82): perry_runtime::object::class_registry::parent_static::js_class_static_method_call has cognitive complexity 82 (threshold 15). Drivers by points: if/else 39 (58 pts), boolean chains 11, loops 4 (8 pts), match/switch 3 (5 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/perry-runtime/src/object/class_registry/parent_static.rs"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca8ef7fd9fef1957d86206888e3332b40689fa2112956a6b71281546ccdb81e"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::stand_in_class (cognitive 82): Gen::stand_in_class has cognitive complexity 82 (threshold 15). Drivers by points: if/else 32 (54 pts), loops 12 (15 pts), boolean chains 7, match/switch 3 (6 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/perry-wpfacts/src/gen/class_values.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d55f64b294e30c0621ec26373bdd9466fe72122dfb622c0118bd03c7ffb9c15"}},{"ruleId":"D2","level":"warning","message":{"text":"FuncEmitCtx::try_emit_expr_native_method (cognitive 81): FuncEmitCtx::try_emit_expr_native_method has cognitive complexity 81 (threshold 15). Drivers by points: if/else 15 (39 pts), loops 6 (23 pts), match/switch 7 (19 pts) (nesting depth added 53). 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/perry-codegen-wasm/src/emit/expr/native_method.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9cf2e5174431baefdb928b24ded4a4fdd95d78f2da0cf744108f0c1a178232a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::static_receiver::static_receiver_class (cognitive 81): perry_hir::lower::expr_call::static_receiver::static_receiver_class has cognitive complexity 81 (threshold 15). Drivers by points: if/else 21 (49 pts), match/switch 8 (26 pts), boolean chains 5, loops 1 (nesting depth added 46). 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/perry-hir/src/lower/expr_call/static_receiver.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca98020c12b3f77503a1667b556780a8b62c68d482830818ee350d2a82fde927"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_parser::normalize_unicode_identifier_escapes_with_metadata (cognitive 81): perry_parser::normalize_unicode_identifier_escapes_with_metadata has cognitive complexity 81 (threshold 15). Drivers by points: if/else 28 (58 pts), boolean chains 10, loops 4 (9 pts), match/switch 3 (4 pts) (nesting depth added 36). Of this number, 65 points are the body\u0027s own statements and 16 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":"crates/perry-parser/src/lib.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5d1bbfd973385a6f96a346af6f36ab34246d796e4378c827ff5693ffac6e59"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::builtins::formatting::util_format::js_util_format (cognitive 81): perry_runtime::builtins::formatting::util_format::js_util_format has cognitive complexity 81 (threshold 15). Drivers by points: if/else 37 (71 pts), boolean chains 4, loops 3 (4 pts), match/switch 1 (2 pts) (nesting depth added 36). Of this number, 77 points are the body\u0027s own statements and 4 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":"crates/perry-runtime/src/builtins/formatting/util_format.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d325ca6cef00268e7cba66c65dfe4023eba71ae41633f3857705dcbef64030"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_call_method::collection_methods::dispatch_raw_pointer (cognitive 81): perry_runtime::object::native_call_method::collection_methods::dispatch_raw_pointer has cognitive complexity 81 (threshold 15). Drivers by points: if/else 22 (70 pts), loops 1 (6 pts), boolean chains 5 (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/perry-runtime/src/object/native_call_method/collection_methods.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f38e71589874d75de8f128ef6db2f8dcd757fe22fe2e0020b432daea55932a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_elements::collect_element_shape_facts (cognitive 80): perry_codegen::collectors::ptr_shape_elements::collect_element_shape_facts has cognitive complexity 80 (threshold 15). Drivers by points: if/else 23 (43 pts), loops 10 (14 pts), boolean chains 12, match/switch 4 (11 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/perry-codegen/src/collectors/ptr_shape_elements.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4b9eef0be151ff8e7a1b84f7e71ab0b7ee91332eeb66ffdb54422c5ebbe254"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::calls::crypto_hash::arm_crypto_hash_chain (cognitive 80): perry_codegen::expr::calls::crypto_hash::arm_crypto_hash_chain has cognitive complexity 80 (threshold 15). Drivers by points: if/else 38 (57 pts), boolean chains 13, match/switch 6 (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/perry-codegen/src/expr/calls/crypto_hash.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6dca04c1a3cf15fa88b67db5039b996e4e598b5fc76c517be4c3173ccf06fd3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_families::own_keys (cognitive 80): perry_codegen::layout_families::own_keys has cognitive complexity 80 (threshold 15). Drivers by points: if/else 27 (57 pts), boolean chains 13, loops 4 (6 pts), match/switch 2 (4 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/layout_families.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"180507d4f3722e6dd9614e7ebf991a608632ad71a306d5c00eae73f7226a6942"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_array_method::lower_array_method (cognitive 80): perry_codegen::lower_array_method::lower_array_method has cognitive complexity 80 (threshold 15). Drivers by points: if/else 44 (75 pts), match/switch 3 (5 pts) (nesting depth added 33). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_array_method.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b0aa3f1bd7633e2bd5b3eb3bea860e1066e6cc2d1045bd5a457338eedd68ae"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::loops::match_packed_f64_range_loop (cognitive 80): perry_codegen::stmt::loops::match_packed_f64_range_loop has cognitive complexity 80 (threshold 15). Drivers by points: if/else 32 (57 pts), boolean chains 16, match/switch 5 (6 pts), loops 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":1754}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6cd9d99d4f3fe50a5680dcd88a217c0f810e4680c7b23ea41e6dd6b8002c7c"}},{"ruleId":"D2","level":"warning","message":{"text":"WasmModuleEmitter::collect_strings (cognitive 80): WasmModuleEmitter::collect_strings has cognitive complexity 80 (threshold 15). Drivers by points: if/else 13 (40 pts), loops 19 (37 pts), match/switch 1 (3 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/emit/string_collection.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0878c6d9b89f7ebfb523ee48d9a5fd81e45138e418e90bb6b1cc71482c17941a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_wasm::emit::locals::resolve_export_to_func (cognitive 80): perry_codegen_wasm::emit::locals::resolve_export_to_func has cognitive complexity 80 (threshold 15). Drivers by points: if/else 19 (67 pts), loops 6 (11 pts), match/switch 1 (2 pts) (nesting depth added 54). 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/perry-codegen-wasm/src/emit/locals.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"446c5e093bf320b1be12bd2f7ca5ad8c2b3af5a519d8d75a41b8e9107d2e1082"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::push_pop::proxy_array_mutator (cognitive 80): perry_runtime::array::push_pop::proxy_array_mutator has cognitive complexity 80 (threshold 15). Drivers by points: if/else 26 (50 pts), loops 10 (25 pts), match/switch 2 (4 pts), boolean chains 1 (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/perry-runtime/src/array/push_pop.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d692f8e1b5bf037e6bdbe168c7af26100f9a56a4733873ca3545bf7f2d2334f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::replacer::js_json_stringify_full (cognitive 80): perry_runtime::json::replacer::js_json_stringify_full has cognitive complexity 80 (threshold 15). Drivers by points: if/else 43 (62 pts), boolean chains 12, match/switch 4 (6 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/perry-runtime/src/json/replacer.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d50366c74b4c8ab9fc274d821273f19ed1e1a9bc305d80d6eb9b7ade697547"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_assign::lower_assign (cognitive 79): perry_hir::lower::expr_assign::lower_assign has cognitive complexity 79 (threshold 15). Drivers by points: if/else 20 (69 pts), match/switch 2 (10 pts) (nesting depth added 57). 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/perry-hir/src/lower/expr_assign.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6c4fc81e87fe1cb06d4754b171e3f121f5597d3a4671e2344dec93fa71cd21"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::lower_expr::arm_optchain::lower_opt_chain_expr (cognitive 79): perry_hir::lower::lower_expr::arm_optchain::lower_opt_chain_expr has cognitive complexity 79 (threshold 15). Drivers by points: if/else 20 (40 pts), match/switch 13 (35 pts), boolean chains 4 (nesting depth added 42). 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/perry-hir/src/lower/lower_expr/arm_optchain.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f9f7bedbd8801d0eef5d479352fdacd02a11d8793e1456103d0616b7837628"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::oldgen::legacy_sweep_with_age_bump_and_old_reclaim_targets (cognitive 79): perry_runtime::gc::oldgen::legacy_sweep_with_age_bump_and_old_reclaim_targets has cognitive complexity 79 (threshold 15). Drivers by points: if/else 40 (68 pts), boolean chains 11 (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/perry-runtime/src/gc/oldgen.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc03171d79d3fd7b91ee00d3504671d5e366816b890553811ed359581031eb00"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::layout::measure_intrinsic (cognitive 79): perry_ui_windows::layout::measure_intrinsic has cognitive complexity 79 (threshold 15). Drivers by points: if/else 49 (78 pts), 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/perry-ui-windows/src/layout.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"7582e8c6280b8d4b995973ca96420d4102cbf7b59f2067cce1e4049c62e65f0b"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::solve (cognitive 79): Model::solve has cognitive complexity 79 (threshold 15). Drivers by points: if/else 25 (64 pts), boolean chains 10, loops 3 (5 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/perry-wpfacts/src/solve.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5958e28d2cc368ec552e2c21fd3cf6ecaa3e19cbd6d09a5d53d6f171db84f5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::monomorph::update_call_sites::update_call_sites_in_expr (cognitive 78): perry_hir::monomorph::update_call_sites::update_call_sites_in_expr has cognitive complexity 78 (threshold 15). Drivers by points: if/else 21 (44 pts), loops 15 (30 pts), match/switch 2 (4 pts) (nesting depth added 40). 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/perry-hir/src/monomorph/update_call_sites.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe2958e208e32a9fe2abd43b1ed7c2f44c3a2f008e3d749c0bd61a259f1cfd5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::map::find_key_index_cold (cognitive 78): perry_runtime::map::find_key_index_cold has cognitive complexity 78 (threshold 15). Drivers by points: if/else 24 (64 pts), loops 5 (13 pts), boolean chains 1 (nesting depth added 48). 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/perry-runtime/src/map.rs"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"b569a11a4b24c169340125d6b44dcd65e0c7d84be5ea1c7bf03a7e513188c9b2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::property_ops::set::own_set_descriptor (cognitive 78): perry_runtime::object::property_ops::set::own_set_descriptor has cognitive complexity 78 (threshold 15). Drivers by points: if/else 29 (63 pts), match/switch 3 (8 pts), boolean chains 7 (nesting depth added 39). 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/perry-runtime/src/object/property_ops/set.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"0108e39b59b37593e8949a6da0b761ab766aceb26d7797f3c4b7cc66611d30b1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::readline::pump::js_readline_process_pending (cognitive 78): perry_stdlib::readline::pump::js_readline_process_pending has cognitive complexity 78 (threshold 15). Drivers by points: if/else 28 (48 pts), loops 9 (22 pts), boolean chains 4, match/switch 2 (4 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/perry-stdlib/src/readline/pump.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c90d06761ddcdd1e5b47f383494bd2d6f0bad45e2ae967c930a974a2e4a4e83"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::worker_threads::channel_pump::js_worker_threads_channels_process_pending (cognitive 78): perry_stdlib::worker_threads::channel_pump::js_worker_threads_channels_process_pending has cognitive complexity 78 (threshold 15). Drivers by points: if/else 13 (38 pts), loops 11 (24 pts), boolean chains 12, match/switch 2 (4 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/worker_threads/channel_pump.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab6498d40edee5021e41cedb1e9f391d6e608a3a77c1a42483e7c5857c60649"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_runtime_root_holders.scan (cognitive 78): gc_runtime_root_holders.scan has cognitive complexity 78 (threshold 15). Drivers by points: loops 17 (37 pts), if/else 12 (33 pts), ternaries 2 (4 pts), boolean chains 2, error handling 1 (2 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":"scripts/gc_runtime_root_holders.py"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"3619d8a9b17cdac056461980269a343801261896b1be0b791da048ac6a324389"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::collect_modules::static_require_transform::transform_static_literal_requires_with_bunfs (cognitive 77): perry::commands::compile::collect_modules::static_require_transform::transform_static_literal_requires_with_bunfs has cognitive complexity 77 (threshold 15). Drivers by points: if/else 20 (62 pts), loops 6 (9 pts), boolean chains 6 (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/perry/src/commands/compile/collect_modules/static_require_transform.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"915e4b35fe06ad6c07fe14db75c37bea2d3f8f59e02cbc9b193c549af9f74f9e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::static_constfn::collect_literal_finals::block (cognitive 77): perry_codegen::codegen::static_constfn::collect_literal_finals::block has cognitive complexity 77 (threshold 15). Drivers by points: if/else 17 (53 pts), match/switch 4 (13 pts), loops 5 (9 pts), boolean chains 2 (nesting depth added 49). 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/perry-codegen/src/codegen/static_constfn.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f06921817e50a7a2992570ad3a8483e239c9349ce601c3dfef82f42007c881"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::debug_info::attach_line_tables (cognitive 77): perry_codegen::debug_info::attach_line_tables has cognitive complexity 77 (threshold 15). Drivers by points: if/else 23 (55 pts), boolean chains 8, loops 5 (7 pts), match/switch 3 (7 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/perry-codegen/src/debug_info.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed793cf5bf9a055d2ea6e620e6137ed41f3ea98d2f76350d1448a03933d49f6a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::loops::packed_f64_range_loop_dense_stmts_collect (cognitive 77): perry_codegen::stmt::loops::packed_f64_range_loop_dense_stmts_collect has cognitive complexity 77 (threshold 15). Drivers by points: if/else 19 (66 pts), boolean chains 8, match/switch 1 (2 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":2711}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0c01f843742a71a33859470aa59707bbf22af10475b84b78ffdcbcd03902ec"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::date_collator::format_components (cognitive 77): perry_runtime::intl::date_collator::format_components has cognitive complexity 77 (threshold 15). Drivers by points: if/else 36 (55 pts), match/switch 7 (14 pts), boolean chains 8 (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/perry-runtime/src/intl/date_collator.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"715d35d3585538219594de51cc2ee41ec399766118eee8e49573cf750029c967"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_desc::registration::register_bound (cognitive 77): perry_runtime::object::layout_desc::registration::register_bound has cognitive complexity 77 (threshold 15). Drivers by points: if/else 37 (50 pts), boolean chains 13, match/switch 5 (9 pts), loops 3 (5 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/perry-runtime/src/object/layout_desc/registration.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"845061edb79acf694fe00d279f776574d58b58c33ad8be36fce1891fddb13dbd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::url::parse::parse_url (cognitive 77): perry_runtime::url::parse::parse_url has cognitive complexity 77 (threshold 15). Drivers by points: if/else 39 (67 pts), boolean chains 8, 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/perry-runtime/src/url/parse.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecff81c103ac54807c8beb85a4b1be7c530a80f863cc9f8f9e1e3a30c57dfec3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::tls::event_pump::js_tls_process_pending (cognitive 77): perry_stdlib::tls::event_pump::js_tls_process_pending has cognitive complexity 77 (threshold 15). Drivers by points: if/else 11 (43 pts), loops 11 (32 pts), match/switch 1 (2 pts) (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/tls/event_pump.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"308727b7665d611d39339188e37ea5b0f72ce22e96322704a7d86649177917df"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::webcrypto::hmac::js_webcrypto_sign (cognitive 77): perry_stdlib::webcrypto::hmac::js_webcrypto_sign has cognitive complexity 77 (threshold 15). Drivers by points: if/else 24 (39 pts), match/switch 15 (30 pts), boolean chains 8 (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/perry-stdlib/src/webcrypto/hmac.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4363dd76af21602e73eccdcab66aa61a14685feda8c45dca468f39e1ddeca3"}},{"ruleId":"D2","level":"warning","message":{"text":"rust_dependency_inventory.main (cognitive 77): rust_dependency_inventory.main has cognitive complexity 77 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 15 (28 pts), boolean chains 11, ternaries 2 (5 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/rust_dependency_inventory.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"819c75693ca80979e1b9f49bb5d45a5e373c68d92e7aa24350a72c4476cabb1e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_call_method::common_methods::dispatch_function_proto_method (cognitive 76): perry_runtime::object::native_call_method::common_methods::dispatch_function_proto_method has cognitive complexity 76 (threshold 15). Drivers by points: if/else 32 (63 pts), boolean chains 12, match/switch 1 (nesting depth added 31). 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/perry-runtime/src/object/native_call_method/common_methods.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"647b7ba0689dbe36fd059f2a21c70f08764a743ca465eff2b137a1a5049ea5e5"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::unit_boundary (cognitive 76): Gen::unit_boundary has cognitive complexity 76 (threshold 15). Drivers by points: if/else 24 (47 pts), loops 11 (17 pts), match/switch 4 (9 pts), boolean chains 3 (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/perry-wpfacts/src/gen/export.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e63a8a1b943f5709880f8d2e55245e68a3e8ca25cd919930295a186a946049"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::decl_units::closed (cognitive 76): perry_wpfacts::decl_units::closed has cognitive complexity 76 (threshold 15). Drivers by points: if/else 20 (40 pts), loops 19 (22 pts), boolean chains 10, match/switch 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/perry-wpfacts/src/decl_units.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4bff3ceaf1253f41ecb031b2ec9583433c342e2ffab6ae32e1785ef344e7d64"}},{"ruleId":"D2","level":"warning","message":{"text":"check_docs.main (cognitive 76): check_docs.main has cognitive complexity 76 (threshold 15). Drivers by points: if/else 23 (54 pts), loops 11 (18 pts), boolean chains 4 (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":"scripts/check_docs.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16e084b272a18789d54c6aeab352f7c14962e8bc4d198aa54bcf1aa04fe3913"}},{"ruleId":"D2","level":"warning","message":{"text":"perf_frontier_report.collect_report (cognitive 76): perf_frontier_report.collect_report has cognitive complexity 76 (threshold 15). Drivers by points: ternaries 13 (33 pts), if/else 14 (31 pts), loops 6 (9 pts), boolean chains 3 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/perf_frontier_report.py"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"239ff890dcd53e02aa4e5305ec95a4cff05e1d78bf5447f10e151cc774df5b11"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::lower_stmt_inner (cognitive 75): perry_codegen::stmt::lower_stmt_inner has cognitive complexity 75 (threshold 15). Drivers by points: if/else 23 (48 pts), loops 9 (22 pts), boolean chains 4, match/switch 1 (nesting depth added 38). 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/perry-codegen/src/stmt/mod.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"407049069625a3b5f85ab71bc92ab60aca3d575d0394c9903ff683afe5d95a88"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::client_turnloop::native_client::run (cognitive 75): perry_ext_http::client_turnloop::native_client::run has cognitive complexity 75 (threshold 15). Drivers by points: if/else 21 (65 pts), match/switch 2 (6 pts), loops 2 (4 pts) (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/perry-ext-http/src/client_turnloop/native_client.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5a0e286aa47d4985c5c31613d07547be4868408d1fd30f8f5c20e87a437ba3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::closure::dynamic_props::closure_get_dynamic_prop_keyed (cognitive 75): perry_runtime::closure::dynamic_props::closure_get_dynamic_prop_keyed has cognitive complexity 75 (threshold 15). Drivers by points: if/else 33 (63 pts), boolean chains 11, loops 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/closure/dynamic_props.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35577a36c53ffa7f6a27db2550addbcb52290d6d7513037354e8e2a4e79027e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::ic_miss::get_field_miss (cognitive 75): perry_runtime::object::field_get_set::ic_miss::get_field_miss has cognitive complexity 75 (threshold 15). Drivers by points: if/else 28 (70 pts), boolean chains 5 (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/perry-runtime/src/object/field_get_set/ic_miss.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46b79cb8242119f36cac08f15ee1b3f7296b1a94258c5c8f2bdd88e541b6b66"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::regex::perex_replace_direct::replace (cognitive 75): perry_runtime::regex::perex_replace_direct::replace has cognitive complexity 75 (threshold 15). Drivers by points: if/else 31 (52 pts), loops 6 (16 pts), match/switch 1 (4 pts), boolean chains 3 (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/perry-runtime/src/regex/perex_replace_direct.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3448be4f773baadd1768b29c5c35b81b2141bef345a80cb5456a76b475003470"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::webcrypto::jwk::js_webcrypto_export_key (cognitive 75): perry_stdlib::webcrypto::jwk::js_webcrypto_export_key has cognitive complexity 75 (threshold 15). Drivers by points: if/else 27 (45 pts), match/switch 7 (18 pts), boolean chains 12 (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/perry-stdlib/src/webcrypto/jwk.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"942b4d106bbe9f9f405577b6e9e1a94553697e1fb379373e8663eac171ca88dd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::type_analysis::numeric::is_numeric_expr (cognitive 74): perry_codegen::type_analysis::numeric::is_numeric_expr has cognitive complexity 74 (threshold 15). Drivers by points: if/else 28 (59 pts), boolean chains 10, match/switch 2 (3 pts), loops 1 (2 pts) (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/perry-codegen/src/type_analysis/numeric.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"977c93cd4d0418087f49fabc2c717be5761f9f52c698e42610f8c37ac4f42c39"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::fn_decl::lower_fn_decl (cognitive 74): perry_hir::lower_decl::fn_decl::lower_fn_decl has cognitive complexity 74 (threshold 15). Drivers by points: if/else 32 (57 pts), boolean chains 7, loops 5, match/switch 3 (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/perry-hir/src/lower_decl/fn_decl.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"66123d0ac5ccd55295d0593bef7924407462c7fe663a2839d397bcc1ecaebaa7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::builtins::numbers::number_coerce_non_plain (cognitive 74): perry_runtime::builtins::numbers::number_coerce_non_plain has cognitive complexity 74 (threshold 15). Drivers by points: if/else 31 (63 pts), match/switch 3 (8 pts), boolean chains 3 (nesting depth added 37). 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/perry-runtime/src/builtins/numbers.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"06dce5ed5ee6aa2f57e84b23b2f8593346ad343e91c32a12060d7a683389e852"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::runtime_extern (cognitive 74): Gen::runtime_extern has cognitive complexity 74 (threshold 15). Drivers by points: if/else 28 (56 pts), loops 6 (12 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 36). 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/perry-wpfacts/src/gen_call.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"212145234fcbbe82fc8de2a832c23212dd8c887375c6fa8f7d6f34f655d315c4"}},{"ruleId":"D2","level":"warning","message":{"text":"check_gc_scanner_latches.mask_non_code (cognitive 74): check_gc_scanner_latches.mask_non_code has cognitive complexity 74 (threshold 15). Drivers by points: if/else 15 (42 pts), loops 8 (23 pts), ternaries 2 (6 pts), boolean chains 3 (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":"scripts/check_gc_scanner_latches.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ac85daf2908ad67034fcd8195591d71747b19e3d72592f6b28a3cb73b39277"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::i32_locals::collect_localset_ids_in_expr_filtered (cognitive 73): perry_codegen::collectors::i32_locals::collect_localset_ids_in_expr_filtered has cognitive complexity 73 (threshold 15). Drivers by points: if/else 16 (32 pts), loops 16 (32 pts), match/switch 4 (9 pts) (nesting depth added 37). 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/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"99908254faf855acda47259abe73b7aed0e677441c719a8fca7a9b6cd4553bfa"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::type_analysis::predicates::is_promise_expr (cognitive 73): perry_codegen::type_analysis::predicates::is_promise_expr has cognitive complexity 73 (threshold 15). Drivers by points: if/else 13 (47 pts), match/switch 6 (19 pts), loops 1 (4 pts), boolean chains 3 (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/perry-codegen/src/type_analysis/predicates.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e53b9c49317214182d9faf257ee898957f028955844b1e66229e18a5442f25f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::type_analysis::refine::refine_type_from_init (cognitive 73): perry_codegen::type_analysis::refine::refine_type_from_init has cognitive complexity 73 (threshold 15). Drivers by points: if/else 25 (55 pts), match/switch 4 (11 pts), boolean chains 7 (nesting depth added 37). 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/perry-codegen/src/type_analysis/refine.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"8575efb5d970b2fcc39635220078bd1e4d24adea0a7e3006041e95133b7cacef"}},{"ruleId":"D2","level":"warning","message":{"text":"DirectParser::parse_object_untyped (cognitive 73): DirectParser::parse_object_untyped has cognitive complexity 73 (threshold 15). Drivers by points: if/else 29 (51 pts), boolean chains 13, match/switch 3 (8 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/perry-runtime/src/json/parser.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"e069e3c9e9aa82a346e7f0dac8b07d24f5faa2f95379c906f3fabf51e3d2902b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wasm_host::instantiate_with_import_callbacks (cognitive 73): perry_wasm_host::instantiate_with_import_callbacks has cognitive complexity 73 (threshold 15). Drivers by points: if/else 16 (53 pts), loops 4 (12 pts), match/switch 2 (8 pts) (nesting depth added 51). 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/perry-wasm-host/src/lib.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ecf52ad561b02d34c8ee03bfb0ec82bea881d03b7bfb02d045709c7c69f4da5"}},{"ruleId":"D2","level":"warning","message":{"text":"component_http_guest_acceptance.main (cognitive 73): component_http_guest_acceptance.main has cognitive complexity 73 (threshold 15). Drivers by points: if/else 7 (28 pts), ternaries 6 (17 pts), loops 6 (14 pts), boolean chains 10, error handling 1 (4 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":"scripts/component_http_guest_acceptance.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ba78d077ad649d928ea94f361baae18017a5f7db81f599a0b7b06030282a44"}},{"ruleId":"D2","level":"warning","message":{"text":"wpfacts_corpus.check_one (cognitive 73): wpfacts_corpus.check_one has cognitive complexity 73 (threshold 15). Drivers by points: if/else 23 (54 pts), loops 4 (8 pts), ternaries 3 (6 pts), boolean chains 5 (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":"scripts/wpfacts_corpus.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7759b6a207982b47abfece8369c9517c7b76828600cbc8d41ef39d095c9502"}},{"ruleId":"D2","level":"warning","message":{"text":"index.main (cognitive 73): index.main has cognitive complexity 73 (threshold 15). Drivers by points: if/else 32 (42 pts), ternaries 18 (22 pts), boolean chains 9 (nesting depth added 14). 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":"upstream/actions/jdx/mr-boxington-action/src/index.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"518ee26d67df3f97cadbfeb9e92d30dc99dbcb9c72f5ec1ae1dbda713dc85434"}},{"ruleId":"D2","level":"warning","message":{"text":"UseWalk::walk_expr (cognitive 72): UseWalk::walk_expr has cognitive complexity 72 (threshold 15). Drivers by points: if/else 25 (65 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (nesting depth added 41). 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/perry-codegen/src/collectors/ptr_numarray.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c7af0f00533e04c23d5d1aeb7dd04a026168f716eca5fa0929f24c6efae6f3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::inprocess::native_homes::retain (cognitive 72): perry_codegen::inprocess::native_homes::retain has cognitive complexity 72 (threshold 15). Drivers by points: if/else 10 (42 pts), loops 7 (16 pts), match/switch 2 (8 pts), boolean chains 6 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/inprocess/native_homes.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b77df13ecfba94adc93e476671fa38179b413947501780d616c94687ac6b437"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::http2_server::pump::process_pending_h2_events (cognitive 72): perry_ext_http::server::http2_server::pump::process_pending_h2_events has cognitive complexity 72 (threshold 15). Drivers by points: if/else 11 (34 pts), loops 10 (30 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-http/src/server/http2_server/pump.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d148d2ea4bb74a7b6ab09e3cbe881b426c6088078597f8daadee38ed38ed1b3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::native_module::object_statics::try_object_statics (cognitive 72): perry_hir::lower::expr_call::native_module::object_statics::try_object_statics has cognitive complexity 72 (threshold 15). Drivers by points: if/else 9 (43 pts), match/switch 4 (21 pts), loops 1 (6 pts), boolean chains 2 (nesting depth added 56). 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/perry-hir/src/lower/expr_call/native_module/object_statics.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6984e42d3d54e13516e8cbf709e8c7720b535c4fce056e13fce9de6e9c61636"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::stringify::stringify_value_depth (cognitive 72): perry_runtime::json::stringify::stringify_value_depth has cognitive complexity 72 (threshold 15). Drivers by points: if/else 36 (69 pts), match/switch 1 (2 pts), boolean chains 1 (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/perry-runtime/src/json/stringify.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a94c626e7d91a24e839b413fca0982f6b729f6f5c74c704946f2769ab11d885"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime_manifest::realm_json::parse (cognitive 72): perry_runtime_manifest::realm_json::parse has cognitive complexity 72 (threshold 15). Drivers by points: if/else 23 (55 pts), loops 5 (10 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime-manifest/src/realm_json.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"2829c38e25dd01566f4ce88782c12bef9afb0b93e20c22929e42b89ef4b3ebdb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::units::driver::solves (cognitive 72): perry_wpfacts::units::driver::solves has cognitive complexity 72 (threshold 15). Drivers by points: if/else 10 (38 pts), loops 7 (17 pts), match/switch 4 (15 pts), boolean chains 2 (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/units/driver.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71ae5c5a9d54228ab9aaf68183ca47abc8e149f49e157bc349be431e44d6feb"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.check_func (cognitive 72): gc_root_dominance_check.check_func has cognitive complexity 72 (threshold 15). Drivers by points: if/else 18 (49 pts), loops 8 (13 pts), boolean chains 7, ternaries 1 (3 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":2294}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa2f3d9f75d7feb9115431e3b8e3801e08382954e730cbbe218d2b7beab26f0"}},{"ruleId":"D2","level":"warning","message":{"text":"package_bench_attr.run (cognitive 72): package_bench_attr.run has cognitive complexity 72 (threshold 15). Drivers by points: if/else 22 (43 pts), loops 7 (13 pts), boolean chains 11, ternaries 2 (5 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":"scripts/package_bench_attr.py"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"e659d571bdd99ff447ebc952c76fdbd7d4535b656da2d4cc6910125f8334de86"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::module_decl::namespace::lower_namespace_block (cognitive 71): perry_hir::lower::module_decl::namespace::lower_namespace_block has cognitive complexity 71 (threshold 15). Drivers by points: if/else 18 (49 pts), match/switch 7 (12 pts), loops 6 (8 pts), boolean chains 2 (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/perry-hir/src/lower/module_decl/namespace.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"32abcee1890f0639016b71ca21bd15d7767138f7c6cdd02aa1b491ea64ffc858"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::number_format::number_parts_core (cognitive 71): perry_runtime::intl::number_format::number_parts_core has cognitive complexity 71 (threshold 15). Drivers by points: if/else 34 (58 pts), loops 4 (8 pts), boolean chains 4, match/switch 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/perry-runtime/src/intl/number_format.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18bb904a5797c6241501473cbe993176cefbc14415e2fe0a38ad46b03f3d19c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_probe::derive_word::derive_word (cognitive 71): perry_runtime::object::layout_probe::derive_word::derive_word has cognitive complexity 71 (threshold 15). Drivers by points: if/else 28 (44 pts), match/switch 5 (11 pts), loops 7 (9 pts), boolean chains 7 (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/perry-runtime/src/object/layout_probe/derive_word.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffdf524fc6180d8c7ddeef5478c27ea0a1c16ec2e39f12b9a6242340a34c7c08"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::webcrypto::wrap::js_webcrypto_unwrap_key (cognitive 71): perry_stdlib::webcrypto::wrap::js_webcrypto_unwrap_key has cognitive complexity 71 (threshold 15). Drivers by points: if/else 23 (35 pts), match/switch 20 (34 pts), boolean chains 2 (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/perry-stdlib/src/webcrypto/wrap.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e1122cb1215dabfd4cd055d5f0f0735cb542e427f0c2827020b677dbe48ea5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_android::widgets::canvas::repaint (cognitive 71): perry_ui_android::widgets::canvas::repaint has cognitive complexity 71 (threshold 15). Drivers by points: if/else 17 (51 pts), loops 3 (14 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 48). 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/perry-ui-android/src/widgets/canvas.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"15df0034dd9de0d88583bf5459ce2297122c3bccc4e6c38f2595c2a88ac9aa3e"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner::summary (cognitive 70): Scanner::summary has cognitive complexity 70 (threshold 15). Drivers by points: if/else 16 (45 pts), match/switch 3 (12 pts), loops 3 (11 pts), boolean chains 2 (nesting depth added 46). 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/perry/src/commands/compile/collect_modules/reexport_prune/scan.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40c109adece36a7d0f2a1b0685f46b19c59ad45424a3159169594de19f217de"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::resolve::resolve_with_extensions (cognitive 70): perry::commands::compile::resolve::resolve_with_extensions has cognitive complexity 70 (threshold 15). Drivers by points: if/else 18 (49 pts), loops 5 (14 pts), boolean chains 7 (nesting depth added 40). 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/perry/src/commands/compile/resolve.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f34d86b4e3ed6fa61164ad027f628beae789c0e7e862115a7b7eec39e77964"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::native_value::verify::verify_native_rep_records (cognitive 70): perry_codegen::native_value::verify::verify_native_rep_records has cognitive complexity 70 (threshold 15). Drivers by points: if/else 25 (43 pts), boolean chains 20, match/switch 2 (6 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/perry-codegen/src/native_value/verify.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2d772e39951decf287ea3bd361b835dc6f0fdcff4274b3a9d1cffc01f069da"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_net::classes::parse_rule_string (cognitive 70): perry_ext_net::classes::parse_rule_string has cognitive complexity 70 (threshold 15). Drivers by points: if/else 17 (56 pts), match/switch 2 (8 pts), loops 3 (6 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/perry-ext-net/src/classes.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3fb406d59fac7be200dd06f7b5012a0c9d36d4dc93670e2ea56bf36c7888ef"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::js_transform::local_natives::fix_class_field_expr (cognitive 70): perry_hir::js_transform::local_natives::fix_class_field_expr has cognitive complexity 70 (threshold 15). Drivers by points: if/else 13 (41 pts), loops 7 (18 pts), match/switch 5 (11 pts) (nesting depth added 45). Of this number, 69 points are the body\u0027s own statements and 1 belongs 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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb4cb787cf07520bde6b00de91acfeb16702e591f1da7f27c8789b87f1eb282"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::has_property::ordinary_has_property (cognitive 70): perry_runtime::object::field_get_set::has_property::ordinary_has_property has cognitive complexity 70 (threshold 15). Drivers by points: if/else 23 (60 pts), boolean chains 7, match/switch 1 (2 pts), loops 1 (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/perry-runtime/src/object/field_get_set/has_property.rs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"6937126c313a70ab1ab24e0a95453109c363edf15de8a1f888e7c8e2c58b371c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::object_ops::define_properties::js_object_set_prototype_of (cognitive 70): perry_runtime::object::object_ops::define_properties::js_object_set_prototype_of has cognitive complexity 70 (threshold 15). Drivers by points: if/else 32 (55 pts), boolean chains 13, loops 1 (2 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/perry-runtime/src/object/object_ops/define_properties.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8dcca898f303da800cab03b944437e0942ce8daceb5a6fe982e2ab69d34818d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::property_ops::set_interceptor::set_interceptor (cognitive 70): perry_runtime::object::property_ops::set_interceptor::set_interceptor has cognitive complexity 70 (threshold 15). Drivers by points: if/else 17 (52 pts), match/switch 3 (13 pts), boolean chains 4, loops 1 (nesting depth added 45). 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/perry-runtime/src/object/property_ops/set_interceptor.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33fff69df1b51612b3d49db5ee5de3a7051beccc2295a8882f1c9a6d45a43a3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::value::dyn_index::js_dyn_index_set_strict (cognitive 70): perry_runtime::value::dyn_index::js_dyn_index_set_strict has cognitive complexity 70 (threshold 15). Drivers by points: if/else 43 (62 pts), boolean chains 8 (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/perry-runtime/src/value/dyn_index.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce5c84a6a4dc43cc5e7b91f20b0e5ac12fa2549abdc97dbe39b721ad9cf3402"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_android::widgets::image::create_file (cognitive 70): perry_ui_android::widgets::image::create_file has cognitive complexity 70 (threshold 15). Drivers by points: if/else 15 (70 pts) (nesting depth added 55). 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/perry-ui-android/src/widgets/image.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d68bff61c02433dbdf625a94488109ce63f2b7e2729f4cb33bff8221e34c71b"}},{"ruleId":"D2","level":"warning","message":{"text":"HoneEditorView.onCreateInputConnection (cognitive 70): HoneEditorView.onCreateInputConnection has cognitive complexity 70 (threshold 15). Drivers by points: if/else 35 (62 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 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":"android-build/app/src/main/java/com/perry/app/HoneEditorView.kt"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e9237133e410998bf71eacd58db0ae6a5bf9672569fa412c78881c90391f59"}},{"ruleId":"D2","level":"warning","message":{"text":"repsel_knob_isolation._verdict (cognitive 70): repsel_knob_isolation._verdict has cognitive complexity 70 (threshold 15). Drivers by points: if/else 16 (42 pts), loops 12 (23 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":"scripts/compiler_output_harness/repsel_knob_isolation.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"813ad09341e9562f6ce107f80aa2e4316a4b14d7158c7ba7c5c5d1a49f2029f0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::i18n::cldr_plural_category (cognitive 69): perry_runtime::i18n::cldr_plural_category has cognitive complexity 69 (threshold 15). Drivers by points: if/else 36 (55 pts), boolean chains 11, 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/perry-runtime/src/i18n.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa1248253e62ac7eca8105397f8a7bf260417de367dbfa90e9f7293f2a35481"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_api_host::properties::napi_get_all_property_names (cognitive 69): perry_runtime::node_api_host::properties::napi_get_all_property_names has cognitive complexity 69 (threshold 15). Drivers by points: if/else 16 (32 pts), match/switch 12 (30 pts), boolean chains 4, 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/perry-runtime/src/node_api_host/properties.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65de0928c5c9cc5e9b0258729720362442250deb69b181265b88c26944fb6e4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::units::published_surface (cognitive 69): perry_wpfacts::units::published_surface has cognitive complexity 69 (threshold 15). Drivers by points: if/else 11 (36 pts), loops 9 (15 pts), match/switch 4 (13 pts), boolean chains 5 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/units.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca5a94ea6a72cf506dc2a415a5cf66ac3962fc791baeb6f8dd9de5ce36d94b3"}},{"ruleId":"D2","level":"warning","message":{"text":"component_http_p3_acceptance.main (cognitive 69): component_http_p3_acceptance.main has cognitive complexity 69 (threshold 15). Drivers by points: ternaries 8 (24 pts), if/else 6 (21 pts), loops 10 (15 pts), boolean chains 6, error handling 1 (3 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":"scripts/component_http_p3_acceptance.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"9821e472ec0584eb1591c9007baaa3953acb7e4617097fe878b1ec0732934062"}},{"ruleId":"D2","level":"warning","message":{"text":"delete_retired_workflow_runs.main (cognitive 69): delete_retired_workflow_runs.main has cognitive complexity 69 (threshold 15). Drivers by points: if/else 21 (49 pts), boolean chains 13, loops 4 (7 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/delete_retired_workflow_runs.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5f9b058b145eda26d14a50078efdab72f466c5cff2b6dab079a8ea1c8bf039"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::function::precise_roots::remat::plan (cognitive 68): perry_codegen::function::precise_roots::remat::plan has cognitive complexity 68 (threshold 15). Drivers by points: if/else 23 (53 pts), loops 4 (6 pts), boolean chains 5, match/switch 1 (4 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/perry-codegen/src/function/precise_roots/remat.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1020626e2e2ee446ca0a6aa7ea1023c7da38c644132c17ffc060ab35abb7cba"}},{"ruleId":"D2","level":"warning","message":{"text":"WasmModuleEmitter::emit_js_expr (cognitive 68): WasmModuleEmitter::emit_js_expr has cognitive complexity 68 (threshold 15). Drivers by points: if/else 22 (40 pts), match/switch 11 (23 pts), loops 2 (5 pts) (nesting depth added 33). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/emit/js_fallback.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"058c2368496fe9cc5c7e8fa76506b8b51a23211833c2dadc8f97d48b5273e2cd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_wasm::emit::locals::resolve_export_to_let (cognitive 68): perry_codegen_wasm::emit::locals::resolve_export_to_let has cognitive complexity 68 (threshold 15). Drivers by points: if/else 15 (57 pts), loops 4 (9 pts), match/switch 1 (2 pts) (nesting depth added 48). 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/perry-codegen-wasm/src/emit/locals.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"26167c77b0f4f19654fd4046a06a845378056481d1ac915859af524c2efc998c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::intrinsics::namespace_static::try_namespace_static_method_apply_call_bind (cognitive 68): perry_hir::lower::expr_call::intrinsics::namespace_static::try_namespace_static_method_apply_call_bind has cognitive complexity 68 (threshold 15). Drivers by points: if/else 17 (64 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 49). 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/perry-hir/src/lower/expr_call/intrinsics/namespace_static.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a770fb6e07c2f07fe0173a714fe169e3a37ab9a2fa2f0ff2f475ac41dc7832b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::widget_decl::parse_gauge_node (cognitive 68): perry_hir::lower::widget_decl::parse_gauge_node has cognitive complexity 68 (threshold 15). Drivers by points: if/else 13 (44 pts), match/switch 6 (21 pts), loops 1 (3 pts) (nesting depth added 48). 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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3515c4241500f357f48c4fc3abc643c545f41e91bcab8640982507f287df154"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::widget_decl::try_parse_family_switch (cognitive 68): perry_hir::lower::widget_decl::try_parse_family_switch has cognitive complexity 68 (threshold 15). Drivers by points: if/else 12 (56 pts), loops 2 (6 pts), match/switch 2 (6 pts) (nesting depth added 52). 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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f225a177c15d4bd463126849185d21519c90b3698d2e96545cd463afe0d2c3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_types::extract::extract_ts_type_with_ctx (cognitive 68): perry_hir::lower_types::extract::extract_ts_type_with_ctx has cognitive complexity 68 (threshold 15). Drivers by points: if/else 16 (46 pts), match/switch 9 (19 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 41). 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/perry-hir/src/lower_types/extract.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0674b20d5c234fea2926c8cf51a12064f234639f19ffa2295360ce9b658e27cb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::replacer::stringify_value_pretty (cognitive 68): perry_runtime::json::replacer::stringify_value_pretty has cognitive complexity 68 (threshold 15). Drivers by points: if/else 34 (63 pts), boolean chains 5 (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/perry-runtime/src/json/replacer.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"06753b59979182980b97f9e1cc6d09c2f623baff58feb18d8b302aadcea1bfac"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::fetch::request_copy::js_request_new_from_input (cognitive 68): perry_stdlib::fetch::request_copy::js_request_new_from_input has cognitive complexity 68 (threshold 15). Drivers by points: if/else 36 (57 pts), boolean chains 7, match/switch 1 (3 pts), loops 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/perry-stdlib/src/fetch/request_copy.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e7bcc6615def80bf03663b7fe11a24dc2d04c81ec3bdc666475ed213cc7473"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::link_exports (cognitive 68): Gen::link_exports has cognitive complexity 68 (threshold 15). Drivers by points: if/else 10 (34 pts), loops 12 (21 pts), match/switch 5 (12 pts), boolean chains 1 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/gen/export.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d28d950902f198e3c0ff2ffe5f183a7bf398d3cad278dd2b29211bc929ec9a1"}},{"ruleId":"D2","level":"warning","message":{"text":"verification.verify_artifacts (cognitive 68): verification.verify_artifacts has cognitive complexity 68 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 22, loops 11 (13 pts), ternaries 4 (5 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":"scripts/compiler_output_harness/verification.py"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e726875b556aee8297c204ffafacc1626f7053c5f71a3790cc04132ab0085b"}},{"ruleId":"D2","level":"warning","message":{"text":"perf_frontier_report.summarize_gc_trace (cognitive 68): perf_frontier_report.summarize_gc_trace has cognitive complexity 68 (threshold 15). Drivers by points: if/else 7 (27 pts), ternaries 11 (27 pts), loops 5 (13 pts), boolean chains 1 (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":"scripts/perf_frontier_report.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce460839f73179e69c63f1ad50d7665bbdbf52a73048fb5d34fb9674e67c7734"}},{"ruleId":"D2","level":"warning","message":{"text":"registry_lifetime_check.scan_with_sites (cognitive 68): registry_lifetime_check.scan_with_sites has cognitive complexity 68 (threshold 15). Drivers by points: if/else 12 (35 pts), loops 13 (20 pts), ternaries 3 (9 pts), boolean chains 4 (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":"scripts/registry_lifetime_check.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32cbe02e7669f2f8c780336640e94ae9168f03f0ab126ca12f82e485f4b2beb"}},{"ruleId":"D2","level":"warning","message":{"text":"tokens.parseTokens (cognitive 68): tokens.parseTokens has cognitive complexity 68 (threshold 15). Drivers by points: if/else 15 (41 pts), loops 7 (21 pts), boolean chains 6 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/perry-styling/src/tokens.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c37d9087ecc26a5f4609f8c716705df55da69e2043099a9367897cdb1f6199"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::run::android::build_and_run_android_impl (cognitive 67): perry::commands::run::android::build_and_run_android_impl has cognitive complexity 67 (threshold 15). Drivers by points: if/else 33 (57 pts), match/switch 3 (6 pts), loops 2 (3 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/perry/src/commands/run/android.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bee3f07f8d62bee898b997139e18146bfc1a21b5d1f8e3c9300431d1a415f28"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::class_declarations::class_declaration_globals (cognitive 67): perry_codegen::codegen::class_declarations::class_declaration_globals has cognitive complexity 67 (threshold 15). Drivers by points: if/else 25 (49 pts), loops 5 (9 pts), boolean chains 6, match/switch 1 (3 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/perry-codegen/src/codegen/class_declarations.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"730bffcdc52b5d2341b1296ed20b0057c5efdcf929416b7f0435d8c27eb09e86"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::anon_key_adds::anon_receiver_added_keys (cognitive 67): perry_codegen::collectors::anon_key_adds::anon_receiver_added_keys has cognitive complexity 67 (threshold 15). Drivers by points: if/else 18 (43 pts), loops 9 (17 pts), match/switch 4 (5 pts), boolean chains 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/perry-codegen/src/collectors/anon_key_adds.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40022721a3ae0316a2ffb8aba8b2464c79c82d1e28e7e851ce00284fceaf985"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::channel::try_match_channel_reduction (cognitive 67): perry_codegen::expr::channel::try_match_channel_reduction has cognitive complexity 67 (threshold 15). Drivers by points: if/else 12 (35 pts), match/switch 8 (27 pts), loops 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/perry-codegen/src/expr/channel.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07e08593637d6dbdb3952c02e3cc9f6052baaf5c902e868d88e32dff478291e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_desc::emit_module_layouts (cognitive 67): perry_codegen::layout_desc::emit_module_layouts has cognitive complexity 67 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 17 (26 pts), match/switch 5 (12 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/perry-codegen/src/layout_desc.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"55699078422029bf43fd17d60eff7674ab8a45c85118f3aa137dbdaa379c7d5a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_families::late::add_variants (cognitive 67): perry_codegen::layout_families::late::add_variants has cognitive complexity 67 (threshold 15). Drivers by points: if/else 13 (35 pts), loops 9 (23 pts), boolean chains 6, match/switch 1 (3 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/perry-codegen/src/layout_families/late.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"8709b215c67876a48c49faca1bf25dc89c281e09e64f567648e962e52bb528a4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::masked_window_region::try_match_masked_window_region (cognitive 67): perry_codegen::stmt::masked_window_region::try_match_masked_window_region has cognitive complexity 67 (threshold 15). Drivers by points: if/else 24 (46 pts), boolean chains 12, loops 5, match/switch 2 (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/perry-codegen/src/stmt/masked_window_region.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"79bf44f26242ec71908a39dad446d33e9173fe491b7d0d84c380b40ca2ba2f26"}},{"ruleId":"D2","level":"warning","message":{"text":"Header::read (cognitive 67): Header::read has cognitive complexity 67 (threshold 15). Drivers by points: if/else 14 (47 pts), loops 6 (16 pts), boolean chains 2, match/switch 1 (2 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/perry-ext-zlib/src/stream/driver.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e254c4534d168919486600efefc4c986d202297fc8f5833669637de1b93fb3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_gc_effects::instructions::analyze_node (cognitive 67): perry_gc_effects::instructions::analyze_node has cognitive complexity 67 (threshold 15). Drivers by points: if/else 20 (49 pts), boolean chains 9, loops 3 (9 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/perry-gc-effects/src/instructions.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a53dabf4c2b7f1699c4ced4ae30323a122ffdd3e6576647dc76c610bb921ad6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::destructuring::assignment_expr::lower_destructuring_assignment (cognitive 67): perry_hir::destructuring::assignment_expr::lower_destructuring_assignment has cognitive complexity 67 (threshold 15). Drivers by points: match/switch 8 (31 pts), if/else 9 (26 pts), loops 3 (10 pts) (nesting depth added 47). 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/perry-hir/src/destructuring/assignment_expr.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a3760fba1c24424626b01435eb273ed42898899796323e2e7990fa19b15906"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_call_method::object_proto::js_object_is_prototype_of_value (cognitive 67): perry_runtime::object::native_call_method::object_proto::js_object_is_prototype_of_value has cognitive complexity 67 (threshold 15). Drivers by points: if/else 19 (45 pts), match/switch 4 (9 pts), boolean chains 7, loops 3 (6 pts) (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/perry-runtime/src/object/native_call_method/object_proto.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3f94ab938b7c36f28d7ae5c9a533337382183c9129cc2837701aa8f1e44a27"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::symbol::properties::set_symbol_property (cognitive 67): perry_runtime::symbol::properties::set_symbol_property has cognitive complexity 67 (threshold 15). Drivers by points: if/else 24 (62 pts), boolean chains 5 (nesting depth added 38). 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/perry-runtime/src/symbol/properties.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6b0555bc23f747149a68d19d3ff67e3f2147e701597b3c4d1562aa8c189c79"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::webcrypto::wrap::js_webcrypto_wrap_key (cognitive 67): perry_stdlib::webcrypto::wrap::js_webcrypto_wrap_key has cognitive complexity 67 (threshold 15). Drivers by points: if/else 23 (35 pts), match/switch 17 (30 pts), boolean chains 2 (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/perry-stdlib/src/webcrypto/wrap.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1646adb8584bdbd619e69af49402c7aa34ec2fa8a68c88f99f815ef685c93ac"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_gtk4::widgets::canvas::create (cognitive 67): perry_ui_gtk4::widgets::canvas::create has cognitive complexity 67 (threshold 15). Drivers by points: if/else 17 (50 pts), loops 3 (12 pts), match/switch 1 (3 pts), boolean chains 2 (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/perry-ui-gtk4/src/widgets/canvas.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b283d7e4643e470e200f0a102ad5cd35dde67f4cddde331351100b9595306c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::app::wnd_proc (cognitive 67): perry_ui_windows::app::wnd_proc has cognitive complexity 67 (threshold 15). Drivers by points: if/else 26 (61 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 36). 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/perry-ui-windows/src/app.rs"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"f036ae94e1b80d46a847c848eddc31aaa0cfa7226ef8ecba424510d4dc01834b"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::contract_check (cognitive 67): Gen::contract_check has cognitive complexity 67 (threshold 15). Drivers by points: if/else 20 (45 pts), loops 13 (15 pts), match/switch 3 (7 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/gen/export.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bc4dfe6559f4f40a4b782be5187bea8a44d7987f96a4dc4467cb06b12b4bde"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::escape (cognitive 67): Model::escape has cognitive complexity 67 (threshold 15). Drivers by points: if/else 27 (55 pts), boolean chains 11, loops 1 (nesting depth added 28). 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/perry-wpfacts/src/solve/call_and_construct.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a648be38daba95d10abd3ccc14bf15d4e97b4c9bd86566eef70a74f8a36f63"}},{"ruleId":"D2","level":"warning","message":{"text":"generator.generateTheme (cognitive 67): generator.generateTheme has cognitive complexity 67 (threshold 15). Drivers by points: if/else 19 (35 pts), loops 11 (22 pts), ternaries 3 (10 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/perry-styling/src/generator.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"29606add15d0d901bdc1d74c79e072f1f3822dcd14f79b0f050c72c5fa61d723"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::loops::expr_preserves_array_length (cognitive 66): perry_codegen::stmt::loops::expr_preserves_array_length has cognitive complexity 66 (threshold 15). Drivers by points: if/else 11 (39 pts), boolean chains 24, match/switch 2 (3 pts) (nesting depth added 29). 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":9570}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad01457b981118ddcff615aa892248568811e199ccb104bce3547d115c4fd87"}},{"ruleId":"D2","level":"warning","message":{"text":"JsEmitter::emit_stmt (cognitive 66): JsEmitter::emit_stmt has cognitive complexity 66 (threshold 15). Drivers by points: if/else 19 (38 pts), loops 10 (24 pts), match/switch 2 (4 pts) (nesting depth added 35). 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/perry-codegen-js/src/emit/stmts.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a9d49c952eb2bfb5ab480894b2587bc2c3d3109aa1b5494138a2c8a6bd55a3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_net::payload_io::sink (cognitive 66): perry_ext_net::payload_io::sink has cognitive complexity 66 (threshold 15). Drivers by points: if/else 30 (54 pts), boolean chains 9, match/switch 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/perry-ext-net/src/payload_io.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f0333edd49b25137a321ba80cf8adcccac8f04defd229ed44c542190d92345"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_stream::native_hooks::run_native_steps (cognitive 66): perry_runtime::node_stream::native_hooks::run_native_steps has cognitive complexity 66 (threshold 15). Drivers by points: if/else 31 (58 pts), boolean chains 7, 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/perry-runtime/src/node_stream/native_hooks.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2bfb6503f74a726cab7744f92198d66570bb88b7c41686cb142f5298ceafcc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::derive::judge (cognitive 66): perry_wpfacts::derive::judge has cognitive complexity 66 (threshold 15). Drivers by points: if/else 21 (40 pts), match/switch 7 (17 pts), boolean chains 8, loops 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/perry-wpfacts/src/derive.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cfa06fa29a914dde63a30c07c86ec0ed463c86b750672d12de5f560e32c09c"}},{"ruleId":"D2","level":"warning","message":{"text":"check_gate_freshness.newest_post_merge_result (cognitive 66): check_gate_freshness.newest_post_merge_result has cognitive complexity 66 (threshold 15). Drivers by points: if/else 17 (53 pts), loops 3 (6 pts), boolean chains 5, error handling 2 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check_gate_freshness.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b36bbd64fe48a92fb179bb530e8bebf52f9ab79bee8a68c5c1a1750b0e795e2"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_runtime_root_holders.self_test (cognitive 66): gc_runtime_root_holders.self_test has cognitive complexity 66 (threshold 15). Drivers by points: if/else 34 (45 pts), boolean chains 14, loops 4 (6 pts), ternaries 1 (nesting depth added 13). 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":"scripts/gc_runtime_root_holders.py"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24ceb2ab331b2d7a968d1b40c9eabecf2a4c4f175a99c608f2aebccee34bd0c"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_store_site_inventory.strip_rust_comments (cognitive 66): gc_store_site_inventory.strip_rust_comments has cognitive complexity 66 (threshold 15). Drivers by points: if/else 10 (37 pts), ternaries 4 (17 pts), loops 3 (7 pts), boolean chains 5 (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":"scripts/gc_store_site_inventory.py"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58c49ab90ad99b91a3526311c04a567a1842d1af28370645d1c7f255e205070"}},{"ruleId":"D2","level":"warning","message":{"text":"server_ab.idle_client (cognitive 66): server_ab.idle_client has cognitive complexity 66 (threshold 15). Drivers by points: if/else 9 (34 pts), error handling 4 (15 pts), loops 8 (15 pts), boolean chains 2 (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":"scripts/turnloop/server_ab.py"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"949614cebff96f772afcfcc8bf70d8e913900868c5698e0bac275243fdc7a952"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::hoist_classes::rewrite_module_exports_class_expression (cognitive 65): perry::commands::compile::cjs_wrap::hoist_classes::rewrite_module_exports_class_expression has cognitive complexity 65 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 18, loops 10 (18 pts), 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/perry/src/commands/compile/cjs_wrap/hoist_classes.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"250607333ea783c0a8beac300d61cd457663f3ee3df4abde2754bfe7da67afe2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::hoist_classes::collect_pattern_binding_names (cognitive 65): perry::commands::compile::cjs_wrap::hoist_classes::collect_pattern_binding_names has cognitive complexity 65 (threshold 15). Drivers by points: if/else 7 (23 pts), loops 7 (21 pts), boolean chains 15, match/switch 2 (6 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/cjs_wrap/hoist_classes.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"1548af46220b1f35bb79b46aa05ce28e541ff12729a6781e5fb8e5b648df4de2"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFactCollector::collect_expr (cognitive 65): ArrayFactCollector::collect_expr has cognitive complexity 65 (threshold 15). Drivers by points: if/else 18 (34 pts), loops 11 (22 pts), match/switch 4 (8 pts), boolean chains 1 (nesting depth added 31). 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/perry-codegen/src/collectors/hir_facts.rs"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a96c0a1ff93d699d51a92dd8f9f63744c7abf9720162533866ee2925a2822b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::region_loop::plan::plan_once (cognitive 65): perry_codegen::stmt::region_loop::plan::plan_once has cognitive complexity 65 (threshold 15). Drivers by points: if/else 25 (45 pts), boolean chains 10, loops 6 (7 pts), match/switch 2 (3 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/perry-codegen/src/stmt/region_loop/plan.rs"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"933da55e1f64992d344ef08c24f6d0e04978f870692674cfa941b03f643addb5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::js_transform::cross_module_natives::scan_for_ident_init_propagation (cognitive 65): perry_hir::js_transform::cross_module_natives::scan_for_ident_init_propagation has cognitive complexity 65 (threshold 15). Drivers by points: if/else 14 (44 pts), loops 8 (20 pts), match/switch 1 (nesting depth added 42). 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/perry-hir/src/js_transform/cross_module_natives.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"821c23c6cdb883ac10960873e862b72a03ed5c40735a493951873a6fb220cff2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::roots::stack_maps_unwind_windows::visit (cognitive 65): perry_runtime::gc::roots::stack_maps_unwind_windows::visit has cognitive complexity 65 (threshold 15). Drivers by points: if/else 16 (51 pts), loops 4 (12 pts), boolean chains 2 (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/perry-runtime/src/gc/roots/stack_maps_unwind_windows.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d9a3dc7f4caa630fd1346afe826fc4b83c295259485e5c7b3e1d158b0c5f93"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::duration_format::parse_iso_duration (cognitive 65): perry_runtime::intl::duration_format::parse_iso_duration has cognitive complexity 65 (threshold 15). Drivers by points: if/else 15 (39 pts), loops 5 (12 pts), boolean chains 7, match/switch 3 (7 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/perry-runtime/src/intl/duration_format.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a67ef6b33cfc2a6fd552f5cb9698808390afb659e1ad648d37cb91d39d93432"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::enumeration::for_in_keys_with (cognitive 65): perry_runtime::object::field_get_set::enumeration::for_in_keys_with has cognitive complexity 65 (threshold 15). Drivers by points: if/else 20 (48 pts), loops 4 (9 pts), boolean chains 4, match/switch 1 (4 pts) (nesting depth added 36). 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/perry-runtime/src/object/field_get_set/enumeration.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d511b109ec244022ce0eaa7cddb9c3d42267a4e9727aa612988aebec0637e5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime_manifest::realm_source::tokens (cognitive 65): perry_runtime_manifest::realm_source::tokens has cognitive complexity 65 (threshold 15). Drivers by points: if/else 23 (46 pts), loops 5 (12 pts), boolean chains 7 (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/perry-runtime-manifest/src/realm_source.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a152694b473ce3d103ff193a5d8598acd97de4cc5735d2a16390ab532c8babbb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_android::widgets::add_child (cognitive 65): perry_ui_android::widgets::add_child has cognitive complexity 65 (threshold 15). Drivers by points: if/else 15 (64 pts), boolean chains 1 (nesting depth added 49). 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/perry-ui-android/src/widgets/mod.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf309ed6a9d3d3c4a8a9b4fdf670e6b18a358d269d58ed196f50f8db3ae1837"}},{"ruleId":"D2","level":"warning","message":{"text":"copied_minor_fallback_report.run_target_collector_gates (cognitive 65): copied_minor_fallback_report.run_target_collector_gates has cognitive complexity 65 (threshold 15). Drivers by points: if/else 26 (58 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/copied_minor_fallback_report.py"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a270885cd4923d3ac66859bbb06b2d45663b6851523211a95fb521de95e325"}},{"ruleId":"D2","level":"warning","message":{"text":"thread_exit_address_globals.check (cognitive 65): thread_exit_address_globals.check has cognitive complexity 65 (threshold 15). Drivers by points: if/else 22 (50 pts), boolean chains 8, loops 6 (7 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":"scripts/thread_exit_address_globals.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"960a78eb46d6ade2dfd6a7a7f38f190817e25e3ce27d2c1bf5adb0a36aaf9dd5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::optimized_libs::features::auto_optimized_cross_features (cognitive 64): perry::commands::compile::optimized_libs::features::auto_optimized_cross_features has cognitive complexity 64 (threshold 15). Drivers by points: if/else 33 (36 pts), boolean chains 25, loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/optimized_libs/features.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"931b21f7a50da495f578eb806990a3ed2936499c10d82156d269856ca97607f0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_numeric::prove_numeric_fields (cognitive 64): perry_codegen::collectors::ptr_shape_numeric::prove_numeric_fields has cognitive complexity 64 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 8 (15 pts), match/switch 4 (14 pts), boolean chains 3 (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/perry-codegen/src/collectors/ptr_shape_numeric.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"976158207a783bce60c4ec15d285d8de354a526c4adf61902fd148523ac4b222"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::loops::lower_object_array_write_versioned_for (cognitive 64): perry_codegen::stmt::loops::lower_object_array_write_versioned_for has cognitive complexity 64 (threshold 15). Drivers by points: if/else 36 (47 pts), loops 13 (17 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":5094}}}],"partialFingerprints":{"codehealthFindingId/v1":"351e51d22a16b43b1eacfd6ec75b3a535cf7ed1ade2069127bd99a8f94cb5b8f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::widget_decl::parse_single_modifier (cognitive 64): perry_hir::lower::widget_decl::parse_single_modifier has cognitive complexity 64 (threshold 15). Drivers by points: if/else 25 (48 pts), match/switch 4 (13 pts), loops 1 (3 pts) (nesting depth added 34). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"8757074422372086d1015e684959804e318af5b0524325ab8d62ad1adf81fef0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::flat_clone::js_array_clone (cognitive 64): perry_runtime::array::flat_clone::js_array_clone has cognitive complexity 64 (threshold 15). Drivers by points: if/else 31 (54 pts), boolean chains 8, match/switch 1 (2 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/perry-runtime/src/array/flat_clone.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b159e3b4537ccd953e3db8004edc0ccae200c038f03b959e3e9bdd2ca77ff4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_set_by_name::fast_paths::object_set_field_by_name_transition_fast_impl_value (cognitive 64): perry_runtime::object::field_set_by_name::fast_paths::object_set_field_by_name_transition_fast_impl_value has cognitive complexity 64 (threshold 15). Drivers by points: if/else 37 (47 pts), boolean chains 16, match/switch 1 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/perry-runtime/src/object/field_set_by_name/fast_paths.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a24b9d47aefa036f4519aad76e2d9f6931629d921f3a8177af862f7eb3aa57"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::export_value_wrappers::emit_export_value_wrappers (cognitive 63): perry_codegen::codegen::export_value_wrappers::emit_export_value_wrappers has cognitive complexity 63 (threshold 15). Drivers by points: if/else 24 (51 pts), boolean chains 5, loops 5, 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/perry-codegen/src/codegen/export_value_wrappers.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac456bc7eab8aa3bee39e80b49e3da3b7577466d53371e5dbbad2df8d7a2939"}},{"ruleId":"D2","level":"warning","message":{"text":"FuncEmitCtx::try_emit_expr_literals_vars (cognitive 63): FuncEmitCtx::try_emit_expr_literals_vars has cognitive complexity 63 (threshold 15). Drivers by points: if/else 22 (39 pts), match/switch 11 (22 pts), loops 1 (2 pts) (nesting depth added 29). 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/perry-codegen-wasm/src/emit/expr/literals_vars.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a706b3cc3996e5dde96605e61c1a0de8dd1669172a27a70a7778a76e947dadb6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_container_compose::capabilities::required_features (cognitive 63): perry_container_compose::capabilities::required_features has cognitive complexity 63 (threshold 15). Drivers by points: if/else 19 (49 pts), loops 4 (9 pts), boolean chains 5 (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/perry-container-compose/src/capabilities.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"41777bd0f947d37cefdc4a4153bba11f65f6ef7fe7df5db93e8f0f04ff8d4489"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::destructuring::var_decl::alias_tracking::track_decl_aliases (cognitive 63): perry_hir::destructuring::var_decl::alias_tracking::track_decl_aliases has cognitive complexity 63 (threshold 15). Drivers by points: if/else 23 (42 pts), match/switch 7 (14 pts), boolean chains 7 (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/perry-hir/src/destructuring/var_decl/alias_tracking.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"939d50e4f656a8bc1eb037653dfe1c7d1dcba1ddfc85602a596a097ed7d8a0b4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::fn_ctor_env::scan_expr_writes (cognitive 63): perry_hir::lower::fn_ctor_env::scan_expr_writes has cognitive complexity 63 (threshold 15). Drivers by points: loops 11 (27 pts), if/else 11 (26 pts), match/switch 4 (10 pts) (nesting depth added 37). 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/perry-hir/src/lower/fn_ctor_env.rs"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"7179fc2911b9598eca79f002bf57528488504ed9c6eaa3b6138cd8213ba622bc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::iterator_helpers::dispatch_iterator_helper_method (cognitive 63): perry_runtime::iterator_helpers::dispatch_iterator_helper_method has cognitive complexity 63 (threshold 15). Drivers by points: if/else 21 (47 pts), loops 5 (10 pts), boolean chains 5, match/switch 1 (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/perry-runtime/src/iterator_helpers.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"535794cd9da1920907b00227847a0a5b6702a98eacd923287be2cbd7d3628ab5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::polymorphic_index::js_object_get_index_polymorphic (cognitive 63): perry_runtime::object::polymorphic_index::js_object_get_index_polymorphic has cognitive complexity 63 (threshold 15). Drivers by points: if/else 33 (54 pts), match/switch 3 (5 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/perry-runtime/src/object/polymorphic_index.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d00ed70565941383970329f0aab2f347739e48cb66501ae4daca0bad5c0893"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::app::app_run (cognitive 63): perry_ui_windows::app::app_run has cognitive complexity 63 (threshold 15). Drivers by points: if/else 16 (46 pts), match/switch 3 (9 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-windows/src/app.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7d521321423c3fabb121e2020e75068b025697c4b78a1db25b2b4a007ff821"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::collect_modules::reexport_prune::forwarding::normalize (cognitive 62): perry::commands::compile::collect_modules::reexport_prune::forwarding::normalize has cognitive complexity 62 (threshold 15). Drivers by points: if/else 15 (34 pts), match/switch 7 (14 pts), boolean chains 7, loops 4 (7 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/perry/src/commands/compile/collect_modules/reexport_prune/forwarding.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"893d7d35214ea85d59e7466e8ecf5313bc21c959ca76764eebf2749bdc6315d3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::lower_expr::arm_ident::lower_ident_expr (cognitive 62): perry_hir::lower::lower_expr::arm_ident::lower_ident_expr has cognitive complexity 62 (threshold 15). Drivers by points: if/else 35 (51 pts), match/switch 2 (7 pts), boolean chains 4 (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/perry-hir/src/lower/lower_expr/arm_ident.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fcd8ab7977a53f881707537c79f679a4c6d56ca64a2fd2eed6bdfb012ea48a1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::monomorph::constraints::check_interface_satisfaction (cognitive 62): perry_hir::monomorph::constraints::check_interface_satisfaction has cognitive complexity 62 (threshold 15). Drivers by points: if/else 16 (49 pts), loops 3 (8 pts), boolean chains 4, match/switch 1 (nesting depth added 38). 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/perry-hir/src/monomorph/constraints.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"63678a4102d0c35f33c926c1bd7bbe3ab294d0f214174efda1c53fc2800ee743"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::iterator::array_from_spread_value (cognitive 62): perry_runtime::array::iterator::array_from_spread_value has cognitive complexity 62 (threshold 15). Drivers by points: if/else 33 (54 pts), boolean chains 4, 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/perry-runtime/src/array/iterator.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8f91d7f50aea3214b63cd4c69c215dca61ae77c099742303e035a832b0f665"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::subclass_packed_index::js_packed_arraylike_index_get (cognitive 62): perry_runtime::array::subclass_packed_index::js_packed_arraylike_index_get has cognitive complexity 62 (threshold 15). Drivers by points: if/else 15 (59 pts), boolean chains 3 (nesting depth added 44). 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/perry-runtime/src/array/subclass_packed_index.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef437c34b39b76088be7e71dd3bc4757fa1d367d93e1e9c2774d1e32c67413d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::pty::reactor::pty_reactor_pump_inner (cognitive 62): perry_runtime::pty::reactor::pty_reactor_pump_inner has cognitive complexity 62 (threshold 15). Drivers by points: if/else 18 (46 pts), match/switch 3 (7 pts), loops 4 (6 pts), boolean chains 3 (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/perry-runtime/src/pty/reactor.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9de3fb3995c24a1e38867821790252a3d34a5be1751ce50dbb5be41704dbd2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::deforest::detect::detect_producers (cognitive 62): perry_transform::deforest::detect::detect_producers has cognitive complexity 62 (threshold 15). Drivers by points: if/else 17 (31 pts), loops 19 (31 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/perry-transform/src/deforest/detect.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"eedfb0492dd97833dfad93088a187398aee267a53ec5990808958dbe9f6c81f8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::run::android::wire_native_lib_kotlin_sources (cognitive 61): perry::commands::run::android::wire_native_lib_kotlin_sources has cognitive complexity 61 (threshold 15). Drivers by points: if/else 17 (40 pts), loops 6 (13 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/run/android.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4fbc1a7eff4022362112f346b7f41af8a32cd14005d2c128f35df6c18000b3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_families::late::module_groups (cognitive 61): perry_codegen::layout_families::late::module_groups has cognitive complexity 61 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 17 (29 pts), boolean chains 1, match/switch 1 (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/perry-codegen/src/layout_families/late.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a47f2956b11ad23c67ee3e6b85c2bac8516e7e049167b1d58913041a1547c60"}},{"ruleId":"D2","level":"warning","message":{"text":"Cfg::pinned (cognitive 61): Cfg::pinned has cognitive complexity 61 (threshold 15). Drivers by points: if/else 20 (51 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-gc-effects/src/instructions.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb10b537cbb6ae131aadc33b0630ad3dd8ae81cd25b4039c1d2cd9aede24a6a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::lower_expr::arm_class::lower_class_expr (cognitive 61): perry_hir::lower::lower_expr::arm_class::lower_class_expr has cognitive complexity 61 (threshold 15). Drivers by points: if/else 27 (41 pts), boolean chains 11, match/switch 6 (8 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/perry-hir/src/lower/lower_expr/arm_class.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f382bc6e378cb9e2ca7ace727e1b0ef67a45157482d8af7a7f98ae8b28f516"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::widget_decl::parse_widget_config_param (cognitive 61): perry_hir::lower::widget_decl::parse_widget_config_param has cognitive complexity 61 (threshold 15). Drivers by points: if/else 10 (39 pts), match/switch 3 (13 pts), loops 2 (9 pts) (nesting depth added 46). 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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd68cf8a2da16a5da012fb23e94f0993cc27735c45678422d8a30ca08559276"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::heap_snapshot::gc_build_v8_heap_snapshot_json_with_format (cognitive 61): perry_runtime::gc::heap_snapshot::gc_build_v8_heap_snapshot_json_with_format has cognitive complexity 61 (threshold 15). Drivers by points: if/else 22 (41 pts), loops 13 (16 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/perry-runtime/src/gc/heap_snapshot.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3150eeca1917c912a157125a294e9bb4ac394231a858b3ecf1752cfafcacf8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::geisterhand_registry::perry_geisterhand_pump (cognitive 61): perry_runtime::geisterhand_registry::perry_geisterhand_pump has cognitive complexity 61 (threshold 15). Drivers by points: if/else 20 (51 pts), match/switch 3 (6 pts), boolean chains 3, loops 1 (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/perry-runtime/src/geisterhand_registry.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef84372949686c63d669d65af014d91924eb575bd9556775072b12437521c7e7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::streams::gc::scan_stream_roots_with (cognitive 61): perry_stdlib::streams::gc::scan_stream_roots_with has cognitive complexity 61 (threshold 15). Drivers by points: if/else 17 (42 pts), loops 8 (19 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/streams/gc.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95ffd666ab7512f11b2e2b2aa81649e7abbe3ccc6d2ed1c338fc4f019d5a749"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::aggregate_scalar::rewrite_return_record_stmts (cognitive 61): perry_transform::aggregate_scalar::rewrite_return_record_stmts has cognitive complexity 61 (threshold 15). Drivers by points: if/else 16 (49 pts), loops 4 (10 pts), match/switch 1 (2 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/aggregate_scalar.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e07c06ef68546f2cbb992bcd10df6b0fa5b4f530e0aeae89d22c1856a92fc1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::derive::template_facts (cognitive 61): perry_wpfacts::derive::template_facts has cognitive complexity 61 (threshold 15). Drivers by points: if/else 23 (40 pts), boolean chains 12, loops 6 (8 pts), match/switch 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/perry-wpfacts/src/derive.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"090c2eaad582b9bc4d58e7cc5b9088a04068f5e334a75d0ca251ec0430b2fedf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::init_order::classify_eager_modules (cognitive 60): perry::commands::compile::init_order::classify_eager_modules has cognitive complexity 60 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 8 (15 pts), match/switch 3 (9 pts), boolean chains 6 (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/perry/src/commands/compile/init_order.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf42b4132523eb88554b9537c7b69dcf24a0a9fef6d2e7203ca3ad599bc54dc9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::init_order::topo_sort_non_entry_modules (cognitive 60): perry::commands::compile::init_order::topo_sort_non_entry_modules has cognitive complexity 60 (threshold 15). Drivers by points: if/else 15 (39 pts), loops 7 (12 pts), boolean chains 6, match/switch 1 (3 pts) (nesting depth added 31). Of this number, 54 points are the body\u0027s own statements and 6 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/perry/src/commands/compile/init_order.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31e67e29c6e5aec5dda3efc3254b0df4519133f881eca7771b4f9c4c492f8a9"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::build (cognitive 60): Model::build has cognitive complexity 60 (threshold 15). Drivers by points: if/else 14 (36 pts), loops 13 (21 pts), boolean chains 3 (nesting depth added 30). Of this number, 58 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/perry-codegen/src/collectors/definite_init.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a795b2f3d2be76c2a9a3eac1207438644225a1007c248e193f6659f165fc60e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::array_push::lower_inner (cognitive 60): perry_codegen::expr::array_push::lower_inner has cognitive complexity 60 (threshold 15). Drivers by points: if/else 23 (50 pts), boolean chains 9, match/switch 1 (nesting depth added 27). 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/perry-codegen/src/expr/array_push.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc316503ee5b1754ad1e9218d6ead73c3fb7e56cd49ca182c655d70a3a286ff"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::func_ref::try_emit_spec_static_call (cognitive 60): perry_codegen::lower_call::func_ref::try_emit_spec_static_call has cognitive complexity 60 (threshold 15). Drivers by points: if/else 12 (28 pts), match/switch 7 (18 pts), loops 5 (8 pts), boolean chains 6 (nesting depth added 30). Of this number, 54 points are the body\u0027s own statements and 6 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":"crates/perry-codegen/src/lower_call/func_ref.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0d82972c28236fd6693a922f30a5cebc1eda6b774252f0b59c1cfb070f81f1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::loops::expr_array_length_effect (cognitive 60): perry_codegen::stmt::loops::expr_array_length_effect has cognitive complexity 60 (threshold 15). Drivers by points: if/else 27 (50 pts), boolean chains 7, match/switch 2 (3 pts) (nesting depth added 24). 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":9107}}}],"partialFingerprints":{"codehealthFindingId/v1":"794fca33881a1af46e9f78c3ea3f84861975559d74a82018fb6399b69e5b3cd9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_net::payload_socket::get (cognitive 60): perry_ext_net::payload_socket::get has cognitive complexity 60 (threshold 15). Drivers by points: if/else 20 (37 pts), match/switch 9 (20 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/perry-ext-net/src/payload_socket.rs"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"327153221be1914ccfd2fc9a686d6058c0b6b6c316acb9bb477b2cb3a98fd3d8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::component::persistent::poll::complete (cognitive 60): perry_runtime::component::persistent::poll::complete has cognitive complexity 60 (threshold 15). Drivers by points: if/else 33 (51 pts), boolean chains 6, 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/perry-runtime/src/component/persistent/poll.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"027a2722e9ac324941127e69f2fb2064edc79c240d97dada0573e019ed615eb8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::audio::start (cognitive 60): perry_ui_windows::audio::start has cognitive complexity 60 (threshold 15). Drivers by points: if/else 16 (43 pts), match/switch 6 (8 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-windows/src/audio.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3c79beeadb3882941edd109e50987ba21b6de4db2bfa5ea1588ed4e65b188a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::publish::credentials::validate_credentials_for_distribute (cognitive 59): perry::commands::publish::credentials::validate_credentials_for_distribute has cognitive complexity 59 (threshold 15). Drivers by points: if/else 29 (51 pts), boolean chains 4, match/switch 1 (4 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/perry/src/commands/publish/credentials.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7877f02076687adf26973bb8580f20d615df2b0f6b86e3c4a040040e0ea6a13"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayWalk::walk_stmt (cognitive 59): ArrayWalk::walk_stmt has cognitive complexity 59 (threshold 15). Drivers by points: if/else 19 (53 pts), boolean chains 3, loops 1 (2 pts), match/switch 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/perry-codegen/src/collectors/ptr_shape_elements.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd31c37efd08bd6e3f47428be58ed97bc9384d76c5bd66660f097f69c3ebc108"}},{"ruleId":"D2","level":"warning","message":{"text":"FnReader::typed (cognitive 59): FnReader::typed has cognitive complexity 59 (threshold 15). Drivers by points: if/else 18 (38 pts), match/switch 8 (15 pts), loops 3 (6 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/perry-codegen/src/dialect/mod.rs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ca6ad64be3ae4d4612c4d01119baae5239b718136a4259f1ae226d4bc119c3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::math_simple::lower (cognitive 59): perry_codegen::expr::math_simple::lower has cognitive complexity 59 (threshold 15). Drivers by points: if/else 25 (37 pts), boolean chains 17, match/switch 3 (5 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/math_simple.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"333f91bafc0d1c19fa527af29aea3b4071ba0edfae8325e480c5d29a5290bef6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::js_transform::cross_module_natives::fix_native_instance_expr (cognitive 59): perry_hir::js_transform::cross_module_natives::fix_native_instance_expr has cognitive complexity 59 (threshold 15). Drivers by points: loops 17 (39 pts), if/else 6 (16 pts), match/switch 2 (4 pts) (nesting depth added 34). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/js_transform/cross_module_natives.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7dd246e8830a712078d19660066d508feb4ed08cd6c6247b6f18e4224ac6fb"}},{"ruleId":"D2","level":"warning","message":{"text":"DirectParser::parse_number (cognitive 59): DirectParser::parse_number has cognitive complexity 59 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 6 (15 pts), boolean chains 14, match/switch 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/perry-runtime/src/json/parser.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0647aad9c26f6672aae20ce2363bff420cde5b245057adead0ce82a5eeec93"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::turnloop_net::transport::dispatch_stream (cognitive 59): perry_runtime::turnloop_net::transport::dispatch_stream has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (49 pts), boolean chains 4, match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 29). 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/perry-runtime/src/turnloop_net/transport.rs"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb634df446c23af7faed70aaa2a305bd1be4c783887509cd5308bc3f7479348"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::webcrypto::aes::js_webcrypto_encrypt (cognitive 59): perry_stdlib::webcrypto::aes::js_webcrypto_encrypt has cognitive complexity 59 (threshold 15). Drivers by points: match/switch 19 (30 pts), if/else 18 (28 pts), boolean chains 1 (nesting depth added 21). 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. This shape REPEATS in the file: one other method here (perry_stdlib::webcrypto::aes::js_webcrypto_decrypt) 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/perry-stdlib/src/webcrypto/aes.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84628127f1a45473fb84b8df83c1c0361da2d6a4c273191d9feb074aa11241c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::webcrypto::aes::js_webcrypto_decrypt (cognitive 59): perry_stdlib::webcrypto::aes::js_webcrypto_decrypt has cognitive complexity 59 (threshold 15). Drivers by points: match/switch 19 (30 pts), if/else 18 (28 pts), boolean chains 1 (nesting depth added 21). 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. This shape REPEATS in the file: one other method here (perry_stdlib::webcrypto::aes::js_webcrypto_encrypt) 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/perry-stdlib/src/webcrypto/aes.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28cb5d8dd43810d017d00ccc1ebdc319f7c516bc8f4aecdf4b6c03dc9373376"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::lib::contracts::describe_toks (cognitive 59): perry_wpfacts::lib::contracts::describe_toks has cognitive complexity 59 (threshold 15). Drivers by points: if/else 19 (47 pts), match/switch 3 (7 pts), boolean chains 4, loops 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/perry-wpfacts/src/lib/contracts.rs"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf16f396c70aade75295417622196956742ecd690670ce5ab569cf40c7c11f7b"}},{"ruleId":"D2","level":"warning","message":{"text":"native_abi_evidence_report.compiler_output_summary (cognitive 59): native_abi_evidence_report.compiler_output_summary has cognitive complexity 59 (threshold 15). Drivers by points: if/else 20 (39 pts), boolean chains 16, ternaries 3, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/native_abi_evidence_report.py"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fcf6e6ad323dc525a669f271baf58d80ed3ad9e5b4b8c2c598b2d039f6bc71"}},{"ruleId":"D2","level":"warning","message":{"text":"shape_descriptor_census.assert_authority_surfaces (cognitive 59): shape_descriptor_census.assert_authority_surfaces has cognitive complexity 59 (threshold 15). Drivers by points: if/else 24 (39 pts), loops 18 (19 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":"scripts/shape_descriptor_census.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a47eb1a67d1a34595a1b7b299acdf955ad49bb8b92d88775c9792006a62985"}},{"ruleId":"D2","level":"warning","message":{"text":"string_payload_access_inventory.mask_non_code (cognitive 59): string_payload_access_inventory.mask_non_code has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (57 pts), boolean chains 1, loops 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":"scripts/string_payload_access_inventory.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"475f305cf98c66a6fca32aa27b6c04c02e86efe505572bbb5f058cc044e32fc8"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayWalk::walk_expr (cognitive 58): ArrayWalk::walk_expr has cognitive complexity 58 (threshold 15). Drivers by points: if/else 19 (50 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 34). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/ptr_shape_elements.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a915512358bdf79a56c17ff66f405ef83468f6677312b751e524f29a1aca5e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::birth_lanes::chain_birth_f64_fields (cognitive 58): perry_codegen::lower_call::birth_lanes::chain_birth_f64_fields has cognitive complexity 58 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 8 (14 pts), boolean chains 10, match/switch 2 (6 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/perry-codegen/src/lower_call/birth_lanes.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd204f657c43d18549a5d37a6f9af86adc01f0736e6b4cfc3c5b2dbb08e28e1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::native_value::verify::abi::validate_native_abi_type_record (cognitive 58): perry_codegen::native_value::verify::abi::validate_native_abi_type_record has cognitive complexity 58 (threshold 15). Drivers by points: if/else 30 (44 pts), boolean chains 6, loops 1 (4 pts), match/switch 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/perry-codegen/src/native_value/verify/abi.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c52ebf3b65e92813d6497f91b1f9daf59c20959bc15d7723dc908e020a446c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::region_loop::verify::verify_exit_effects (cognitive 58): perry_codegen::stmt::region_loop::verify::verify_exit_effects has cognitive complexity 58 (threshold 15). Drivers by points: if/else 14 (43 pts), loops 5 (9 pts), boolean chains 3, match/switch 1 (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/perry-codegen/src/stmt/region_loop/verify.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7689b9f9320636fbe09a052d144c4c12fb2670e33be71faa57d3f54745d7631"}},{"ruleId":"D2","level":"warning","message":{"text":"Prepared::new (cognitive 58): Prepared::new has cognitive complexity 58 (threshold 15). Drivers by points: if/else 16 (31 pts), loops 11 (20 pts), boolean chains 4, match/switch 1 (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/perry-component-host/src/async_values/compose.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e9e91f02ed6b9268c188cb5bfad24b730721277aa4b14a660b3669cc618807"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_call_method::class_holder::chain_method_admitting (cognitive 58): perry_runtime::object::native_call_method::class_holder::chain_method_admitting has cognitive complexity 58 (threshold 15). Drivers by points: if/else 22 (49 pts), boolean chains 6, match/switch 1 (2 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/perry-runtime/src/object/native_call_method/class_holder.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"67dd33830b80e9aa4f399cd2ae6650a00127e33f07dba718bae773229f83bfdc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::property_ops::put_value::object_array_numeric_write_slots (cognitive 58): perry_runtime::object::property_ops::put_value::object_array_numeric_write_slots has cognitive complexity 58 (threshold 15). Drivers by points: if/else 29 (41 pts), boolean chains 10, loops 6 (7 pts) (nesting depth added 13). Of this number, 42 points are the body\u0027s own statements and 16 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":"crates/perry-runtime/src/object/property_ops/put_value.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e113bffe284f5ebb0a374999784f832d63666eb112511a686734c84819b07a"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::runtime_glue (cognitive 58): Gen::runtime_glue has cognitive complexity 58 (threshold 15). Drivers by points: if/else 19 (40 pts), match/switch 6 (12 pts), loops 3 (6 pts) (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/perry-wpfacts/src/gen/glue.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"8487794324d35494c93e1a35a0a965662ebef2a2f6b8d23318223ef9e8a14cbd"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check._array_element_loads (cognitive 58): gc_root_dominance_check._array_element_loads has cognitive complexity 58 (threshold 15). Drivers by points: if/else 15 (43 pts), boolean chains 9, loops 4 (6 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":3607}}}],"partialFingerprints":{"codehealthFindingId/v1":"6565ea288f0c766008d437bdfb187245ff49f406961da225ba2d35ae4ed5f6ce"}},{"ruleId":"D2","level":"warning","message":{"text":"realm_manifest_coverage.cell_names (cognitive 58): realm_manifest_coverage.cell_names has cognitive complexity 58 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 7 (12 pts), ternaries 2 (9 pts), boolean chains 6 (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":"scripts/realm_manifest_coverage.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b7479ac586aaa3b71335f18c78c71cc46af0a901c2debf5e093da6da4ff67e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::detect::strip_comments_and_strings (cognitive 57): perry::commands::compile::cjs_wrap::detect::strip_comments_and_strings has cognitive complexity 57 (threshold 15). Drivers by points: if/else 15 (29 pts), match/switch 5 (14 pts), boolean chains 8, loops 4 (6 pts) (nesting depth added 25). Of this number, 46 points are the body\u0027s own statements and 11 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":"crates/perry/src/commands/compile/cjs_wrap/detect.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9063a058ad5942807f243de7c39bbe1c92902e9f3ff74197751e1b64a42d8d3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::library_search::find_msvc_lib_paths (cognitive 57): perry::commands::compile::library_search::find_msvc_lib_paths has cognitive complexity 57 (threshold 15). Drivers by points: if/else 18 (53 pts), loops 3, boolean chains 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/perry/src/commands/compile/library_search.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c94cb0d96e9667676c624b83c4b5f845dd36b3c8570f16ae7320bc36686670"}},{"ruleId":"D2","level":"warning","message":{"text":"NumberAtReadFlow::stmt (cognitive 57): NumberAtReadFlow::stmt has cognitive complexity 57 (threshold 15). Drivers by points: if/else 26 (48 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 2 (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/perry-codegen/src/collectors/number_by_construction.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"75355997a7d23621c2e52dac817d61d717f93e0561e5b6f096e7b4f27c9abaea"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::static_fields::init_static_fields_late (cognitive 57): perry_codegen::codegen::static_fields::init_static_fields_late has cognitive complexity 57 (threshold 15). Drivers by points: if/else 15 (49 pts), loops 5 (7 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/perry-codegen/src/codegen/static_fields.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8a7099f2141466b7fb12a1de3f29ac2a0c89d152b5785a5003b227e1872729"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::lower_stmts_list (cognitive 57): perry_codegen::stmt::lower_stmts_list has cognitive complexity 57 (threshold 15). Drivers by points: if/else 19 (53 pts), boolean chains 3, loops 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/perry-codegen/src/stmt/mod.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"00128ba81b9fa735dd31158ee0ede6692fbfa6a0877df1653b9c2a0f7b74e662"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::intrinsics::bare_builtins::try_function_return_this (cognitive 57): perry_hir::lower::expr_call::intrinsics::bare_builtins::try_function_return_this has cognitive complexity 57 (threshold 15). Drivers by points: if/else 9 (45 pts), loops 2 (9 pts), boolean chains 3 (nesting depth added 43). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/intrinsics/bare_builtins.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6fbc0779527fc63db92786795ae70ddea689156596e1b95fdec427e3e5793e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::indexing::js_array_length (cognitive 57): perry_runtime::array::indexing::js_array_length has cognitive complexity 57 (threshold 15). Drivers by points: if/else 26 (49 pts), boolean chains 8 (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/perry-runtime/src/array/indexing.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c703140f2eb119bb5cd2c8c7957e2f591898652fa578da56bdc0a64373e9b7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::make_instance_this (cognitive 57): perry_runtime::intl::make_instance_this has cognitive complexity 57 (threshold 15). Drivers by points: if/else 25 (49 pts), boolean chains 5, match/switch 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/perry-runtime/src/intl.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"3854af07f86b5d0a2a2775ea3d00ace1b7d7b2d62677efb9a8d3b01e00c7ad91"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::construct::builtin::construct (cognitive 57): perry_runtime::object::class_registry::construct::builtin::construct has cognitive complexity 57 (threshold 15). Drivers by points: if/else 25 (46 pts), match/switch 4 (7 pts), loops 2 (4 pts) (nesting depth added 26). 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/perry-runtime/src/object/class_registry/construct/builtin.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"398d30fc0e28071b93198758be90cc1160153fef500a997a47376063779e5cc9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::turnloop_net::dispatch (cognitive 57): perry_runtime::turnloop_net::dispatch has cognitive complexity 57 (threshold 15). Drivers by points: if/else 25 (44 pts), boolean chains 6, match/switch 3 (5 pts), loops 1 (2 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/perry-runtime/src/turnloop_net/mod.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01ee6aedb9047afb7db1cacb1ad38ce11bcff3f75e9c03b700f34d7243edace"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::turnloop_client::exchange::feed (cognitive 57): perry_stdlib::turnloop_client::exchange::feed has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (38 pts), match/switch 6 (15 pts), boolean chains 3, loops 1 (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/perry-stdlib/src/turnloop_client/exchange.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"10296ca8cccb818cae119c45c1aa0d5c00ae9412147a2583152b28c8444f0888"}},{"ruleId":"D2","level":"warning","message":{"text":"wasi_host_qualification.main (cognitive 57): wasi_host_qualification.main has cognitive complexity 57 (threshold 15). Drivers by points: ternaries 12 (30 pts), if/else 6 (13 pts), loops 7 (8 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_host_qualification.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac4878449dc1736b2dbca118a4e289f5d26b78d0e30e3b2a6fe2a35dcb8acc0"}},{"ruleId":"D2","level":"warning","message":{"text":"wpfacts_recompute.derive (cognitive 57): wpfacts_recompute.derive has cognitive complexity 57 (threshold 15). Drivers by points: if/else 12 (30 pts), boolean chains 14, loops 4 (7 pts), ternaries 2 (6 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":"scripts/wpfacts_recompute.py"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"65aec2aeab573b86ff9f872bcf7371ecfe10852afa6376e36537a3a262a78691"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::definite_init::order_verdict (cognitive 56): perry_codegen::collectors::definite_init::order_verdict has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 14, match/switch 3 (7 pts), loops 3 (5 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/perry-codegen/src/collectors/definite_init.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d625bb95837a41afac79367665db59fe4864cdd29ce39516e53e62c99da83b2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::property_get::generic_dispatch::lower_property_site_tail (cognitive 56): perry_codegen::expr::property_get::generic_dispatch::lower_property_site_tail has cognitive complexity 56 (threshold 15). Drivers by points: if/else 35 (45 pts), boolean chains 9, match/switch 2 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/perry-codegen/src/expr/property_get/generic_dispatch.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0a8deb3fd1bfd0edca010efa3eaec30dc47adb7746db9b47ad53bc0655b737"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::proxy_reflect::lower (cognitive 56): perry_codegen::expr::proxy_reflect::lower has cognitive complexity 56 (threshold 15). Drivers by points: if/else 23 (48 pts), match/switch 3 (5 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/perry-codegen/src/expr/proxy_reflect.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"6779de1ad32b91e42c3cfdd1651d6c196aa04109555bb369f3434fc664e91523"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::inprocess::native_homes::publish_with_builder (cognitive 56): perry_codegen::inprocess::native_homes::publish_with_builder has cognitive complexity 56 (threshold 15). Drivers by points: if/else 7 (32 pts), loops 8 (18 pts), match/switch 1 (4 pts), boolean chains 2 (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/perry-codegen/src/inprocess/native_homes.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c159f331733c79dcd89b808825eb2a7c202067a0806bcbbac8fd0891698fa3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::dynamic_import::collect_dynamic_import_local_candidate_literals (cognitive 56): perry_hir::dynamic_import::collect_dynamic_import_local_candidate_literals has cognitive complexity 56 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 13 (23 pts), match/switch 1 (4 pts), boolean chains 3 (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/perry-hir/src/dynamic_import.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"98876313697d3c813e4d8c65385279da3805579bb7af249a809aa18c758ef81d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::bun_compat::string_width::grapheme_break (cognitive 56): perry_runtime::bun_compat::string_width::grapheme_break has cognitive complexity 56 (threshold 15). Drivers by points: if/else 30 (40 pts), boolean chains 15, 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/perry-runtime/src/bun_compat/string_width.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"806bd4b3a6ca4378e623074f89722dea0345fa07dd3fb974bcbf10f2e6d2ffa8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::construct::js_new_function_construct_with_new_target (cognitive 56): perry_runtime::object::class_registry::construct::js_new_function_construct_with_new_target has cognitive complexity 56 (threshold 15). Drivers by points: if/else 32 (50 pts), boolean chains 3, loops 1 (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/perry-runtime/src/object/class_registry/construct.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3aef7ef6988c0a4d05bb7cde6e440780983e9d623aa88ddedba3aff57a3f74"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::shapes::scan_shape_keys_address (cognitive 56): perry_runtime::object::shapes::scan_shape_keys_address has cognitive complexity 56 (threshold 15). Drivers by points: if/else 15 (39 pts), loops 3 (11 pts), boolean chains 4, match/switch 1 (2 pts) (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/perry-runtime/src/object/shapes.rs"},"region":{"startLine":6336}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e238fc2c937f73ff480d22b988312f6e44a9b7421ccdd4d3783f83fbf3fe0e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::path::win32_dirname_inner (cognitive 56): perry_runtime::path::win32_dirname_inner has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (35 pts), loops 4 (13 pts), boolean chains 7, match/switch 1 (nesting depth added 28). 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/perry-runtime/src/path.rs"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba85eb1b71ecd45765b22a75ad97bcfc82a4f71962d3525ccf2d55008229b49c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::readline::pump::route_pending_stdin_input (cognitive 56): perry_stdlib::readline::pump::route_pending_stdin_input has cognitive complexity 56 (threshold 15). Drivers by points: if/else 20 (48 pts), boolean chains 5, loops 2 (3 pts) (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/perry-stdlib/src/readline/pump.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a9c33d28d553b357cbe4c49ddfb1121701e854948ca5779b6454f38bc54750"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::finally_inline::process_stmts (cognitive 56): perry_transform::finally_inline::process_stmts has cognitive complexity 56 (threshold 15). Drivers by points: if/else 12 (35 pts), match/switch 4 (13 pts), loops 3 (7 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/perry-transform/src/finally_inline.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0df78dea28e01e8eb46c4edebcea8de7a2c05f7b37650e137ecd5bbaba10d6"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::publish_class (cognitive 56): Model::publish_class has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (39 pts), loops 7 (10 pts), boolean chains 5, match/switch 2 (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/perry-wpfacts/src/solve/call_and_construct.rs"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa56edbcf279cf672082434784fb4d4d6a9f1069524e34e0a9a2d8ec36640e9a"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_1090_evidence_report.gate_copied_minor (cognitive 56): gc_1090_evidence_report.gate_copied_minor has cognitive complexity 56 (threshold 15). Drivers by points: if/else 25 (51 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gc_1090_evidence_report.py"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"993986442125efa9d96fee150901176bb2c0d251a1bf4af0740338de8f12a3bb"}},{"ruleId":"D2","level":"warning","message":{"text":"native_abi_evidence_report.benchmark_deltas (cognitive 56): native_abi_evidence_report.benchmark_deltas has cognitive complexity 56 (threshold 15). Drivers by points: if/else 23 (37 pts), boolean chains 12, loops 6, ternaries 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":"scripts/native_abi_evidence_report.py"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df7bbfe68d77da8a668c543144a8eb69b01228892ee8b955ce6b147eba96a2d"}},{"ruleId":"D2","level":"warning","message":{"text":"wpfacts_oracle.main (cognitive 56): wpfacts_oracle.main has cognitive complexity 56 (threshold 15). Drivers by points: if/else 13 (34 pts), loops 9 (13 pts), boolean chains 5, error handling 1 (3 pts), ternaries 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":"scripts/wpfacts_oracle.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"709bbe99ef9ca72806d32cccd19e512edd6694f08ffac7b1ac4dec52bd2e84f1"}},{"ruleId":"D2","level":"warning","message":{"text":"wpfacts_recompute.site_verdicts (cognitive 56): wpfacts_recompute.site_verdicts has cognitive complexity 56 (threshold 15). Drivers by points: if/else 12 (29 pts), ternaries 4 (16 pts), boolean chains 8, loops 2 (3 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":"scripts/wpfacts_recompute.py"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bf173fabf9c603c945cc638fe2a992fd601946ed6fa656cb0f936db29dcac2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::static_fields::init_static_fields_early (cognitive 55): perry_codegen::codegen::static_fields::init_static_fields_early has cognitive complexity 55 (threshold 15). Drivers by points: if/else 20 (47 pts), loops 5 (7 pts), boolean chains 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/perry-codegen/src/codegen/static_fields.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d2ae7aa9f68683ba9037d826e339271f06a0dfa12881025fcdc89a2af88de0"}},{"ruleId":"D2","level":"warning","message":{"text":"SolidJsx::native_parts (cognitive 55): SolidJsx::native_parts has cognitive complexity 55 (threshold 15). Drivers by points: if/else 26 (47 pts), match/switch 3 (5 pts), loops 3 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/solid_jsx/native.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d29a0ef5810d9586205b3a4dbcaa43a03857af46afb57147aae99b2cb77503"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::concat_reverse::js_array_fill_generic (cognitive 55): perry_runtime::array::concat_reverse::js_array_fill_generic has cognitive complexity 55 (threshold 15). Drivers by points: if/else 18 (46 pts), boolean chains 5, loops 1 (4 pts) (nesting depth added 31). 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/perry-runtime/src/array/concat_reverse.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4fadb913956e731d35c6131f60ef6f7953c4f4bea7d08418f4b6f601e46a33"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::closure::dispatch::bound::dispatch_bound_method (cognitive 55): perry_runtime::closure::dispatch::bound::dispatch_bound_method has cognitive complexity 55 (threshold 15). Drivers by points: if/else 18 (52 pts), boolean chains 3 (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/perry-runtime/src/closure/dispatch/bound.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3f6b72ffd65dafc3a8e1f5b26d065e68d179ec7d2a0d5a1eacfac9397722f4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::replacer::stringify_object_with_replacer_pretty (cognitive 55): perry_runtime::json::replacer::stringify_object_with_replacer_pretty has cognitive complexity 55 (threshold 15). Drivers by points: if/else 25 (41 pts), boolean chains 8, loops 3 (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/perry-runtime/src/json/replacer.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7130865e57e9d615a0392625448061bb92d4651500c360c877f85f7f226d28f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::enumeration::js_object_keys_value (cognitive 55): perry_runtime::object::field_get_set::enumeration::js_object_keys_value has cognitive complexity 55 (threshold 15). Drivers by points: if/else 17 (34 pts), loops 5 (17 pts), boolean chains 2, match/switch 1 (2 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/perry-runtime/src/object/field_get_set/enumeration.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be53b0993a667b9dab8ecb36dbbc30bca34b214c6e30be79807664db2d42b76"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_android::ffi::tabbar_layout::perry_ui_stack_set_distribution (cognitive 55): perry_ui_android::ffi::tabbar_layout::perry_ui_stack_set_distribution has cognitive complexity 55 (threshold 15). Drivers by points: if/else 9 (52 pts), loops 1 (3 pts) (nesting depth added 45). 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/perry-ui-android/src/ffi/tabbar_layout.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ab024eed85f945ca4c0ec151522d22bceff4df3e5b26ef3b0bf0aa67a219d0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::builtins::ns_method (cognitive 55): perry_wpfacts::builtins::ns_method has cognitive complexity 55 (threshold 15). Drivers by points: if/else 23 (42 pts), loops 4 (10 pts), boolean chains 2, match/switch 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/perry-wpfacts/src/builtins.rs"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d7fcc892e5d06dfaa2cd3cfa7124551bb3b07630f857ba5e1ab1adf318bb29"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::collect_modules::walk::walk_modules (cognitive 54): perry::commands::compile::collect_modules::walk::walk_modules has cognitive complexity 54 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 4 (10 pts), match/switch 3 (8 pts) (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/perry/src/commands/compile/collect_modules/walk.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6c20275541a85033785650e64b0aa64826212dd4b3b213883165851bc7c600"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::resolve::native_library::parse_native_abi_descriptor (cognitive 54): perry::commands::compile::resolve::native_library::parse_native_abi_descriptor has cognitive complexity 54 (threshold 15). Drivers by points: match/switch 15 (33 pts), if/else 7 (14 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 27). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/resolve/native_library.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75564fb40a20b9443c1ab4ecd9b95054c3a43f461b81981dd23190dce27cc8b"}},{"ruleId":"D2","level":"warning","message":{"text":"Build::expr_kind (cognitive 54): Build::expr_kind has cognitive complexity 54 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 7 (24 pts), boolean chains 2, match/switch 1 (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/perry-codegen/src/codegen/reach_report.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c920e99e16b08bf3efe96edad03de4838d1c8180efa3586b1038594477ee5f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::static_constfn_class::class_final (cognitive 54): perry_codegen::codegen::static_constfn_class::class_final has cognitive complexity 54 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 13, loops 5 (8 pts), 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/perry-codegen/src/codegen/static_constfn_class.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac636065770d6b406bf5e304525a930f387b452600d9415740528b7a65baeb3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::static_prototype::collect (cognitive 54): perry_codegen::codegen::static_prototype::collect has cognitive complexity 54 (threshold 15). Drivers by points: if/else 25 (40 pts), boolean chains 6, loops 4 (5 pts), match/switch 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/perry-codegen/src/codegen/static_prototype.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a8a72fb1b0f6818ea3192258d78d68cda38cf597f29970b8bb66bb9c0983b2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::property_get::number_string::try_lower_number_string_methods (cognitive 54): perry_codegen::lower_call::property_get::number_string::try_lower_number_string_methods has cognitive complexity 54 (threshold 15). Drivers by points: if/else 21 (37 pts), boolean chains 7, loops 3 (6 pts), 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/perry-codegen/src/lower_call/property_get/number_string.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b12890da2cfc5aa3a09cb9fcdec757881d8f5ad413a680711556829dfebd508"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_zlib::stream::create_stream (cognitive 54): perry_ext_zlib::stream::create_stream has cognitive complexity 54 (threshold 15). Drivers by points: if/else 38 (46 pts), match/switch 3 (5 pts), loops 2 (3 pts) (nesting depth added 11). 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/perry-ext-zlib/src/stream.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1cd9d143e53b581cfda4bfbaf017b4e88ebc6ed4499304bea9c3df91b4b2053"}},{"ruleId":"D2","level":"warning","message":{"text":"HirTypeEnv::from_module (cognitive 54): HirTypeEnv::from_module has cognitive complexity 54 (threshold 15). Drivers by points: if/else 13 (31 pts), loops 14 (23 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/perry-hir/src/analysis/value_types.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7f37c1cb5f286f130d572b336ee4fa90aa8fde487f73c2b20276ffa88bc970"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::post_args_dispatch::try_object_prototype_call (cognitive 54): perry_hir::lower::expr_call::post_args_dispatch::try_object_prototype_call has cognitive complexity 54 (threshold 15). Drivers by points: if/else 9 (45 pts), match/switch 1 (7 pts), boolean chains 2 (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/perry-hir/src/lower/expr_call/post_args_dispatch.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a25ff3c38d761e60316f21ae242675f4d57446eb6186c7606c54decfea446f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::component::persistent::poll::cycle (cognitive 54): perry_runtime::component::persistent::poll::cycle has cognitive complexity 54 (threshold 15). Drivers by points: if/else 23 (40 pts), boolean chains 9, loops 3 (5 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/perry-runtime/src/component/persistent/poll.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8753aaf5be0a4dd460c8db1ce5308c822488db9bb738f4e1d43a3d6683169b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::duration_format::partition (cognitive 54): perry_runtime::intl::duration_format::partition has cognitive complexity 54 (threshold 15). Drivers by points: if/else 17 (38 pts), boolean chains 7, loops 3 (6 pts), match/switch 1 (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/perry-runtime/src/intl/duration_format.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"2778335963ec55b55f8470d1c0f40b3da4adf966ad5079ecbee3aa9af84b7b6f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::sqlite::bind::bind_node_sqlite_params (cognitive 54): perry_stdlib::sqlite::bind::bind_node_sqlite_params has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (49 pts), loops 3 (5 pts) (nesting depth added 31). 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/perry-stdlib/src/sqlite/bind.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f7d180881085610fa1f1fd93990e90e21d446d9badb6062c92e8ae9b013371"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::settle_keyed_uses (cognitive 54): Model::settle_keyed_uses has cognitive complexity 54 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 11 (21 pts), match/switch 1 (4 pts), boolean chains 2 (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/perry-wpfacts/src/model/operations.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aaca67f6c9cea650a1c780ac0d69160b77bbcd64e90afbdc6c7b38e3589d39f"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_repsel_matrix_merge.merge (cognitive 54): gc_repsel_matrix_merge.merge has cognitive complexity 54 (threshold 15). Drivers by points: if/else 22 (46 pts), boolean chains 4, loops 3 (4 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":"scripts/gc_repsel_matrix_merge.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1024e5f1296aac5915067d0c7e600e8398a4c063e9c6eaf7dda8ebb9bfe670a9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::extract_requires::function_local_specs (cognitive 53): perry::commands::compile::cjs_wrap::extract_requires::function_local_specs has cognitive complexity 53 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 15, loops 7 (14 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/cjs_wrap/extract_requires.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10fa795a5cdabcf52c18dc93b1948febd2be5712ee3b38e0db501883fa1bdd3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::lowering_report::aggregate_record (cognitive 53): perry::commands::compile::lowering_report::aggregate_record has cognitive complexity 53 (threshold 15). Drivers by points: if/else 33 (44 pts), boolean chains 4, match/switch 2 (4 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/perry/src/commands/compile/lowering_report.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6504a9b36c815eca8d9b894d24fe2786a5eb6b943ad5fba532cc989cf5d471"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::method_registry::build_method_names (cognitive 53): perry_codegen::codegen::method_registry::build_method_names has cognitive complexity 53 (threshold 15). Drivers by points: loops 14 (28 pts), if/else 11 (25 pts) (nesting depth added 28). 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/perry-codegen/src/codegen/method_registry.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80f0d3979a7bf66928173ee2703bc8ac7c4445e98f5aa1a111fd902a0fdedf4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::split_regions_facts::declarations_to_assignments (cognitive 53): perry_codegen::codegen::split_regions_facts::declarations_to_assignments has cognitive complexity 53 (threshold 15). Drivers by points: if/else 10 (36 pts), match/switch 3 (12 pts), loops 2 (5 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/perry-codegen/src/codegen/split_regions_facts.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1ccac5d4f2be9959560befd2f6c94a92f2c349523fa57e80f06a7ade1cd549"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::lower_call (cognitive 53): perry_codegen::lower_call::lower_call has cognitive complexity 53 (threshold 15). Drivers by points: if/else 32 (51 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":"crates/perry-codegen/src/lower_call/mod.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf817c1438cdc3c3325bd5b629a958f2485bba489a3b9780cc37f734c538e286"}},{"ruleId":"D2","level":"warning","message":{"text":"Serializer::write_heap_value (cognitive 53): Serializer::write_heap_value has cognitive complexity 53 (threshold 15). Drivers by points: if/else 30 (53 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/perry-runtime/src/child_process/v8_serde.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b463c0074b683d51e9047c699c8d3a88c1ef5ea52c7ae516f4c4acdc49db04d"}},{"ruleId":"D2","level":"warning","message":{"text":"GcCycleState::step_reclaim (cognitive 53): GcCycleState::step_reclaim has cognitive complexity 53 (threshold 15). Drivers by points: if/else 18 (48 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (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/perry-runtime/src/gc/cycle.rs"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b05e5452e66869ed4b1e5f70ed6819d13191871cfc65e2b1caf5a82be474a7e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::number_format_options::configure_number_format (cognitive 53): perry_runtime::intl::number_format_options::configure_number_format has cognitive complexity 53 (threshold 15). Drivers by points: if/else 29 (39 pts), boolean chains 9, match/switch 3 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/intl/number_format_options.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8363ee717d256c73222624718fd292b74f342dd72e43122703f48cb3b21ddc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::stringify_record_output::emit_cached_record_memo (cognitive 53): perry_runtime::json::stringify_record_output::emit_cached_record_memo has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (35 pts), loops 6 (14 pts), boolean chains 2, match/switch 1 (2 pts) (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/perry-runtime/src/json/stringify_record_output.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eed9d50ea805d0ea93ebb19f2d6d3bee3e7fceca85ceba9e8e0587a54ac54d7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::regex::perex_replace::regexp (cognitive 53): perry_runtime::regex::perex_replace::regexp has cognitive complexity 53 (threshold 15). Drivers by points: if/else 24 (44 pts), loops 4 (7 pts), 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/perry-runtime/src/regex/perex_replace.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22824093f24b94a8e6679a2bd4dd2c868e895741f173bfae5a46b3803b41231"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::call_inliner::inline_calls_in_expr (cognitive 53): perry_transform::inline::call_inliner::inline_calls_in_expr has cognitive complexity 53 (threshold 15). Drivers by points: loops 12 (24 pts), if/else 12 (22 pts), match/switch 3 (7 pts) (nesting depth added 26). 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/perry-transform/src/inline/call_inliner.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23f47d17bcf14569a33840cc97cb65bbfc8794fed5e575f93b6f952dbc9d485"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::escape_summarized (cognitive 53): Model::escape_summarized has cognitive complexity 53 (threshold 15). Drivers by points: if/else 13 (40 pts), loops 3 (6 pts), match/switch 1 (4 pts), boolean chains 3 (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/perry-wpfacts/src/summary.rs"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"d883a7acc6af015816d8cb2793eed924087106cf543899c5f7538e7a4beed90f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::units::driver::unit_io (cognitive 53): perry_wpfacts::units::driver::unit_io has cognitive complexity 53 (threshold 15). Drivers by points: loops 26 (51 pts), if/else 1 (2 pts) (nesting depth added 26). 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/perry-wpfacts/src/units/driver.rs"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"491a8c0f23edf51f09a071609229a307f49d173566687114704d888cb0abd83e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_families::compute (cognitive 52): perry_codegen::layout_families::compute has cognitive complexity 52 (threshold 15). Drivers by points: if/else 17 (36 pts), boolean chains 8, loops 4 (8 pts) (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/perry-codegen/src/layout_families.rs"},"region":{"startLine":1518}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54017d91ae5aa7dbf1ff956a9399f7a7d48ac8bdb433e288087a6f74b8f31ac"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::global_eval_hoist::rename_ident_in_stmt (cognitive 52): perry_hir::lower::global_eval_hoist::rename_ident_in_stmt has cognitive complexity 52 (threshold 15). Drivers by points: if/else 14 (37 pts), loops 4 (11 pts), match/switch 2 (4 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/perry-hir/src/lower/global_eval_hoist.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f42a302ea4ee181ec11a9444339736b810d494a249fa0ae6319fe93efdb8e66"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::lower_expr::lower_expr_impl (cognitive 52): perry_hir::lower::lower_expr::lower_expr_impl has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (38 pts), match/switch 3 (6 pts), loops 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/perry-hir/src/lower/lower_expr.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"859e5d51e6a15fcf1229cc23c6b367369e1d22f2bf271de850446b70cd84ba1f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::entries_shape::js_object_entries_shape (cognitive 52): perry_runtime::object::field_get_set::entries_shape::js_object_entries_shape has cognitive complexity 52 (threshold 15). Drivers by points: if/else 23 (37 pts), loops 4 (8 pts), boolean chains 6, match/switch 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/perry-runtime/src/object/field_get_set/entries_shape.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7362432d87b8340db434a3acb500e486e8546979b8d0d3feb8485c87ad887ab9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::enumeration::js_object_values_shape (cognitive 52): perry_runtime::object::field_get_set::enumeration::js_object_values_shape has cognitive complexity 52 (threshold 15). Drivers by points: if/else 23 (37 pts), loops 4 (8 pts), boolean chains 6, match/switch 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/perry-runtime/src/object/field_get_set/enumeration.rs"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0cf450ea131aef294f77716428f60fac8121467f3e78d31c63794e74f23396"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_probe::probe_has (cognitive 52): perry_runtime::object::layout_probe::probe_has has cognitive complexity 52 (threshold 15). Drivers by points: if/else 19 (43 pts), match/switch 3 (5 pts), boolean chains 3, loops 1 (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/perry-runtime/src/object/layout_probe.rs"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1854e8dc9b36a8ba394078f90642335619861ac567502ef1a9f73ab1e16ae3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::shapes::scan_shape_table_keys_mut (cognitive 52): perry_runtime::object::shapes::scan_shape_table_keys_mut has cognitive complexity 52 (threshold 15). Drivers by points: if/else 15 (33 pts), loops 9 (14 pts), boolean chains 5 (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/perry-runtime/src/object/shapes.rs"},"region":{"startLine":6009}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3c57e2e19b6fb9719b152deac24a5aefd76a77f4b00fe556815c593ed807a4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::transform_generator_closures_in_stmts (cognitive 52): perry_transform::generator::transform_generator_closures_in_stmts has cognitive complexity 52 (threshold 15). Drivers by points: if/else 11 (38 pts), loops 4 (9 pts), match/switch 2 (5 pts) (nesting depth added 35). Of this number, 51 points are the body\u0027s own statements and 1 belongs to one function item 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":"crates/perry-transform/src/generator/mod.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e33a5b50426bf96e96e9b5dda34b27898196aeea2223ae324f0e0e81464418"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::private_frame::lower_list (cognitive 52): perry_transform::generator::private_frame::lower_list has cognitive complexity 52 (threshold 15). Drivers by points: if/else 28 (80 pts), loops 9 (19 pts), match/switch 6 (15 pts), boolean chains 1 (nesting depth added 71). To reduce it, split the body into named stages: move each independent 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: 2 other methods here (perry_transform::generator::private_frame::lower_list::ids, perry_transform::generator::private_frame::lower_list::catch_binders) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/perry-transform/src/generator/private_frame.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced7c841401bdbe4b250fa3604824c178c47c355844106c21f034ceafd2b1a25"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::note_for_in_define_keys (cognitive 52): Gen::note_for_in_define_keys has cognitive complexity 52 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 6 (18 pts), match/switch 4 (12 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/gen/for_in.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"0726ba0df744de313f868f7037f8f7773d41fb9d4d9f7fba6c407d57fc5e2084"}},{"ruleId":"D2","level":"warning","message":{"text":"buffer_b1_validate.measure (cognitive 52): buffer_b1_validate.measure has cognitive complexity 52 (threshold 15). Drivers by points: if/else 7 (29 pts), ternaries 7 (12 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/buffer_b1_validate.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3796c59dabbd59bdcb52edf0ab43669098a73f700633601f32025b81af1b389e"}},{"ruleId":"D2","level":"warning","message":{"text":"buffer_b4_validate.measure (cognitive 52): buffer_b4_validate.measure has cognitive complexity 52 (threshold 15). Drivers by points: if/else 7 (29 pts), ternaries 7 (12 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/buffer_b4_validate.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"12782a3a276f03912769b967cf5063a4895f806755a36c52c63729263699e9f6"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_1090_evidence_report.render_markdown (cognitive 52): gc_1090_evidence_report.render_markdown has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (23 pts), ternaries 9 (18 pts), loops 7 (10 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":"scripts/gc_1090_evidence_report.py"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fce848e722ff0881a4108ba97057d565ab1773d26b0a521321cdc50f572113f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::definite_init::collect (cognitive 51): perry_codegen::collectors::definite_init::collect has cognitive complexity 51 (threshold 15). Drivers by points: if/else 11 (36 pts), loops 4 (9 pts), boolean chains 6 (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/perry-codegen/src/collectors/definite_init.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"230898455bbf19c84871709430fb2fa31489088ed9deb3335141bdf1901b8ffb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals (cognitive 51): perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals has cognitive complexity 51 (threshold 15). Drivers by points: if/else 47 (122 pts), match/switch 16 (36 pts), loops 16 (29 pts), boolean chains 9 (nesting depth added 108). To reduce it, split the body into named stages: move each independent 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: 5 other methods here (perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::expr_value_type, perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::collect_expr_writes_in_closure_stmts, perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::collect_direct_let_ids, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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/perry-codegen/src/collectors/pointer_locals.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfdb741c0cdc4675fd96f1a8b655c0812ac6ff78b2a14275758f22a707f193b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::scalar_method_dispatch::collect_module_dispatch_facts (cognitive 51): perry_codegen::collectors::scalar_method_dispatch::collect_module_dispatch_facts has cognitive complexity 51 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 9 (17 pts), boolean chains 10, 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/perry-codegen/src/collectors/scalar_method_dispatch.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d34e1057eeab516ea8b27bedf1ec0dada056eb69d4695f463f14a5a3dab48e0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::calls::fs::arm_fs (cognitive 51): perry_codegen::expr::calls::fs::arm_fs has cognitive complexity 51 (threshold 15). Drivers by points: if/else 34 (50 pts), 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/perry-codegen/src/expr/calls/fs.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1c79e0482b0a6cb988d47b3f0431dd21606532dc48793febc05d1a7b9017aa"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::compare_chain::try_lower (cognitive 51): perry_codegen::expr::compare_chain::try_lower has cognitive complexity 51 (threshold 15). Drivers by points: if/else 21 (34 pts), loops 8 (9 pts), boolean chains 5, match/switch 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/perry-codegen/src/expr/compare_chain.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"303084340c218e0bc3179157a9d46f1f140f05ff545ced31c15a88763c76cb97"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_desc::create_families::literal_iife (cognitive 51): perry_codegen::layout_desc::create_families::literal_iife has cognitive complexity 51 (threshold 15). Drivers by points: match/switch 9 (23 pts), if/else 10 (22 pts), boolean chains 5, loops 1 (nesting depth added 26). 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/perry-codegen/src/layout_desc/create_families.rs"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"28563d512d63132c4016d4f0be0b38edc3578c7ceae5c878d02c14dce2ffb0a6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_better_sqlite3::js_sqlite_stmt_all (cognitive 51): perry_ext_better_sqlite3::js_sqlite_stmt_all has cognitive complexity 51 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 3 (22 pts) (nesting depth added 39). 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/perry-ext-better-sqlite3/src/lib.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"8735b9eab9e4912b56099d35368d6a4042df2df3693f677a80179ec5e1f0c425"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::client_request_surface::dispatch_method (cognitive 51): perry_ext_http::client_request_surface::dispatch_method has cognitive complexity 51 (threshold 15). Drivers by points: if/else 18 (38 pts), boolean chains 8, match/switch 2 (3 pts), loops 1 (2 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/perry-ext-http/src/client_request_surface.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a5104fcdff57ed1488ad2681284f679e628a0e651e0f36b4869e91ec4d3524"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_net::tls::js_tls_connect (cognitive 51): perry_ext_net::tls::js_tls_connect has cognitive complexity 51 (threshold 15). Drivers by points: if/else 20 (38 pts), boolean chains 7, match/switch 2 (4 pts), loops 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/perry-ext-net/src/tls.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"7012d34577607218f7323c3dc3f92ed7eef54f515ad9ce4b59a261748c68fc27"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::block::lower_fn_body_block_stmt_inner (cognitive 51): perry_hir::lower_decl::block::lower_fn_body_block_stmt_inner has cognitive complexity 51 (threshold 15). Drivers by points: if/else 18 (35 pts), loops 7 (11 pts), boolean chains 4, match/switch 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/perry-hir/src/lower_decl/block.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0b2c0f00aadf1670f264cbf8d7a127dd8429a8b24cc18d39d0535c60ba8c09"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::closure::dispatch::bound::function_bind_observable (cognitive 51): perry_runtime::closure::dispatch::bound::function_bind_observable has cognitive complexity 51 (threshold 15). Drivers by points: if/else 37 (42 pts), boolean chains 9 (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/perry-runtime/src/closure/dispatch/bound.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05ac2aa09db2016215313e8fbce3b28f1d8032e1b1f281afe2da4031a1eb52d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_set_by_name::fast_paths::existing_own_data_overwrite (cognitive 51): perry_runtime::object::field_set_by_name::fast_paths::existing_own_data_overwrite has cognitive complexity 51 (threshold 15). Drivers by points: if/else 28 (40 pts), boolean chains 9, match/switch 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/perry-runtime/src/object/field_set_by_name/fast_paths.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b013b90a7bdbb660bc31030c35d6d8ed06075ebae4b6e688c8c593d5004a46"}},{"ruleId":"D2","level":"warning","message":{"text":"repsel_census.census_from_report (cognitive 51): repsel_census.census_from_report has cognitive complexity 51 (threshold 15). Drivers by points: if/else 25 (42 pts), boolean chains 7, loops 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":"scripts/compiler_output_harness/repsel_census.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"b096b841d9939865fcb73234c417b397a3bf8d8a58758fc122e05785ca7a5cda"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_1090_evidence_report.old_page_policy_summary (cognitive 51): gc_1090_evidence_report.old_page_policy_summary has cognitive complexity 51 (threshold 15). Drivers by points: if/else 18 (25 pts), ternaries 11 (15 pts), boolean chains 11 (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":"scripts/gc_1090_evidence_report.py"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e399093c8bf04b701d691ada60b5cd2fa92f1890c89a4521066826cac8a6359"}},{"ruleId":"D2","level":"warning","message":{"text":"native_result_ledger.scan_rows (cognitive 51): native_result_ledger.scan_rows has cognitive complexity 51 (threshold 15). Drivers by points: if/else 11 (38 pts), loops 4 (11 pts), boolean chains 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":"scripts/native_result_ledger.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"8195d4d52514a515199eadd3ed5c392cd72cc0f341a6d2c327b86eb5dd7d0367"}},{"ruleId":"D2","level":"warning","message":{"text":"perf_12015_lane.compare (cognitive 51): perf_12015_lane.compare has cognitive complexity 51 (threshold 15). Drivers by points: loops 9 (21 pts), if/else 4 (18 pts), ternaries 4 (12 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/perf_12015_lane.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c0f27dc673acc0d33a9a69d08d5a97f9a408177c5d8fb35db463531a30e3a7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::publish::tarball::create_project_tarball_with_includes (cognitive 50): perry::commands::publish::tarball::create_project_tarball_with_includes has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (37 pts), match/switch 2 (6 pts), loops 3 (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/perry/src/commands/publish/tarball.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad533709da710ea6342980b44f1b59605af877c850594c6447dec7de653036d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::entry_outline::max_func_id (cognitive 50): perry_codegen::codegen::entry_outline::max_func_id has cognitive complexity 50 (threshold 15). Drivers by points: loops 21 (36 pts), if/else 6 (14 pts) (nesting depth added 23). 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/perry-codegen/src/codegen/entry_outline.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0c53fcd1dd7424e4b9a43b01b8b9f91100325c9254087efad0ee0c80b664cd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_families::colouring (cognitive 50): perry_codegen::layout_families::colouring has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 11 (20 pts), match/switch 1 (3 pts), boolean chains 2 (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/perry-codegen/src/layout_families.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"084fe663d58744e9f3b7657abde4992a75b966722e17ab3e30039c581a3d4dc2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::root_reload::raw_facts (cognitive 50): perry_codegen::root_reload::raw_facts has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (32 pts), boolean chains 11, match/switch 3 (4 pts), loops 2 (3 pts) (nesting depth added 19). 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/perry-codegen/src/root_reload.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"da97f3653313ab27c4564ccae5561049012e6642af4ea21c36180c63010de75e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::native_module::process_module::try_process_module_methods (cognitive 50): perry_hir::lower::expr_call::native_module::process_module::try_process_module_methods has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (40 pts), match/switch 2 (7 pts), boolean chains 3 (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/perry-hir/src/lower/expr_call/native_module/process_module.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aedf48f9bd41d6c0e4ad467fd9f10a660e40c37998125a7e0b6a802b122db60"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::fs::dirent::js_fs_readdir_sync (cognitive 50): perry_runtime::fs::dirent::js_fs_readdir_sync has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 7 (21 pts), match/switch 2, boolean chains 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/fs/dirent.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0db0fe6356e506d6974caca9c61150940f92c941058b99c451aa0f6cbeea83"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::date_collator::format_parts_with_dtf_obj (cognitive 50): perry_runtime::intl::date_collator::format_parts_with_dtf_obj has cognitive complexity 50 (threshold 15). Drivers by points: if/else 25 (40 pts), match/switch 5 (8 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/perry-runtime/src/intl/date_collator.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"56841b6eb76d7e1ae0f34d6b8881990a9472471634fbc27ddfc7d24d99c715ce"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::replacer::property_list::stringify_object_with_array_replacer (cognitive 50): perry_runtime::json::replacer::property_list::stringify_object_with_array_replacer has cognitive complexity 50 (threshold 15). Drivers by points: if/else 19 (35 pts), loops 4 (8 pts), boolean chains 7 (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/perry-runtime/src/json/replacer/property_list.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece6a7932bbae1c412d87065377f391971f48e6af4b8b4c9c783ca3f895844b2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::parent_static::register_class_parent_dynamic (cognitive 50): perry_runtime::object::class_registry::parent_static::register_class_parent_dynamic has cognitive complexity 50 (threshold 15). Drivers by points: if/else 18 (29 pts), boolean chains 12, match/switch 4 (9 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/perry-runtime/src/object/class_registry/parent_static.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4011f90071f09d93c88c4a7280e96d9d62a1d1029792abb73d498f12d312956"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_call_method::collection_methods::dispatch_map_set (cognitive 50): perry_runtime::object::native_call_method::collection_methods::dispatch_map_set has cognitive complexity 50 (threshold 15). Drivers by points: if/else 20 (36 pts), match/switch 4 (10 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/perry-runtime/src/object/native_call_method/collection_methods.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"df461abd67f982d398aced0a3760e0ae043aae8aaf946f1ab782421b18ea7fc8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::promise::async_step::js_async_step_chain (cognitive 50): perry_runtime::promise::async_step::js_async_step_chain has cognitive complexity 50 (threshold 15). Drivers by points: if/else 33 (44 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/promise/async_step.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"a004930145d97316cb070b18dcad43cac2a4ee6c30b10af7ec96fd7783abe1af"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::aggregate_scalar::return_record_stmts_are_safe (cognitive 50): perry_transform::aggregate_scalar::return_record_stmts_are_safe has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (35 pts), boolean chains 7, loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 24). Of this number, 42 points are the body\u0027s own statements and 8 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/perry-transform/src/aggregate_scalar.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"814f633ce4cbd0a9574af9759c1a9a931abb1e6bad499dc326411a5a73daa21e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::factory_specialize::specialize_captured_class_factories::rewrite_to_specialized_class (cognitive 50): perry_transform::inline::factory_specialize::specialize_captured_class_factories::rewrite_to_specialized_class has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (29 pts), loops 6 (15 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (perry_transform::inline::factory_specialize::specialize_captured_class_factories, perry_transform::inline::factory_specialize::specialize_captured_class_factories::resolve_factory_return_class, perry_transform::inline::factory_specialize::specialize_captured_class_factories::visit_stmts, \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/perry-transform/src/inline/factory_specialize.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dabee54fa6fe8ae126e12043be0300a426e9fb6a4fccf2e8e260b594039d1c9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::unroll::refresh_in_stmt (cognitive 50): perry_transform::unroll::refresh_in_stmt has cognitive complexity 50 (threshold 15). Drivers by points: loops 11 (26 pts), if/else 11 (23 pts), match/switch 1 (nesting depth added 27). 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/perry-transform/src/unroll/mod.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"63628c942ffc814821238336c152c3da61c9f849d2ff4c3d488be28410f03dcb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::window::window_default_wnd_proc (cognitive 50): perry_ui_windows::window::window_default_wnd_proc has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (47 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 31). 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/perry-ui-windows/src/window.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d45821a3cd6d9ffbfc51a7a6523892d0d6eb2ed184cb699b2a9e0a863da12c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::int_valued_ta_locals::observe_stmts (cognitive 49): perry_codegen::collectors::int_valued_ta_locals::observe_stmts has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (41 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 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/perry-codegen/src/collectors/int_valued_ta_locals.rs"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c2deac76338563028418b9c9d02b6af05dd712b54e2edcc9967d986918ba35"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::scalar_method_dispatch::read_only_prototype_reads (cognitive 49): perry_codegen::collectors::scalar_method_dispatch::read_only_prototype_reads has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (37 pts), loops 5 (7 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 28). 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/perry-codegen/src/collectors/scalar_method_dispatch.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6fdd97b16840daca624320746c408a8dd09869e34dc4af318a3e9b0a94018e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::destructuring::var_decl_sources::register_destructured_stream_ctors (cognitive 49): perry_hir::destructuring::var_decl_sources::register_destructured_stream_ctors has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 7 (16 pts), loops 3 (6 pts), boolean chains 2 (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/perry-hir/src/destructuring/var_decl_sources.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccdc28dd061b65a432577fb1714da6c7344382f0d870e848854aeb6c18467d0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_parser::strip_comments_and_strings (cognitive 49): perry_parser::strip_comments_and_strings has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (42 pts), boolean chains 4, match/switch 1 (2 pts), 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/perry-parser/src/lib.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62fba48898a5d8429c2ae7cbd4882b7e281441309760a73c15c9db5ce347de5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::builtins::arithmetic::js_loose_eq (cognitive 49): perry_runtime::builtins::arithmetic::js_loose_eq has cognitive complexity 49 (threshold 15). Drivers by points: if/else 26 (35 pts), boolean chains 11, match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/builtins/arithmetic.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1489ef2a552b2d0811005deddc11c7eb5c6dba36462e930c974bd972322349"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::date::parse::parse_rfc_or_named (cognitive 49): perry_runtime::date::parse::parse_rfc_or_named has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (41 pts), boolean chains 6, loops 1, match/switch 1 (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/perry-runtime/src/date/parse.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"4953f3ee678e89ea6610bc8cdb2e14e50c3fe288dd288951de74c7a7e18a25df"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::locale::parse_language_tag (cognitive 49): perry_runtime::intl::locale::parse_language_tag has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (36 pts), loops 4 (8 pts), boolean chains 5 (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/perry-runtime/src/intl/locale.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69504240ad7ccd15e54a64e883763279de078f50ac5592175404ca987bcaa80"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::os_process_streams_build::build_stream_object_with_write (cognitive 49): perry_runtime::os_process_streams_build::build_stream_object_with_write has cognitive complexity 49 (threshold 15). Drivers by points: if/else 36 (47 pts), boolean chains 2 (nesting depth added 11). 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/perry-runtime/src/os_process_streams_build.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93b3aeb61195b21e96c9341609de2d5f4c6671d04abca8ebe588ea2072b5b33"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_ios::widgets::alert::topmost_view_controller (cognitive 49): perry_ui_ios::widgets::alert::topmost_view_controller has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (40 pts), loops 3 (8 pts), match/switch 1 (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/perry-ui-ios/src/widgets/alert.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"44cfe9604be2e6e6a43e9012522d7994305a413c189910aa26c8283352a15836"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_ios::widgets::rich_tooltip::find_key_window (cognitive 49): perry_ui_ios::widgets::rich_tooltip::find_key_window has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (42 pts), loops 2 (7 pts) (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/perry-ui-ios/src/widgets/rich_tooltip.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec19e6fbba69ae2043e48c2946e77218e33b4427471dff1a071131e4c7d13b8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_tvos::widgets::alert::topmost_view_controller (cognitive 49): perry_ui_tvos::widgets::alert::topmost_view_controller has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (40 pts), loops 3 (8 pts), match/switch 1 (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/perry-ui-tvos/src/widgets/alert.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b448c7e58bd9b6d71038a4a0a2d4dbf54991f1015618c5c7222b3b54c128cc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_visionos::widgets::alert::topmost_view_controller (cognitive 49): perry_ui_visionos::widgets::alert::topmost_view_controller has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (40 pts), loops 3 (8 pts), match/switch 1 (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/perry-ui-visionos/src/widgets/alert.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"573165c3be4afabec763a3cf7ed5246e9087a560dcc4dd53baa939b919108f80"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_visionos::widgets::rich_tooltip::find_key_window (cognitive 49): perry_ui_visionos::widgets::rich_tooltip::find_key_window has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (42 pts), loops 2 (7 pts) (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/perry-ui-visionos/src/widgets/rich_tooltip.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c125e71e1a73ebe22b8b1b0cf1a8351999d2b5c26c16cd43177faab77a94523"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::summary::compose::compose (cognitive 49): perry_wpfacts::summary::compose::compose has cognitive complexity 49 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 9 (20 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/perry-wpfacts/src/summary/compose.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da36de6c1fbe3a555a52db3676741d4f8e5480f87eee6680ccf9d5324be1cbf"}},{"ruleId":"D2","level":"warning","message":{"text":"check_ext_net_socket_open_invariant.mask_non_code (cognitive 49): check_ext_net_socket_open_invariant.mask_non_code has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (39 pts), loops 3 (7 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":"scripts/check_ext_net_socket_open_invariant.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a4dc508da9e70e5d553f8d87fe0733e62c12fee1ae0be744f8480fd803e6f0"}},{"ruleId":"D2","level":"warning","message":{"text":"verification.generic_native_rep_contract_results (cognitive 49): verification.generic_native_rep_contract_results has cognitive complexity 49 (threshold 15). Drivers by points: boolean chains 22, if/else 16 (21 pts), loops 3 (4 pts), ternaries 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":"scripts/compiler_output_harness/verification.py"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"9affaa81dfe39759c5dbc2e5242810e72b0773b1f9fca0f781b458a14a76e715"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check._tracked_across_statepoint (cognitive 49): gc_root_dominance_check._tracked_across_statepoint has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (33 pts), loops 6 (12 pts), boolean chains 4 (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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":5251}}}],"partialFingerprints":{"codehealthFindingId/v1":"207fa8c46897f90f89ab8fdb82d9caca226c972a59f9203431d22592386e65e5"}},{"ruleId":"D2","level":"warning","message":{"text":"server_ab.markdown (cognitive 49): server_ab.markdown has cognitive complexity 49 (threshold 15). Drivers by points: if/else 9 (27 pts), boolean chains 8, loops 4 (7 pts), ternaries 3 (7 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":"scripts/turnloop/server_ab.py"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2353cc94279846a78fe2c157cbfcc28851a3b41826f9e99dd8eec912ad23a89"}},{"ruleId":"D2","level":"warning","message":{"text":"ThisFlowAnalysis::expr_this_safe (cognitive 48): ThisFlowAnalysis::expr_this_safe has cognitive complexity 48 (threshold 15). Drivers by points: if/else 19 (41 pts), boolean chains 6, match/switch 1 (nesting depth added 22). 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/perry-codegen/src/collectors/ptr_shape_this_flow.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9de2a2a95d5325e71d1cba282e8b148aeeb2dfee86f442a3649dd8d55c45b5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::array_record_stack::lower (cognitive 48): perry_codegen::array_record_stack::lower has cognitive complexity 48 (threshold 15). Drivers by points: if/else 24 (47 pts), match/switch 1 (nesting depth added 23). 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/perry-codegen/src/array_record_stack.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e69f19049a0b8444c2aa729c18496c2c6ee2fdc95dca8d5a257e902e1287e9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::static_field_meta::lower_class_evaluation_object (cognitive 48): perry_codegen::expr::static_field_meta::lower_class_evaluation_object has cognitive complexity 48 (threshold 15). Drivers by points: if/else 20 (31 pts), loops 5 (8 pts), match/switch 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/perry-codegen/src/expr/static_field_meta.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"352df66b68e3ab4f59b898d732dd2f37cbd31288c4bc1c60823003d2b53293f2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::loops::emit_packed_f64_range_guards (cognitive 48): perry_codegen::stmt::loops::emit_packed_f64_range_guards has cognitive complexity 48 (threshold 15). Drivers by points: match/switch 6 (19 pts), if/else 6 (17 pts), loops 3 (10 pts), boolean chains 2 (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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":3346}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be1b394a181a7300ab4757a0be9e982e2720636f952c1311ac2ebc1fc2447be"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::analysis::replace_this_in_expr (cognitive 48): perry_hir::analysis::replace_this_in_expr has cognitive complexity 48 (threshold 15). Drivers by points: loops 15 (30 pts), if/else 5 (11 pts), match/switch 3 (7 pts) (nesting depth added 25). 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/perry-hir/src/analysis.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce080edc2bb6e350bb15c538b0c37a2da11ab4272884d2975062d7c71184e7e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::dynamic_import::collect_param_literal_sets_from_frames (cognitive 48): perry_hir::dynamic_import::collect_param_literal_sets_from_frames has cognitive complexity 48 (threshold 15). Drivers by points: if/else 9 (31 pts), loops 4 (12 pts), match/switch 2 (5 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/dynamic_import.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65cb494e625c7bce86a9f47b87ffb13e8b9929f25f89c3c93b036377e537212"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::js_transform::cross_module_natives::scan_for_native_func_returns (cognitive 48): perry_hir::js_transform::cross_module_natives::scan_for_native_func_returns has cognitive complexity 48 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 8 (20 pts), match/switch 3 (8 pts) (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/perry-hir/src/js_transform/cross_module_natives.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bdf1b3e0fb97cada6abb9b6164f62ea0fa75a32b77b8220dc167289e71d44f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::builder_fold::walk_expr (cognitive 48): perry_hir::lower::builder_fold::walk_expr has cognitive complexity 48 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 6 (13 pts), match/switch 4 (10 pts) (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/perry-hir/src/lower/builder_fold.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"629b79b0a20f0911a32b763c2144a48956b395acc8c59507c33fc81a0a329b2b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::imported_array_methods::try_imported_array_methods (cognitive 48): perry_hir::lower::expr_call::imported_array_methods::try_imported_array_methods has cognitive complexity 48 (threshold 15). Drivers by points: if/else 8 (33 pts), match/switch 2 (15 pts) (nesting depth added 38). 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/perry-hir/src/lower/expr_call/imported_array_methods.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"15772482421dbae9d39440c571122481dfe443ec7b8ebc6a6811722ff8a284cf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::fn_ctor_env::scan_stmt (cognitive 48): perry_hir::lower::fn_ctor_env::scan_stmt has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 7 (17 pts), match/switch 2 (3 pts) (nesting depth added 27). 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/perry-hir/src/lower/fn_ctor_env.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"0360dc824b72d509b9c28314bc09759c0d02fcb46fa8922c9dcd89226f927830"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::monomorph::defaults::fill_defaults_in_expr (cognitive 48): perry_hir::monomorph::defaults::fill_defaults_in_expr has cognitive complexity 48 (threshold 15). Drivers by points: loops 12 (27 pts), if/else 8 (20 pts), match/switch 1 (nesting depth added 27). 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/perry-hir/src/monomorph/defaults.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"4748949d9c4653b8e76d409f3eac0e024556c5b679ecb6e0efdfdd58c35fd136"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::monomorph::driver::monomorphize_with_context (cognitive 48): perry_hir::monomorph::driver::monomorphize_with_context has cognitive complexity 48 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 8 (18 pts), boolean chains 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/monomorph/driver.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"92edbb0926221bfd450a3c058bffd261f08a3cdfb752bea665e7e839fdfa2e49"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::array (cognitive 48): Writer::array has cognitive complexity 48 (threshold 15). Drivers by points: if/else 17 (38 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 25). 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/perry-runtime/src/thread/clone_write.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"98483ead4fc129ab528ff6100ae80e324f92f378b6871acfeba92dd56eb3fde3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::date::parse::parse_legacy_iso_tail (cognitive 48): perry_runtime::date::parse::parse_legacy_iso_tail has cognitive complexity 48 (threshold 15). Drivers by points: if/else 21 (44 pts), boolean chains 3, loops 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/perry-runtime/src/date/parse.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59aa0f2f7cdaff1ae88d68dc7f9caaa3c167dd12f1f4e6a1846d272e088dff4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::dyn_eval::expr::eval_call (cognitive 48): perry_runtime::dyn_eval::expr::eval_call has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (32 pts), boolean chains 12, match/switch 3 (4 pts) (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/perry-runtime/src/dyn_eval/expr.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97940fb93ad04beb1c29c10fa2e997af0e8b9edbd4f328604dd910428e7e116"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::descriptor_state::plain_custom_prototype_may_intercept (cognitive 48): perry_runtime::object::descriptor_state::plain_custom_prototype_may_intercept has cognitive complexity 48 (threshold 15). Drivers by points: if/else 23 (44 pts), boolean chains 3, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/descriptor_state.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"85389fc3864bf1d26b533c7ef526e018c639422b47d223f6c09cb63f4d6f5d67"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::timer::gc_scan::scan_store_step (cognitive 48): perry_runtime::timer::gc_scan::scan_store_step has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (37 pts), loops 3 (7 pts), match/switch 1 (4 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/perry-runtime/src/timer/gc_scan.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0e3f211701083b76ebbe1cc3e07a1a138b28f94d78b8d68a064bcd67d358ed"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::validators::received::received_native_fallback (cognitive 48): perry_runtime::validators::received::received_native_fallback has cognitive complexity 48 (threshold 15). Drivers by points: if/else 28 (38 pts), boolean chains 10 (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/perry-runtime/src/validators/received.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"632b24e6001f26edbbecf4f8190eedec7a0748b35f7a9481e00d828796bbadf2"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassContract::join (cognitive 48): ClassContract::join has cognitive complexity 48 (threshold 15). Drivers by points: match/switch 10 (18 pts), if/else 8 (15 pts), boolean chains 9, loops 6 (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/perry-wpfacts/src/units.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbde8e2adffcdd639a2274dec179fdf1a1f5a88fadb0ca0805a2a913cfd4bc4"}},{"ruleId":"D2","level":"warning","message":{"text":"native_abi_evidence_report.material_accounting_rows (cognitive 48): native_abi_evidence_report.material_accounting_rows has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (43 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (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":"scripts/native_abi_evidence_report.py"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"a318f1262d3ac428906782b8d1735f3560be8035037b8dc7594ed676d6d77f92"}},{"ruleId":"D2","level":"warning","message":{"text":"sso_unbox_inventory.apply_reviews (cognitive 48): sso_unbox_inventory.apply_reviews has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (33 pts), boolean chains 6, error handling 3 (5 pts), 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":"scripts/sso_unbox_inventory.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec13e946e8e24d7fd0920646f05538911f429db9657abc77a6c8d3277989f7b0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::resolve::find_file_dep_in_package_json (cognitive 47): perry::commands::compile::resolve::find_file_dep_in_package_json has cognitive complexity 47 (threshold 15). Drivers by points: if/else 8 (41 pts), loops 2 (6 pts) (nesting depth added 37). 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/perry/src/commands/compile/resolve.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf8c81d3be3c95a1fef1262349bd454dc431e72cd45397810cd65505f532cdf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::sync_program::why_module_not_synchronous (cognitive 47): perry::commands::compile::sync_program::why_module_not_synchronous has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 7 (11 pts), boolean chains 9, 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/perry/src/commands/compile/sync_program.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"99629856bed3f2d06b93a1bba7b012580b313075f47a22f3c3e0e0703607d880"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::run::entry::resolve_target (cognitive 47): perry::commands::run::entry::resolve_target has cognitive complexity 47 (threshold 15). Drivers by points: if/else 22 (42 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 22). 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/perry/src/commands/run/entry.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"3753bfb852b628c1ad140e64473566963b25c27c4d02eba77f8187021c03f647"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_component_host::driver::async_values::execute (cognitive 47): perry_component_host::driver::async_values::execute has cognitive complexity 47 (threshold 15). Drivers by points: if/else 30 (38 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 12). 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/perry-component-host/src/driver/async_values.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a4b412252619897f24446b4cc275c261c1488750c5021a6294bcdf1bdc38eb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::agent::agent_new_with_protocol (cognitive 47): perry_ext_http::agent::agent_new_with_protocol has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (41 pts), boolean chains 6 (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/perry-ext-http/src/agent.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7204acbe176e96abe02e7dde11f9f34293022710a79c9125c54b157d97a90d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_net::payload_tls::drive (cognitive 47): perry_ext_net::payload_tls::drive has cognitive complexity 47 (threshold 15). Drivers by points: if/else 28 (43 pts), boolean chains 2, loops 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/perry-ext-net/src/payload_tls.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce26a3ea4f40dd8fa639c65292a3d18abe589c90e47acb1d8d8667c2957ba38"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::closure_analysis::collect_closure_assigned_in_body_expr (cognitive 47): perry_hir::lower::closure_analysis::collect_closure_assigned_in_body_expr has cognitive complexity 47 (threshold 15). Drivers by points: loops 13 (26 pts), if/else 7 (14 pts), match/switch 3 (7 pts) (nesting depth added 24). 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/perry-hir/src/lower/closure_analysis.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"2403bdf73a41fa4be6b233713ab3813fd1ffdafe3631c78e1b9f9e1f07d5364d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::regex_string::try_regex_string_methods (cognitive 47): perry_hir::lower::expr_call::regex_string::try_regex_string_methods has cognitive complexity 47 (threshold 15). Drivers by points: if/else 9 (34 pts), match/switch 2 (10 pts), boolean chains 3 (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/perry-hir/src/lower/expr_call/regex_string.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c68452657457153e56b0e1c334ec47306bfcb5b6b1942539afe5a6f42b5a1bb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::fn_ctor_env::collect_fn_scope_names (cognitive 47): perry_hir::lower::fn_ctor_env::collect_fn_scope_names has cognitive complexity 47 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 6 (19 pts), match/switch 1 (2 pts) (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/perry-hir/src/lower/fn_ctor_env.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1275df07aab45e0968f9be3370b7361f935cccb0b5a1c17aeee08450ea75838"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::lower_expr::arm_bin::lower_bin_expr (cognitive 47): perry_hir::lower::lower_expr::arm_bin::lower_bin_expr has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (33 pts), match/switch 6 (12 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/perry-hir/src/lower/lower_expr/arm_bin.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0378374a0c0fa8789e868618267417662c3d748a0a7b80fa2f001f97d85b1a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::roots::stack_maps::fp_chain::visit (cognitive 47): perry_runtime::gc::roots::stack_maps::fp_chain::visit has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (38 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/gc/roots/stack_maps.rs"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fac668720cfe532d1eb91c2e30eb232fb2ca61aa50bd8cf89fcbbef3f4ae49"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::module_require::js_require_resolve_node_modules (cognitive 47): perry_runtime::module_require::js_require_resolve_node_modules has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (37 pts), loops 3 (5 pts), boolean chains 3, match/switch 1 (2 pts) (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/perry-runtime/src/module_require.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"3823045a3df975fc937bfe58816a8195eb1af625ac78c12e84ba853bbc107699"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_stream_pipeline::run_collected_pipeline (cognitive 47): perry_runtime::node_stream_pipeline::run_collected_pipeline has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (31 pts), match/switch 5 (14 pts), boolean chains 1, 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/perry-runtime/src/node_stream_pipeline.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"facc1466dc5ab526aa4de0bbeb3f3607404e1afd4dc816bc7987f30cfba82270"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_module::native_module_property_by_name_impl (cognitive 47): perry_runtime::object::native_module::native_module_property_by_name_impl has cognitive complexity 47 (threshold 15). Drivers by points: if/else 28 (32 pts), boolean chains 13, match/switch 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/perry-runtime/src/object/native_module.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b4db02d0a59e02311726c0848c30b85960bfc3e210cc74db9ebd890d8e2fa7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::static_shapes::finalized_constfn_facts (cognitive 47): perry_runtime::object::static_shapes::finalized_constfn_facts has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (34 pts), boolean chains 8, loops 3 (5 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/perry-runtime/src/object/static_shapes.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"984fd57e13004ca77de530c054e1620ffe320859233f065369ca54ddcbdd24a4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::path::win32_parse::parse_components (cognitive 47): perry_runtime::path::win32_parse::parse_components has cognitive complexity 47 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 5 (13 pts), boolean chains 11, match/switch 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/perry-runtime/src/path/win32_parse.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f9e7c19f392803c8426175addef0e98a94c417da147c1c5ab8ce2fa3aafd8f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::typedarray_props::typed_array_define_own_property (cognitive 47): perry_runtime::typedarray_props::typed_array_define_own_property has cognitive complexity 47 (threshold 15). Drivers by points: if/else 21 (39 pts), boolean chains 7, match/switch 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/perry-runtime/src/typedarray_props.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef6f44584b29b81abd7ad2234fc0ddee7268de20ea9e6a3ae79a81103d5a0cd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::value::equality::js_jsvalue_equals (cognitive 47): perry_runtime::value::equality::js_jsvalue_equals has cognitive complexity 47 (threshold 15). Drivers by points: if/else 25 (40 pts), boolean chains 7 (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/perry-runtime/src/value/equality.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"851332aa58e57cbfdd7e9d019c2deedafdc9f5a71ff46bd0c6120f7433f05ead"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::factory_specialize::specialize_captured_class_factories (cognitive 47): perry_transform::inline::factory_specialize::specialize_captured_class_factories has cognitive complexity 47 (threshold 15). Drivers by points: if/else 64 (135 pts), loops 20 (37 pts), match/switch 10 (13 pts), boolean chains 4 (nesting depth added 91). 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 (perry_transform::inline::factory_specialize::specialize_captured_class_factories::resolve_factory_return_class, perry_transform::inline::factory_specialize::specialize_captured_class_factories::visit_stmts, perry_transform::inline::factory_specialize::specialize_captured_class_factories::rewrite_call_init, \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/perry-transform/src/inline/factory_specialize.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6831fca0d958f14c404a8eb9cbeb3c55f2a5ca78183c109a74c7d8848c064969"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::widgets::handle_command (cognitive 47): perry_ui_windows::widgets::handle_command has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (35 pts), match/switch 6 (12 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/perry-ui-windows/src/widgets/mod.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c00a3953758a1b15453cda58ae7723a022b0d3aada76b20063cd4032cda0ab"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_snapshot_contracts.snapshot_contract_problems (cognitive 47): gc_snapshot_contracts.snapshot_contract_problems has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 10, 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":"scripts/gc_snapshot_contracts.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac8be6546bc4f4eaaddcdd64ae0dfc5cd90ba41c07f47a453729bc66d37add5"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime_abi_check.check_ir (cognitive 47): runtime_abi_check.check_ir has cognitive complexity 47 (threshold 15). Drivers by points: if/else 7 (24 pts), loops 7 (11 pts), ternaries 3 (9 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":"scripts/runtime_abi_check.py"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e4919acb3c1a19f699e4dcfa27d6d185dccb16d4477b307cae9c8135756b68"}},{"ruleId":"D2","level":"warning","message":{"text":"release.ensureTagAndRelease (cognitive 47): release.ensureTagAndRelease has cognitive complexity 47 (threshold 15). Drivers by points: if/else 21 (32 pts), error handling 3 (6 pts), boolean chains 4, loops 2 (3 pts), ternaries 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":"scripts/publish/release.mts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcc6a15dce2b65fb993fd0cc750163c5e643c8d514183c6cf83519ed0a51845"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::doctor::run (cognitive 46): perry::commands::doctor::run has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (35 pts), loops 2 (5 pts), match/switch 3 (5 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/perry/src/commands/doctor.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"674b77581c8a96bf59471f2b6d4c1694936e14b4cdd2a05cd4b5108ca98b473f"}},{"ruleId":"D2","level":"warning","message":{"text":"Walk::stmt (cognitive 46): Walk::stmt has cognitive complexity 46 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 4 (9 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 24). 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/perry-codegen/src/collectors/read_before_write.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a59aeea95f400b0549ebd0fa9425c2ff98ce89c3b6b33c31ee892862f0e7ef3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::opt_report::render::render_text_with_sources (cognitive 46): perry_codegen::opt_report::render::render_text_with_sources has cognitive complexity 46 (threshold 15). Drivers by points: if/else 22 (34 pts), loops 7 (11 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/perry-codegen/src/opt_report/render.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"082d004b8ce38d977557fc82498a64661053e632ffda61364bab121ab7ed8c97"}},{"ruleId":"D2","level":"warning","message":{"text":"WasmModuleEmitter::emit_js_stmt (cognitive 46): WasmModuleEmitter::emit_js_stmt has cognitive complexity 46 (threshold 15). Drivers by points: loops 10 (24 pts), if/else 11 (21 pts), match/switch 1 (nesting depth added 24). 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/perry-codegen-wasm/src/emit/js_fallback.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6747d03097417c2529e49eaffc3b7788bdf0371925be06ce6a268ba17b8b0a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::dynamic_import::resolve_import_path_with_context (cognitive 46): perry_hir::dynamic_import::resolve_import_path_with_context has cognitive complexity 46 (threshold 15). Drivers by points: loops 7 (20 pts), if/else 7 (15 pts), match/switch 5 (10 pts), boolean chains 1 (nesting depth added 26). 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/perry-hir/src/dynamic_import.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1b7255a4c01504ea50e48b245a07665832eb88e94e85c5df170a39a9521f41"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::closure_analysis::widen_mutable_captures_expr (cognitive 46): perry_hir::lower::closure_analysis::widen_mutable_captures_expr has cognitive complexity 46 (threshold 15). Drivers by points: loops 12 (24 pts), if/else 7 (15 pts), match/switch 3 (7 pts) (nesting depth added 24). 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/perry-hir/src/lower/closure_analysis.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9881a79786d218e258011ec62cd33a588517c1123e88fa4abfad262ce93b90"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::nested_namespace::try_web_crypto_subtle (cognitive 46): perry_hir::lower::expr_call::nested_namespace::try_web_crypto_subtle has cognitive complexity 46 (threshold 15). Drivers by points: if/else 7 (28 pts), match/switch 2 (17 pts), boolean chains 1 (nesting depth added 36). 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/perry-hir/src/lower/expr_call/nested_namespace.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6e042a3dd4f11b00c2683692c04f6f2b83c4b7ab47aee39f10c348d1ed28ef"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::shared_mutable_capture::for_each_nested_capture (cognitive 46): perry_hir::lower::shared_mutable_capture::for_each_nested_capture has cognitive complexity 46 (threshold 15). Drivers by points: if/else 6 (26 pts), loops 7 (20 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/shared_mutable_capture.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8992767fc67ba71333fb85129a5743e4f08ba8b41e6323a907ffecb33d276c4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::arena::reset::arena_reset_empty_blocks (cognitive 46): perry_runtime::arena::reset::arena_reset_empty_blocks has cognitive complexity 46 (threshold 15). Drivers by points: if/else 20 (36 pts), boolean chains 6, loops 3 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/arena/reset.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c16f52d01aaa0af6491b97a52bebb1171d560c94f2d2268adb6a9c45a106186"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::concat_reverse::js_array_concat (cognitive 46): perry_runtime::array::concat_reverse::js_array_concat has cognitive complexity 46 (threshold 15). Drivers by points: if/else 23 (37 pts), loops 3 (5 pts), boolean chains 4 (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/perry-runtime/src/array/concat_reverse.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"475ed2da846b6b90b7f008f8117df1bc60cf6c585a4e3ab3c0cf4919a5bd031f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::splice_slice::js_array_splice (cognitive 46): perry_runtime::array::splice_slice::js_array_splice has cognitive complexity 46 (threshold 15). Drivers by points: if/else 27 (33 pts), loops 4 (9 pts), boolean chains 4 (nesting depth added 11). 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/perry-runtime/src/array/splice_slice.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae0a91d1dbeb36feb212aa8bdb137ae84034c9886c15f8ac27f8893ffedccac"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::process::node_module::module_strip_type_aliases (cognitive 46): perry_runtime::process::node_module::module_strip_type_aliases has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 2 (9 pts), loops 4 (8 pts), boolean chains 5 (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/perry-runtime/src/process/node_module.rs"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5f54eeae954c4e3756b16c2a633fc110a0449c88a8c0b0a702e9a78182c190"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::async_to_generator::hoist_awaits_in_stmt (cognitive 46): perry_transform::async_to_generator::hoist_awaits_in_stmt has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (36 pts), loops 3 (7 pts), boolean chains 2, match/switch 1 (nesting depth added 23). 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/perry-transform/src/async_to_generator.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0bc7150c789230e0598409dadb230ac92c1a388060302c46da1357b9e52491"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::i18n::apply_i18n (cognitive 46): perry_transform::i18n::apply_i18n has cognitive complexity 46 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 15 (23 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/perry-transform/src/i18n.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"470e4a12c956c62edebea7673ef6fc2e3d3f1f45c2314c02d08479043d8b6bd0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_gtk4::state::state_set (cognitive 46): perry_ui_gtk4::state::state_set has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (31 pts), loops 8 (14 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/perry-ui-gtk4/src/state.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"81744a73e657ca06449a45dfea942aecd49df285dcc4e4e2559e3bc926c24df7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_ios::app::key_window_root_vc (cognitive 46): perry_ui_ios::app::key_window_root_vc has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (38 pts), loops 2 (7 pts), match/switch 1 (nesting depth added 31). 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/perry-ui-ios/src/app.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff63f0e77d1bc4b19c0649ff9caa6e78b3a7c1161b5083343e40d6c3ccb97e6f"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::reports (cognitive 46): Gen::reports has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 6 (11 pts), boolean chains 7, match/switch 1 (2 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/perry-wpfacts/src/gen.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade4af494a2d4898ef02748d95bf1e8c7fa0626ce542ccbd705c6c10ee0829f4"}},{"ruleId":"D2","level":"warning","message":{"text":"buffer_b5_validate.measure (cognitive 46): buffer_b5_validate.measure has cognitive complexity 46 (threshold 15). Drivers by points: if/else 7 (28 pts), ternaries 7 (12 pts), loops 3 (6 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":"scripts/buffer_b5_validate.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebda2d3ada11dc19b1a1a962bfd97dd22d66b92ae2c548734e76ff82282b7ef9"}},{"ruleId":"D2","level":"warning","message":{"text":"check_gc_scanner_latches.scan_source (cognitive 46): check_gc_scanner_latches.scan_source has cognitive complexity 46 (threshold 15). Drivers by points: if/else 8 (29 pts), loops 6 (13 pts), boolean chains 4 (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":"scripts/check_gc_scanner_latches.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c6df671a28b65f4cc26f7fd60c808443a4f585b33143c734a5e409d996a4c8"}},{"ruleId":"D2","level":"warning","message":{"text":"check_thread_locals.cfg_test_module_files (cognitive 46): check_thread_locals.cfg_test_module_files has cognitive complexity 46 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 8 (21 pts), ternaries 1 (4 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":"scripts/check_thread_locals.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"887441d8e80b761f07569924b22a91460752c1713abf3db197cf9889a8c0ebe6"}},{"ruleId":"D2","level":"warning","message":{"text":"server_ab.run (cognitive 46): server_ab.run has cognitive complexity 46 (threshold 15). Drivers by points: loops 8 (21 pts), if/else 11 (15 pts), ternaries 2 (5 pts), error handling 1 (4 pts), boolean chains 1 (nesting depth added 23). 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":"scripts/turnloop/server_ab.py"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66c6fb1a40a9c55b71de7c646f1dd612d7499474fe800251853e97ae8bef400"}},{"ruleId":"D2","level":"warning","message":{"text":"wpfacts_recompute.load (cognitive 46): wpfacts_recompute.load has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 7 (28 pts), if/else 5 (15 pts), loops 2, boolean chains 1 (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":"scripts/wpfacts_recompute.py"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df04908b9386f2eee52f8358eb058c96a1f47b89eb6024aa963707f3b6a8aad"}},{"ruleId":"D2","level":"warning","message":{"text":"Uses::visit_call_expr (cognitive 45): Uses::visit_call_expr has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (44 pts), boolean chains 1 (nesting depth added 31). 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/perry/src/commands/compile/cjs_wrap/run_once_syntax.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c87d138572622fed5c0f0f6770ec58ec072d833095a24d5b745bcb55d7b89b7"}},{"ruleId":"D2","level":"warning","message":{"text":"Fixer::find_issues_in_class (cognitive 45): Fixer::find_issues_in_class has cognitive complexity 45 (threshold 15). Drivers by points: if/else 7 (31 pts), loops 3 (8 pts), match/switch 2 (6 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/fixer.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02f326fe24592718b25f351b013a18b7491125d43118e79995a2733103ec639"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::size_report::build_report (cognitive 45): perry::commands::compile::size_report::build_report has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 8 (11 pts), match/switch 2 (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/perry/src/commands/compile/size_report.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed5e5976cf0166491b18cbbbda9ccb16fa7da881c5193b581a3968dec0d0ef0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::param_ranges::collect_param_int_ranges (cognitive 45): perry_codegen::collectors::param_ranges::collect_param_int_ranges has cognitive complexity 45 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 11 (18 pts), match/switch 2 (5 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/perry-codegen/src/collectors/param_ranges.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"32be4221e5f95381d9fae202450372ef7d7a4d350d330c36af27a1dc415eeaa9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::inprocess::native_homes::collecting_loop_blocks (cognitive 45): perry_codegen::inprocess::native_homes::collecting_loop_blocks has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 9 (17 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/perry-codegen/src/inprocess/native_homes.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"955780b34b358feb4968f6a7d69271618ef9a530b2f6954c49b86eb48c534e79"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_families::program_families (cognitive 45): perry_codegen::layout_families::program_families has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 6 (12 pts), match/switch 2 (6 pts), boolean chains 4 (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/perry-codegen/src/layout_families.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d9c2d4d7fab62e64dac721d51d5a930e1bf37b6a8208010a61d5d5d93bde5c"}},{"ruleId":"D2","level":"warning","message":{"text":"CensusScanner::visit_class (cognitive 45): CensusScanner::visit_class has cognitive complexity 45 (threshold 15). Drivers by points: if/else 7 (23 pts), match/switch 5 (18 pts), loops 2 (4 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/perry-hir/src/proto_census.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf6c730b5c9bb41533205538325cf04b99737f7e99b896065e7a8f8721c4dd3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::nested_namespace::dispatch_path_subnamespace (cognitive 45): perry_hir::lower::expr_call::nested_namespace::dispatch_path_subnamespace has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (27 pts), loops 4 (12 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/nested_namespace.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"a907adba3ca5827419738aac0e79d2578a1bfff3237a5739ce66e939b4ae8ae8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::post_args_dispatch::try_object_has_own_call (cognitive 45): perry_hir::lower::expr_call::post_args_dispatch::try_object_has_own_call has cognitive complexity 45 (threshold 15). Drivers by points: if/else 8 (36 pts), match/switch 1 (8 pts), boolean chains 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/perry-hir/src/lower/expr_call/post_args_dispatch.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"626a0ecee473e04ff29d4711ffd10cc9da5b8c9cc6aa7677742461e539da72b1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_types::extract::lower_decorators (cognitive 45): perry_hir::lower_types::extract::lower_decorators has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (44 pts), match/switch 1 (nesting depth added 33). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_types/extract.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc86890715b6e7a0901e50e1ddbf911ff4b35d303515e69f1a8e473c8a62f35"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::buffer::u8_codec::base64_decode_strict (cognitive 45): perry_runtime::buffer::u8_codec::base64_decode_strict has cognitive complexity 45 (threshold 15). Drivers by points: if/else 21 (38 pts), boolean chains 6, 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/perry-runtime/src/buffer/u8_codec.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18262402abd308ee0b1bd22f263100727bc3709368a688e04a748071db4141c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::locales_from_value (cognitive 45): perry_runtime::intl::locales_from_value has cognitive complexity 45 (threshold 15). Drivers by points: if/else 21 (35 pts), loops 4 (7 pts), boolean chains 3 (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/perry-runtime/src/intl.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5521702d87afa83d9168e8aa9b0dc2b1a36db4f5c2fa660218974fae9a39f3d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::parser_depth_blocks::nesting_depth_exceeds (cognitive 45): perry_runtime::json::parser_depth_blocks::nesting_depth_exceeds has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (33 pts), loops 4 (8 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/perry-runtime/src/json/parser_depth_blocks.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6562b7bd5c22fab9c75da36bc3feba2a1696bfec3e2d922cee45b8488d0fcc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::transform_generators (cognitive 45): perry_transform::generator::transform_generators has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (33 pts), loops 8 (12 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/perry-transform/src/generator/mod.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2dab55df859a2676f485c6d2c1dcda0fed0bed1b43576854d428620208ee443"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::closure_analysis::find_max_local_id::check_stmt (cognitive 45): perry_transform::inline::closure_analysis::find_max_local_id::check_stmt has cognitive complexity 45 (threshold 15). Drivers by points: loops 11 (26 pts), if/else 9 (18 pts), match/switch 1 (nesting depth added 24). 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/perry-transform/src/inline/closure_analysis.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb52e5ff11536b004b17a34fbf69ba251c25727aa5166a8d4ba64797041a771"}},{"ruleId":"D2","level":"warning","message":{"text":"Session::finish (cognitive 44): Session::finish has cognitive complexity 44 (threshold 15). Drivers by points: if/else 19 (32 pts), loops 6 (7 pts), 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/perry/src/commands/compile/reach_report.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f12785d2fb661ece72b4e7f532e4a0eaa51a192cd44e043f3c1b9a540a6973"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::collect_modules::native_addon::discovery::collect_declared_addons (cognitive 44): perry::commands::compile::collect_modules::native_addon::discovery::collect_declared_addons has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 8 (15 pts), boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/collect_modules/native_addon/discovery.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42c8426a5e4724e201dd6a533791cd7c8da812f78c6e49e214357c30e0b69cd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_cli_support::dotenv::parse_record (cognitive 44): perry_cli_support::dotenv::parse_record has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 11, loops 2 (4 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/perry-cli-support/src/dotenv.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da000553e55f938c5f336d662301f527e065deb3dcffe0e45c6860094a348bc"}},{"ruleId":"D2","level":"warning","message":{"text":"Build::stmt (cognitive 44): Build::stmt has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (41 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 25). 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/perry-codegen/src/codegen/source_need/flow.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"528ba70b648b5c090d6ed69e74e0985ba477443556b510395f9dad66864f3e52"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeRepSummary::from_records (cognitive 44): NativeRepSummary::from_records has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 10, loops 4 (7 pts), match/switch 2 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/native_value/artifact.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bba080f0a1ce54a8946ef7c323630955973f97b91bcccc54521f578913e7f78"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::property_get::helpers::lower_raw_f64_class_field_get_for_number_context (cognitive 44): perry_codegen::expr::property_get::helpers::lower_raw_f64_class_field_get_for_number_context has cognitive complexity 44 (threshold 15). Drivers by points: if/else 23 (37 pts), match/switch 1 (4 pts), boolean chains 3 (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/perry-codegen/src/expr/property_get/helpers.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5b98401df15d55245ec9e533b0fbe8cc133a7f219ea5e3a9b7f22a513a2feb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::indexed_owner_loop::numeric (cognitive 44): perry_codegen::stmt::indexed_owner_loop::numeric has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (26 pts), match/switch 8 (16 pts), loops 1 (2 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/perry-codegen/src/stmt/indexed_owner_loop.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e30782e28e53b4e03cf1375f656cae9017e25408b7395a4bd26a846abd6b0ea"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_diagnostics::compat_report::verify_redaction_invariants (cognitive 44): perry_diagnostics::compat_report::verify_redaction_invariants has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (38 pts), loops 2 (4 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/perry-diagnostics/src/compat_report.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a3f897cf2e4ba7d7d6420c9b34eb1c3c680a4742b981d828972b58fe089a27"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_net::payload_socket::write (cognitive 44): perry_ext_net::payload_socket::write has cognitive complexity 44 (threshold 15). Drivers by points: if/else 22 (35 pts), match/switch 3 (5 pts), boolean chains 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-net/src/payload_socket.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e87738b5a5deffd89f2340d6a0aaf5610e967e8e586755ce320aeca5d966b1f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_pdf::serde_json_lite::parse_value (cognitive 44): perry_ext_pdf::serde_json_lite::parse_value has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (32 pts), loops 5 (10 pts), boolean chains 1, match/switch 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/perry-ext-pdf/src/lib.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"9483faef1d61551b64f298f63148687274ec1fe163efe0afb32e0b24c9a0dd49"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_object::lower_method_prop (cognitive 44): perry_hir::lower::expr_object::lower_method_prop has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 8, loops 5 (6 pts), match/switch 4 (6 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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d738e9d21de254bb65d31fe69be1c1be8effac4f8d892df286800583e48ee1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::fn_ctor_env::build_fn_ctor_env (cognitive 44): perry_hir::lower::fn_ctor_env::build_fn_ctor_env has cognitive complexity 44 (threshold 15). Drivers by points: if/else 19 (39 pts), loops 8 (11 pts), match/switch 4 (9 pts), boolean chains 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (perry_hir::lower::fn_ctor_env::build_fn_ctor_env::collect_fn_decl_kinds) 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/perry-hir/src/lower/fn_ctor_env.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded8689d33836aa84e84f58bbe7c2d8eb44b15ad7f94fbafd6ffe700d6a1188d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::stringify_proxy::try_stringify (cognitive 44): perry_runtime::json::stringify_proxy::try_stringify has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), loops 3 (7 pts), match/switch 4 (6 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/json/stringify_proxy.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71e8c5155e4a2ddd47f9b0cd80661ae0a828278bab003d0d691732349eb84c0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::exotic_expando::exotic_define_own_property (cognitive 44): perry_runtime::object::exotic_expando::exotic_define_own_property has cognitive complexity 44 (threshold 15). Drivers by points: if/else 28 (39 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/perry-runtime/src/object/exotic_expando.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4491c366bd279195a361c21e27ad2fb9a619b4cbcac5a74eba13ad74a3a83f9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::value::dynamic_object::js_value_length_f64 (cognitive 44): perry_runtime::value::dynamic_object::js_value_length_f64 has cognitive complexity 44 (threshold 15). Drivers by points: if/else 22 (39 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/value/dynamic_object.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e71af8ab4f392501a8d96be9d1cac977579fb02d89460c733a7a06f8e13d87"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_gtk4::app::app_run (cognitive 44): perry_ui_gtk4::app::app_run has cognitive complexity 44 (threshold 15). Drivers by points: if/else 19 (35 pts), match/switch 2 (6 pts), loops 2, 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/perry-ui-gtk4/src/app.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"febd5ee92b50032abc2450002c0efec11561edeefa6e32920953d945145397cf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_macos::widgets::clear_children (cognitive 44): perry_ui_macos::widgets::clear_children has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (28 pts), loops 5 (16 pts) (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/perry-ui-macos/src/widgets/mod.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"775702a00b8a282ba645f15daccd3469082d3d13234e12c0a03ce440eb5be94e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::summary::compose::expand (cognitive 44): perry_wpfacts::summary::compose::expand has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 13 (18 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/summary/compose.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"1deb60c26c9398031d4ab26fe4753cb66a1f574a1cace134dd2b912df4625f0a"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze-current0ed-native-v17.analyze (cognitive 44): analyze-current0ed-native-v17.analyze has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 11, loops 7 (8 pts), ternaries 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":"docs/audits/gc-rss-instructions-2026-10-03/analyze-current0ed-native-v17.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0f343950011b2d0efe534773cafae095f07367de61f67e83ae7ebe7ac36c40"}},{"ruleId":"D2","level":"warning","message":{"text":"check_gate_freshness.self_test (cognitive 44): check_gate_freshness.self_test has cognitive complexity 44 (threshold 15). Drivers by points: if/else 24, boolean chains 17, loops 1 (2 pts), ternaries 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":"scripts/check_gate_freshness.py"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf7b7608ed8d58c121745188518f868695a49b32d54ea06eef14cf5c8204b6c"}},{"ruleId":"D2","level":"warning","message":{"text":"gate_failure_watch.check_config (cognitive 44): gate_failure_watch.check_config has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 8, loops 4 (8 pts), ternaries 1 (3 pts), error handling 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":"scripts/gate_failure_watch.py"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4be3cd8856ba76a5a7dafb3777afbb91afa7daa1c54da6ca8155550e9bef34"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_gate_wiring_check.check_gate (cognitive 44): gc_gate_wiring_check.check_gate has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (31 pts), boolean chains 8, loops 4 (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":"scripts/gc_gate_wiring_check.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd67adc4ae60bb484b1c59fc398650bb0c1cb0e15379f2f7a092760702e267a3"}},{"ruleId":"D2","level":"warning","message":{"text":"wpfacts_corpus.run_corpus (cognitive 44): wpfacts_corpus.run_corpus has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 8 (19 pts), if/else 8 (18 pts), loops 3 (4 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":"scripts/wpfacts_corpus.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb4dd0a95df66613304b8b28589cd7cc46a5aba9792cf83175f233393227d1b"}},{"ruleId":"D2","level":"warning","message":{"text":"Solver.call_tok (cognitive 44): Solver.call_tok has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 6 (13 pts) (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":"scripts/wpfacts_recompute.py"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd9ea487824c1bd9259f0bcd122769103adb5231d072fe4d35c79185ae5640a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::hoist_classes::collect_top_level_function_decls (cognitive 43): perry::commands::compile::cjs_wrap::hoist_classes::collect_top_level_function_decls has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 5 (8 pts), match/switch 3 (8 pts), boolean chains 7 (nesting depth added 19). Of this number, 41 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":"crates/perry/src/commands/compile/cjs_wrap/hoist_classes.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"df573e35126d0911c7452d927a0168f95ec4cb4de325df8a35caed8715aa2df8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::hoist_classes::source_has_top_level_return (cognitive 43): perry::commands::compile::cjs_wrap::hoist_classes::source_has_top_level_return has cognitive complexity 43 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 5 (13 pts), boolean chains 12, match/switch 1 (2 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/perry/src/commands/compile/cjs_wrap/hoist_classes.rs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"3298ef36387ac08ad64babbd58a7b0000ec4d67dfaea7b3b0cd7e011a1229547"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::library_search::find_msvc_link_exe (cognitive 43): perry::commands::compile::library_search::find_msvc_link_exe has cognitive complexity 43 (threshold 15). Drivers by points: if/else 7 (29 pts), loops 3 (14 pts) (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/perry/src/commands/compile/library_search.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6742fcdfcb7fafacecd176e85bf3180d03077c2800a432d60d6e008996decb7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::tiny_program::analysis::analyze_module (cognitive 43): perry::commands::compile::tiny_program::analysis::analyze_module has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (31 pts), match/switch 2 (5 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/tiny_program/analysis.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"497b6d99d37d1d490916b9a4b3608978e320ff0b7ca77244cd2c1849c4f3b6c0"}},{"ruleId":"D2","level":"warning","message":{"text":"Census::capture (cognitive 43): Census::capture has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 7 (18 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/perry-codegen/src/codegen/reach_report.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"577ae98a4b3d76317b16a5b443581b5efa72e16c2ad749e00fe0d362572da55b"}},{"ruleId":"D2","level":"warning","message":{"text":"Build::call (cognitive 43): Build::call has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 3 (8 pts), boolean chains 7, match/switch 1 (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/source_need/flow.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fcb2028ef245d07207695ec670a103f1900f9e2f54a045543d1744fbefa9c8"}},{"ruleId":"D2","level":"warning","message":{"text":"LlFunction::proof_dominates_block_end (cognitive 43): LlFunction::proof_dominates_block_end has cognitive complexity 43 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 5 (13 pts), boolean chains 3, match/switch 1 (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/perry-codegen/src/function/proof_dominance.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6f24bbc6f3993aa909c024f542b0161150dcb4b2839cae76cbd60c9ccac57b"}},{"ruleId":"D2","level":"warning","message":{"text":"LlFunction::for_each_final_item (cognitive 43): LlFunction::for_each_final_item has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 5 (13 pts), boolean chains 2 (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/perry-codegen/src/function.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf7f717a7112ee077d7861933c72734719963abf6ea75efb09ef4cff7b1bdd3"}},{"ruleId":"D2","level":"warning","message":{"text":"Plan::body (cognitive 43): Plan::body has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (37 pts), boolean chains 3, match/switch 1 (2 pts), loops 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/perry-codegen/src/stmt/indexed_owner_loop.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ba8c96564e05c45fb108d9a7f28836050f8da721c41492d70eff70af7bc144"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::closure_collect::collect_module_closures (cognitive 43): perry_codegen::codegen::closure_collect::collect_module_closures has cognitive complexity 43 (threshold 15). Drivers by points: if/else 19 (25 pts), loops 8 (14 pts), boolean chains 4 (nesting depth added 12). 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/perry-codegen/src/codegen/closure_collect.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"412ef035539f1a7c892f9b2daf63919ed987b5367176138b2feff21c24f01b54"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::string_pool::image_uses::fold (cognitive 43): perry_codegen::codegen::string_pool::image_uses::fold has cognitive complexity 43 (threshold 15). Drivers by points: if/else 5 (22 pts), loops 7 (16 pts), match/switch 1 (4 pts), boolean chains 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/perry-codegen/src/codegen/string_pool/image_uses.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"413f4a747ddc3461046c3531739a3c578cd5108aac08c79de7f0095adf982bf2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::array_literal::emit_array_from_lowered_values (cognitive 43): perry_codegen::expr::array_literal::emit_array_from_lowered_values has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 7 (16 pts), match/switch 2 (6 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/perry-codegen/src/expr/array_literal.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85500d269cf1b6ae66d92d3c0ebe64bd1ff759d8d16ae3bb31deb87b65fb9ca"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::env_clones::lower (cognitive 43): perry_codegen::expr::env_clones::lower has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (27 pts), match/switch 8 (16 pts) (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/env_clones.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd4c13dc8413f60d7f337cd3ee527a804b54893cc0092a16fe6f8cf3fd0a4fd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::property_get::promise_chain::try_lower_promise_chain_method (cognitive 43): perry_codegen::lower_call::property_get::promise_chain::try_lower_promise_chain_method has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (39 pts), boolean chains 2, match/switch 1 (2 pts) (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/perry-codegen/src/lower_call/property_get/promise_chain.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1550808731649a562fb9d396ebea3f23a5a1718714d3d78d855b42a878c438cc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_wasm::emit::locals::collect_locals (cognitive 43): perry_codegen_wasm::emit::locals::collect_locals has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (34 pts), loops 3 (7 pts), 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/perry-codegen-wasm/src/emit/locals.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4107867b1e9e2f015d2eb897e0b80769aba1b4571d95c48b81673c486ebb00a7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_better_sqlite3::js_sqlite_stmt_get (cognitive 43): perry_ext_better_sqlite3::js_sqlite_stmt_get has cognitive complexity 43 (threshold 15). Drivers by points: if/else 7 (28 pts), loops 2 (15 pts) (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/perry-ext-better-sqlite3/src/lib.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d3c05f21d25c907335a8ec5b34bdd48a3c437c83ac155e46e159c7c1a981d4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::builder_fold::fold_module_stmt_run (cognitive 43): perry_hir::lower::builder_fold::fold_module_stmt_run has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (27 pts), match/switch 4 (10 pts), loops 3 (5 pts), boolean chains 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/perry-hir/src/lower/builder_fold.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"7605a728d25a2ff71d0afb0903ad95e28789b18aeb1efe9b61053561b84f803e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::closure_analysis::collect_closure_assigned_expr (cognitive 43): perry_hir::lower::closure_analysis::collect_closure_assigned_expr has cognitive complexity 43 (threshold 15). Drivers by points: loops 12 (24 pts), if/else 6 (12 pts), match/switch 3 (7 pts) (nesting depth added 22). 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/perry-hir/src/lower/closure_analysis.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc77332b7d78d51f9b3be6b53210f586bc256621166029488c4bdc04728d0c3e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::closure_analysis::collect_closure_captures_expr (cognitive 43): perry_hir::lower::closure_analysis::collect_closure_captures_expr has cognitive complexity 43 (threshold 15). Drivers by points: loops 12 (24 pts), if/else 6 (12 pts), match/switch 3 (7 pts) (nesting depth added 22). 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/perry-hir/src/lower/closure_analysis.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c32c051e620f9af6bb6724cda3e8f0b84f1b30bd6b4a71225333760c678465"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::intrinsics::eval_strict::expr_has_violation (cognitive 43): perry_hir::lower::expr_call::intrinsics::eval_strict::expr_has_violation has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (27 pts), boolean chains 8, match/switch 4 (8 pts) (nesting depth added 21). 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/perry-hir/src/lower/expr_call/intrinsics/eval_strict.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"17133df1aedebb44e3712dd8ec9b2c45a434a96fa3ab06cbd8414a0ec277fb53"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_function::lower_arrow (cognitive 43): perry_hir::lower::expr_function::lower_arrow has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 7, match/switch 3 (5 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"4413080a07f23e983755ed33c7e896d3f6b6047b03888b19ab6d523982986cea"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::from_concat::populate_from_iterable (cognitive 43): perry_runtime::array::from_concat::populate_from_iterable has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 4 (11 pts), loops 3 (6 pts), boolean chains 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/perry-runtime/src/array/from_concat.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b7fe164efc07db22e5a431b0e876da3910c8bbd689a9d630e93cf5b4a35196"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::indexing::js_array_get_f64 (cognitive 43): perry_runtime::array::indexing::js_array_get_f64 has cognitive complexity 43 (threshold 15). Drivers by points: if/else 25 (39 pts), boolean chains 4 (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/perry-runtime/src/array/indexing.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8494d95a1b97dc9e322a3fd51ce1bf81d26942dfd12a790f2be14b886d6c16"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::push_pop::js_array_set_length (cognitive 43): perry_runtime::array::push_pop::js_array_set_length has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 4 (11 pts), boolean chains 6, match/switch 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/perry-runtime/src/array/push_pop.rs"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f3adfc40993cd876160e90935f74917e2ad4c8b00a5dde9ba65611aceb423a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::bun_compat::string_width::width_utf16 (cognitive 43): perry_runtime::bun_compat::string_width::width_utf16 has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (39 pts), boolean chains 3, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/bun_compat/string_width.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b75005ced8df6920ed0479728c25ae9ce034f605fc8e538ae7752b21cb6033"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::iterator_helpers::helper_next (cognitive 43): perry_runtime::iterator_helpers::helper_next has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 24). 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/perry-runtime/src/iterator_helpers.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"1637fb0d15dd5b1fb18cc2384fdbc4b196e86f80aa8495f3a3c0ac169f27098e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::concat::concat_chain_sized (cognitive 43): perry_runtime::string::concat::concat_chain_sized has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (40 pts), loops 2, boolean chains 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/perry-runtime/src/string/concat.rs"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd94d95d6afe00be70d5c7217a00155faee7d4ee9d71e1b653711433632c276e"}},{"ruleId":"D2","level":"warning","message":{"text":"server_ab.build (cognitive 43): server_ab.build has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (31 pts), boolean chains 6, loops 2 (4 pts), ternaries 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":"scripts/turnloop/server_ab.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d632752b9620ba966f0c5d3a7cf17a0f1ff0a4976268bef2efb5d1e20726194"}},{"ruleId":"D2","level":"warning","message":{"text":"web_runtime._mapKeyToAction (cognitive 43): web_runtime._mapKeyToAction has cognitive complexity 43 (threshold 15). Drivers by points: if/else 27, boolean chains 16. 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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":2245}}}],"partialFingerprints":{"codehealthFindingId/v1":"778c6b39e80e5a498acf09f76d1071d3e541b2ce73fb665d64da5ca24dee1abd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::library_search::collect_library_candidates (cognitive 42): perry::commands::compile::library_search::collect_library_candidates has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (37 pts), match/switch 1 (4 pts), loops 1 (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/perry/src/commands/compile/library_search.rs"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e601c249c4fc73bd79f10412dde1e2d16be9a314530f8d33ed6f20a4333bf37"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::program_facts::elision_for (cognitive 42): perry::commands::compile::program_facts::elision_for has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 10, loops 5 (7 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/program_facts.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"98cf50377660ef166013f5bd1866a8ba2d9cb814db9fe948ca085ad5726150c6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::resolve::tsconfig_paths::resolve_extends_package (cognitive 42): perry::commands::compile::resolve::tsconfig_paths::resolve_extends_package has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (41 pts), loops 1 (nesting depth added 31). 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/perry/src/commands/compile/resolve/tsconfig_paths.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab596c6be4ab4080cfef52cac874ca8b6fc200de22ed6b96845d6e8bd7f140b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::widget_build::build_declared_widgets_ios (cognitive 42): perry::commands::compile::widget_build::build_declared_widgets_ios has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (32 pts), match/switch 3 (5 pts), loops 2 (3 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/perry/src/commands/compile/widget_build.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fb08205c6fd58b55eb6546101acaa736b2152bb1914b6ce714cf069ad1373b"}},{"ruleId":"D2","level":"warning","message":{"text":"Walk::seed_stmts (cognitive 42): Walk::seed_stmts has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (36 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/int_valued_i64_locals.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58d2a5af4dc712dc9dae6abdb14003799239adae03117aa7c02db64c72dfc38"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::artifact_source_text::extend_class_method_source_text (cognitive 42): perry_codegen::codegen::artifact_source_text::extend_class_method_source_text has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 7 (13 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/perry-codegen/src/codegen/artifact_source_text.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ab45b5e9a87b16074a1e8adf307c1c2dda7a7c9df1feced99cb6407cb67f57"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::boxed_locals::collect_module_local_types (cognitive 42): perry_codegen::codegen::boxed_locals::collect_module_local_types has cognitive complexity 42 (threshold 15). Drivers by points: loops 15 (34 pts), if/else 3 (8 pts) (nesting depth added 24). 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/perry-codegen/src/codegen/boxed_locals.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f75737a10d67f14e80e66f13e537a9fab113b6f4719c15dfc86cece9c430ad"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::closure_collect::scan_capture_use_stmt (cognitive 42): perry_codegen::codegen::closure_collect::scan_capture_use_stmt has cognitive complexity 42 (threshold 15). Drivers by points: loops 10 (24 pts), if/else 9 (17 pts), match/switch 1 (nesting depth added 22). 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/perry-codegen/src/codegen/closure_collect.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd6efb2e60e751ea25530831a9e1fc9b300b655726f160e969c94792819b976"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::param_guard::cycle_members (cognitive 42): perry_codegen::codegen::param_guard::cycle_members has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 4 (12 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/perry-codegen/src/codegen/param_guard.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b57ddd8c817fb253f7d1f5c856af44a381391ebd9cddb6e71687ccf29f89e3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::int_valued_ta_locals::collect_closure_refs_stmt (cognitive 42): perry_codegen::collectors::int_valued_ta_locals::collect_closure_refs_stmt has cognitive complexity 42 (threshold 15). Drivers by points: loops 10 (24 pts), if/else 9 (17 pts), match/switch 1 (nesting depth added 22). 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/perry-codegen/src/collectors/int_valued_ta_locals.rs"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaeee7ecaa903a9dfc1ad85bcd2b29fcdd54870ecfc85be65e4f0b2d6fe9a55e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::number_local_loop::lower (cognitive 42): perry_codegen::stmt::number_local_loop::lower has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19 (28 pts), loops 9 (10 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/number_local_loop.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"f624f953fe4baa9d00e076af61e26d09538f1bd767108896a0507e3755d3287b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::stable_packed_accumulator::collect_local_writes::walk_stmt (cognitive 42): perry_codegen::stmt::stable_packed_accumulator::collect_local_writes::walk_stmt has cognitive complexity 42 (threshold 15). Drivers by points: loops 10 (24 pts), if/else 9 (17 pts), match/switch 1 (nesting depth added 22). 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/perry-codegen/src/stmt/stable_packed_accumulator.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53646fb7bddcbce4d7aefc4c7cfe45bdd156f2520ea0a75e756e20dfc9843bc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::switch_stmt::lower_switch (cognitive 42): perry_codegen::stmt::switch_stmt::lower_switch has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (26 pts), match/switch 4 (9 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/switch_stmt.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0242b88fdfcb3d94bf012388529be58c215106ff630a165a9e1578491e218d3"}},{"ruleId":"D2","level":"warning","message":{"text":"Cfg::slot_pinned (cognitive 42): Cfg::slot_pinned has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 3 (5 pts), boolean chains 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/perry-gc-effects/src/instructions.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff21e8fb0beeb4600293b0625cbdcef00b7d3f674850c76083c2126b9de0106c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::analysis::collect_local_refs_stmt (cognitive 42): perry_hir::analysis::collect_local_refs_stmt has cognitive complexity 42 (threshold 15). Drivers by points: loops 10 (24 pts), if/else 9 (17 pts), match/switch 1 (nesting depth added 22). 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/perry-hir/src/analysis.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59d0339e69da6886502df21ea08538ae5822e6161cd1e25dc2411f14a748d01"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::dynamic_import::scan_mutations_from_frames (cognitive 42): perry_hir::dynamic_import::scan_mutations_from_frames has cognitive complexity 42 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 3 (8 pts), match/switch 3 (8 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/perry-hir/src/dynamic_import.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"627e2fe251cf07c4ef23aeb3fe575f38a1c2539da30a3c2583b0c4fd24d727d9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::dynamic_import::visitors::visit_stmt_for_dyn_imports (cognitive 42): perry_hir::dynamic_import::visitors::visit_stmt_for_dyn_imports has cognitive complexity 42 (threshold 15). Drivers by points: loops 10 (24 pts), if/else 9 (17 pts), match/switch 1 (nesting depth added 22). 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. This shape REPEATS in the file: 3 other methods here (perry_hir::dynamic_import::visitors::visit_stmt_for_dyn_imports_ref, perry_hir::dynamic_import::visitors::visit_stmt_for_worker_new, perry_hir::dynamic_import::visitors::visit_stmt_for_worker_new_ref) 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/perry-hir/src/dynamic_import/visitors.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e742746392f2a8ffb6b3c3d1a39fdf9fac1ee83b21d97f1758e878f6806bbf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::dynamic_import::visitors::visit_stmt_for_dyn_imports_ref (cognitive 42): perry_hir::dynamic_import::visitors::visit_stmt_for_dyn_imports_ref has cognitive complexity 42 (threshold 15). Drivers by points: loops 10 (24 pts), if/else 9 (17 pts), match/switch 1 (nesting depth added 22). 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. This shape REPEATS in the file: 3 other methods here (perry_hir::dynamic_import::visitors::visit_stmt_for_dyn_imports, perry_hir::dynamic_import::visitors::visit_stmt_for_worker_new, perry_hir::dynamic_import::visitors::visit_stmt_for_worker_new_ref) 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/perry-hir/src/dynamic_import/visitors.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"da930310832f4e778bfd8027b879224e0984e87e11f8ddfcbea610ee118fe3e0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::dynamic_import::visitors::visit_stmt_for_worker_new (cognitive 42): perry_hir::dynamic_import::visitors::visit_stmt_for_worker_new has cognitive complexity 42 (threshold 15). Drivers by points: loops 10 (24 pts), if/else 9 (17 pts), match/switch 1 (nesting depth added 22). 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. This shape REPEATS in the file: 3 other methods here (perry_hir::dynamic_import::visitors::visit_stmt_for_dyn_imports, perry_hir::dynamic_import::visitors::visit_stmt_for_dyn_imports_ref, perry_hir::dynamic_import::visitors::visit_stmt_for_worker_new_ref) 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/perry-hir/src/dynamic_import/visitors.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"8937890c075c75d9c860a58f601b77f17a79b765de2a4b8237bd706b4627458b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::dynamic_import::visitors::visit_stmt_for_worker_new_ref (cognitive 42): perry_hir::dynamic_import::visitors::visit_stmt_for_worker_new_ref has cognitive complexity 42 (threshold 15). Drivers by points: loops 10 (24 pts), if/else 9 (17 pts), match/switch 1 (nesting depth added 22). 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. This shape REPEATS in the file: 3 other methods here (perry_hir::dynamic_import::visitors::visit_stmt_for_dyn_imports, perry_hir::dynamic_import::visitors::visit_stmt_for_dyn_imports_ref, perry_hir::dynamic_import::visitors::visit_stmt_for_worker_new) 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/perry-hir/src/dynamic_import/visitors.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7125a103ca77b3fecf48ddd1ffaef4272bbf71a3b66fe101edc3524d5c3927"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::body_stmt::gen_capture_scan::collect_idents_stmt (cognitive 42): perry_hir::lower_decl::body_stmt::gen_capture_scan::collect_idents_stmt has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 7 (18 pts), match/switch 2 (3 pts) (nesting depth added 23). 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/perry-hir/src/lower_decl/body_stmt/gen_capture_scan.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd6f207394055a08e75c308fe4b526000874d5f19cf12c58b2e3eebf1ab5638"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::subclass_loop_guard::packed_arraylike_loop_guard (cognitive 42): perry_runtime::array::subclass_loop_guard::packed_arraylike_loop_guard has cognitive complexity 42 (threshold 15). Drivers by points: if/else 23 (34 pts), boolean chains 8 (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/perry-runtime/src/array/subclass_loop_guard.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d0e09825d06103fd4d7106da809e43edf0fec2a6122b94c5377b8beaebe372"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::bun_compat::cli_utils::yaml_add_js_value (cognitive 42): perry_runtime::bun_compat::cli_utils::yaml_add_js_value has cognitive complexity 42 (threshold 15). Drivers by points: if/else 27 (36 pts), loops 3 (4 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/perry-runtime/src/bun_compat/cli_utils.rs"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"f410159b335034df6fbde545fa9d43b065df8843837b293b4086f9b9d5f65f5a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::child_process::validate::cp_validate_options (cognitive 42): perry_runtime::child_process::validate::cp_validate_options has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 12, loops 5 (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/perry-runtime/src/child_process/validate.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"970d12c8f9351d4fc6418de496fef174e7c9a2cc1403f442cc5217ff0f33b38c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::perf_hooks::js_perf_observer_observe (cognitive 42): perry_runtime::perf_hooks::js_perf_observer_observe has cognitive complexity 42 (threshold 15). Drivers by points: if/else 20 (34 pts), loops 2 (5 pts), boolean chains 3 (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/perry-runtime/src/perf_hooks.rs"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d514f88402affb5742a09da340387f309ff46da5982a138ad1bd90f1f3d1c2"}},{"ruleId":"D2","level":"warning","message":{"text":"RealmManifest::validate (cognitive 42): RealmManifest::validate has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 5 (8 pts), boolean chains 7, match/switch 2 (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/perry-runtime-manifest/src/realm.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf960ee05acb9ce54b09449ca651be491048c51c20b16014049cfdd0618003c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::async_to_generator::transform_async_to_generator (cognitive 42): perry_transform::async_to_generator::transform_async_to_generator has cognitive complexity 42 (threshold 15). Drivers by points: loops 13 (30 pts), if/else 4 (12 pts) (nesting depth added 25). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/async_to_generator.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b274c5b53f6cbec46f3d2703d6a768d43a30d240bbb2455aa65e68b1053a9335"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::state_desugar::try_rewrite_state_access (cognitive 42): perry_transform::state_desugar::try_rewrite_state_access has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (30 pts), match/switch 2 (10 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/perry-transform/src/state_desugar.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae03201ed74246d3f772a2fba4e74dcc5f2bb7a1cd668d108028808f131d83f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_macos::app::app_run (cognitive 42): perry_ui_macos::app::app_run has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 3 (5 pts), match/switch 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/perry-ui-macos/src/app.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"a537c677a82f62ca7f686789f2d86f87d1b4328afbf14679a8f4b028f74eed98"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wasi::filesystem::primitives::windows::fs::create_file_at_w::CreateFileAtW (cognitive 42): perry_wasi::filesystem::primitives::windows::fs::create_file_at_w::CreateFileAtW has cognitive complexity 42 (threshold 15). Drivers by points: if/else 29 (36 pts), boolean chains 4, match/switch 2 (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/perry-wasi/src/filesystem/primitives/windows/fs/create_file_at_w.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e09360e16ec6bb8f609da93b8aaff66e171e4cc1ae0f85bf0c0d4d27bc5fa22"}},{"ruleId":"D2","level":"warning","message":{"text":"copied_minor_fallback_report.aggregate_workload (cognitive 42): copied_minor_fallback_report.aggregate_workload has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 6 (12 pts), ternaries 2 (6 pts), boolean chains 4 (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":"scripts/copied_minor_fallback_report.py"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc39ee8d1f074c0b0cad371d65ab2abcd2994a242b1bec091b551599a032a1f"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.parse_file (cognitive 42): gc_root_dominance_check.parse_file has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (32 pts), ternaries 2 (7 pts), loops 2, boolean chains 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"86bbc1a3f5458b1ebe10969bcaff91b648203710cad7a90742f4097ce471d226"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::optimized_libs::driver::build_optimized_libs (cognitive 41): perry::commands::compile::optimized_libs::driver::build_optimized_libs has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (30 pts), boolean chains 7, loops 3 (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/perry/src/commands/compile/optimized_libs/driver.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a744bff0b137e743dcb89822c744fc4108678674226d590a3186eabcacbb95f6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::verify::run_verify_check (cognitive 41): perry::commands::verify::run_verify_check has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (32 pts), loops 2 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 25). 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/perry/src/commands/verify.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8b0c3ac012b609fd44901c6756f125575956229e4bc81dd985fbbefe0eb1db"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::segview::rewrite_site (cognitive 41): perry_codegen::collectors::segview::rewrite_site has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 5 (12 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 25). 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/perry-codegen/src/collectors/segview.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"96496df05122b747534a303692d06e16f52fddbfadc39766dc754faf35aabbd0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::typed_locals::collect_typed_locals (cognitive 41): perry_codegen::collectors::typed_locals::collect_typed_locals has cognitive complexity 41 (threshold 15). Drivers by points: loops 9 (19 pts), if/else 9 (18 pts), boolean chains 4 (nesting depth added 19). 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/perry-codegen/src/collectors/typed_locals.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3517a71288278b278360f4eec0a423eb663d5c365064a6015407de1a03357e0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::gc_map::verify_roundtrip (cognitive 41): perry_codegen::gc_map::verify_roundtrip has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (32 pts), loops 3 (7 pts), boolean chains 2 (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/perry-codegen/src/gc_map.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"6328c2e288a8cc6d3ac428791fb1c308af427b4c1ebc26f2079c6cddfb63c52f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::buffer_intrinsic::module_shadows_buffer_read_method::stmt_shadows (cognitive 41): perry_codegen::lower_call::buffer_intrinsic::module_shadows_buffer_read_method::stmt_shadows has cognitive complexity 41 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 10 (18 pts), match/switch 1 (nesting depth added 21). 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. This shape REPEATS in the file: one other method here (perry_codegen::lower_call::buffer_intrinsic::module_shadows_buffer_read_method) 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/perry-codegen/src/lower_call/buffer_intrinsic.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"e624bd846277ab989261c28802a2373bf126e94ee5e6fb78f6341fec0d86242f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::ui_tables::lower_perry_ui_table_call (cognitive 41): perry_codegen::lower_call::ui_tables::lower_perry_ui_table_call has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 7, match/switch 4 (7 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/perry-codegen/src/lower_call/ui_tables.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67831e9148716f44f7e5e7769a8d566f0600e8f08afdbaa9bc168a1d7ddffa7"}},{"ruleId":"D2","level":"warning","message":{"text":"FuncEmitCtx::try_emit_expr_objects (cognitive 41): FuncEmitCtx::try_emit_expr_objects has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (27 pts), match/switch 5 (8 pts), loops 3 (6 pts) (nesting depth added 19). 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/perry-codegen-wasm/src/emit/expr/objects.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"17188766fcfb7011dff597b5912b214491afd89153fe23038b4329ee07a5f9aa"}},{"ruleId":"D2","level":"warning","message":{"text":"Registry::dispatch (cognitive 41): Registry::dispatch has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (33 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-db-turnloop/src/lib.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"39766ce3de3c7e61326f5a3d88a76ba75f715878140bf62260f3570f6eb94e9e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::analysis::fn_infer::ty_of (cognitive 41): perry_hir::analysis::fn_infer::ty_of has cognitive complexity 41 (threshold 15). Drivers by points: match/switch 9 (19 pts), if/else 8 (15 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 19). 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/perry-hir/src/analysis/fn_infer.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6dff566c71ecd49a6f5b0c82150d7a6dab7c8c77df167406f9b60d363af7b4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::enum_image::enum_stores (cognitive 41): perry_hir::lower::enum_image::enum_stores has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (27 pts), match/switch 4 (13 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/perry-hir/src/lower/enum_image.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9aa2073a7134494a2bef98713de692af727c72e90e8e934c0def01ed500ac8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::lower_module_fn::collect_assigned_function_binding_candidates::collect_from_stmt (cognitive 41): perry_hir::lower::lower_module_fn::collect_assigned_function_binding_candidates::collect_from_stmt has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 7 (17 pts), match/switch 2 (4 pts) (nesting depth added 23). 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. This shape REPEATS in the file: one other method here (perry_hir::lower::lower_module_fn::collect_assigned_function_binding_candidates::collect_from_expr) 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/perry-hir/src/lower/lower_module_fn.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"289be7700ca0c230f20a3bc11882d4948052145f49e5601226b1bedc37687b79"}},{"ruleId":"D2","level":"warning","message":{"text":"WalkerImage::decode_row (cognitive 41): WalkerImage::decode_row has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 4 (12 pts), match/switch 1 (2 pts), boolean chains 1 (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/perry-runtime/src/eh_walker.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc62f7caedd9aab842df01207d9f20c71852494f5ce6c60d68609ee1f233a14"}},{"ruleId":"D2","level":"warning","message":{"text":"DirectParser::parse_string_bytes_slow (cognitive 41): DirectParser::parse_string_bytes_slow has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (30 pts), match/switch 2 (5 pts), loops 2 (4 pts), boolean chains 2 (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/perry-runtime/src/json/parser.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc470fbaea71ae04f3935c99c90b4a9bbd964ae834145e85b4939d3137a85a7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::eh_walker_trace::capture_js_return_addresses (cognitive 41): perry_runtime::eh_walker_trace::capture_js_return_addresses has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (27 pts), match/switch 4 (9 pts), boolean chains 4, 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/perry-runtime/src/eh_walker_trace.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"9710fc73985070dceee42822b550dbef2b1906a4797a75520a17ab3949cc263e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::replacer::stringify_object_pretty (cognitive 41): perry_runtime::json::replacer::stringify_object_pretty has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (29 pts), boolean chains 7, 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/perry-runtime/src/json/replacer.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae4feb9bbc8c949153c50b82873daffa3d7f975aa62c6c70843c48b3d69c3f8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::stringify_primitive_object::emit (cognitive 41): perry_runtime::json::stringify_primitive_object::emit has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (31 pts), match/switch 2 (5 pts), boolean chains 4, 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/perry-runtime/src/json/stringify_primitive_object.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"79396149d5b1b7e6bb2bccaadcdff1551fb62aaf7290473bf99d7a77e5d4a20c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::method_site::read_holder::keyed::walk_to_key (cognitive 41): perry_runtime::object::method_site::read_holder::keyed::walk_to_key has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (31 pts), boolean chains 6, match/switch 1 (3 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/method_site/read_holder/keyed.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"602d262ea4d9fa9bb14e3c71fd15db93ad129a01b3d94e92badd84b9a1ae7f76"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::path::normalize_win32_str (cognitive 41): perry_runtime::path::normalize_win32_str has cognitive complexity 41 (threshold 15). Drivers by points: if/else 23 (36 pts), boolean chains 4, 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/perry-runtime/src/path.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f44d80301b5e31f899b112a176458f7494f836bee5223d93847f12228aa1da7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::process::node_module::module_typescript_code_mask (cognitive 41): perry_runtime::process::node_module::module_typescript_code_mask has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 6, loops 2 (5 pts), match/switch 2 (5 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/perry-runtime/src/process/node_module.rs"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7ed799c30057c911da4497db68eeae56bdf913b3700fb6930df7f32734f468"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::url::node_compat::legacy_url_resolve_impl (cognitive 41): perry_runtime::url::node_compat::legacy_url_resolve_impl has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 14, 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/perry-runtime/src/url/node_compat.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc84b9ed0af2b2f048b95bd0a2b86d0a1a835ccba3a6e43f243b953e7fb1588"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::value::to_string_radix::double_to_radix_string (cognitive 41): perry_runtime::value::to_string_radix::double_to_radix_string has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 4 (10 pts), match/switch 1 (6 pts), boolean chains 2 (nesting depth added 25). 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/perry-runtime/src/value/to_string_radix.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b73e76912c0fb2f7f28f35cc30ba89dd17db09196468a81448440db829b662f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::fetch::gc::scan_fetch_roots_with (cognitive 41): perry_stdlib::fetch::gc::scan_fetch_roots_with has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 7 (16 pts), boolean chains 2 (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/perry-stdlib/src/fetch/gc.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9d95b6a9fac967d5ec97ee241ec28912d89d268f3e4c5a41f60ee1ed42b2d6"}},{"ruleId":"D2","level":"warning","message":{"text":"OutUsageAnalyzer::visit_stmt (cognitive 41): OutUsageAnalyzer::visit_stmt has cognitive complexity 41 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 10 (18 pts), match/switch 1 (nesting depth added 21). 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/perry-transform/src/deforest/out_usage.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8080a407fbe1a46f3328912a7ef0123f5398693f6f89feeb8d7b9280e659d854"}},{"ruleId":"D2","level":"warning","message":{"text":"StmtRefWalker::visit_stmt (cognitive 41): StmtRefWalker::visit_stmt has cognitive complexity 41 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 10 (18 pts), match/switch 1 (nesting depth added 21). 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/perry-transform/src/deforest/walk.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ed0ba02b990bcca1bc9d5adf9fe168e213b07c18713abb110920235dce8557"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::deforest::scan::scan_stmt_call_sites (cognitive 41): perry_transform::deforest::scan::scan_stmt_call_sites has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 3 (11 pts), match/switch 1 (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/perry-transform/src/deforest/scan.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37d0133e748a368147781b3acb9d3788a555b03fe16feac292586b27021d16a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::widgets::image::image_wnd_proc (cognitive 41): perry_ui_windows::widgets::image::image_wnd_proc has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (38 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 26). 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/perry-ui-windows/src/widgets/image.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8f3119bb5a79927025f86a78cb483f892fc329a8b68ee243d8ad7c9a3b45ae"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::stand_in_value (cognitive 41): Gen::stand_in_value has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 9 (10 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/gen/class_values.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"91871d0de4e84004c1d26c4b4d59baa50f048da46ee5bb11e246931f8ca790de"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::add_tokens (cognitive 41): Model::add_tokens has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 9, loops 3 (6 pts), match/switch 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/perry-wpfacts/src/solve.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f73a27d4feda1c095b53aa803e2fce40b56c084f50efc568919e8f22976a90"}},{"ruleId":"D2","level":"warning","message":{"text":"check_js_body_call_funnel.entry_abi_violations (cognitive 41): check_js_body_call_funnel.entry_abi_violations has cognitive complexity 41 (threshold 15). Drivers by points: if/else 6 (21 pts), ternaries 3 (11 pts), boolean chains 6, loops 2 (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":"scripts/check_js_body_call_funnel.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ae8a8ff60fb01e6245e14b8de4a56f17f4a7ac61cf338a16849aee9283daf6"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check._sp_seed_sites (cognitive 41): gc_root_dominance_check._sp_seed_sites has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (34 pts), boolean chains 4, loops 2 (3 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":5592}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d16fb4c17c943e8c7c20ee505968467927d0ce4690bc4917b09c1b6b26f4e44"}},{"ruleId":"D2","level":"warning","message":{"text":"global_sink_isolation.asserted_globals (cognitive 41): global_sink_isolation.asserted_globals has cognitive complexity 41 (threshold 15). Drivers by points: if/else 7 (23 pts), boolean chains 6, loops 4 (6 pts), ternaries 3 (6 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":"scripts/global_sink_isolation.py"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"4930041029d1bb19013d45309258984e375cf15c1ade084900c1cbab513b1696"}},{"ruleId":"D2","level":"warning","message":{"text":"perf_tscwall_lane.measure (cognitive 41): perf_tscwall_lane.measure has cognitive complexity 41 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 5 (13 pts), ternaries 3 (10 pts), boolean chains 3 (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":"scripts/perf_tscwall_lane.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"56aaca2b08c1b533b8ac0e9aeb1257de5b8f23f52b31dd8c648aae155c037378"}},{"ruleId":"D2","level":"warning","message":{"text":"wpfacts_recompute.compare (cognitive 41): wpfacts_recompute.compare has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (22 pts), ternaries 4 (12 pts), boolean chains 4, loops 3 (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":"scripts/wpfacts_recompute.py"},"region":{"startLine":1420}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97ce21a90d33fcbb54900a86fbf49fc9b22345e11ceaaee5c85257d5429de2b"}},{"ruleId":"D2","level":"warning","message":{"text":"Fixer::find_any_in_ts_type (cognitive 40): Fixer::find_any_in_ts_type has cognitive complexity 40 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 5 (14 pts), match/switch 3 (5 pts) (nesting depth added 26). 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/perry/src/commands/fixer.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43939a759183e8e249645a7df6023de413c5a4e2aedd78971cd43fab3d331ea"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::deps::package_declares_types (cognitive 40): perry::commands::deps::package_declares_types has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (31 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 25). 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/perry/src/commands/deps.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d03897b14f084ad25bb92884752100e3f501d338883068bea54a5c8c1e88fd1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::object_create_proto::object_create_protos (cognitive 40): perry_codegen::collectors::object_create_proto::object_create_protos has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 7 (9 pts), match/switch 3 (6 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/perry-codegen/src/collectors/object_create_proto.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5c1b81589c822e867aeb240bb7c65277752cd22186844801df68ae01f14f24"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::receiver_regions::enders_in_stmt (cognitive 40): perry_codegen::collectors::receiver_regions::enders_in_stmt has cognitive complexity 40 (threshold 15). Drivers by points: loops 10 (24 pts), if/else 7 (15 pts), match/switch 1 (nesting depth added 22). 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/perry-codegen/src/collectors/receiver_regions.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7d6cf6a47c50d9243fda1ea8d425cd6137a24ce807e783071add93a3710fc7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::shadow_slots::collect_declared_shadow_locals_in_stmt (cognitive 40): perry_codegen::collectors::shadow_slots::collect_declared_shadow_locals_in_stmt has cognitive complexity 40 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 7 (17 pts), match/switch 1 (nesting depth added 23). 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/perry-codegen/src/collectors/shadow_slots.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a02ea99ae9fe4763607664f493247d29691b9c06f48e352574e31f804f7486a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::closure_analysis::find_outer_writes_stmt (cognitive 40): perry_codegen::lower_call::closure_analysis::find_outer_writes_stmt has cognitive complexity 40 (threshold 15). Drivers by points: loops 10 (24 pts), if/else 8 (15 pts), match/switch 1 (nesting depth added 21). 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/perry-codegen/src/lower_call/closure_analysis.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a9f79b0f91b87c32167d7b11ee97140c15fa93bd8e9ba223dfab577aa6c8d7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::console_promise::try_lower_promise_static_call (cognitive 40): perry_codegen::lower_call::console_promise::try_lower_promise_static_call has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 4 (15 pts), loops 1 (4 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/console_promise.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd064f6edf48f29ddaf32d189da8d5380c37e4fda90ab5f437f2502b3602e37d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_component_host::driver::writers::execute (cognitive 40): perry_component_host::driver::writers::execute has cognitive complexity 40 (threshold 15). Drivers by points: if/else 27 (38 pts), boolean chains 1, match/switch 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/perry-component-host/src/driver/writers.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ad7c2f9af4d9fc1a2db1b9338f987f6adea27da099a8b9c130d5ea9ddafbdd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::turnloop_h2::stream::pump_outbox (cognitive 40): perry_ext_http::server::turnloop_h2::stream::pump_outbox has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (29 pts), boolean chains 4, loops 3 (4 pts), match/switch 1 (3 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/perry-ext-http/src/server/turnloop_h2/stream.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bb0671025af4606e3216eef5f949fb5ee315dcab41ba367268af90094064f7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::analysis::collect_assigned_locals_stmt (cognitive 40): perry_hir::analysis::collect_assigned_locals_stmt has cognitive complexity 40 (threshold 15). Drivers by points: loops 10 (24 pts), if/else 8 (15 pts), match/switch 1 (nesting depth added 21). 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/perry-hir/src/analysis.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"551350b72e7cd37c3f15968ea2377b6938958240c306539faf0ccf09066959ee"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::analysis::fn_infer::for_each_stmt_expr (cognitive 40): perry_hir::analysis::fn_infer::for_each_stmt_expr has cognitive complexity 40 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 9 (17 pts), match/switch 1 (nesting depth added 21). 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/perry-hir/src/analysis/fn_infer.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c81e86bf5acc22fd6536bf67a8cbe00b6d454c16175368377e133b13c94a037"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::js_transform::cross_module_natives::fix_native_instance_stmt (cognitive 40): perry_hir::js_transform::cross_module_natives::fix_native_instance_stmt has cognitive complexity 40 (threshold 15). Drivers by points: loops 10 (24 pts), if/else 8 (15 pts), match/switch 1 (nesting depth added 21). 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/perry-hir/src/js_transform/cross_module_natives.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80b3f15da6d82deb2b85ba58d402bcd1b55bc0ba6a2635f7c2ff0728ca647c9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::js_transform::local_natives::fix_native_instance_stmt_with_locals (cognitive 40): perry_hir::js_transform::local_natives::fix_native_instance_stmt_with_locals has cognitive complexity 40 (threshold 15). Drivers by points: loops 10 (24 pts), if/else 8 (15 pts), match/switch 1 (nesting depth added 21). 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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"89387b8f5fe5a29eaf6812609f2f1eae1329b165ef58345ba38c62668be5bb7d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::block::collect_refs_in_closure_bodies_stmt (cognitive 40): perry_hir::lower_decl::block::collect_refs_in_closure_bodies_stmt has cognitive complexity 40 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 9 (17 pts), match/switch 1 (nesting depth added 21). 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/perry-hir/src/lower_decl/block.rs"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab0dda1d6aed78c05b8e12b1c31eeed77e9695395153f697b72374c36ce95f8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::body_stmt::find_native_return_in_stmts (cognitive 40): perry_hir::lower_decl::body_stmt::find_native_return_in_stmts has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 2 (6 pts), 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/perry-hir/src/lower_decl/body_stmt.rs"},"region":{"startLine":2540}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa23c955c9271b9c0b43712e7c34f58fae415576c5a388c6a5eeea5ca9a9c3fb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::body_stmt::nested_fn_decl::lower_nested_fn_decl (cognitive 40): perry_hir::lower_decl::body_stmt::nested_fn_decl::lower_nested_fn_decl has cognitive complexity 40 (threshold 15). Drivers by points: if/else 22 (27 pts), boolean chains 7, loops 6 (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/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2383709281a25ab8327b0247e13c9e6ee05469cbaf5b88f971ac1e10d42a26f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::class_captures::append_new_args_stmt (cognitive 40): perry_hir::lower_decl::class_captures::append_new_args_stmt has cognitive complexity 40 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 9 (17 pts), match/switch 1 (nesting depth added 21). 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. This shape REPEATS in the file: one other method here (perry_hir::lower_decl::class_captures::stamp_self_new_stmt) 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/perry-hir/src/lower_decl/class_captures.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd40b6a41bc36dfab0ab20be4e7dae2a49b76139a141ff3c2b677718d8ca69b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::class_captures::stamp_self_new_stmt (cognitive 40): perry_hir::lower_decl::class_captures::stamp_self_new_stmt has cognitive complexity 40 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 9 (17 pts), match/switch 1 (nesting depth added 21). 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. This shape REPEATS in the file: one other method here (perry_hir::lower_decl::class_captures::append_new_args_stmt) 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/perry-hir/src/lower_decl/class_captures.rs"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62d51780a6522d6e30af8decd60d3acf3093b63e6c9cc6dacb224e0286aaa0c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_http_client::http::exchange (cognitive 40): perry_http_client::http::exchange has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (27 pts), match/switch 2 (7 pts), boolean chains 3, loops 2 (3 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/perry-http-client/src/http.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"402b6677068793cb3eda7a304799bbff89d87082d9ac98c44e2f6c8cc3118893"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::builtins::numbers::js_parse_int (cognitive 40): perry_runtime::builtins::numbers::js_parse_int has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (34 pts), boolean chains 4, loops 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/perry-runtime/src/builtins/numbers.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"623b8c45ea48d9222761b68cacaddbd6306a547c83ee36a68ff0aa1e7236d855"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::date::parse::parse_iso8601 (cognitive 40): perry_runtime::date::parse::parse_iso8601 has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (35 pts), boolean chains 4, match/switch 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/perry-runtime/src/date/parse.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"3729f27e3c259ab48062193f2fdcdc53a19a22b5615082cbff2e78c5dfd66b55"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::layout_slot_visit::visit_gc_layout_slot_descriptors_generic (cognitive 40): perry_runtime::gc::layout_slot_visit::visit_gc_layout_slot_descriptors_generic has cognitive complexity 40 (threshold 15). Drivers by points: if/else 21 (32 pts), loops 2 (6 pts), boolean chains 1, 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/perry-runtime/src/gc/layout_slot_visit.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca3eb6a3f254a41c44fd1820afe7287386d173f3fcb493ec3fcd3d179e5659c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::descriptor_state::class_instance_set_may_intercept (cognitive 40): perry_runtime::object::descriptor_state::class_instance_set_may_intercept has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (37 pts), boolean chains 2, 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/perry-runtime/src/object/descriptor_state.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93a09092f08118f4974630acff1309817f721a144a8e289ed4b0a20533f8970"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::object_ops::descriptor_helpers::nonconfigurable_redefine_allowed (cognitive 40): perry_runtime::object::object_ops::descriptor_helpers::nonconfigurable_redefine_allowed has cognitive complexity 40 (threshold 15). Drivers by points: if/else 20 (36 pts), boolean chains 4 (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/perry-runtime/src/object/object_ops/descriptor_helpers.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"3253fe8a771ada1049331416413448520d42de8f7c817b9ac7300d0e100d7dc1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::tty::color_depth_from_lookup (cognitive 40): perry_runtime::tty::color_depth_from_lookup has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 9, match/switch 3 (5 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/perry-runtime/src/tty.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4698994bf01b871965bb1883beeee913fbe137f92d26d76cdaf6ea6ffca2e74"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::util_parse_args::parse_long_option (cognitive 40): perry_runtime::util_parse_args::parse_long_option has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (34 pts), match/switch 4 (6 pts) (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/perry-runtime/src/util_parse_args.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"4077623168d7de2125ffbde9a4d49bc08c2742cb60449cf2ac7c80251ccbabf9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::streams::release_web_streams_in_freed_ranges (cognitive 40): perry_stdlib::streams::release_web_streams_in_freed_ranges has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 9 (11 pts), boolean chains 6 (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/perry-stdlib/src/streams.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa5ddba98f9cbec1fa9fe2460aa3ebc149e0a4b18d872a0666a835b64fca99a"}},{"ruleId":"D2","level":"warning","message":{"text":"SubstituteLocal::visit_stmt (cognitive 40): SubstituteLocal::visit_stmt has cognitive complexity 40 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 9 (17 pts), match/switch 1 (nesting depth added 21). 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/perry-transform/src/deforest/producer_rewrite.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e228639056c679864189fa059b3424c322e84cfd87fb7a5e861c60f7eab38c81"}},{"ruleId":"D2","level":"warning","message":{"text":"StmtRefAllWalker::visit_stmt (cognitive 40): StmtRefAllWalker::visit_stmt has cognitive complexity 40 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 9 (17 pts), match/switch 1 (nesting depth added 21). 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/perry-transform/src/deforest/scan.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"54945aa3644b3cc7d0e273702c3ddfacc452281c0881d1c6fa3a81216ffd0989"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::break_continue::body_contains_yield (cognitive 40): perry_transform::generator::break_continue::body_contains_yield has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (31 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (2 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/perry-transform/src/generator/break_continue.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2254581dc7d4ef30bfd254e6773d776fbf4e3b1fb5e2647cfce6e82ec18db1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::unroll::substitute_localget_with_int_in_stmt (cognitive 40): perry_transform::unroll::substitute_localget_with_int_in_stmt has cognitive complexity 40 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 9 (17 pts), match/switch 1 (nesting depth added 21). 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/perry-transform/src/unroll/mod.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"964fb96110c80283ddda41c7f3c12757c21c6a2350b915bb0a92e302ffc7aa3c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_android::widgets::canvas::load_image (cognitive 40): perry_ui_android::widgets::canvas::load_image has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (40 pts) (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/perry-ui-android/src/widgets/canvas.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d9e4a0fe6ed1c0f8f862498d4b085b523b44544efeed69f02b213b355946ed"}},{"ruleId":"D2","level":"warning","message":{"text":"check_node_version_consistency.check (cognitive 40): check_node_version_consistency.check has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 6 (8 pts), error handling 1 (2 pts), ternaries 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":"scripts/check_node_version_consistency.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"701fc9a7922f3b18c4052030dda32b4a7363d0668d8d3ce42bad261e52a04d57"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime_abi_check.expand_signature_macros (cognitive 40): runtime_abi_check.expand_signature_macros has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 7 (13 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":"scripts/runtime_abi_check.py"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee9845a67dae6b98e72a5dc18f84974285adfe825b3fe3a8b167b74c4e9f825"}},{"ruleId":"D2","level":"warning","message":{"text":"test262_subset.discover (cognitive 40): test262_subset.discover has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (31 pts), boolean chains 3, error handling 1 (3 pts), loops 2 (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":"scripts/test262_subset.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3436c5c1013f2cc5f50566ebd35a8721c774eaee0bdf67b77a3901a75bb06eb"}},{"ruleId":"D2","level":"warning","message":{"text":"Session::finish (cognitive 39): Session::finish has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 8 (15 pts), match/switch 3 (7 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/perry/src/commands/compile/source_need.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77d3a853be1b8b019692587193fe2d8fcaf20fc0e6a5ab1ad0206ad6a342bfe"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::targets::compile_metallib_for_bundle (cognitive 39): perry::commands::compile::targets::compile_metallib_for_bundle has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 6 (13 pts), match/switch 3 (4 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/perry/src/commands/compile/targets.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e54391b1b4a25e1cc90105845238969035afcb95cc82fa17dc871746d341442"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::setup::macos::macos_wizard (cognitive 39): perry::commands::setup::macos::macos_wizard has cognitive complexity 39 (threshold 15). Drivers by points: if/else 25 (29 pts), boolean chains 5, match/switch 4 (5 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/perry/src/commands/setup/macos.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b11c8d146c68e0aa5c8560e3db9e3f456c924562235d81a20fe1c64ba647448"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_this_flow::expr_mentions_this::stmt_visit (cognitive 39): perry_codegen::collectors::ptr_shape_this_flow::expr_mentions_this::stmt_visit has cognitive complexity 39 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 9 (16 pts), match/switch 1 (nesting depth added 20). 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/perry-codegen/src/collectors/ptr_shape_this_flow.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20ca4d596e5976a7fb9dbfde30c6d30227fa29d6aaf51c1f337e221c8b9aa36"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::static_field_meta::lower_computed_member_registration (cognitive 39): perry_codegen::expr::static_field_meta::lower_computed_member_registration has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (36 pts), boolean chains 2, match/switch 1 (nesting depth added 22). 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/perry-codegen/src/expr/static_field_meta.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ebf50fb274213fdf7336c7f109372515bb3b57737876bb92fb56d5671b2ad0a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_desc::create_families::analyze (cognitive 39): perry_codegen::layout_desc::create_families::analyze has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 4 (5 pts), match/switch 2 (5 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/perry-codegen/src/layout_desc/create_families.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"04377060352d9bcf04131627ac1a088092ef61da711349d11b4a1db46227bf14"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_arkts::emit_widget::emit_widget (cognitive 39): perry_codegen_arkts::emit_widget::emit_widget has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (33 pts), match/switch 4 (6 pts) (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/perry-codegen-arkts/src/emit_widget.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"525c5a0e59b42a38117c88c929001a949fcd4bcd330b15b6bf5d57931e41d2cf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_net::payload_socket::destroy (cognitive 39): perry_ext_net::payload_socket::destroy has cognitive complexity 39 (threshold 15). Drivers by points: if/else 25 (34 pts), boolean chains 4, 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/perry-ext-net/src/payload_socket.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58673fbe838e2825ec2b79d45a4019adacd813f5bebf47c635aef19019ce0f8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_gc_effects::instructions::idiom (cognitive 39): perry_gc_effects::instructions::idiom has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 13, loops 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/perry-gc-effects/src/instructions.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b549ab7522c7a28a64b50b97e3ff6aaa36b1131cb6c6bb227e14f5d41270a36"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::dynamic_import::collect_local_candidate_defs_from_frames (cognitive 39): perry_hir::dynamic_import::collect_local_candidate_defs_from_frames has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (23 pts), loops 3 (8 pts), match/switch 3 (8 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/perry-hir/src/dynamic_import.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3852081ed3ee57143eca53255b19837998e8c28ac441f79f8a50582a3bf77d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::dynamic_import::collect_const_locals_from_frames (cognitive 39): perry_hir::dynamic_import::collect_const_locals_from_frames has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 3 (8 pts), match/switch 2 (5 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/perry-hir/src/dynamic_import.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23b45a4115ba61325a81a395c815b2bc191b35c130ad74fefbd82a966803dcd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::shared_mutable_capture::rewrite_expr (cognitive 39): perry_hir::lower::shared_mutable_capture::rewrite_expr has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 8 (16 pts), boolean chains 4, match/switch 2 (3 pts) (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/perry-hir/src/lower/shared_mutable_capture.rs"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"31effae541f8ebf4b4f4b39b3e13a640d5c35211e515dda5e47aecf9869bd2ca"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::class_members::lower_class_method_in_scope (cognitive 39): perry_hir::lower_decl::class_members::lower_class_method_in_scope has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (31 pts), boolean chains 4, loops 3 (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/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"246c25681064bf18c6ca465d285237cd5ca4d9a460f6c5895d930f66592a335a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::indexing::js_array_set_f64_extend_resolved (cognitive 39): perry_runtime::array::indexing::js_array_set_f64_extend_resolved has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (33 pts), boolean chains 5, 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/perry-runtime/src/array/indexing.rs"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91b23c5765624be2282af3941de6207540749581595cd361b47aed11c97d292"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::search::js_array_last_index_of_jsvalue (cognitive 39): perry_runtime::array::search::js_array_last_index_of_jsvalue has cognitive complexity 39 (threshold 15). Drivers by points: if/else 22 (33 pts), loops 2 (3 pts), match/switch 1 (3 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/perry-runtime/src/array/search.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"0229034fad34c5aa669b022c9c2175558dc595a7bbb0c8287eded19963f9ce7e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::subclass_loop_guard::js_packed_arraylike_loop_revalidate_live (cognitive 39): perry_runtime::array::subclass_loop_guard::js_packed_arraylike_loop_revalidate_live has cognitive complexity 39 (threshold 15). Drivers by points: if/else 21 (26 pts), boolean chains 13 (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/perry-runtime/src/array/subclass_loop_guard.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1efb0e650094e0e9c763db638f8fe739b574ea3a99ad1f44b325b11e7f230f9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::list_relative_plural::rtf_auto_word (cognitive 39): perry_runtime::intl::list_relative_plural::rtf_auto_word has cognitive complexity 39 (threshold 15). Drivers by points: if/else 25 (37 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/perry-runtime/src/intl/list_relative_plural.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bd4152602d68039dcf56e168198ec0a73cb66d4775881276cc16b74a999372"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::array_object_ops::array_set_length_from_descriptor (cognitive 39): perry_runtime::object::array_object_ops::array_set_length_from_descriptor has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 8, loops 2 (6 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/perry-runtime/src/object/array_object_ops.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"c902920dc881af3d984dd8316aaf2d21f8e7625acc25b5c388ab158020638ca8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::ic_miss::class_field_define_fast::try_define_new_class_field (cognitive 39): perry_runtime::object::field_get_set::ic_miss::class_field_define_fast::try_define_new_class_field has cognitive complexity 39 (threshold 15). Drivers by points: if/else 21 (28 pts), boolean chains 9, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/field_get_set/ic_miss/class_field_define_fast.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2325a75bcdf34b0252d2d0c3acddf3f384297f5c4b48e7e349a5db24b244cb1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::polymorphic_index::js_object_set_index_polymorphic (cognitive 39): perry_runtime::object::polymorphic_index::js_object_set_index_polymorphic has cognitive complexity 39 (threshold 15). Drivers by points: if/else 25 (34 pts), boolean chains 5 (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/perry-runtime/src/object/polymorphic_index.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"f004d8005ed4cd334f58ada0136627986a13cd088b2238b13b6b7529d8090ec7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::shape_store::try_array_store (cognitive 39): perry_runtime::object::shape_store::try_array_store has cognitive complexity 39 (threshold 15). Drivers by points: if/else 23 (37 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/perry-runtime/src/object/shape_store.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4f561c9c2aca32b690fd09908016b0021b83a387a9fe1ff02ae7f42e987e48"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::util_parse_args::js_util_parse_args (cognitive 39): perry_runtime::util_parse_args::js_util_parse_args has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (34 pts), loops 2 (4 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/perry-runtime/src/util_parse_args.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"326dc04ffaf5109847298c07a9fc77f38624335bc449bc285c7f8678117ef2e1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::webcrypto::jwk::jwk_import_key_bytes (cognitive 39): perry_stdlib::webcrypto::jwk::jwk_import_key_bytes has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (35 pts), match/switch 1 (3 pts), boolean chains 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/perry-stdlib/src/webcrypto/jwk.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0c52a424701d893a7f6a2841d033b3ddb3ddce51afb4ce0a04b24c5ca50fac"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_android::state::state_set (cognitive 39): perry_ui_android::state::state_set has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 9 (18 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/perry-ui-android/src/state.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b0d4a342c6c9e13c857259c299648c5be23d0d0feb6252a24fa9384ebb2cfa"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_android::system::preferences_get (cognitive 39): perry_ui_android::system::preferences_get has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (29 pts), match/switch 9 (10 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/perry-ui-android/src/system.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e36472aa06e1b3ad1481f95f90344d94daceac0065881a609f7f027f32a45b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::state::state_set (cognitive 39): perry_ui_windows::state::state_set has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 8 (14 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/perry-ui-windows/src/state.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a4a24c2db833651401490df6f13a1a18429ecb622edf7e1c7e709826c8c189"}},{"ruleId":"D2","level":"warning","message":{"text":"Emitter::lower_inner (cognitive 39): Emitter::lower_inner has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 6 (12 pts), match/switch 4 (6 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/perry-wit/src/guest_c/values.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"171e10eb81937b77ea145d58cbafcccb264e4a813efaf80f95d0c87bc4ee09f9"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::publish_result (cognitive 39): Gen::publish_result has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 2 (8 pts), boolean chains 6, loops 3 (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/perry-wpfacts/src/gen/export.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ec35ee19dc842800836a27cac313f84a2ac69be19ea3bfed8b924629499e42"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::store_out_arg_reach (cognitive 39): Model::store_out_arg_reach has cognitive complexity 39 (threshold 15). Drivers by points: match/switch 8 (20 pts), if/else 5 (11 pts), boolean chains 4, loops 4 (nesting depth added 18). 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/perry-wpfacts/src/solve.rs"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b00412a1f773dbd83fcc00dcbc528fcb5ef3f71c139c1949635c08573bb00ab"}},{"ruleId":"D2","level":"warning","message":{"text":"primary-map-prefix-main07-v69r2-auto.build_arm (cognitive 39): primary-map-prefix-main07-v69r2-auto.build_arm has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 6 (12 pts), boolean chains 9, ternaries 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":"docs/audits/gc-rss-instructions-2026-10-03/primary-map-prefix-main07-v69r2-auto.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ae16293705905b89904143fc655f2cb1facf7742330357dd8760e3daa9df5c"}},{"ruleId":"D2","level":"warning","message":{"text":"check_buffer_layout.inventory (cognitive 39): check_buffer_layout.inventory has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 4 (9 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":"scripts/check_buffer_layout.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"002f4856722fc781b42258eb82011c2145821098aac465277ee9476320921282"}},{"ruleId":"D2","level":"warning","message":{"text":"measure_readpath3.measure (cognitive 39): measure_readpath3.measure has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 4 (10 pts), ternaries 5 (8 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":"scripts/measure_readpath3.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"923b5e384d50f46564477059d00a2493661a4245a7833932924eaaef384661e2"}},{"ruleId":"D2","level":"warning","message":{"text":"native_export_collisions.cfg_without_tests (cognitive 39): native_export_collisions.cfg_without_tests has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (20 pts), ternaries 5 (15 pts), boolean chains 2, loops 1 (2 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":"scripts/native_export_collisions.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ae984451e4da6fd08b57f7eba64fde9c44e5e72743d87674c1a9c50b81aea5"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceIndex.sourcemap (cognitive 39): SourceIndex.sourcemap has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 3 (6 pts), ternaries 2 (6 pts), boolean chains 4, error handling 1 (3 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":"scripts/package_bench_attr.py"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e08cfd5fd3e754f0ace4cc830c093d3241b4433073d9860cf81e37e50b4d9de"}},{"ruleId":"D2","level":"warning","message":{"text":"perf_readpath3.main (cognitive 39): perf_readpath3.main has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 7 (9 pts), ternaries 5 (9 pts), boolean chains 3 (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":"scripts/perf_readpath3.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9913dba5a5c492ed1cdbb3f3ac6f61518a11af4de66a0dc89dc6c85f227a79"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime_abi_check.strip_comments (cognitive 39): runtime_abi_check.strip_comments has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 4 (14 pts), if/else 6 (12 pts), loops 3 (7 pts), boolean chains 6 (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":"scripts/runtime_abi_check.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"5923e521c6e80ec4bbd897e6f569708ccf6293234ddf8149113b652d3a4d320c"}},{"ruleId":"D2","level":"warning","message":{"text":"wpfacts_precision.census (cognitive 39): wpfacts_precision.census has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 5 (7 pts), boolean chains 5, ternaries 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":"scripts/wpfacts_precision.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0999de9fdb265fc5a7dfa3e9b0b1eca51290e23ad4ea4f084730c0bbff54dbae"}},{"ruleId":"D2","level":"warning","message":{"text":"wpfacts_recompute.resolve_method (cognitive 39): wpfacts_recompute.resolve_method has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (24 pts), loops 5 (13 pts), boolean chains 2 (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":"scripts/wpfacts_recompute.py"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef323bb44e98c6ed34a8c291360c2512d34558975b8253530dd6e1d39b88f26f"}},{"ruleId":"D2","level":"warning","message":{"text":"color.namedColor (cognitive 39): color.namedColor has cognitive complexity 39 (threshold 15). Drivers by points: if/else 36, boolean chains 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":"packages/perry-styling/src/color.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"be77d74c0fb0f332f59bff79d376af5ccaae46e36518c15d71b004de28ba2e35"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::bootstrap::rerun_collect_with_class_field_types (cognitive 38): perry::commands::compile::bootstrap::rerun_collect_with_class_field_types has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 8 (15 pts), boolean chains 3 (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/perry/src/commands/compile/bootstrap.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed281f3de3225d84dc2d001b36862fc187d8d56f2f067f4b1c94277de3bf413"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::link::harmonyos_objects::push_harmonyos_native_objects (cognitive 38): perry::commands::compile::link::harmonyos_objects::push_harmonyos_native_objects has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 6 (13 pts), boolean chains 3, match/switch 1 (2 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/perry/src/commands/compile/link/harmonyos_objects.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1cb4a94007ba6003a0b0c7175ce7f88d3038fd00519e520cce75ca87da6fa2c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::hoisted_callback_calls::collect_loop_called_callee_bindings::scan_stmt (cognitive 38): perry_codegen::collectors::hoisted_callback_calls::collect_loop_called_callee_bindings::scan_stmt has cognitive complexity 38 (threshold 15). Drivers by points: loops 10 (24 pts), if/else 7 (13 pts), match/switch 1 (nesting depth added 20). 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/perry-codegen/src/collectors/hoisted_callback_calls.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f09b2b1805876fc20264703b30a38963b6a4d95fa11e9639609f7904eedcaf0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::index_get::lower_numeric_index_get_for_number_context (cognitive 38): perry_codegen::expr::index_get::lower_numeric_index_get_for_number_context has cognitive complexity 38 (threshold 15). Drivers by points: if/else 19 (36 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/perry-codegen/src/expr/index_get.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d4ea1f231ee2cf844a1320601453786edf7536a150fee76678a58a8d8765d5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::literals_vars::bind_lowered_value_to_local (cognitive 38): perry_codegen::expr::literals_vars::bind_lowered_value_to_local has cognitive complexity 38 (threshold 15). Drivers by points: if/else 21 (34 pts), boolean chains 4 (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/perry-codegen/src/expr/literals_vars.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"060f7a89d7ddde19e399b6784859d8a3cde38743aa0548e755d450750e4fdf02"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::fn_info::render_definition (cognitive 38): perry_codegen::fn_info::render_definition has cognitive complexity 38 (threshold 15). Drivers by points: if/else 30 (32 pts), match/switch 3 (4 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/perry-codegen/src/fn_info.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a97ef9aadaa1678497a15105761d1656223026ef64ca8edc605f13e112b40e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::loops::lower_packed_f64_range_versioned_for (cognitive 38): perry_codegen::stmt::loops::lower_packed_f64_range_versioned_for has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (28 pts), match/switch 3 (5 pts), boolean chains 3, loops 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":3700}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf19b5697d1ea700145d0411bb786ea2116097f33b91b654b8d30772397329a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::type_analysis::pod::numeric_proof_is_declared_only (cognitive 38): perry_codegen::type_analysis::pod::numeric_proof_is_declared_only has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (34 pts), boolean chains 3, 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/perry-codegen/src/type_analysis/pod.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0eda20f6dd75a8e44dddda48029dd1a7f94ebc13038d309511b94380857e644"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_arkts::mutations::collect_mutations_in_stmt (cognitive 38): perry_codegen_arkts::mutations::collect_mutations_in_stmt has cognitive complexity 38 (threshold 15). Drivers by points: loops 6 (20 pts), if/else 8 (17 pts), match/switch 1 (nesting depth added 23). 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/perry-codegen-arkts/src/mutations.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"89336e0cca893eee23fcf7405a2c1d5bd486d7eaf49847cd2338e3b878e2a28f"}},{"ruleId":"D2","level":"warning","message":{"text":"Host::new_prepared (cognitive 38): Host::new_prepared has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 7 (11 pts), boolean chains 2, match/switch 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/perry-component-host/src/lib.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"b397b7a8906c497cfc46183c39f23c7b9c9b05640f721011c27c784641cae312"}},{"ruleId":"D2","level":"warning","message":{"text":"ComposeEngine::down (cognitive 38): ComposeEngine::down has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 5 (11 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/perry-container-compose/src/compose.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd10eb4485f099e5db0e68139ad685ae1c08ebb013d618e9fe31ae8e5428f592"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::audit::visit_stmt (cognitive 38): perry_hir::audit::visit_stmt has cognitive complexity 38 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 8 (15 pts), match/switch 1 (nesting depth added 20). 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/perry-hir/src/audit.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1387c40914a734a5378d7fe2f271425f3815144fe35686e32fbf80ca686d269"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::capability::visit_stmt (cognitive 38): perry_hir::capability::visit_stmt has cognitive complexity 38 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 8 (15 pts), match/switch 1 (nesting depth added 20). 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/perry-hir/src/capability.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e203f5d780ef544b54c2693f82f924164db4c78cd2595580d7779e2aa2fee1dc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::egress::visit_stmt (cognitive 38): perry_hir::egress::visit_stmt has cognitive complexity 38 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 8 (15 pts), match/switch 1 (nesting depth added 20). 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/perry-hir/src/egress.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1bb3724e6669ad1948fb37fe8a6fe609bfe27c9290971777f2a39baafd3029"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::iterator_record::walk_stmt (cognitive 38): perry_hir::iterator_record::walk_stmt has cognitive complexity 38 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 8 (15 pts), match/switch 1 (nesting depth added 20). 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/perry-hir/src/iterator_record.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75c597808458665ee902755aa5e017628ea9fdd5b87d8984f76947748b92dd0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::js_transform::local_natives::fix_class_field_stmt (cognitive 38): perry_hir::js_transform::local_natives::fix_class_field_stmt has cognitive complexity 38 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 8 (15 pts), match/switch 1 (nesting depth added 20). 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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"14485a8c40107093913ce1313bcd8b3c1eb1a6171ec117843eb4543cf7f2ed2d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lockdown::visit_stmt (cognitive 38): perry_hir::lockdown::visit_stmt has cognitive complexity 38 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 8 (15 pts), match/switch 1 (nesting depth added 20). 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/perry-hir/src/lockdown.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c1761735ccd5d228a4fbe9234379ae13267730c4c75f55a06c30c0812ab3c3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::lower_module_fn::collect_top_level_closure_reassigned_identifiers (cognitive 38): perry_hir::lower::lower_module_fn::collect_top_level_closure_reassigned_identifiers has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 7 (11 pts), match/switch 4 (7 pts) (nesting depth added 20). Of this number, 19 points are the body\u0027s own statements and 19 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":"crates/perry-hir/src/lower/lower_module_fn.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77c43451c2f6509eb632318ec7939ed5999e270decf3cb25c31a6386c22ea8b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::widget_decl::parse_stack_node (cognitive 38): perry_hir::lower::widget_decl::parse_stack_node has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (30 pts), loops 2 (6 pts), match/switch 1 (2 pts) (nesting depth added 27). 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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e3db7406784863cafd81e3966b55f89edefca786f2d741f03f1c9d3dafc88e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::block::pre_register_forward_captured_lets_in_scope (cognitive 38): perry_hir::lower_decl::block::pre_register_forward_captured_lets_in_scope has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (26 pts), loops 3 (10 pts), boolean chains 2 (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/perry-hir/src/lower_decl/block.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7cf4b27ee3127f612a4c5122b2c74c984334cdbd00679a5e63a589d00895996"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::splice_slice::js_array_slice (cognitive 38): perry_runtime::array::splice_slice::js_array_slice has cognitive complexity 38 (threshold 15). Drivers by points: if/else 19 (34 pts), loops 2 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/array/splice_slice.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"8478cc5aeef02e7166685db27d39e4c00cf5807a1c19d61a7591915dee6cd5d5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::builtins::arithmetic::abstract_relational (cognitive 38): perry_runtime::builtins::arithmetic::abstract_relational has cognitive complexity 38 (threshold 15). Drivers by points: if/else 19 (25 pts), match/switch 4 (8 pts), boolean chains 5 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/perry-runtime/src/builtins/arithmetic.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9c9c949fcf939ea99a88c754c76efa4fe61198bfa14160c2d44c2aad7c8a68"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::bun_compat::cli_utils::hard_wrap_word (cognitive 38): perry_runtime::bun_compat::cli_utils::hard_wrap_word has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 3 (9 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/perry-runtime/src/bun_compat/cli_utils.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"8498a138714f223b7f1d43367c51bfbd1d7e616ea20defac1b79c057e5fd1149"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::closure::dispatch::value_call::dispatch_explicit_this_call (cognitive 38): perry_runtime::closure::dispatch::value_call::dispatch_explicit_this_call has cognitive complexity 38 (threshold 15). Drivers by points: if/else 23 (29 pts), boolean chains 6, loops 1 (3 pts) (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/perry-runtime/src/closure/dispatch/value_call.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"10adfaaec6214c733ba18986197fb082b1e61df97fd11b9aa1b215604e721c15"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::closure::props::bag_born_with_attrs (cognitive 38): perry_runtime::closure::props::bag_born_with_attrs has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (30 pts), loops 2 (5 pts), boolean chains 3 (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/perry-runtime/src/closure/props.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c2a55993b1aae4caabb8477553cc57ae4f810c7f1626feb8af4edb1d178a82"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::dyn_eval::interp::collect_var_names_stmt (cognitive 38): perry_runtime::dyn_eval::interp::collect_var_names_stmt has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 5 (16 pts), match/switch 1 (nesting depth added 23). 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/perry-runtime/src/dyn_eval/interp.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"8478a91cf7e4e6fc1807b266dfbef1698c303f43fa714ab896ea663838eb9f76"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::dyn_eval::interp::bind_pattern (cognitive 38): perry_runtime::dyn_eval::interp::bind_pattern has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (30 pts), loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 22). 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/perry-runtime/src/dyn_eval/interp.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6fb79fd667fa3bce24cc2f29a068772d77559f4020c374af1264e95b64a97b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::tenuring::retune_nursery_cap_scale (cognitive 38): perry_runtime::gc::tenuring::retune_nursery_cap_scale has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 2 (8 pts), boolean chains 7 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/gc/tenuring.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa01f5bc7cec4d83d23aa9d7f5051fe27cb8bbaffbcc80a98e64d43de367ff9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::path::js_path_win32_resolve_join (cognitive 38): perry_runtime::path::js_path_win32_resolve_join has cognitive complexity 38 (threshold 15). Drivers by points: if/else 20 (30 pts), boolean chains 8 (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/perry-runtime/src/path.rs"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"167dee73c14c8e0f3d893833e92f1a7796bd99e88b740fdac97d1d0b88f1e576"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::punycode::encode (cognitive 38): perry_runtime::punycode::encode has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 5 (10 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/perry-runtime/src/punycode.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f00a2b750398a1751fec7ea07caa5562c5fd623f35b00f7f5904ebae637069e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::streams::js_reader_read (cognitive 38): perry_stdlib::streams::js_reader_read has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (35 pts), match/switch 3 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/streams.rs"},"region":{"startLine":2358}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7ebae9dd13134d9c78b5c9808b799f53960b64e3fea322368d63d43d563789"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::deforest::run (cognitive 38): perry_transform::deforest::run has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 9 (14 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/perry-transform/src/deforest/mod.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cda431b50c9b5630038bf376bd6f3d7dc1b6ae89059bdc38b9c90dee78880f6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::iter_result_rewrite::rewrite_stmt (cognitive 38): perry_transform::generator::iter_result_rewrite::rewrite_stmt has cognitive complexity 38 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 8 (15 pts), match/switch 1 (nesting depth added 20). 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/perry-transform/src/generator/iter_result_rewrite.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f9882a699dcd084c62ec70658ea69107d21cdc4d7965a61793c3d1744372b2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::inline_functions_inner::walk_stmt_exprs (cognitive 38): perry_transform::inline::inline_functions_inner::walk_stmt_exprs has cognitive complexity 38 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 8 (15 pts), match/switch 1 (nesting depth added 20). 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. This shape REPEATS in the file: one other method here (perry_transform::inline::inline_functions_inner) 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/perry-transform/src/inline/mod.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ef4c6420bab4ce34ebb2486a5ab98e0caab2f0cccde84bc273c3208dd42df4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::exact_receivers::collect_exact_receiver_refs_in_stmt (cognitive 38): perry_transform::inline::exact_receivers::collect_exact_receiver_refs_in_stmt has cognitive complexity 38 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 8 (15 pts), match/switch 1 (nesting depth added 20). 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/perry-transform/src/inline/exact_receivers.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e1c1bb8ac5ab47e7f07a071be8cecb65b113e646775f34e7f0bc903c3cd172"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_ios::state::state_set (cognitive 38): perry_ui_ios::state::state_set has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 8 (15 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-ios/src/state.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"220b78fdd783822036f9decbcab385cc05d9c81fc8a8503b95426b5def1a94c0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::widgets::paint_shadow_for_child (cognitive 38): perry_ui_windows::widgets::paint_shadow_for_child has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (30 pts), boolean chains 3, loops 2 (3 pts), match/switch 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/perry-ui-windows/src/widgets/mod.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e38c6c766deec1656f5005165a110d139346840759f74654c22c2a456a0f69e"}},{"ruleId":"D2","level":"warning","message":{"text":"shape-storage-observer-v17.observe_shapes (cognitive 38): shape-storage-observer-v17.observe_shapes has cognitive complexity 38 (threshold 15). Drivers by points: if/else 5 (19 pts), loops 5 (15 pts), boolean chains 4 (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":"docs/audits/gc-rss-instructions-2026-10-03/shape-storage-observer-v17.py"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9bfc4c798458e2e27bf48b6d37700bcc532723cec13628bc871b51c433c4f1"}},{"ruleId":"D2","level":"warning","message":{"text":"component_http_p3_acceptance.client (cognitive 38): component_http_p3_acceptance.client has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 3 (7 pts), error handling 2, ternaries 2, 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":"scripts/component_http_p3_acceptance.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d73efa137af9d1f4e3331e5fc7a41150455a58cf200a1cb29f0e9098834691"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.runtime_symbol_bodies (cognitive 38): gc_root_dominance_check.runtime_symbol_bodies has cognitive complexity 38 (threshold 15). Drivers by points: loops 9 (26 pts), if/else 4 (12 pts) (nesting depth added 25). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gc_root_dominance_check.py"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6287cd347f300e1f2ab49bb86c3803679755e4821e79e8177849a616166c959"}},{"ruleId":"D2","level":"warning","message":{"text":"native_export_collisions.production_tokens (cognitive 38): native_export_collisions.production_tokens has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (31 pts), loops 2 (5 pts), boolean chains 2 (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":"scripts/native_export_collisions.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"2553d183e9e3a9f2b593d423ff218517d688b9ff7fb131ce298b97bb44f6d124"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime_rss_ab.main (cognitive 38): runtime_rss_ab.main has cognitive complexity 38 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 7 (12 pts), ternaries 4 (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":"scripts/runtime_rss_ab.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9f10947327fced968e963a01065353860232c3d9a545f3d7cc4df12436d379"}},{"ruleId":"D2","level":"warning","message":{"text":"color.parseColor (cognitive 38): color.parseColor has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (32 pts), ternaries 2 (6 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/perry-styling/src/color.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd3b368e64d03e6f3abc7b7e3ebf291a4ef2fffaaa9933a6d709a4024528efd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::main_inner (cognitive 37): perry::main_inner has cognitive complexity 37 (threshold 15). Drivers by points: if/else 19 (29 pts), boolean chains 4, match/switch 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/perry/src/main.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccac39db6f76a6789a71048b93454a1da1251c47c027b9c8366a73091749ef12"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::bootstrap::dump_hir_for_debug (cognitive 37): perry::commands::compile::bootstrap::dump_hir_for_debug has cognitive complexity 37 (threshold 15). Drivers by points: loops 7 (17 pts), if/else 6 (13 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 18). 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/perry/src/commands/compile/bootstrap.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0f0a34144698bc077b5d0224ea75069390e9e59d8ec7a0040e029384bd9ce2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::extract_requires::deferred_function_sites (cognitive 37): perry::commands::compile::cjs_wrap::extract_requires::deferred_function_sites has cognitive complexity 37 (threshold 15). Drivers by points: loops 5 (17 pts), boolean chains 9, if/else 5 (9 pts), match/switch 1 (2 pts) (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/cjs_wrap/extract_requires.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ae18c9d5a6085e4eaa930c3ee04c716f61aa7493d48285ab0f96975d049633"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::resolve::resolve_package_declaration_entry (cognitive 37): perry::commands::compile::resolve::resolve_package_declaration_entry has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (33 pts), loops 1 (4 pts) (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/perry/src/commands/compile/resolve.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89342c24ae867f83a426558eaedba9ea86aa7098ff9575cebba650364e45a65"}},{"ruleId":"D2","level":"warning","message":{"text":"Census::precise_nodes (cognitive 37): Census::precise_nodes has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 6 (12 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/perry-codegen/src/codegen/reach_report.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"201a81b3e9d067c2c2b9479ea9201a5a9073b19a3510ecf74d94660dca8bce58"}},{"ruleId":"D2","level":"warning","message":{"text":"Build::solve (cognitive 37): Build::solve has cognitive complexity 37 (threshold 15). Drivers by points: loops 11 (19 pts), if/else 5 (14 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 19). 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/perry-codegen/src/codegen/source_need/flow.rs"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d6b8079cacfea1722204341dc258f732bb0233c131809103c971dc4d47db84"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::entry::module_init::compile_module_init (cognitive 37): perry_codegen::codegen::entry::module_init::compile_module_init has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 9, loops 6 (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/perry-codegen/src/codegen/entry/module_init.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a2a5093a60afe0fe12611a6432832cf6e88fb903c96ff28592e164a1c479c7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::this_as_value::expr_uses_this_as_value (cognitive 37): perry_codegen::collectors::this_as_value::expr_uses_this_as_value has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 14, if/else 8 (13 pts), match/switch 5 (10 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/perry-codegen/src/collectors/this_as_value.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c04b34d8184970bfe8c6c7e11432876e6f95d9ff823ad6888879579e19f970"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::lower_expr_value (cognitive 37): perry_codegen::expr::lower_expr_value has cognitive complexity 37 (threshold 15). Drivers by points: if/else 19 (36 pts), match/switch 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/perry-codegen/src/expr/mod.rs"},"region":{"startLine":4392}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2725777946aed1909d6cf4699101d883e55cd7aff115b9390b5943665cc0e5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::fallback_diag::enter_expr (cognitive 37): perry_codegen::fallback_diag::enter_expr has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (23 pts), match/switch 7 (11 pts), loops 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/perry-codegen/src/fallback_diag.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa5870d365e06c55d34efd18b848d33ae85cffe5fd78e5d646aceb7b163301d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::function::precise_roots::remat::apply (cognitive 37): perry_codegen::function::precise_roots::remat::apply has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (35 pts), boolean chains 1, loops 1 (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/perry-codegen/src/function/precise_roots/remat.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce399837a70fe21bd166a0137f876315e273341d1f1cb903b6b4e52fd275e57"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::loops::masked_window_expression_proof (cognitive 37): perry_codegen::stmt::loops::masked_window_expression_proof has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 10, loops 2 (4 pts), match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":2982}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5535d4e40f8092d19568eef3855875e5f410aa099f5b3e32739a12814ffafc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::type_analysis::predicates::receiver_class_name (cognitive 37): perry_codegen::type_analysis::predicates::receiver_class_name has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (27 pts), match/switch 4 (7 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 19). 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/perry-codegen/src/type_analysis/predicates.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07a1be9b726d77b33e11ade20e404288268551f53e5b17c5e31dc58873221f0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_arkts::conditions::evaluate_condition::to_lit (cognitive 37): perry_codegen_arkts::conditions::evaluate_condition::to_lit has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 9 (17 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/perry-codegen-arkts/src/conditions.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"1566fb61821030c8346a3032169144c0da2d533494950618b531f2ffe9e94e8d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::analysis::remap_local_ids_in_expr (cognitive 37): perry_hir::analysis::remap_local_ids_in_expr has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 4 (8 pts), match/switch 1 (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/analysis.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd98eb0ac117dd20b4e909154651ceb910ceaee05df474a36dbc367b8e2b45f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::eval_super_scan::scan_stmt (cognitive 37): perry_hir::lower::eval_super_scan::scan_stmt has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 6 (15 pts), match/switch 2 (3 pts) (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/eval_super_scan.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca63169af9eea840e3f1f24f30f2fab9ab9f3e64ab951ee3c463af2f284324c4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::nested_namespace::try_util_types_namespace (cognitive 37): perry_hir::lower::expr_call::nested_namespace::try_util_types_namespace has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (28 pts), match/switch 1 (8 pts), boolean chains 1 (nesting depth added 28). 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/perry-hir/src/lower/expr_call/nested_namespace.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ed7efd0421f1a1830182a1f9cab860e700877bb86a17f8e623ecf5827f5be9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::module_tdz::apply (cognitive 37): perry_hir::lower::module_tdz::apply has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 6 (7 pts), match/switch 2 (4 pts), boolean chains 3 (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/perry-hir/src/lower/module_tdz.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1634fcd2a8adc7f69ae145f7fe60a4dcfd15654ae817625379fab3819a50b2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::class_members::lower_constructor_in_scope (cognitive 37): perry_hir::lower_decl::class_members::lower_constructor_in_scope has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (25 pts), match/switch 3 (7 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c660fb4d43104f7fc8f6518f45ada88a4a145ca9d3862fe33dd6efdcdd2916e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::enum_decl::enum_value_binding (cognitive 37): perry_hir::lower_decl::enum_decl::enum_value_binding has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (24 pts), match/switch 3 (9 pts), boolean chains 2, loops 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/perry-hir/src/lower_decl/enum_decl.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27b9147b568f34c60be77878c4dccd1ed3d001a90a9f84bfa1a360f09de3628"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::monomorph::infer::infer_expr_type (cognitive 37): perry_hir::monomorph::infer::infer_expr_type has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (25 pts), match/switch 5 (10 pts), boolean chains 2 (nesting depth added 19). 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/perry-hir/src/monomorph/infer.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fd54a3d5bb07a0af39120572198451f2f138dd1dca3ddf2e2cabe5d1ba3e0f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_http_server::conn::drain (cognitive 37): perry_http_server::conn::drain has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (25 pts), match/switch 4 (9 pts), boolean chains 2, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-http-server/src/conn.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"208358a7cefaf2351a491ac8cc9b9905c3772361539a7c4bfe7e6fc8151fff5c"}},{"ruleId":"D2","level":"warning","message":{"text":"ValidPointerSetBuilder::walk_census_block (cognitive 37): ValidPointerSetBuilder::walk_census_block has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 2, 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/perry-runtime/src/gc/trace.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"79809b8c57ac7e80b6fecd8607a716f3840ac018279ffb3ebf29ac3a5b04ad19"}},{"ruleId":"D2","level":"warning","message":{"text":"FullWeakProcessingState::step (cognitive 37): FullWeakProcessingState::step has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (33 pts), match/switch 1 (2 pts), boolean chains 1, 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/perry-runtime/src/weakref/sliced.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"9550f4e367c29c3a1c0933afad83253cb7e0b25a161e4cc790faa3a05abb17d4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::sort_indices::sort_indices (cognitive 37): perry_runtime::array::sort_indices::sort_indices has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 6 (12 pts), boolean chains 5 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/array/sort_indices.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e8d4b850192559ed315433145b0f61edf40a2c72a10e9c97491826e490b8b7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::bigint::convert::js_bigint_from_f64 (cognitive 37): perry_runtime::bigint::convert::js_bigint_from_f64 has cognitive complexity 37 (threshold 15). Drivers by points: if/else 22 (34 pts), match/switch 1 (2 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/perry-runtime/src/bigint/convert.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5933db9c16d46d48918a921c67df8f9d6349cca1a731f8a807a51ae82cf3add"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::builtins::console::decode_dir_depth_option (cognitive 37): perry_runtime::builtins::console::decode_dir_depth_option has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (35 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/perry-runtime/src/builtins/console.rs"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"648e3bc33f9e001bb725d808ecf682e6cfd560758c1ae1e77abb8331b0ada591"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::component::value::encode_at (cognitive 37): perry_runtime::component::value::encode_at has cognitive complexity 37 (threshold 15). Drivers by points: if/else 21 (29 pts), boolean chains 4, loops 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/perry-runtime/src/component/value.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"799ab4c861266bbaa614ca772ca0ec79c8c865e0af4602950c0878e9caefbb31"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::shape_mint_census::classify_mint (cognitive 37): perry_runtime::object::shape_mint_census::classify_mint has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (34 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/shape_mint_census.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"035fbf385804ff46794589b6bc20c9ac1abc1cd53072398b1ec4fec6b38bc72f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::shapes::region_loop_pack (cognitive 37): perry_runtime::object::shapes::region_loop_pack has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 7, match/switch 2 (5 pts), loops 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/perry-runtime/src/object/shapes.rs"},"region":{"startLine":3346}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a635ebaf1fd8e46274193be51a9a72460b71dd7ac288ac0ea5b4939bd708717"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::literal_replace::split (cognitive 37): perry_runtime::string::literal_replace::split has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 2 (8 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/perry-runtime/src/string/literal_replace.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7742eb19149ac93faf1117448bd55a1bf339cc0148ee033a21aa314c136521"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::rewrite_returns::body_contains_return (cognitive 37): perry_transform::generator::rewrite_returns::body_contains_return has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (31 pts), loops 2 (4 pts), match/switch 1 (2 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/perry-transform/src/generator/rewrite_returns.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f58718dc33f14e5043e4bb081cf518e6cd9cfa5bd4cce3d5ab5971eebc4fe56"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::media_playback::poll_tick (cognitive 37): perry_ui_windows::media_playback::poll_tick has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (33 pts), match/switch 1 (2 pts), boolean chains 1, 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/perry-ui-windows/src/media_playback.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"722112b7358a70ea5fd2cf687600ee8958bac0fd3306ebde7a5531ef264303c6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::widgets::hstack::container_wnd_proc (cognitive 37): perry_ui_windows::widgets::hstack::container_wnd_proc has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (35 pts), boolean chains 1, match/switch 1 (nesting depth added 19). 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/perry-ui-windows/src/widgets/hstack.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6365cbc4bdf561c3c47078c59b3880cc73e503ac5ce487efd721c173e1f88a7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::widgets::vstack::container_wnd_proc (cognitive 37): perry_ui_windows::widgets::vstack::container_wnd_proc has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (35 pts), boolean chains 1, match/switch 1 (nesting depth added 19). 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/perry-ui-windows/src/widgets/vstack.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35a8fc1ed86199c02aee37bf7d1e3d55b95a4d214ff9b5ed0bdf3c1b76126ea"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::walk_class (cognitive 37): Gen::walk_class has cognitive complexity 37 (threshold 15). Drivers by points: loops 11 (15 pts), if/else 6 (11 pts), match/switch 4 (8 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/gen/walk.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"409fa91c87b0ae7d53a87caeb4e1a41e83ef96e85a3099024683f66dfe35b82c"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::stmt_inner (cognitive 37): Gen::stmt_inner has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (28 pts), match/switch 3 (5 pts), loops 2 (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/perry-wpfacts/src/gen/walk.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9de7ce4674ea5bfd442362d371ebfd1881262ef06aa520103d3f32020a34b7"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::override_reports (cognitive 37): Gen::override_reports has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (26 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":"crates/perry-wpfacts/src/gen.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d5239b039b8788795c5e68b2f1dbed74a00fc0991738cd25881adfafb16cf4"}},{"ruleId":"D2","level":"warning","message":{"text":"check_ext_net_socket_open_invariant.evaluate (cognitive 37): check_ext_net_socket_open_invariant.evaluate has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 6 (9 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check_ext_net_socket_open_invariant.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba0c8ff1c87111a26c75658e5723067fe6c427f937d88915d2d0d86a843d4cc"}},{"ruleId":"D2","level":"warning","message":{"text":"global_sink_isolation.self_test (cognitive 37): global_sink_isolation.self_test has cognitive complexity 37 (threshold 15). Drivers by points: if/else 23 (26 pts), loops 4, boolean chains 3, error handling 2 (3 pts), ternaries 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":"scripts/global_sink_isolation.py"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80aeb2c0e30b211721db1766656e35e39061887582995ec61d25def6291e108"}},{"ruleId":"D2","level":"warning","message":{"text":"raw_handle_debt.self_test (cognitive 37): raw_handle_debt.self_test has cognitive complexity 37 (threshold 15). Drivers by points: if/else 19 (24 pts), loops 6, boolean chains 4, error handling 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/raw_handle_debt.py"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf566cba777b7f9f660ff83c430dd0e3dbfe7d0c9d84fa1b2e395626b4adde4"}},{"ruleId":"D2","level":"warning","message":{"text":"stackmap_anatomy.extract_section (cognitive 37): stackmap_anatomy.extract_section has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 4 (10 pts), boolean chains 5 (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":"scripts/stackmap_anatomy.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c55f1f41bca27481f6bb2eedc5d0604fcf00c1a28c753943a9b7fb69c342962"}},{"ruleId":"D2","level":"warning","message":{"text":"test262_subset.main (cognitive 37): test262_subset.main has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (20 pts), ternaries 5 (7 pts), boolean chains 4, loops 3 (4 pts), error handling 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":"scripts/test262_subset.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"57213d2e7f3f6c9c9c931eab8de74067d33852888d58b4b4807b9b84f7cff31c"}},{"ruleId":"D2","level":"warning","message":{"text":"turnloop_p0_loop_stats.main (cognitive 37): turnloop_p0_loop_stats.main has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (28 pts), ternaries 3 (4 pts), loops 3, boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop_p0_loop_stats.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"168e20c90b063745aa6c7e15af97695941bf3bab188d7e8e9b0507a741afb169"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::bootstrap::recompute_common_project_root (cognitive 36): perry::commands::compile::bootstrap::recompute_common_project_root has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 3 (11 pts), match/switch 1 (4 pts) (nesting depth added 25). 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/perry/src/commands/compile/bootstrap.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"c895ea38a72a359306c046e19a0703abd58da1fe8c6d3c1f4b1d42b6ba7fc559"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::targets::compile_for_watchos_widget (cognitive 36): perry::commands::compile::targets::compile_for_watchos_widget has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (16 pts), loops 7 (15 pts), match/switch 3 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/targets.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e97d371f7d44f49d9c3271d2a3a09cdeaf53982ab8a886c1c41b7ae6816e4ec"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::login::run (cognitive 36): perry::commands::login::run has cognitive complexity 36 (threshold 15). Drivers by points: if/else 19 (31 pts), match/switch 2 (4 pts), 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/perry/src/commands/login.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6680a80ed757c5be90463f0e86bce5693dafd44e07afac1c039cf5cc0cf5c82d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::escape_objects::find_object_literal_candidates (cognitive 36): perry_codegen::collectors::escape_objects::find_object_literal_candidates has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 3 (7 pts), boolean chains 2, match/switch 1 (2 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/perry-codegen/src/collectors/escape_objects.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"3184f06def1323cf5e6384e4a6545339f04d264ffbd09ba8c29d3e21a20a887d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::hot_callees::collect_alloc_hot_functions (cognitive 36): perry_codegen::collectors::hot_callees::collect_alloc_hot_functions has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 10 (16 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/hot_callees.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3116bc705616c3dd57b0e78468207548add4b65dfeaa3132e0596941e1e1e46"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_numeric::prove_group_numeric_fields (cognitive 36): perry_codegen::collectors::ptr_shape_numeric::prove_group_numeric_fields has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 5 (11 pts), match/switch 2 (7 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/perry-codegen/src/collectors/ptr_shape_numeric.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"697cf02e322f5ffd574f33d0e4802ff7d17865a546f56c1e6eb8097e6b170424"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::safepoint_sites::count_in_stmt (cognitive 36): perry_codegen::collectors::safepoint_sites::count_in_stmt has cognitive complexity 36 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 7 (13 pts), match/switch 1 (nesting depth added 19). 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/perry-codegen/src/collectors/safepoint_sites.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e62acaee8ad45ea4a3cf9907023d2cc21bca6b0b50a7f040010d24a73d4fcc4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::sealed_buffers::buffer_exposure (cognitive 36): perry_codegen::collectors::sealed_buffers::buffer_exposure has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 6 (8 pts), boolean chains 5, match/switch 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/perry-codegen/src/collectors/sealed_buffers.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c131d889380f35752a6f932662efa38d1f0def3cac195b6f649254de7642a6a8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::index_get::guarded_array::lower_guarded_array_index_get_with_index (cognitive 36): perry_codegen::expr::index_get::guarded_array::lower_guarded_array_index_get_with_index has cognitive complexity 36 (threshold 15). Drivers by points: if/else 25 (31 pts), boolean chains 4, match/switch 1 (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/perry-codegen/src/expr/index_get/guarded_array.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"86844e2367fa69bf85f7da90f5bbb145622294b45e0e1352e3d4aefe444ff4e0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::range_facts::int_range_expr_inner (cognitive 36): perry_codegen::expr::range_facts::int_range_expr_inner has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 4 (8 pts), boolean chains 4 (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/range_facts.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a84ec68d6ec8347a3119aa50d192760a78b84bdbe7b83e18ec04baf80e9b97"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::providers::program_providers (cognitive 36): perry_codegen::providers::program_providers has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 7 (11 pts), match/switch 1 (4 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/perry-codegen/src/providers.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f95e40e18ea8cfeea75423bba376bc116a4cad88428e4e3d29b087046087662"}},{"ruleId":"D2","level":"warning","message":{"text":"FuncEmitCtx::try_emit_expr_buffers (cognitive 36): FuncEmitCtx::try_emit_expr_buffers has cognitive complexity 36 (threshold 15). Drivers by points: if/else 22 (33 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/emit/expr/buffers.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"473f2b1da399a596e55d40e0acdf67304c56490ea6f0e23b175a041f5af2969e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_cheerio::js_cheerio_selection_children (cognitive 36): perry_ext_cheerio::js_cheerio_selection_children has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (29 pts), loops 2 (7 pts) (nesting depth added 28). 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/perry-ext-cheerio/src/lib.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c6f59a3c0fecab7537eb7646f9554dd32aaedfc64e3d529a0a14551269bd39"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_gc_effects::archive::parse_section (cognitive 36): perry_gc_effects::archive::parse_section has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-gc-effects/src/archive.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e8c21f00c86f8bc47f8dc1b7591f095bf196b705f7da77625163cf70526f14"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_gc_effects::instructions::writes (cognitive 36): perry_gc_effects::instructions::writes has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 10, match/switch 1 (3 pts), loops 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/perry-gc-effects/src/instructions.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"150ff1624834b83c71e80e731cf7bc65805f5761738545b64511023a3b01862a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::closure_analysis::collect_closure_assigned_stmt (cognitive 36): perry_hir::lower::closure_analysis::collect_closure_assigned_stmt has cognitive complexity 36 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 7 (13 pts), match/switch 1 (nesting depth added 19). 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. This shape REPEATS in the file: 3 other methods here (perry_hir::lower::closure_analysis::collect_closure_captures_stmt, perry_hir::lower::closure_analysis::collect_scope_level_assigns_stmt, perry_hir::lower::closure_analysis::collect_closure_assigned_in_closure_body_stmt) 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/perry-hir/src/lower/closure_analysis.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a2e6e91a7e225b1cab0543cf8bfa55cf8bd34fedd92941f365e75652ff4f53"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::closure_analysis::collect_closure_captures_stmt (cognitive 36): perry_hir::lower::closure_analysis::collect_closure_captures_stmt has cognitive complexity 36 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 7 (13 pts), match/switch 1 (nesting depth added 19). 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. This shape REPEATS in the file: 3 other methods here (perry_hir::lower::closure_analysis::collect_closure_assigned_stmt, perry_hir::lower::closure_analysis::collect_scope_level_assigns_stmt, perry_hir::lower::closure_analysis::collect_closure_assigned_in_closure_body_stmt) 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/perry-hir/src/lower/closure_analysis.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"e375c1f5c1c49aeeb0ab4546253c64b20f70ea974ef5ef808c02f362da37cf78"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::closure_analysis::collect_scope_level_assigns_stmt (cognitive 36): perry_hir::lower::closure_analysis::collect_scope_level_assigns_stmt has cognitive complexity 36 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 7 (13 pts), match/switch 1 (nesting depth added 19). 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. This shape REPEATS in the file: 3 other methods here (perry_hir::lower::closure_analysis::collect_closure_assigned_stmt, perry_hir::lower::closure_analysis::collect_closure_captures_stmt, perry_hir::lower::closure_analysis::collect_closure_assigned_in_closure_body_stmt) 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/perry-hir/src/lower/closure_analysis.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76fdf958712aaec2cd078ed933f533693274f885c1a415e5bc1aeec686ebb32"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::closure_analysis::collect_closure_assigned_in_closure_body_stmt (cognitive 36): perry_hir::lower::closure_analysis::collect_closure_assigned_in_closure_body_stmt has cognitive complexity 36 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 7 (13 pts), match/switch 1 (nesting depth added 19). 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. This shape REPEATS in the file: 3 other methods here (perry_hir::lower::closure_analysis::collect_closure_assigned_stmt, perry_hir::lower::closure_analysis::collect_closure_captures_stmt, perry_hir::lower::closure_analysis::collect_scope_level_assigns_stmt) 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/perry-hir/src/lower/closure_analysis.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0dcf7dbe60e6c2e4f12079fc44e852bf75984050e5b927e6d663acf1bc4b7d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::intrinsics::apply_call::try_native_module_method_apply_call (cognitive 36): perry_hir::lower::expr_call::intrinsics::apply_call::try_native_module_method_apply_call has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (26 pts), match/switch 3 (6 pts), boolean chains 4 (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/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4528051976d105530efa5508c98d01b59cd05fc1b8486f2872101bb922e0f7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::nested_namespace::try_process_hrtime_bigint (cognitive 36): perry_hir::lower::expr_call::nested_namespace::try_process_hrtime_bigint has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (36 pts) (nesting depth added 28). 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: one other method here (perry_hir::lower::expr_call::nested_namespace::try_process_memory_usage_rss) 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/perry-hir/src/lower/expr_call/nested_namespace.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d741572a35c368810313b42f256d9072b9b354c9025cc88f5da9a697827d0f8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::nested_namespace::try_process_memory_usage_rss (cognitive 36): perry_hir::lower::expr_call::nested_namespace::try_process_memory_usage_rss has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (36 pts) (nesting depth added 28). 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: one other method here (perry_hir::lower::expr_call::nested_namespace::try_process_hrtime_bigint) 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/perry-hir/src/lower/expr_call/nested_namespace.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"399255d890290f4e635f5967669db3ae19e44fe6f88e5ca66fbd1d67bd94df16"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_function::collect_direct_eval_var_names_from_expr (cognitive 36): perry_hir::lower::expr_function::collect_direct_eval_var_names_from_expr has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 5 (11 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 22). 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/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"79703723fdfdc93a4a3d2687053def009075fd7b91915790ed3cc735edad1578"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_function::insert_class_capture_refresh_after_assignments (cognitive 36): perry_hir::lower::expr_function::insert_class_capture_refresh_after_assignments has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 4 (10 pts), 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/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":1780}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3f4567a8e60d59bd6b918d6deeda16f3d755fe564fc0c3a33b83097b1ba26c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::lower_expr::json_literal::is_large (cognitive 36): perry_hir::lower::lower_expr::json_literal::is_large has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 3 (7 pts), match/switch 2 (6 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/perry-hir/src/lower/lower_expr/json_literal.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c708453310e02f1d27dc01a5c6019cc948d70711f49310f7d8b89f46a9b4b11"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::lower_module_fn::reflect_script_var_initializers (cognitive 36): perry_hir::lower::lower_module_fn::reflect_script_var_initializers has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 2 (4 pts), match/switch 2 (4 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/perry-hir/src/lower/lower_module_fn.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7401dd90dad9dc96bb5cfaa6649293295d72ad0ed5c8d3b684cb0a4bc794130"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::module_decl::namespace::rewrite_member_references (cognitive 36): perry_hir::lower::module_decl::namespace::rewrite_member_references has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (24 pts), loops 4 (12 pts) (nesting depth added 25). 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/perry-hir/src/lower/module_decl/namespace.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ae3a5286a992fd377fe9761f78e94df2e8f8545244031c292ebc74d82c6a6c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals::walk_stmt (cognitive 36): perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals::walk_stmt has cognitive complexity 36 (threshold 15). Drivers by points: loops 10 (25 pts), if/else 5 (10 pts), match/switch 1 (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 3 other methods here (perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals, perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals::record_var, perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals::collect_shadowing_decls) 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/perry-hir/src/lower/pre_scan/weakref_locals.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af017f7b525d2651e5cf6785e9b5bcfa6e2427f2d096408a5a03a967c1ad6a9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::type_widening::visit_stmt (cognitive 36): perry_hir::lower::type_widening::visit_stmt has cognitive complexity 36 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 7 (13 pts), match/switch 1 (nesting depth added 19). 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/perry-hir/src/lower/type_widening.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22adde21b97eb6cb3723e256c978aee797263cdd873eca7c16bdc791e7d1a47"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::type_widening::widen_lets_stmt (cognitive 36): perry_hir::lower::type_widening::widen_lets_stmt has cognitive complexity 36 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 5 (10 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 19). 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/perry-hir/src/lower/type_widening.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"218be51cf8be7dc4a07a8d3a2d66256ef77d0d1fdad77f793a0c6f54da9c113a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::widget_decl::extract_entry_fields_from_param (cognitive 36): perry_hir::lower::widget_decl::extract_entry_fields_from_param has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 25). 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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16102fe3a0c02e2f3d9ad9fb7cba8b50d0f7c289051577721e6c99c15a93a72"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::static_dynamic_code::specialize (cognitive 36): perry_hir::static_dynamic_code::specialize has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (33 pts), boolean chains 3 (nesting depth added 19). 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/perry-hir/src/static_dynamic_code.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0967b705229963bd62f7cc1de93cbf335558001cf7ce5fc0e8693d5159c831c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::policy::gc_check_trigger_evaluate (cognitive 36): perry_runtime::gc::policy::gc_check_trigger_evaluate has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 6, match/switch 2 (5 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/perry-runtime/src/gc/policy.rs"},"region":{"startLine":3245}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2bbeece4b324a0dee7e68c9821e430c8c866b5a9eeadf100e74261de1e038e4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::roots::stack_maps_sections::loaded_stack_map_sections (cognitive 36): perry_runtime::gc::roots::stack_maps_sections::loaded_stack_map_sections has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (26 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 24). Of this number, 35 points are the body\u0027s own statements and 1 belongs to one function item 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":"crates/perry-runtime/src/gc/roots/stack_maps_sections.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1122e72dc157cdb4669178beccb3c3a7f0e8e1786a5081184ded2125b76cb3d7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::trace::mark_slots::trace_heap_rewrite_slots_impl (cognitive 36): perry_runtime::gc::trace::mark_slots::trace_heap_rewrite_slots_impl has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 10, loops 3 (7 pts), match/switch 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/perry-runtime/src/gc/trace/mark_slots.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"af292395ee793dc524b9c83ad5666318876d04742d4af70629aa3f7518a1e098"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_stream_constructors::builders::init_transform_kind (cognitive 36): perry_runtime::node_stream_constructors::builders::init_transform_kind has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (24 pts), match/switch 4 (6 pts), loops 2 (4 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/perry-runtime/src/node_stream_constructors/builders.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fcd09745eaee3d8623f0b3d2c7c1b42f175cd39b1875a1667ebe2f9b1db54b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::gc_roots::scan_class_symbol_member_keys_mut (cognitive 36): perry_runtime::object::class_registry::gc_roots::scan_class_symbol_member_keys_mut has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 4 (12 pts), boolean chains 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/perry-runtime/src/object/class_registry/gc_roots.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fbfd3e1a7fa7ae68ffbdb25a198c474679c94309c2646409a3f8fc72389924"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::gc_roots::class_side_table_root_snapshot (cognitive 36): perry_runtime::object::class_registry::gc_roots::class_side_table_root_snapshot has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 6 (18 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/perry-runtime/src/object/class_registry/gc_roots.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb40d8aa2501c004af606759b169cdadbad3ecd7166fe407b767e5edf2f5644"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::parent_static::class_method_bind_length_bytes (cognitive 36): perry_runtime::object::class_registry::parent_static::class_method_bind_length_bytes has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 2 (8 pts), loops 2 (6 pts), boolean chains 4 (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/perry-runtime/src/object/class_registry/parent_static.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"304815eb961d3464290ef91923c4dd98093b67ec7aa24daba0b50f5f8813973c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::delete_rest::try_delete_stable_sso (cognitive 36): perry_runtime::object::delete_rest::try_delete_stable_sso has cognitive complexity 36 (threshold 15). Drivers by points: if/else 19 (28 pts), boolean chains 8 (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/perry-runtime/src/object/delete_rest.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7813489ba704a0d9396925a761d84ca3b8b5cfa58af53fb086dc2b03947dbbc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::key_attrs::apply_edits (cognitive 36): perry_runtime::object::key_attrs::apply_edits has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (29 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/key_attrs.rs"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ad68cf05706712aa0bc3a3b0b843f5d8ff8974255ee759d6fb9725375808f2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_probe::exotic_get (cognitive 36): perry_runtime::object::layout_probe::exotic_get has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (23 pts), match/switch 5 (11 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/layout_probe.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"8675e0e13cf66a473ea5da5d4c8411d4eb75d351462ba6ec1919f78d5a3b06ee"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::property_ops::set::prototype_of_for_set (cognitive 36): perry_runtime::object::property_ops::set::prototype_of_for_set has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (31 pts), boolean chains 5 (nesting depth added 17). 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/perry-runtime/src/object/property_ops/set.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"286425e04ac6ed6b724574d14c3b2e22d8555f0bae01cf5dc84d60e9be5cfa91"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::regex::perex_literal_search::ascii_positions (cognitive 36): perry_runtime::regex::perex_literal_search::ascii_positions has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 6 (11 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/perry-runtime/src/regex/perex_literal_search.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfeedd28f14873681dfc26e8d4066f30894fb373615fcce04ef5ee074147e4d3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::url::parse::create_url_object (cognitive 36): perry_runtime::url::parse::create_url_object has cognitive complexity 36 (threshold 15). Drivers by points: if/else 23 (31 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/url/parse.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"161ad3508740c676a588b84481c4464082313fad86672185c2663946bf0da933"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::cheerio::js_cheerio_selection_children (cognitive 36): perry_stdlib::cheerio::js_cheerio_selection_children has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (29 pts), loops 2 (7 pts) (nesting depth added 28). 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/perry-stdlib/src/cheerio.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"12dde5ccd376183b2b3ea30c3df11bfdddd1716f10795eaa4fd594b28bec762f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::closure_analysis::collect_closure_captured_local_ids::visit_stmt (cognitive 36): perry_transform::inline::closure_analysis::collect_closure_captured_local_ids::visit_stmt has cognitive complexity 36 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 7 (13 pts), match/switch 1 (nesting depth added 19). 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/perry-transform/src/inline/closure_analysis.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb455d114869dc26b2949f429244bd95b6ce4f43ac9a0c67c3919dde8176116"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::closure_analysis::collect_mutated_local_ids::visit_stmt (cognitive 36): perry_transform::inline::closure_analysis::collect_mutated_local_ids::visit_stmt has cognitive complexity 36 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 7 (13 pts), match/switch 1 (nesting depth added 19). 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/perry-transform/src/inline/closure_analysis.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3e4ed9bdeb5addfbb4bbbd6cb03fe0241e10de9ce2bf52f8848c49eeb4ff37"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::module_const_fold::walk_stmt_exprs (cognitive 36): perry_transform::module_const_fold::walk_stmt_exprs has cognitive complexity 36 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 7 (13 pts), match/switch 1 (nesting depth added 19). 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/perry-transform/src/module_const_fold.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd571b08bdd757f4fe10ee4e4c90a919c3c85abb279327513118f866683d1847"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::state_desugar::scan_stmt_handle_uses (cognitive 36): perry_transform::state_desugar::scan_stmt_handle_uses has cognitive complexity 36 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 7 (13 pts), match/switch 1 (nesting depth added 19). 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/perry-transform/src/state_desugar.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbd2e9ad64b0343eba1d968f400b0db8ccf42fe5214f6e72c589050b456e394"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator::generate (cognitive 36): Generator::generate has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 9 (15 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/perry-wit/src/guest_c.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98c4f6fadd2126951294f2a83a63c8ea091d8de515005c825b69e7706ec02b5"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator::function (cognitive 36): Generator::function has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (29 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wit/src/guest_c.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"00be4bcfe582d1c2977e394a48f5286b5cfed30d22db8f8c2468fbd30793a78c"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::check_toks (cognitive 36): Gen::check_toks has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (27 pts), match/switch 1 (4 pts), loops 3, 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":"crates/perry-wpfacts/src/gen/export.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d55dd817f9c1806ee05f50c647b88da5ba918a3cbc721a3199ea0a7d4298e1"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::register_all (cognitive 36): Gen::register_all has cognitive complexity 36 (threshold 15). Drivers by points: loops 14 (26 pts), if/else 2 (6 pts), match/switch 1 (4 pts) (nesting depth added 19). 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/perry-wpfacts/src/gen.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab18e0a21c7845ad61f32595a3e0f1011fc58f361e628b9f238d18b94b41ee16"}},{"ruleId":"D2","level":"warning","message":{"text":"primary-entry-once-main07-v46-auto.build_arm (cognitive 36): primary-entry-once-main07-v46-auto.build_arm has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 5 (10 pts), boolean chains 9 (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":"docs/audits/gc-rss-instructions-2026-10-03/primary-entry-once-main07-v46-auto.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0abfa7ba5f365152948c1d0933da3999e4281035a3dff580d6cbbc80857261"}},{"ruleId":"D2","level":"warning","message":{"text":"primary-lazy-rss-main07-v52-auto.build_arm (cognitive 36): primary-lazy-rss-main07-v52-auto.build_arm has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 5 (10 pts), boolean chains 9 (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":"docs/audits/gc-rss-instructions-2026-10-03/primary-lazy-rss-main07-v52-auto.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f33bc92ebb3a77685d2bb62787d6f6544eeb9816d6b439e881e5882b7f44dd"}},{"ruleId":"D2","level":"warning","message":{"text":"primary-learned-floor-main07-v60-auto.build_arm (cognitive 36): primary-learned-floor-main07-v60-auto.build_arm has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 5 (10 pts), boolean chains 9 (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":"docs/audits/gc-rss-instructions-2026-10-03/primary-learned-floor-main07-v60-auto.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1510972dc2cad5796f93988bc11226beb28a01feeff781936a43dfaf720476"}},{"ruleId":"D2","level":"warning","message":{"text":"primary-map-prefix-main07-v69-auto.build_arm (cognitive 36): primary-map-prefix-main07-v69-auto.build_arm has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 5 (10 pts), boolean chains 9 (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":"docs/audits/gc-rss-instructions-2026-10-03/primary-map-prefix-main07-v69-auto.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"250055e1eb566c02e9d1463b71b9fcd0b4bbc4795947bd361cec9b9708aada6e"}},{"ruleId":"D2","level":"warning","message":{"text":"primary-map-prefix-main07-v69r1-auto.build_arm (cognitive 36): primary-map-prefix-main07-v69r1-auto.build_arm has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 5 (10 pts), boolean chains 9 (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":"docs/audits/gc-rss-instructions-2026-10-03/primary-map-prefix-main07-v69r1-auto.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b813acf74b76b0dde5cc6e23a66d17d3120afb0e74eeb0fdc4ea9c965fe5ca"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_store_site_inventory.codegen_stem_census (cognitive 36): gc_store_site_inventory.codegen_stem_census has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (29 pts), loops 3 (6 pts), boolean chains 1 (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":"scripts/gc_store_site_inventory.py"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"73690bd9fb91e7222701e07ceb871435330270894ff22dd91623b2b562a93f13"}},{"ruleId":"D2","level":"warning","message":{"text":"local_binding_type_audit.strip_rust_comments (cognitive 36): local_binding_type_audit.strip_rust_comments has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 10, ternaries 2 (5 pts), loops 2 (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":"scripts/local_binding_type_audit.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f85b9758131f259368dc77ab0e1891b18e56e1e254e2fed3ba9a7b5291d9919"}},{"ruleId":"D2","level":"warning","message":{"text":"parity_report_merge.merge (cognitive 36): parity_report_merge.merge has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 7 (12 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":"scripts/parity_report_merge.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a68bbb36c97f4379467f9beaff355d4b959dfcc23a9328f645aa2724dd34eef"}},{"ruleId":"D2","level":"warning","message":{"text":"perf_schemadec_lane.class_micros (cognitive 36): perf_schemadec_lane.class_micros has cognitive complexity 36 (threshold 15). Drivers by points: loops 6 (17 pts), ternaries 3 (11 pts), if/else 2 (8 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":"scripts/perf_schemadec_lane.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abddb965636b716fb380e612ca1ba8a190501401a3680d78df8b6adab51538e"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime_abi_check.self_test (cognitive 36): runtime_abi_check.self_test has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (22 pts), loops 6 (7 pts), boolean chains 5, error handling 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":"scripts/runtime_abi_check.py"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"c803f72e09291446f22706c0ce13e2023d553fbc959a764eca1c9733645c4eae"}},{"ruleId":"D2","level":"warning","message":{"text":"update-actions.inspectActionPins (cognitive 36): update-actions.inspectActionPins has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (27 pts), error handling 3 (7 pts), boolean chains 1, 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":"scripts/update-actions.mts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcacbd677729d903a87ac709b6f4d444a524763c8b6728be3233f9ec27b384b1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::hoist_classes::top_level_class_names (cognitive 35): perry::commands::compile::cjs_wrap::hoist_classes::top_level_class_names has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 4 (8 pts), boolean chains 7 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/cjs_wrap/hoist_classes.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f89de2a05a8482b234abc8d370e785f92a45008b78b6627a01ac7b74c58aba"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::link::link_cache::feed_command_args (cognitive 35): perry::commands::compile::link::link_cache::feed_command_args has cognitive complexity 35 (threshold 15). Drivers by points: if/else 21 (34 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/perry/src/commands/compile/link/link_cache.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"94dd1ec523003703ccd431c274623d364d70950c6523cdb6de58e122efb1a8a7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::widget_build::build_declared_widgets_android (cognitive 35): perry::commands::compile::widget_build::build_declared_widgets_android has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 2 (3 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/perry/src/commands/compile/widget_build.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efec95f1fe0a7174430d56c63116ea9c7e7607b75f6854eb023a2cdd9b4481a"}},{"ruleId":"D2","level":"warning","message":{"text":"Scan::walk_expr (cognitive 35): Scan::walk_expr has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 2 (6 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/sealed_buffers.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ecbdfae7c83ff2fce8ccc1f451e4caa851b6e960405d7d8b1a63b65469f381"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::definite_init::taint_of (cognitive 35): perry_codegen::collectors::definite_init::taint_of has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 5 (13 pts), boolean chains 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/perry-codegen/src/collectors/definite_init.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da7c9d3a527ce5b8b711933874a02a89a5c44e195da1c202d9379ed2b03744e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::hot_callees::collect_recursion_participants (cognitive 35): perry_codegen::collectors::hot_callees::collect_recursion_participants has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 4 (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/perry-codegen/src/collectors/hot_callees.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b46623078bbff4f8337af386480d5ba222ec974617b6da10cc05e03643f8d2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::this_as_value::class_uses_this_as_value (cognitive 35): perry_codegen::collectors::this_as_value::class_uses_this_as_value has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 4 (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/perry-codegen/src/collectors/this_as_value.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48d0cfc4f791e776fb4063570e55dba02ac595b69d94ab54f0f53931947882e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::lower_compare_value (cognitive 35): perry_codegen::expr::lower_compare_value has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 8, match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/mod.rs"},"region":{"startLine":4237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e851e4f886bd6be8f698e03bc73c6bc62abded1b421560f07642119a76b5524d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::call_spread_short::direct_candidates (cognitive 35): perry_codegen::expr::call_spread_short::direct_candidates has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 3 (5 pts), boolean chains 3 (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/perry-codegen/src/expr/call_spread_short.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1ab342a2c79aae0beea6c23e7cb1be97dfdafa1ae1bfac346e2dd934d66994"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::loops::lower_packed_f64_versioned_for_with_protocol (cognitive 35): perry_codegen::stmt::loops::lower_packed_f64_versioned_for_with_protocol has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (29 pts), match/switch 4, 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffcafb13bc75bd77127c268921696e8ade167a56f91184f0c18ea638fd339e04"}},{"ruleId":"D2","level":"warning","message":{"text":"JsEmitter::emit_ui_method_call (cognitive 35): JsEmitter::emit_ui_method_call has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 4 (8 pts), match/switch 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/perry-codegen-js/src/emit/calls.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ed78abdcbfe2f3cc82091736fe3bbd902216168fbb616d940f044dec5c361a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_net::turnloop_tls::step (cognitive 35): perry_ext_net::turnloop_tls::step has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 5 (12 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-net/src/turnloop_tls.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da4c06dc3475ca2fa724d8b8e82c8901beeb0c6c60a5bd0a5005374ae34cc38"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::enums::fix_imported_enums_in_stmts (cognitive 35): perry_hir::enums::fix_imported_enums_in_stmts has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 2 (4 pts), 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/perry-hir/src/enums.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e22fcbeac26a50645fe29bf39598b48237aedd829e5df54c19380047e79653"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::nested_namespace::try_path_subnamespace (cognitive 35): perry_hir::lower::expr_call::nested_namespace::try_path_subnamespace has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (27 pts), match/switch 1 (6 pts), boolean chains 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/perry-hir/src/lower/expr_call/nested_namespace.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"a303b0e1f2269f6860c6f48f7267e9fc33f90ce07ad73cbe116c5ec262186450"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::stream::register_super_stream_controller_params (cognitive 35): perry_hir::lower::expr_call::stream::register_super_stream_controller_params has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (22 pts), match/switch 5 (12 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/perry-hir/src/lower/expr_call/stream.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d2409b1b569e25649a3591b04e4b2fba63bfe7fb23381ce0a903b96363c534"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::block::lower_stmts_using_aware_inner (cognitive 35): perry_hir::lower_decl::block::lower_stmts_using_aware_inner has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 5 (15 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/perry-hir/src/lower_decl/block.rs"},"region":{"startLine":1518}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3d02e8b272294b96d3e7ff27b7e7372d3cce4cad4fe8b15f0529c0fce38f63"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_perex::tooling::dialect::common_escape (cognitive 35): perry_perex::tooling::dialect::common_escape has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 5 (15 pts), loops 3 (9 pts), if/else 4 (8 pts), boolean chains 3 (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-perex/src/tooling/dialect.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b2bddea1df18671af7e88b289332dca67f86c9906b7194e39c468ca4d0adf6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::barrier::scan_dirty_object_slots (cognitive 35): perry_runtime::gc::barrier::scan_dirty_object_slots has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 7, loops 2 (5 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/perry-runtime/src/gc/barrier/mod.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab65647500e35decd7fb66e33f50423e60f9f06a5eaa45dd0493527728d4339c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::has_property::object_string_key_has_property (cognitive 35): perry_runtime::object::field_get_set::has_property::object_string_key_has_property has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (35 pts) (nesting depth added 19). 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/perry-runtime/src/object/field_get_set/has_property.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83ede76b113f1ac8823d560ca102824c51c06ea1fe800b3443b8ca3bf615245"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::typedarray::access::classify_set_source (cognitive 35): perry_runtime::typedarray::access::classify_set_source has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 3 (7 pts), boolean chains 4 (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/perry-runtime/src/typedarray/access.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e60e88eaca407ffe253acc43d89d997a054f3eb803c21b84b323759dccab93"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::crypto::util::crypto_key_input_to_public_pem (cognitive 35): perry_stdlib::crypto::util::crypto_key_input_to_public_pem has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (35 pts) (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/perry-stdlib/src/crypto/util.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e364f83f81e8f464ad8412960b2f807b2213cb7d263e6b09f5e9eb99e778bf2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_tls_session::step (cognitive 35): perry_tls_session::step has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 5 (12 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-tls-session/src/lib.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"1326a0b2ef6ffefbdd139f61cbf95404380a8097bb3d1a80e56bb442f33eada2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_tls_session::session::step (cognitive 35): perry_tls_session::session::step has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 5 (12 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-tls-session/src/session.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"1924d1e04653ad677c976e478fe0643c6d491a671e838caa176d50b33548057d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::factory_specialize::specialize_captured_class_factories::visit_stmts (cognitive 35): perry_transform::inline::factory_specialize::specialize_captured_class_factories::visit_stmts has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 2 (4 pts), 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. This shape REPEATS in the file: 4 other methods here (perry_transform::inline::factory_specialize::specialize_captured_class_factories, perry_transform::inline::factory_specialize::specialize_captured_class_factories::resolve_factory_return_class, perry_transform::inline::factory_specialize::specialize_captured_class_factories::rewrite_call_init, \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/perry-transform/src/inline/factory_specialize.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccc6245af762c096d9ef6672461b67a6396308e05de95d89f56c0d394d925a4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_ios::widgets::clear_children (cognitive 35): perry_ui_ios::widgets::clear_children has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 4 (12 pts) (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/perry-ui-ios/src/widgets/mod.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"d371bdfa3da370e7a5045c373c2f5c6d4118bb929a0931a3941db93141870755"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_macos::state::state_set (cognitive 35): perry_ui_macos::state::state_set has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 8 (14 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/perry-ui-macos/src/state.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d965c99e3d5e7a4c46325f0e4bbf85966144f51cbd05e844b7f7268872324e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_macos::widgets::image::create_file (cognitive 35): perry_ui_macos::widgets::image::create_file has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (34 pts), match/switch 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/perry-ui-macos/src/widgets/image.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"478859d6f2bf2a2331d88515234f576d50f1a7bdb0ff8475ea0ddfc5f71654f5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_visionos::widgets::clear_children (cognitive 35): perry_ui_visionos::widgets::clear_children has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 4 (12 pts) (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/perry-ui-visionos/src/widgets/mod.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"da11d408a96945036257ada8602466962f0f68689b2e31860ae37c927047a42e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wasi::filesystem::primitives::windows::fs::open_unchecked::handle_open_result (cognitive 35): perry_wasi::filesystem::primitives::windows::fs::open_unchecked::handle_open_result has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (27 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 21). 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/perry-wasi/src/filesystem/primitives/windows/fs/open_unchecked.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc2d9062bc6de639dc902ce4bb781cadd699984e1d3433f1ad457a4daa72a6b"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::escape_fn_params (cognitive 35): Model::escape_fn_params has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 17). 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/perry-wpfacts/src/solve/call_and_construct.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1cad4278a0808508b77671143e2c64b6f7cf74232539043c3641b6d3aa9dbc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::builtins::collections::array_method (cognitive 35): perry_wpfacts::builtins::collections::array_method has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 4 (8 pts), match/switch 5 (8 pts) (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/builtins/collections.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46b8800b01841bf776dcacfc183cc7a52b95432d88011012db102308161bef3"}},{"ruleId":"D2","level":"warning","message":{"text":"gate_failure_watch.subject_verdict (cognitive 35): gate_failure_watch.subject_verdict has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (19 pts), ternaries 6 (12 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":"scripts/gate_failure_watch.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a803870d57785f105e87a45732db88d3cc109e13658c1770764cb643df8ec6"}},{"ruleId":"D2","level":"warning","message":{"text":"objects-cache.measureTree (cognitive 35): objects-cache.measureTree has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 2 (4 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":"upstream/actions/jdx/mr-boxington-action/src/objects-cache.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"c076d2f6897b09f861a06ccbe856392b491e88f3a5cff6d963cf65b6bffdca85"}},{"ruleId":"D2","level":"warning","message":{"text":"objects-cache.canonicalExistingDirectory (cognitive 35): objects-cache.canonicalExistingDirectory has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (28 pts), error handling 1 (5 pts), boolean chains 1, 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":"upstream/actions/jdx/mr-boxington-action/src/objects-cache.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"c984d7174e79f6db64efef6f9d9ab2cdd718461e2a00626d36e178f8590864f4"}},{"ruleId":"D2","level":"warning","message":{"text":"index.post (cognitive 35): index.post has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 7, ternaries 2 (3 pts) (nesting depth added 11). Of this number, 24 points are the body\u0027s own statements and 11 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":"upstream/actions/jdx/mr-boxington-action/src/index.ts"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52d825eb4f142dc8acfea72622123e5a257bad78497c59e130925f65d3ce04d"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolve::visit_mut_expr (cognitive 34): Resolve::visit_mut_expr has cognitive complexity 34 (threshold 15). Drivers by points: if/else 20 (31 pts), boolean chains 2, match/switch 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/perry/src/commands/compile/collect_modules/import_meta_resolve.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96885296fa6fa756b8250d9d1f69bbf5b03d0c6cf10e85eaa777152a8467452"}},{"ruleId":"D2","level":"warning","message":{"text":"Fns::collect (cognitive 34): Fns::collect has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 5 (8 pts), match/switch 2 (3 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/perry-codegen/src/collectors/read_before_write.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"066b20a680305923886f81cb767d3ccd4170689dbca1481ca138f4190358362b"}},{"ruleId":"D2","level":"warning","message":{"text":"ProgramLayoutOrdinals::assign (cognitive 34): ProgramLayoutOrdinals::assign has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 5, boolean chains 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/layout_ordinals.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8dfe3dd408c2b490fbde8c844e461ed184a2af888d19f091a04d8698dc51ff"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::i32_locals::walk_writes_for_unsigned_i32 (cognitive 34): perry_codegen::collectors::i32_locals::walk_writes_for_unsigned_i32 has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 2 (4 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/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"0292e2ed1eda42fb1a2938981fbe10a2a45a89fbe4d7a477cd57a62c73f251e9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::loop_bounded_i32::walk_stmts (cognitive 34): perry_codegen::collectors::loop_bounded_i32::walk_stmts has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (28 pts), loops 2 (4 pts), match/switch 1 (2 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/perry-codegen/src/collectors/loop_bounded_i32.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c5bf57902cce681f447b5f5e19242e728d01c855e1089f4ea42e6ca17ececd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::loop_bounded_i32::walk_accumulator_stmts (cognitive 34): perry_codegen::collectors::loop_bounded_i32::walk_accumulator_stmts has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (28 pts), loops 2 (4 pts), match/switch 1 (2 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/perry-codegen/src/collectors/loop_bounded_i32.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"df642a19c79b7db71f7ca5456ad635dab52460b08441bed3aa6874d8645409e5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_numeric::expr_numeric_by_construction_with_region (cognitive 34): perry_codegen::collectors::ptr_shape_numeric::expr_numeric_by_construction_with_region has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 11, match/switch 6 (9 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/perry-codegen/src/collectors/ptr_shape_numeric.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"17dcd90558b6f21e23ff1b150e126babe9f0ccc88c7f9143cc0df73c118bd99f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::refs::refs_stmts (cognitive 34): perry_codegen::collectors::refs::refs_stmts has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 2 (4 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/perry-codegen/src/collectors/refs.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f3ca6420fb6b1b64ba8723c2299271544c73721f46709f556628587befe00f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::index::lower_index_set_fast (cognitive 34): perry_codegen::expr::index::lower_index_set_fast has cognitive complexity 34 (threshold 15). Drivers by points: if/else 29 (32 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/perry-codegen/src/expr/index.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"635e5abfe9015edbbb38f05f3843f9329c21ad665d4f7ee68c10d88343d21dc1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::slot_rep::collect_canonical_str_ineligible_locals (cognitive 34): perry_codegen::expr::slot_rep::collect_canonical_str_ineligible_locals has cognitive complexity 34 (threshold 15). Drivers by points: if/else 19 (44 pts), match/switch 6 (10 pts), loops 4 (7 pts), boolean chains 3 (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. This shape REPEATS in the file: one other method here (perry_codegen::expr::slot_rep::collect_canonical_str_ineligible_locals::scan_declared) 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/perry-codegen/src/expr/slot_rep.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9770127264004c07b7c84dce6abfec059b81f9a6fe4134e5b15eeeadc43a201"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::wpfacts_access::prove (cognitive 34): perry_codegen::expr::wpfacts_access::prove has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 9, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/wpfacts_access.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b8d18119b556bb807ec8c058d19d511f66b3fa14dd137445fd30c877d9fb6f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::fallback_diag::record (cognitive 34): perry_codegen::fallback_diag::record has cognitive complexity 34 (threshold 15). Drivers by points: if/else 24 (28 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, 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/perry-codegen/src/fallback_diag.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d2cf32d982816e4ccc120dcd42510587d9b60bc226fa1ccd9d1fd590ce6e71"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::inprocess::nanbox_operands::rewrite_module (cognitive 34): perry_codegen::inprocess::nanbox_operands::rewrite_module has cognitive complexity 34 (threshold 15). Drivers by points: if/else 4 (20 pts), loops 4 (13 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/inprocess/nanbox_operands.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acf50aede3d615eda5629eac9559d726d2ddcd3d84b6d75719e5a53b864a83b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::closure_analysis::collect_closure_introduced_ids (cognitive 34): perry_codegen::lower_call::closure_analysis::collect_closure_introduced_ids has cognitive complexity 34 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 5 (11 pts), match/switch 1 (nesting depth added 19). 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/perry-codegen/src/lower_call/closure_analysis.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ad1d20b27a577f5b3eb363b3b787f6a40cd1901094685c085449e73444d93b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_arkts::state_rewrite::rewrite_state_in_expr (cognitive 34): perry_codegen_arkts::state_rewrite::rewrite_state_in_expr has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (23 pts), loops 5 (10 pts), match/switch 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/perry-codegen-arkts/src/state_rewrite.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"acae665faa7a4225c19df091d9272cbc06b3743e25f1af605c85d74949b937db"}},{"ruleId":"D2","level":"warning","message":{"text":"JsEmitter::emit_class (cognitive 34): JsEmitter::emit_class has cognitive complexity 34 (threshold 15). Drivers by points: loops 11 (17 pts), if/else 9 (16 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/perry-codegen-js/src/emit/decls.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8036ebece6be4b19654e8dc1f26a2fc6c86130411def0823d67e6a641bf89a5"}},{"ruleId":"D2","level":"warning","message":{"text":"Gzip::read (cognitive 34): Gzip::read has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 2 (4 pts), match/switch 1 (2 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/perry-ext-zlib/src/stream/driver.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4fc4d3e21310317e0d1727a6ca073afc933d478554d28f8df7e9b539003f05"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::global_eval_hoist::rename_ident_in_expr (cognitive 34): perry_hir::lower::global_eval_hoist::rename_ident_in_expr has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 6 (13 pts), match/switch 1 (nesting depth added 19). 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/perry-hir/src/lower/global_eval_hoist.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"00742c687b31652e65f9325284c5e5416a11c1cb3066718e5e8c3e18a50ea227"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::lower_expr::json_literal::serialize (cognitive 34): perry_hir::lower::lower_expr::json_literal::serialize has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 3 (6 pts), loops 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/perry-hir/src/lower/lower_expr/json_literal.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed7155bf1e7df300d8b19216c6e434d5965182f49869fdc676012761b4de23a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::widget_decl::parse_widget_field_type (cognitive 34): perry_hir::lower::widget_decl::parse_widget_field_type has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (23 pts), match/switch 3 (6 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 19). 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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6cfb3e667fd69d0da765aaef5f7d3559f0ba65c667656aabc26f2de9fa2016"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::widget_decl::parse_reload_policy_seconds (cognitive 34): perry_hir::lower::widget_decl::parse_reload_policy_seconds has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 2 (3 pts), match/switch 2 (3 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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":1493}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5bf3f5e4698107b8ccc9175d1f7f2e4041b02806a056a0ed24d83048ee122c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::helpers::collect_let_decls_in_stmt (cognitive 34): perry_hir::lower_decl::helpers::collect_let_decls_in_stmt has cognitive complexity 34 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 5 (11 pts), match/switch 1 (nesting depth added 19). 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/perry-hir/src/lower_decl/helpers.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"114f685edabaf3dfacdefc0c01808ca1088ccd70d102e453ff6509a235eeb447"}},{"ruleId":"D2","level":"warning","message":{"text":"Substitute::visit_mut_expr (cognitive 34): Substitute::visit_mut_expr has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (25 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-parser/src/defines.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"856ab743745e7ff3a01ac406d54471ea0df27292c36053b4efb5a0c6220098be"}},{"ruleId":"D2","level":"warning","message":{"text":"MutableRegisteredRootScanState::step (cognitive 34): MutableRegisteredRootScanState::step has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 4 (8 pts), boolean chains 6, loops 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/gc/cycle/registered_root_scan.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f4639ed3c8346015cb200380f5497256c1ae1f0dafaff57ddf0972f671f493"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::arena::promote::stamp_and_index_block (cognitive 34): perry_runtime::arena::promote::stamp_and_index_block has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 2 (4 pts), boolean chains 2, 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/perry-runtime/src/arena/promote.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c11ddfe54fe5621d29c6e808e4a11ab15e508276e23938849fed1ba8c95256e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::join::join_values (cognitive 34): perry_runtime::array::join::join_values has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (31 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/perry-runtime/src/array/join.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0f8444806872b7df81030b4a6256e678b836ebca13a2cb810fea042bcb664d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::push_pop::js_array_pop_f64 (cognitive 34): perry_runtime::array::push_pop::js_array_pop_f64 has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (29 pts), boolean chains 3, match/switch 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/perry-runtime/src/array/push_pop.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38f9673623db98fc0e88eefdfc5dea15cac6c2cfec092bbb98316d72632f0eb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::bun_compat::spawn::stdio_spec (cognitive 34): perry_runtime::bun_compat::spawn::stdio_spec has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (27 pts), match/switch 3 (7 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/bun_compat/spawn.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"0980070420732844b5f20b0a41dabfb0eef8b24da98cd8c64e4eead158e569d4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::component::asynchronous::step (cognitive 34): perry_runtime::component::asynchronous::step has cognitive complexity 34 (threshold 15). Drivers by points: if/else 24 (29 pts), boolean chains 5 (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/perry-runtime/src/component/asynchronous.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa000ecf82a42db653540b10958f460c0957538a3b1cdbb15ab6a1c92acf89d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::component::value::decode_at (cognitive 34): perry_runtime::component::value::decode_at has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 3 (6 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/component/value.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"1206e85da3148765be65304d5a49c21504c52f44337479e99ad95dfeb39cc2b3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::stringify_data_record::try_emit_with_live (cognitive 34): perry_runtime::json::stringify_data_record::try_emit_with_live has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 2 (5 pts), boolean chains 2, loops 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/perry-runtime/src/json/stringify_data_record.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"895d14a686918f1492a75947e549a2f77ae71eac81ef2eaff3c36648f4417b62"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::stringify_record_output::emit_record (cognitive 34): perry_runtime::json::stringify_record_output::emit_record has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 4 (8 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/json/stringify_record_output.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cfad724838982ad6bda4400fbcd1ca7a4ca785581260923282d3941ca6342f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::assign::positional_assign_target_is_safe (cognitive 34): perry_runtime::object::assign::positional_assign_target_is_safe has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 2 (3 pts), boolean chains 2, 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/perry-runtime/src/object/assign.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73cd0341c70d7f78ae897d196da737cf04b4d37f7c72b28f5a169b6e54b18bb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::canonical_keys::static_seed::link_image_list (cognitive 34): perry_runtime::object::canonical_keys::static_seed::link_image_list has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (29 pts), boolean chains 3, 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/perry-runtime/src/object/canonical_keys/static_seed.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"484037338c648290f9af65f7c06780e46a521562280ba9274a86e70d7cc5eab5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_constructors::replay_class_object_constructor_impl (cognitive 34): perry_runtime::object::class_constructors::replay_class_object_constructor_impl has cognitive complexity 34 (threshold 15). Drivers by points: if/else 21 (27 pts), boolean chains 3, loops 2, match/switch 1 (2 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/perry-runtime/src/object/class_constructors.rs"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"30367aba58ae4b13d39f59d7f63ea2867eb67d123eb0dafdd077002c5f152705"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::decl_prototype_birth::decl_prototype_born_final (cognitive 34): perry_runtime::object::class_registry::decl_prototype_birth::decl_prototype_born_final has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 4, loops 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/perry-runtime/src/object/class_registry/decl_prototype_birth.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"299c3edd9cea06fa9242f03d9ade8c1c84dd524b7edb9f41983d34f9eff88b9a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::class_object_template::record_class_object_template (cognitive 34): perry_runtime::object::field_get_set::class_object_template::record_class_object_template has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 9, loops 2, 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/perry-runtime/src/object/field_get_set/class_object_template.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f77cc8bd94ea345f0ddafa7111279de6b35c43e3984cd791cafbfdeec31adf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_probe_site_memo::prime (cognitive 34): perry_runtime::object::layout_probe_site_memo::prime has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (28 pts), match/switch 2 (4 pts), boolean chains 1, 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/perry-runtime/src/object/layout_probe_site_memo.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"063fd6149657e82297c359cc574f8b5e687d3201d827d92633e00f66b603cc13"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_module_dispatch::dispatch_m_p::nm_dispatch_path (cognitive 34): perry_runtime::object::native_module_dispatch::dispatch_m_p::nm_dispatch_path has cognitive complexity 34 (threshold 15). Drivers by points: if/else 25 (31 pts), loops 2, match/switch 1 (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/perry-runtime/src/object/native_module_dispatch/dispatch_m_p.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc747b3ed8adfc75f8ed651078aa5870b94012cc3d0ac75de8d2188869c9959d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::regex::perex_results::materialize (cognitive 34): perry_runtime::regex::perex_results::materialize has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 5 (8 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/regex/perex_results.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5977d346eed2f4917781d36557e7a0c361e1ad91aa44b34dfad08e92732f1d1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::regex::perex_split::regexp (cognitive 34): perry_runtime::regex::perex_split::regexp has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 3 (6 pts), match/switch 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/perry-runtime/src/regex/perex_split.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c118ded1f4d2914cdae99a4c4d772273154ce3ef11993b218af20e49c18f3a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::substitute::collect_body_local_ids::collect_from_stmt (cognitive 34): perry_transform::inline::substitute::collect_body_local_ids::collect_from_stmt has cognitive complexity 34 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 5 (11 pts), match/switch 1 (nesting depth added 19). 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/perry-transform/src/inline/substitute.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19ec3f8bd60b4d56993e69dbcb013613b90a3545d9af450775a6c6a70ea4285"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::local_copies::clean_function (cognitive 34): perry_transform::local_copies::clean_function has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 5 (8 pts), boolean chains 6, 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/perry-transform/src/local_copies.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52095c762f44ed992b6efee375cd04df28a9f9f7942759a08c353f05f6ac6a7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_ios::drag_drop::perform_drop_impl (cognitive 34): perry_ui_ios::drag_drop::perform_drop_impl has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 3 (6 pts) (nesting depth added 15). Of this number, 25 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/perry-ui-ios/src/drag_drop.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fdfedbc6bfd5e613a57eda8e1b8f0f5d27c329526fdb2bee310c607505972c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_visionos::drag_drop::perform_drop_impl (cognitive 34): perry_ui_visionos::drag_drop::perform_drop_impl has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 3 (6 pts) (nesting depth added 15). Of this number, 25 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/perry-ui-visionos/src/drag_drop.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"156789b7b0a1a0253091ad5341f09b99807c16138c43307a1dd00c4adc6baf69"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::note_field_fns (cognitive 34): Gen::note_field_fns has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (21 pts), match/switch 2 (7 pts), loops 2 (4 pts), boolean chains 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/perry-wpfacts/src/gen/export.rs"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cafa8e55f9439f668e36c17aeffa450585dc93fb0cc2a3ebeec98145bd43cab"}},{"ruleId":"D2","level":"warning","message":{"text":"check_thread_locals.self_test (cognitive 34): check_thread_locals.self_test has cognitive complexity 34 (threshold 15). Drivers by points: if/else 23 (29 pts), loops 5 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check_thread_locals.py"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a80f453215eb8fac87f5171fd8cb558952488e7890e0718da0c6a42c6ad5d45"}},{"ruleId":"D2","level":"warning","message":{"text":"capture.capture (cognitive 34): capture.capture has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 7, ternaries 5 (6 pts), loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/compiler_output_harness/capture.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ab3899ce28751fc098f2e553eb5cb90f76bb385994b7b5cec33217d0606830"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_gate_wiring_check.main (cognitive 34): gc_gate_wiring_check.main has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 4 (6 pts), boolean chains 2, error handling 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":"scripts/gc_gate_wiring_check.py"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1eabb4db2f02c6653e66436a7a06b8480639e4afe80944f63d33e29399818ed"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_store_site_inventory.classify_rust_store (cognitive 34): gc_store_site_inventory.classify_rust_store has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 8 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gc_store_site_inventory.py"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d887b1bb1536335d12e1862a7a73588e319c523691c852c6abac6fdc661e7b"}},{"ruleId":"D2","level":"warning","message":{"text":"gen_parity_gaps.covered (cognitive 34): gen_parity_gaps.covered has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 11, loops 4 (6 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":"scripts/gen_parity_gaps.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a5095939daa52fa2885f28ab3b99cb3ffc7adb83ebc92750a6cdad733bb2d2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::library_search::find_llvm_tool (cognitive 33): perry::commands::compile::library_search::find_llvm_tool has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (33 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/library_search.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"faef369eca026f6c19a507f2e63f431b59b1ec610fbda0f329abf5e2550c3e6d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::lock_scan::for_each_native_library_package (cognitive 33): perry::commands::compile::lock_scan::for_each_native_library_package has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 2 (5 pts), boolean chains 2 (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/perry/src/commands/compile/lock_scan.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c407a9eb7e62159a507e85921bae43fc0848030f58a3de2f48305fabbfcbcd6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::lock_scan::run_lock_verify_for_compile (cognitive 33): perry::commands::compile::lock_scan::run_lock_verify_for_compile has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 2 (4 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/perry/src/commands/compile/lock_scan.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a1e1f5a2c3dd9aa018ccbdf2e923afa548fdf9a3e8da8c1630bc349aee5bc3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::resolve::collect_packages_in_node_modules (cognitive 33): perry::commands::compile::resolve::collect_packages_in_node_modules has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 2 (5 pts), match/switch 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/perry/src/commands/compile/resolve.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3429e6698cda910d956aa1ca1179166957a3a21f11fb81f0b69d97e9e125ca"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::resolve::discover_extension_entries (cognitive 33): perry::commands::compile::resolve::discover_extension_entries has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 2 (5 pts) (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/perry/src/commands/compile/resolve.rs"},"region":{"startLine":1857}}}],"partialFingerprints":{"codehealthFindingId/v1":"655086cfb94f8f2c7eb99de9238369351b50322b88c30755c019afd36d5787fa"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::tiny_program::try_compile (cognitive 33): perry::commands::compile::tiny_program::try_compile has cognitive complexity 33 (threshold 15). Drivers by points: if/else 24 (31 pts), boolean chains 1, match/switch 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/perry/src/commands/compile/tiny_program/mod.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b24e7ff03f0da47944c912be1e77a270a94f7564bc325d326fd5d7d93ff8875"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::helpers::emit_callee_binding_resolutions (cognitive 33): perry_codegen::codegen::helpers::emit_callee_binding_resolutions has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (30 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/perry-codegen/src/codegen/helpers.rs"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef43dac2b3393517aa35c3bf3ca62d70c3c175cb94785e30004e1f408e207759"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::region_loop::verify::verify (cognitive 33): perry_codegen::stmt::region_loop::verify::verify has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 6 (9 pts), boolean chains 5, 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/perry-codegen/src/stmt/region_loop/verify.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5304de195238438b90cc5fe0540c10f1e4c6b482091f381856fec280e3ceecd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::stable_packed_loop::match_candidate (cognitive 33): perry_codegen::stmt::stable_packed_loop::match_candidate has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 10, match/switch 4 (5 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/perry-codegen/src/stmt/stable_packed_loop.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2cd57daad28e94a9f60342fc80e10b207bf0cc92faa5da679577d661bde8162"}},{"ruleId":"D2","level":"warning","message":{"text":"Disposal::visit (cognitive 33): Disposal::visit has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 3 (6 pts), match/switch 3 (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/perry-component-host/src/async_values/reader_dispose.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fef35c26a9758ea302ad490c04f05af4635497c6ce87999b9710b6bd0d58d8"}},{"ruleId":"D2","level":"warning","message":{"text":"DriverClient::submit (cognitive 33): DriverClient::submit has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 2 (6 pts), match/switch 1 (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-component-host/src/driver/requests.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f0f0a4e2f9be4375673350ddfbfe3a623db8077fed48b5a236890b0631a22d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::response_end::standalone_end (cognitive 33): perry_ext_http::server::response_end::standalone_end has cognitive complexity 33 (threshold 15). Drivers by points: if/else 19 (26 pts), match/switch 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/perry-ext-http/src/server/response_end.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a486c28cd4d655c88486c0b2785cc9dc14c7465fba3b460db4f7621a73d5fe9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::analysis::fn_infer::walk_stmts (cognitive 33): perry_hir::analysis::fn_infer::walk_stmts has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 3 (7 pts), match/switch 2 (4 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/perry-hir/src/analysis/fn_infer.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa2128ad4230569181e6399f1def2a06ffda3468f12313e2f2d03fc203e181a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::destructuring::var_decl::binding_guards::apply_binding_guards (cognitive 33): perry_hir::destructuring::var_decl::binding_guards::apply_binding_guards has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (32 pts), boolean chains 1 (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/perry-hir/src/destructuring/var_decl/binding_guards.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70ab985d0287f95e18238da4aff02680e133fde20a6452e467f588ab8026c66"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::dynamic_import::binding_origin::resolve_exported_binding (cognitive 33): perry_hir::dynamic_import::binding_origin::resolve_exported_binding has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 6, match/switch 2 (5 pts), loops 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/perry-hir/src/dynamic_import/binding_origin.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"b405674e01f5dee8ec3758c1a497d08304ea502d9a26d3a048511efda8765bed"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::js_transform::imports::transform_js_imports (cognitive 33): perry_hir::js_transform::imports::transform_js_imports has cognitive complexity 33 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 8 (14 pts), match/switch 1 (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/perry-hir/src/js_transform/imports.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ea3a5e88209423848e7412e00254606947e813b7ec4fb4139944012159b41b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::js_transform::local_natives::fix_local_native_instances (cognitive 33): perry_hir::js_transform::local_natives::fix_local_native_instances has cognitive complexity 33 (threshold 15). Drivers by points: loops 15 (31 pts), if/else 1 (2 pts) (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"69258ffaaa9cc1166b387b6ccfd11906f4620116273d4fd71b2c26f0156868f5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::lower_expr::helpers::native_module_binding_value (cognitive 33): perry_hir::lower::lower_expr::helpers::native_module_binding_value has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 4, match/switch 2 (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/perry-hir/src/lower/lower_expr/helpers.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b65b09675f124923337173ee7423640b9d13254770374c118eaaf8fd7f16e2e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::module_decl::static_import_bindings::pre_register_static_import_bindings (cognitive 33): perry_hir::lower::module_decl::static_import_bindings::pre_register_static_import_bindings has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (24 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (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/perry-hir/src/lower/module_decl/static_import_bindings.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5952e6a2736234fc26a8689834f4927cdda4fcc56b5279ebe8c7bb76c45337a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals (cognitive 33): perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals has cognitive complexity 33 (threshold 15). Drivers by points: loops 25 (60 pts), if/else 23 (49 pts), match/switch 9 (20 pts), boolean chains 1 (nesting depth added 72). 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. This shape REPEATS in the file: 3 other methods here (perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals::record_var, perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals::walk_stmt, perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals::collect_shadowing_decls) 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/perry-hir/src/lower/pre_scan/weakref_locals.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8260d5cc39611a5d8f53196294d55a3cfcf3b5659011159982bcab5a213ca115"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::block::switch_case_tdz::register_switch_case_tdz_lets (cognitive 33): perry_hir::lower_decl::block::switch_case_tdz::register_switch_case_tdz_lets has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 6 (13 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/perry-hir/src/lower_decl/block/switch_case_tdz.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"274e996ae0add73a99bd81ce00571808629ce0c2379882b441d2d28406e2a0e9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::alloc_census::alloc_census_dump (cognitive 33): perry_runtime::alloc_census::alloc_census_dump has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 3 (8 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/perry-runtime/src/alloc_census.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"318c1fd9c303680520fb7d794e7fe17ed160a198341a55dbdabf97f2470ecf5a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::arena::page_meta::unregister_old_objects_batch (cognitive 33): perry_runtime::arena::page_meta::unregister_old_objects_batch has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 5 (8 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/arena/page_meta/mod.rs"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d07548567371d68510a72bc0e9c550e8c693b733996b79d2f61eb45cdd919d7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::from_concat::array_from_full (cognitive 33): perry_runtime::array::from_concat::array_from_full has cognitive complexity 33 (threshold 15). Drivers by points: if/else 21 (30 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/array/from_concat.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"891ef0db7c84782f3845bd36ca74bc9301dc960fb59c25ab8fda16b5b4d03cc2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::indexing::try_strict_dense_index_set (cognitive 33): perry_runtime::array::indexing::try_strict_dense_index_set has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 6 (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/perry-runtime/src/array/indexing.rs"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9cc0f964b3040601a5b57cc79dbab16284ba63563b03ef063f6fa6ebf854df"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::bun_compat::string_width::width_latin1_exclude_ansi (cognitive 33): perry_runtime::bun_compat::string_width::width_latin1_exclude_ansi has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 2 (7 pts), loops 2 (4 pts), boolean chains 3 (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/perry-runtime/src/bun_compat/string_width.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a99e53e8b93d4098abace8d5c2ebea29b00a546ea1990cf816c153bf51c27e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::barrier::replay_old_parent_slot_range (cognitive 33): perry_runtime::gc::barrier::replay_old_parent_slot_range has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 3 (5 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/perry-runtime/src/gc/barrier/mod.rs"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee6fbca48aa8c5f0d6b82e58b78dbcf6249cd5acd4a9833913a9c2306fddf7c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::parent_static::js_register_class_computed_accessor (cognitive 33): perry_runtime::object::class_registry::parent_static::js_register_class_computed_accessor has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 4 (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/perry-runtime/src/object/class_registry/parent_static.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d56d467717c57ca805fd3d0c1ce97030bc259ca9583542dad44939e47c6f5c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::has_property::shape_presence::own_position (cognitive 33): perry_runtime::object::field_get_set::has_property::shape_presence::own_position has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 13, 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/perry-runtime/src/object/field_get_set/has_property/shape_presence.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"457d7114fbd79667a7ec01cf67172b43f773bc79478af190b345ba431c626185"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::object_ops::has_own::has_own_of_non_ordinary_kind (cognitive 33): perry_runtime::object::object_ops::has_own::has_own_of_non_ordinary_kind has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 10, match/switch 2 (3 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/perry-runtime/src/object/object_ops/has_own.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"6515b71ce2735f4261884bece31ea62a19e2db8579e71c5a3ba57ca81a94a6df"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::property_ops::reflect::js_reflect_get_impl (cognitive 33): perry_runtime::object::property_ops::reflect::js_reflect_get_impl has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (29 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/perry-runtime/src/object/property_ops/reflect.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"936a25bc692a581961e395ebed187e0be5229942c5f5bc5721848d227ea37e12"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::regex::perex_literal_search::each_readers (cognitive 33): perry_runtime::regex::perex_literal_search::each_readers has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 5 (8 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/perry-runtime/src/regex/perex_literal_search.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b796ce3b3a3d33f062bd8768b19a7ebc6009d24d12964d62b8512e8cba7ea1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::compare::locale_compare_numeric_raw (cognitive 33): perry_runtime::string::compare::locale_compare_numeric_raw has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (25 pts), match/switch 2 (5 pts), loops 2, boolean chains 1 (nesting depth added 18). Of this number, 30 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":"crates/perry-runtime/src/string/compare.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec5ee68539ee63e49af0e7324a90b080d5ad2e7a404eeae0e7701fa964c7ed4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::read::read_utf8 (cognitive 33): perry_runtime::string::read::read_utf8 has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (8 pts), loops 3 (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/perry-runtime/src/string/read.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d526496134d93b6bfcf9c3916487f95b15dd88209991ec7f3e13b190b516685"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::symbol::get::explicit_prototype_symbol_lookup (cognitive 33): perry_runtime::symbol::get::explicit_prototype_symbol_lookup has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (29 pts), match/switch 1 (2 pts), boolean chains 1, 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/perry-runtime/src/symbol/get.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0578c5457cda79c22ca156573bcaf52602fbff2397bfd772adeb0b2c3520c32"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::thread::parallel_map_impl (cognitive 33): perry_runtime::thread::parallel_map_impl has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 10 (15 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/perry-runtime/src/thread.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20d7aabb1c5736516b2271150bfe5859d5249e114942e7142583570d5f3ca5b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::url::parse::is_valid_absolute_url (cognitive 33): perry_runtime::url::parse::is_valid_absolute_url has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 2, loops 1, match/switch 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/perry-runtime/src/url/parse.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"118235d2733ffa1bb7f889e353ba5ee027b25b0aee72d59b692e4de67d4ead55"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::value::equality::js_jsvalue_compare (cognitive 33): perry_runtime::value::equality::js_jsvalue_compare has cognitive complexity 33 (threshold 15). Drivers by points: if/else 19 (23 pts), boolean chains 6, match/switch 1 (4 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/perry-runtime/src/value/equality.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"125177bb33bc2e22002e34ebfdc66cf36ffc6078d0fe12fd4d2b4d157099749d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::value::truthy::js_is_truthy (cognitive 33): perry_runtime::value::truthy::js_is_truthy has cognitive complexity 33 (threshold 15). Drivers by points: if/else 21 (29 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/perry-runtime/src/value/truthy.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8394584ff7224603700fc63add6be62a04a5a5f8ec4d6b59457595cfdbad365a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::crypto::random::js_crypto_native_dispatch (cognitive 33): perry_stdlib::crypto::random::js_crypto_native_dispatch has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 7, 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/perry-stdlib/src/crypto/random.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34a81ccc0d7ddeca6713f6b0ce2ab656fc351fba88c7739f850eb42b689c84c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::tls::dispatch::dispatch_tls_handle (cognitive 33): perry_stdlib::tls::dispatch::dispatch_tls_handle has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (29 pts), match/switch 2 (4 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/perry-stdlib/src/tls/dispatch.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"614cce219eb74b3e570b8994f5e861469214cebdbc6f37cbb0c3761ab03dedc1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::aggregate_scalar::rewrite_stmts (cognitive 33): perry_transform::aggregate_scalar::rewrite_stmts has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 2 (4 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/perry-transform/src/aggregate_scalar.rs"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4eaaa8b49e4425074f00c8ee49796fcbf6103b6596c393cccef4fb88df5cb98"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::cross_module::gather_cross_module_methods_with_extern_imports (cognitive 33): perry_transform::inline::cross_module::gather_cross_module_methods_with_extern_imports has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 5 (9 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/perry-transform/src/inline/cross_module.rs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"7112dd672b5f37852b4bb43cc1dd531f0f51095c08c2f0bdec3a369ebbbd9e39"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::prop_cse::scan_stmt (cognitive 33): perry_transform::prop_cse::scan_stmt has cognitive complexity 33 (threshold 15). Drivers by points: loops 10 (23 pts), if/else 5 (9 pts), match/switch 1 (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/prop_cse.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d75a417df7061cb035550866c0f09210db8cbc8630694f8aeadff19a948ca6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wasi::filesystem::primitives::manually::open::stat (cognitive 33): perry_wasi::filesystem::primitives::manually::open::stat has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (29 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 19). 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/perry-wasi/src/filesystem/primitives/manually/open.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"1920a65db290756e8810b2d9369bd9e8510ac82b048bd0fcba5bab2891d85af6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::decl_units::sccs (cognitive 33): perry_wpfacts::decl_units::sccs has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 3 (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/perry-wpfacts/src/decl_units.rs"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"2120c182b0b34b71febaaa9e147b30c3bbcb87960136d8b4558bf872a766faf7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::lib::contracts::fn_contract_of (cognitive 33): perry_wpfacts::lib::contracts::fn_contract_of has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 7, loops 5 (7 pts), match/switch 5 (6 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/perry-wpfacts/src/lib/contracts.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d58c710e8907e5b7b8bb4f5dcf62960be85c2f8a59477e1abb01da631767ef9"}},{"ruleId":"D2","level":"warning","message":{"text":"gc-currentc170-regression-profile-v23.run (cognitive 33): gc-currentc170-regression-profile-v23.run has cognitive complexity 33 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 2 (8 pts), ternaries 3 (8 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":"docs/audits/gc-rss-instructions-2026-10-03/gc-currentc170-regression-profile-v23.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a112b0a04195faf336139752db23638d012f422f1fa66af73b5b83de55a02657"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.run_statepoints (cognitive 33): gc_root_dominance_check.run_statepoints has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (18 pts), loops 7 (10 pts), ternaries 1 (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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":5456}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fee8e655138182f7e558546b5dafcc7e21155185b149e8b1ead8420332621fd"}},{"ruleId":"D2","level":"warning","message":{"text":"shape_descriptor_census._rust_without_comments_and_literals (cognitive 33): shape_descriptor_census._rust_without_comments_and_literals has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 4 (15 pts), if/else 7 (13 pts), loops 2 (4 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":"scripts/shape_descriptor_census.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfab87a6e81cced000a10f565ec8b8ccade15db94f291a912492fafa1016e2d4"}},{"ruleId":"D2","level":"warning","message":{"text":"server_ab.summarize (cognitive 33): server_ab.summarize has cognitive complexity 33 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 5 (11 pts), ternaries 2 (7 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":"scripts/turnloop/server_ab.py"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"9317d9e73e8a9f4e6b2526fec6b874be41ebb57eee34d5a74280224588b100df"}},{"ruleId":"D2","level":"warning","message":{"text":"wasi_run.main (cognitive 33): wasi_run.main has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (22 pts), ternaries 5 (6 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":"scripts/wasi_run.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00372ef04aeeab3765bcbaa597c38ef21d78d26863623289106f3733e776bcd"}},{"ruleId":"D2","level":"warning","message":{"text":"Solver.accessor_hit (cognitive 33): Solver.accessor_hit has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 4 (10 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":"scripts/wpfacts_recompute.py"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3df1157210d901d7e9542bd9dbe19c5055f0a931a2e30ed4c6cdaf03c41bec"}},{"ruleId":"D2","level":"warning","message":{"text":"node_compat_matrix.parseArgs (cognitive 33): node_compat_matrix.parseArgs has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 4 (9 pts), boolean chains 4 (nesting depth added 12). Of this number, 32 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":"scripts/node_compat_matrix.mjs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ccbd71737964a9e13e72554b1768c66d7f227f19045f53b146d91603b7f657"}},{"ruleId":"D2","level":"warning","message":{"text":"objects-cache.withObjectsResourceSampler (cognitive 33): objects-cache.withObjectsResourceSampler has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (24 pts), error handling 4 (5 pts), loops 2, ternaries 2 (nesting depth added 9). Most of this is not in the body itself: 9 of the 33 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 647, recordSampleFailure, sample, \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":"upstream/actions/jdx/mr-boxington-action/src/objects-cache.ts"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb49ce3e495e5c04c89b2a5c8a18846c5a1a463424f005f22192f38933df9c8f"}},{"ruleId":"D2","level":"warning","message":{"text":"Fixer::find_issues_in_expr (cognitive 32): Fixer::find_issues_in_expr has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 5 (11 pts), match/switch 2 (3 pts) (nesting depth added 19). 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/perry/src/commands/fixer.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a3d241c4561e794c14cac4982847ba0010e9ace456439d5263917772898352"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::extract_requires::identifier_is_reassigned (cognitive 32): perry::commands::compile::cjs_wrap::extract_requires::identifier_is_reassigned has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 8, loops 4 (7 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/perry/src/commands/compile/cjs_wrap/extract_requires.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af2e50e8cbb94a3026c7282594b12eff0ae539b2b8641533ceb1526595d41d2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::lock_scan::collect_native_archives_for_lock (cognitive 32): perry::commands::compile::lock_scan::collect_native_archives_for_lock has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 1 (3 pts) (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/perry/src/commands/compile/lock_scan.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"71249ea794cdba6adfa8b49638d53c608e0b2b256ee9628eec296425f7cd8bc7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::lowering_report::print_text_report (cognitive 32): perry::commands::compile::lowering_report::print_text_report has cognitive complexity 32 (threshold 15). Drivers by points: if/else 31, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/lowering_report.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"055f20674028e4e26cacedcfb0cdb2d192adb7ff4e323a6e111f39e569c02287"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::strip_dedup::find_nightly_llvm_tool (cognitive 32): perry::commands::compile::strip_dedup::find_nightly_llvm_tool has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 6 (10 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/strip_dedup.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37590abf09ceeea4f922afca76f90a4834265a69e26da6c10a5f619916a4994"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::targets::compile_for_ios_widget (cognitive 32): perry::commands::compile::targets::compile_for_ios_widget has cognitive complexity 32 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 11 (12 pts), match/switch 3 (5 pts) (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/perry/src/commands/compile/targets.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"584159988d408fb433cdd4ed542b7a0453e12e418f324e36cb21fcbb9566f77b"}},{"ruleId":"D2","level":"warning","message":{"text":"ProvenanceJudge::walk_stmts (cognitive 32): ProvenanceJudge::walk_stmts has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/integer_locals.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ad90f0fc6e9d8aa0f00ab70843d650c0263517f977499af47ff65e54205722"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph::components (cognitive 32): Graph::components has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 3 (7 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/perry-codegen/src/layout_desc/array_families.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"02749218cd9c67a7981945e6028769c507c887817bfe6e9eeb55062e55acaa0e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::opts::computed_names::collect (cognitive 32): perry_codegen::codegen::opts::computed_names::collect has cognitive complexity 32 (threshold 15). Drivers by points: loops 11 (22 pts), if/else 2 (6 pts), match/switch 1 (4 pts) (nesting depth added 18). 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/perry-codegen/src/codegen/opts/computed_names.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3386be30428a0c71d25ebe6b072d1130e8b891ea015e97481bad2331a3d723c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::retained_source_pool::prepare_ranges (cognitive 32): perry_codegen::codegen::retained_source_pool::prepare_ranges has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 8, loops 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/retained_source_pool.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f6d5456a4e0dabc5d1065313c433001e1c0b007386a8d4f6703bf4aced28dd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::static_constfn::construction_final (cognitive 32): perry_codegen::codegen::static_constfn::construction_final has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 9, 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/perry-codegen/src/codegen/static_constfn.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"454c74d0012478dc7cb873393f33922cf664d99efb843561fbb4b0d7390c142d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::hir_facts::collect_type_facts (cognitive 32): perry_codegen::collectors::hir_facts::collect_type_facts has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 4 (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/perry-codegen/src/collectors/hir_facts.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f6ed2a9b207e7f92759eaaf9ab735c3958c6f7f2757d33bfeb83d07f19b070"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::collect_facts (cognitive 32): perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::collect_facts has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 2 (4 pts), 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. This shape REPEATS in the file: 5 other methods here (perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals, perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::expr_value_type, perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::collect_expr_writes_in_closure_stmts, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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/perry-codegen/src/collectors/pointer_locals.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc8762d69abc570c5801433f5a6667595e972d130c41b32a46d8318db528777"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_report::scan_stmts (cognitive 32): perry_codegen::collectors::ptr_shape_report::scan_stmts has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 3 (7 pts), 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/perry-codegen/src/collectors/ptr_shape_report.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fea3a44e011010e5fc349a33fb4f73746ad667e08e09c8a25e7f94f87f6b75"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::i32_fast_path::lower_expr_native_i32 (cognitive 32): perry_codegen::expr::i32_fast_path::lower_expr_native_i32 has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (23 pts), match/switch 3 (5 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/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"570efdcf68e8d49965fd5e406c3877f222ee9253aef5eff16a1006f8a163b784"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::method_site::emit_method_site (cognitive 32): perry_codegen::expr::method_site::emit_method_site has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 5 (8 pts), loops 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/perry-codegen/src/expr/method_site.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1baece4f7d9a628f7aceb1e5a5dff03f093423cc18c456f48d1f30129a15753"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::native_value::verify::layout::validate_pod_layout (cognitive 32): perry_codegen::native_value::verify::layout::validate_pod_layout has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 4, loops 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/perry-codegen/src/native_value/verify/layout.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"932c91779dc4c671a91a85354ee93b0686d61abe4115e13b769aeec7ce2c712a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::stable_packed_loop::lower (cognitive 32): perry_codegen::stmt::stable_packed_loop::lower has cognitive complexity 32 (threshold 15). Drivers by points: if/else 22 (23 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/stable_packed_loop.rs"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a32b170799900c4eb351f544f187dd42c723c65313d098b9a26ef330ec099b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::type_analysis_class_fields::class_declared_field_type (cognitive 32): perry_codegen::type_analysis_class_fields::class_declared_field_type has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 19). 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/perry-codegen/src/type_analysis_class_fields.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"657ac3127d09ce3b4d24bf5ced1b1b907be53a9d68dcd38454f02c836e13ed62"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_zlib::stream::one_shot_callback::run (cognitive 32): perry_ext_zlib::stream::one_shot_callback::run has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (25 pts), boolean chains 4, match/switch 1 (2 pts), loops 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/perry-ext-zlib/src/stream/one_shot_callback.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9abe56170185db3fd9fd2420b61f275e772bf7f21ca5921ace41dbf66d90e3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::dynamic_import::collect_module_const_locals (cognitive 32): perry_hir::dynamic_import::collect_module_const_locals has cognitive complexity 32 (threshold 15). Drivers by points: loops 14 (19 pts), if/else 5 (13 pts) (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/perry-hir/src/dynamic_import.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"c218b9c3da832efe3dcbe0f888b80bd365229fb2e78c79b9f6d2fc917de0cd8d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::builder_fold_width_hints::const_build_loop_width (cognitive 32): perry_hir::lower::builder_fold_width_hints::const_build_loop_width has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (28 pts), match/switch 2, 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/perry-hir/src/lower/builder_fold_width_hints.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb9702bd68fed44538879d198d296ac213ddce0ef0eead9b0fdd051f2ace7f5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::intrinsics::apply_call::try_builtin_prototype_method_apply_call (cognitive 32): perry_hir::lower::expr_call::intrinsics::apply_call::try_builtin_prototype_method_apply_call has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (21 pts), match/switch 6 (10 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"1326832553638af233fdd949cbbc21e4d9c6453500f5e1d44515d56025b45a0e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals::collect_shadowing_decls (cognitive 32): perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals::collect_shadowing_decls has cognitive complexity 32 (threshold 15). Drivers by points: loops 8 (20 pts), if/else 5 (11 pts), match/switch 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. This shape REPEATS in the file: 3 other methods here (perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals, perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals::record_var, perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals::walk_stmt) 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/perry-hir/src/lower/pre_scan/weakref_locals.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2fb90b2cf5ef5c01d3fd9fe0cc5a8f8c45e17849c9d108a3f3820779657442"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::shared_mutable_capture::rewrite_stmt (cognitive 32): perry_hir::lower::shared_mutable_capture::rewrite_stmt has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 4 (9 pts), loops 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/perry-hir/src/lower/shared_mutable_capture.rs"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f64cd6bcec89c43f832d71140f7ac27b8a9156cfcbabbb1a00c3d8826f93fe"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::stmt_loops::mark_iterator_completion_on_abrupt (cognitive 32): perry_hir::lower::stmt_loops::mark_iterator_completion_on_abrupt has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 5 (14 pts), loops 2 (4 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"71227e7fe2cd55047d1f80922825fc81e689b83a16b04c44b72f440cbf4680bb"}},{"ruleId":"D2","level":"warning","message":{"text":"GcCycleState::step_atomic_finalize_current_subphase (cognitive 32): GcCycleState::step_atomic_finalize_current_subphase has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 4 (9 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/gc/cycle.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"07baa9178072c63b86160ed03cfb2dd147ef9ac7692b323399c263c0a0693c91"}},{"ruleId":"D2","level":"warning","message":{"text":"ValidPointerSetBuilder::step (cognitive 32): ValidPointerSetBuilder::step has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (28 pts), match/switch 1 (2 pts), boolean chains 1, 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/perry-runtime/src/gc/trace.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d661eac86b1ee0d12c957f6e366611015c09a681a91112e8a3286af11645d9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::builtins::arithmetic::classify_value_typeof (cognitive 32): perry_runtime::builtins::arithmetic::classify_value_typeof has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (26 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/perry-runtime/src/builtins/arithmetic.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaff900cb6692f3a9066944fe5fb30036044f996a1f149aa44f88ce66de99518"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::bun_compat::cli_utils::jsonl_parse_chunk (cognitive 32): perry_runtime::bun_compat::cli_utils::jsonl_parse_chunk has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 4 (6 pts), match/switch 3 (6 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/perry-runtime/src/bun_compat/cli_utils.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"0371c383bfb47a13c426ba28e6c1f15343b376e203da7568da7575761d3ff35e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::bun_ffi::dlopen::cstring_value (cognitive 32): perry_runtime::bun_ffi::dlopen::cstring_value has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (21 pts), match/switch 4 (6 pts), loops 1 (3 pts), boolean chains 2 (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/perry-runtime/src/bun_ffi/dlopen.rs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b9c5ce913db1c80f67655cb7627bb9090b87eb7268e0b29207367ca40e8c59"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::fromspace_scan::scan_object (cognitive 32): perry_runtime::gc::fromspace_scan::scan_object has cognitive complexity 32 (threshold 15). Drivers by points: if/else 20 (30 pts), loops 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/gc/fromspace_scan.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"244bec70ee957e1899bbb0416eb0a148d4c1bc1430cf0ea9ac25b2e31f559c63"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::native_stack_scan::run_native_stack_scan (cognitive 32): perry_runtime::gc::native_stack_scan::run_native_stack_scan has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 5 (9 pts), boolean chains 4 (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/perry-runtime/src/gc/native_stack_scan.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"410775a7bf8a6c44d0529737093a5e24a5ce9ab2d890ddab749f0c3e2ccf814b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::replacer::dispatch_pointer_with_replacer (cognitive 32): perry_runtime::json::replacer::dispatch_pointer_with_replacer has cognitive complexity 32 (threshold 15). Drivers by points: if/else 23 (31 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/perry-runtime/src/json/replacer.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc08254ad16195e3c624002d7fc6fdde7016eadea23de475efde1ee93406804"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json_tape::iterative::materialize_iterative (cognitive 32): perry_runtime::json_tape::iterative::materialize_iterative has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (26 pts), match/switch 2 (5 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/perry-runtime/src/json_tape/iterative.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"927a012754634edebbae922a303e6b2fbef586e4ff722d3ee861839e39ef44e2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_constructors::entry::call_class_object_captured_entry (cognitive 32): perry_runtime::object::class_constructors::entry::call_class_object_captured_entry has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 5 (9 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/perry-runtime/src/object/class_constructors/entry.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21c732f13615f2cccd00fe50239ab5628795e02e722ed9f22fed164f3a0f8a5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::descriptor_state::declared_class_chain_blocks_store (cognitive 32): perry_runtime::object::descriptor_state::declared_class_chain_blocks_store has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (29 pts), 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/perry-runtime/src/object/descriptor_state.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfaad464f38a7fe5e2e4157e69433b50dcd2ed12c67947e181bea3598515b8e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_probe::write::chain_admits_add (cognitive 32): perry_runtime::object::layout_probe::write::chain_admits_add has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 2 (4 pts), boolean chains 3, 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/perry-runtime/src/object/layout_probe/write.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"e764f2c500a72811f605ae7055a520df9266a0db1134c98f86155592c0504e37"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_module::callable_exports::bound_native_callable_export_value (cognitive 32): perry_runtime::object::native_module::callable_exports::bound_native_callable_export_value has cognitive complexity 32 (threshold 15). Drivers by points: if/else 24, 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/perry-runtime/src/object/native_module/callable_exports.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb85da551770d97e2c655562d23a549b3d751f8f92fcef80780574baf9c8777d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::reflect_support::obj_value_has_own_key (cognitive 32): perry_runtime::object::reflect_support::obj_value_has_own_key has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (30 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/perry-runtime/src/object/reflect_support.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b87f2c497674a29ead71ca62f4a80268259cb119b03939592677c91087a22a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::shape_store::try_own_store (cognitive 32): perry_runtime::object::shape_store::try_own_store has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (28 pts), boolean chains 3, 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/perry-runtime/src/object/shape_store.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d2c7ca5a1006bbfb248b28477ec27e53bc517e2781091abf3536eea1964f88"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::shapes::object_proto_id_for (cognitive 32): perry_runtime::object::shapes::object_proto_id_for has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 5 (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/perry-runtime/src/object/shapes.rs"},"region":{"startLine":5174}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae1658d4816d2316c7872b575c87df9dc5853d78a7a7cd168bf3c68e717cc06"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::slice_ops::case_convert (cognitive 32): perry_runtime::string::slice_ops::case_convert has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 2 (5 pts), boolean chains 2, 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/perry-runtime/src/string/slice_ops.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"77925b7b5cdb2cc9db61dc0791cc59769a254fb070dba5143174cc719872f031"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::webassembly::call_wasm_import (cognitive 32): perry_runtime::webassembly::call_wasm_import has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 5, match/switch 3, 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/perry-runtime/src/webassembly.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8912079e3780e53250888dfe225c837417ecb4f508e50f0682ccdb2235ecf95"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::finally_inline::inline_finally_into_returns (cognitive 32): perry_transform::finally_inline::inline_finally_into_returns has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 8 (13 pts), boolean chains 4 (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/perry-transform/src/finally_inline.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8601377d9fa6d0261d7906cbfaa9b84e8cb2e826fd982d69fa4ea659b931cd07"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::lower::fixed_state::record_step_kinds (cognitive 32): perry_transform::generator::lower::fixed_state::record_step_kinds has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 4 (8 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 17). Of this number, 29 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":"crates/perry-transform/src/generator/lower/fixed_state.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"092222695291877ca579099ff025072d8df29f654c2adadbd93c387828e7644f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::private_frame::closed_effects (cognitive 32): perry_transform::generator::private_frame::closed_effects has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 5 (9 pts), match/switch 4 (9 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/perry-transform/src/generator/private_frame.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"45aa274ef6721db018cea6f08dabf710e73167d69868b6bd71d0c43fb0e6c015"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::substitute::substitute_locals_in_stmts_inner (cognitive 32): perry_transform::inline::substitute::substitute_locals_in_stmts_inner has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 2 (4 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/perry-transform/src/inline/substitute.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"564e4b76e9f313f534edb32bf7a349046ae542b2f55e756276b810b270caa1bf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_tvos::state::state_set (cognitive 32): perry_ui_tvos::state::state_set has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 8 (14 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/perry-ui-tvos/src/state.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfdaf35532f5c004c4ec3a4b09c4dde167d3a46ca385a279c6893e8e2dbe97a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_visionos::state::state_set (cognitive 32): perry_ui_visionos::state::state_set has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 8 (14 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/perry-ui-visionos/src/state.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"625e781aec20e73c7b6a6ff0582740508f4ddf960bfce1ca8d6b08a500c32dd3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::media_playback::set_now_playing (cognitive 32): perry_ui_windows::media_playback::set_now_playing has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 1, match/switch 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/perry-ui-windows/src/media_playback.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"0274a4ae9faf0407126b40e9553078072b34cfafb218431d6eecd4aa4fb870fa"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::virt_revoke (cognitive 32): Model::virt_revoke has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 4 (8 pts), match/switch 3 (6 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/solve.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a84ed7603b9a6e74a8fffe326b4055238c046c01a46064b1e1e588e93b4e685"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::wire_args (cognitive 32): Model::wire_args has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 4 (6 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/summary.rs"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"41eab35a55202fa531a6c2be18518ef5cd019160ccace03217ef5b99a030b517"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::builtins::collections::bobj_method (cognitive 32): perry_wpfacts::builtins::collections::bobj_method has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 3 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/builtins/collections.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74f4c20c895829d53ca1ff2e0f5134a6a0834facfffa3f05529a285bbee3aaf"}},{"ruleId":"D2","level":"warning","message":{"text":"gc-paired-instruction-domains-v1.run (cognitive 32): gc-paired-instruction-domains-v1.run has cognitive complexity 32 (threshold 15). Drivers by points: loops 8 (12 pts), if/else 3 (9 pts), boolean chains 6, ternaries 2 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/audits/gc-rss-instructions-2026-10-03/gc-paired-instruction-domains-v1.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8b73744c5cf611066b233cbda48b352e5ebeeb44e85fc99e21bb7ed0a1a084"}},{"ruleId":"D2","level":"warning","message":{"text":"repsel_census.self_test (cognitive 32): repsel_census.self_test has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 6 (7 pts), error handling 4 (6 pts), boolean chains 4, ternaries 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":"scripts/compiler_output_harness/repsel_census.py"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf658ce0813779af84ad33105fd30688ec99a19d0b02680558005b4e3c998ed0"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.must_active_slots (cognitive 32): gc_root_dominance_check.must_active_slots has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 5 (11 pts), ternaries 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":2185}}}],"partialFingerprints":{"codehealthFindingId/v1":"853d2117109abffbafeb332e62a33b2c6448a019841adcc55904db4c886b4fc3"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_runtime_root_holders.inventory_problems (cognitive 32): gc_runtime_root_holders.inventory_problems has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 7, 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":"scripts/gc_runtime_root_holders.py"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc12c185d1f7bba8cdeedbe06bc02badfcbcd173ff0f8054df3f81a941e26909"}},{"ruleId":"D2","level":"warning","message":{"text":"native_export_collisions.literal_exports (cognitive 32): native_export_collisions.literal_exports has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (22 pts), ternaries 2 (6 pts), boolean chains 3, 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":"scripts/native_export_collisions.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e7265a8928735b78751ea8b79442cb582bf4699706a809445fef6869fb547f"}},{"ruleId":"D2","level":"warning","message":{"text":"schemadec_micros.main (cognitive 32): schemadec_micros.main has cognitive complexity 32 (threshold 15). Drivers by points: loops 9 (17 pts), if/else 4 (9 pts), ternaries 2 (6 pts) (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/schemadec_micros.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4e1f27d6ea28ce0721ed08be0f74e34cae963c9ee13551ec7fd1f3cf9b5598"}},{"ruleId":"D2","level":"warning","message":{"text":"sso_unbox_inventory.string_param_table (cognitive 32): sso_unbox_inventory.string_param_table has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (19 pts), loops 4 (10 pts), ternaries 1 (2 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":"scripts/sso_unbox_inventory.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6650c2c6a89805f7fd085d70d546b020a6f40203f4940531ce89ae3449e114"}},{"ruleId":"D2","level":"warning","message":{"text":"statepoint_report_assert.main (cognitive 32): statepoint_report_assert.main has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (23 pts), loops 4 (6 pts), boolean chains 2, ternaries 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":"scripts/statepoint_report_assert.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c9301e91a023326dacda36f93729d0a2d08c3dca7d15b8ea1d0af1a34001cc"}},{"ruleId":"D2","level":"warning","message":{"text":"tokio_inventory.self_test (cognitive 32): tokio_inventory.self_test has cognitive complexity 32 (threshold 15). Drivers by points: if/else 28, boolean chains 2, loops 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":"scripts/tokio_inventory.py"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf51e93ca84b07a1e7bb678a1faf08faf6a30844ad3235beb6015cffc0a5ade9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::bootstrap::named_exports::enforce (cognitive 31): perry::commands::compile::bootstrap::named_exports::enforce has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 4 (7 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/perry/src/commands/compile/bootstrap/named_exports.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce35ed3cbc5101eee90fa8f183ae2bfe92de8e7d73ecfef5791d80451bdea73"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::extract_exports::extract_object_literal_keys (cognitive 31): perry::commands::compile::cjs_wrap::extract_exports::extract_object_literal_keys has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (9 pts), boolean chains 6, 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/perry/src/commands/compile/cjs_wrap/extract_exports.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"47dc982477e2b2efdf920d848cb3b2ab55eaf9a3771725dee5bbea0df6e36821"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::program_facts::run (cognitive 31): perry::commands::compile::program_facts::run has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/program_facts.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"295211bfc062e4f5a02ade40bea8284fdc2f0b7df15deb3bea064e7c6bf07bcf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::deps::dynamic_import_lines (cognitive 31): perry::commands::deps::dynamic_import_lines has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 8, loops 4 (7 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/perry/src/commands/deps.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"5556042e456f4713ea00920a84ad1083db836d474c548613bd23fb8f60c83d72"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::run::resign::find_system_dev_profile (cognitive 31): perry::commands::run::resign::find_system_dev_profile has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (23 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 19). 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/perry/src/commands/run/resign.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"257d5764f89cbe806e6e627e3f325c6122fe4ab18ba7421c5634da91bdfceac2"}},{"ruleId":"D2","level":"warning","message":{"text":"Names::stmts (cognitive 31): Names::stmts has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 3 (7 pts), match/switch 1 (2 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/perry-codegen/src/codegen/tdz_names.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a3c413e1bd17a98c1e59fc20c635f49a1476ea9987c08be92c264d625abb02"}},{"ruleId":"D2","level":"warning","message":{"text":"Flow::statements (cognitive 31): Flow::statements has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (8 pts), 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/perry-codegen/src/layout_desc/array_families.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89f8182710c363f18750cf95d96fb0d01ce53a74ef35cfb674a951858c7901e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::split_regions_literal::chunk_giant_literal (cognitive 31): perry_codegen::codegen::split_regions_literal::chunk_giant_literal has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (23 pts), match/switch 3 (5 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/perry-codegen/src/codegen/split_regions_literal.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f56896a21fd061bcc47ae8b3e4652b6a8ad032e5e045644cfdb622d11770f1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::int_valued_i64_locals::collect_written_ids (cognitive 31): perry_codegen::collectors::int_valued_i64_locals::collect_written_ids has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 2 (3 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/perry-codegen/src/collectors/int_valued_i64_locals.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e5060054c9f4f8cbc4d671363742feca2e8fdc73a63602c9928aaa710c8832"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::url_main::lower (cognitive 31): perry_codegen::expr::url_main::lower has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (24 pts), match/switch 3 (5 pts), loops 1 (2 pts) (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/perry-codegen/src/expr/url_main.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c993ac8c895cadf8ba92b6dd35b5a6fbe18ba30c1386dce8e714c57f18bc2d10"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_desc::function_families::emit (cognitive 31): perry_codegen::layout_desc::function_families::emit has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 4 (8 pts), match/switch 2 (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/perry-codegen/src/layout_desc/function_families.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac8d13b850d2cb6afed8ddee8ac88d82788423d41898dd7e90f0f2621d4f403"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::field_init::ctor_super_reruns_parent_ctor (cognitive 31): perry_codegen::lower_call::field_init::ctor_super_reruns_parent_ctor has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 2 (4 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/perry-codegen/src/lower_call/field_init.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"452d400159f35ee8a0e63bf62dc486743bf6e27f4fae11c236d1dd76b41c257b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::namespace_call::try_lower_namespace_member_call (cognitive 31): perry_codegen::lower_call::namespace_call::try_lower_namespace_member_call has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (24 pts), match/switch 3 (7 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/perry-codegen/src/lower_call/namespace_call.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d9d17f32145816e1ad563b7aad8f04f0a7f9c120c64b5b75d770dc72e48fe1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::region_loop::bare::nothing_collects_since (cognitive 31): perry_codegen::stmt::region_loop::bare::nothing_collects_since has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 5 (7 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/perry-codegen/src/stmt/region_loop/bare.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8aa5df2b5f88ecdf216bd2159c92e55dea02d1fc345eb16d2a50453baa62418"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_js::compile_modules_to_html_with_metadata (cognitive 31): perry_codegen_js::compile_modules_to_html_with_metadata has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 3 (8 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/perry-codegen-js/src/lib.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b73b5a9df19f61af8b61c003ccf8190602d45214bafcb87e6fda84c37affdeb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::analysis::builtins::builtin_static_function_length (cognitive 31): perry_hir::analysis::builtins::builtin_static_function_length has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 16 (31 pts) (nesting depth added 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. 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/perry-hir/src/analysis/builtins.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb655234e4f34ecb80488a972622e474b6be0864464e082ea3963eff0b8c77f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::analysis::fn_infer::unit_stats (cognitive 31): perry_hir::analysis::fn_infer::unit_stats has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 2 (3 pts), match/switch 2, boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/analysis/fn_infer.rs"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ebe9a003a928780c7b95ba4bd6aca75599b32b5647b1baa2d396dff5b9d736"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::analysis::fn_infer::layout::prefix (cognitive 31): perry_hir::analysis::fn_infer::layout::prefix has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 2 (4 pts), match/switch 1 (2 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/perry-hir/src/analysis/fn_infer/layout.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"7713bd5fe2b2824210773c1b2f1d7a895db6b78647eec225f75ad0c64a766bce"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::js_transform::local_natives::scan_stmt_for_user_class_instances (cognitive 31): perry_hir::js_transform::local_natives::scan_stmt_for_user_class_instances has cognitive complexity 31 (threshold 15). Drivers by points: loops 7 (17 pts), if/else 6 (13 pts), match/switch 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. This shape REPEATS in the file: one other method here (perry_hir::js_transform::local_natives::scan_stmt_for_field_native_instances) 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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdc8f1b012656c7f67db64889bb56b468df5a0780f136a257cee631a5e854e7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::js_transform::local_natives::scan_stmt_for_field_native_instances (cognitive 31): perry_hir::js_transform::local_natives::scan_stmt_for_field_native_instances has cognitive complexity 31 (threshold 15). Drivers by points: loops 7 (17 pts), if/else 6 (13 pts), match/switch 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. This shape REPEATS in the file: one other method here (perry_hir::js_transform::local_natives::scan_stmt_for_user_class_instances) 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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e000b0947fa24d3c62f7e4edff4e276f3ff2c85db33a7984b097fb84702a5a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::inline_array_methods::try_inline_array_methods (cognitive 31): perry_hir::lower::expr_call::inline_array_methods::try_inline_array_methods has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (19 pts), match/switch 2 (11 pts), boolean chains 1 (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/perry-hir/src/lower/expr_call/inline_array_methods.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ccccefec17e0377f3ea7bd420dc5e41d0a35aa4e6f209aa134bbddc03a75130"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_patterns::expr_reads_name_before_assignment (cognitive 31): perry_hir::lower_patterns::expr_reads_name_before_assignment has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 8, match/switch 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/perry-hir/src/lower_patterns.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7706352c1ddebaaf1395296c29400c46b529e164276ed86c3aa5d3527b0b00"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::arena::page_meta::unregister_block_generation (cognitive 31): perry_runtime::arena::page_meta::unregister_block_generation has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 4, match/switch 1 (3 pts), 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/perry-runtime/src/arena/page_meta/mod.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"b589c7640db2a59a2c35095fa33ce25540724803098cfd939d770be98f2cc63d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::subclass::build_dense_layout (cognitive 31): perry_runtime::array::subclass::build_dense_layout has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 3 (5 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/perry-runtime/src/array/subclass.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"57edec9b3e4dbcc48034cc260be4cebdf49d1244aca806929749bcca303a3ce3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::subclass::ensure_subclass_numeric_prefix (cognitive 31): perry_runtime::array::subclass::ensure_subclass_numeric_prefix has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 2, 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/perry-runtime/src/array/subclass.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42a0cbb23b320fa19145b51f23c28b7bb3e04275abe5c573d3e0b5d1a3d8c5b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::bun_compat::cli_utils::yaml_document_to_js (cognitive 31): perry_runtime::bun_compat::cli_utils::yaml_document_to_js has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 5 (11 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/perry-runtime/src/bun_compat/cli_utils.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0cebcf031d8cca80e35990c00a17d4f02941ea64aa28fc11e16aac6f53dd73"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::oldgen::evacuation_policy_snapshot_after_mark (cognitive 31): perry_runtime::gc::oldgen::evacuation_policy_snapshot_after_mark has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 2, 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/perry-runtime/src/gc/oldgen.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"785a75dd1534038314d113cfcc6b0d90ff241a4395834214b4604d5460c843f5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::parser::nesting_depth_exceeds (cognitive 31): perry_runtime::json::parser::nesting_depth_exceeds has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (23 pts), loops 2 (4 pts), boolean chains 2, 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/perry-runtime/src/json/parser.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c44210512427ea7a6ad7d74ad9d684aa29cc83805a16dff12b85aa0ad92bd5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json_tape::force_materialize_lazy_impl (cognitive 31): perry_runtime::json_tape::force_materialize_lazy_impl has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 2, 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/perry-runtime/src/json_tape.rs"},"region":{"startLine":1791}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f00a06950ff94302ab5a6eb35a2bfb27839314fca7432a6a96099338d8c173e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_stream_readwrite::drain_readable_from_events (cognitive 31): perry_runtime::node_stream_readwrite::drain_readable_from_events has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 5, loops 2 (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/perry-runtime/src/node_stream_readwrite.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58bf208b24d525e374be958404e00f4a3af6d2a7db090892f637f20f7b4ee9b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::field_ops::js_object_set_field_by_index (cognitive 31): perry_runtime::object::field_get_set::field_ops::js_object_set_field_by_index has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (30 pts), boolean chains 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/perry-runtime/src/object/field_get_set/field_ops.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44ebd4d4130e38c5aac1e8c882f95495092beb9c831938af157432159ebec64"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::instanceof::static_dispatch::instanceof_dispatch (cognitive 31): perry_runtime::object::instanceof::static_dispatch::instanceof_dispatch has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 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/perry-runtime/src/object/instanceof/static_dispatch.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea978bed55e3af63fd573fe562fdb80b3c58c600dc90279097d67b9023d0822f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::symbol::iterator::js_object_get_own_property_symbols (cognitive 31): perry_runtime::symbol::iterator::js_object_get_own_property_symbols has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 5 (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/perry-runtime/src/symbol/iterator.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec4d1f27889c4390256cf0c7d3fb4ca5f68f4211d9f0e2b99a7135a0e2d1527"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::thread::parallel_filter_impl (cognitive 31): perry_runtime::thread::parallel_filter_impl has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 9 (13 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/perry-runtime/src/thread.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"934b4e6ea04fd19754371c7875dc9b49d9d070bf7e79ebd0eeea703d1ec591e6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::validators::received::describe_received_js (cognitive 31): perry_runtime::validators::received::describe_received_js has cognitive complexity 31 (threshold 15). Drivers by points: if/else 19 (28 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/validators/received.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d11f227399db12f45532e0437f033c433cb3106c61c5889a96a35ba962f299"}},{"ruleId":"D2","level":"warning","message":{"text":"ContentDecoder::next_chunk (cognitive 31): ContentDecoder::next_chunk has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (19 pts), boolean chains 5, match/switch 1 (4 pts), 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/perry-stdlib/src/turnloop_client/content_decoding.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"31602c5606af5c7533ba51c8929ebb45a6690b05d1deaff0aea3e1e38b10c5fd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::lower::build_dispatch_while_body (cognitive 31): perry_transform::generator::lower::build_dispatch_while_body has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (28 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/generator/lower.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f046555609b5d064fbc235dbc53b68a8f40b980ca918a4091bd2b17f2e3d0d0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::per_iteration::rewrite_cells_in_expr (cognitive 31): perry_transform::generator::per_iteration::rewrite_cells_in_expr has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 6 (12 pts), match/switch 5 (7 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/generator/per_iteration.rs"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce4a24f60e3d1223b8bd98dedde86197e376109b6a0f6464fce3f0e1aad90d3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::call_inliner::fold_scalar_aggregate_param_length (cognitive 31): perry_transform::inline::call_inliner::fold_scalar_aggregate_param_length has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). Of this number, 30 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/perry-transform/src/inline/call_inliner.rs"},"region":{"startLine":1944}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccfd49b9ecddbf2a7864ad6b80f60259f81ac78119c9aeb966fdcf5067531727"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::cross_module::gather_cross_module_functions (cognitive 31): perry_transform::inline::cross_module::gather_cross_module_functions has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 5 (8 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/inline/cross_module.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"affdc2faecf1d3396746c0f8aeb1fb782a1e7603061a17440d6bb2221bd8e91a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::unroll::unroll_static_loops (cognitive 31): perry_transform::unroll::unroll_static_loops has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 6 (9 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/perry-transform/src/unroll/mod.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1493dd622b5af08eb41a96da40d3b2031df9c8a05a47c33d0aa5b31d6962e1"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::settle_members_from (cognitive 31): Model::settle_members_from has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 5 (10 pts), match/switch 1 (3 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/perry-wpfacts/src/model/operations.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c9c637d1327643b3daed59572eb760fb44876e99ea2799aff51af4baafb3a9"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::load_from (cognitive 31): Model::load_from has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (20 pts), match/switch 4 (6 pts), boolean chains 5 (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/perry-wpfacts/src/solve/lookup.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba26f602cd00609396a627828a2bf488543710ea893e9073f22e8252b3fdd695"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::derive::site_facts (cognitive 31): perry_wpfacts::derive::site_facts has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (19 pts), match/switch 3 (8 pts), loops 3, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/derive.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"474f89352688f631f0144d7b5fc98a204af528e21290f658117d43f500e2e714"}},{"ruleId":"D2","level":"warning","message":{"text":"DG-fallback-gap.check_native_calls (cognitive 31): DG-fallback-gap.check_native_calls has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 7 (14 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/DG-fallback-gap.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc735310115da1b567ac3006445097d91f30c9d9b695801cf72421040e4c0112"}},{"ruleId":"D2","level":"warning","message":{"text":"verification._record_matches_required (cognitive 31): verification._record_matches_required has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 13, 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":"scripts/compiler_output_harness/verification.py"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"58bad3267df1b2d6be3129dd7ee6630f8820dc980e76ccf9e57e6a1466da8e58"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_runtime_root_holders.crate_type_index (cognitive 31): gc_runtime_root_holders.crate_type_index has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (23 pts), loops 3 (6 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":"scripts/gc_runtime_root_holders.py"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d07373cce33c8e3fd07285127684f4d455db50d46112e3ca6b7fa8430d8d15"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::publish::tarball::resolve_file_deps (cognitive 30): perry::commands::publish::tarball::resolve_file_deps has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (26 pts), loops 2 (4 pts) (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/perry/src/commands/publish/tarball.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc38a3b69e110b5b3dbe9a49770cb4510abca2042a698a0925d848ebd5ccf744"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_audio_miniaudio::reapply_solo_state (cognitive 30): perry_audio_miniaudio::reapply_solo_state has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (10 pts), loops 3 (6 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/perry-audio-miniaudio/src/lib.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddaaaadb8951cbee21dd3b9e4f22358a1e1ddeca8f478a74e0f2c2cc877267b9"}},{"ruleId":"D2","level":"warning","message":{"text":"Facts::expr (cognitive 30): Facts::expr has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (27 pts), boolean chains 2, match/switch 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/perry-codegen/src/codegen/opts/computed_names.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"54809fe3bc85124b5713c98d938cabad73fe16c41c2acc7fdbd37975a646b033"}},{"ruleId":"D2","level":"warning","message":{"text":"Build::class (cognitive 30): Build::class has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 8 (11 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/perry-codegen/src/codegen/source_need/flow.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"714c870cf583c02059a5e97aba345e5c5434f90364ab6fd556c0dbf5b38411c1"}},{"ruleId":"D2","level":"warning","message":{"text":"Walk::judge_stmts (cognitive 30): Walk::judge_stmts has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/int_valued_i64_locals.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78971b9d73b25ac5ec4f561f344d8bbfd471700a5b255226ba46f2f5a44c426"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyzer::stmt (cognitive 30): Analyzer::stmt has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/scope_env/analysis.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"5951b49ab0a1344c652b299d3cf0720d12c7976fe02437673e985d64b3ed21ac"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::artifact_display_names::extend_body_symbol_display_names (cognitive 30): perry_codegen::codegen::artifact_display_names::extend_body_symbol_display_names has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 5 (10 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/artifact_display_names.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec03ecf0a2871a5fcc9c16f0a661a6c4dc88399803db0f95d46e01f8636c116"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::closure_collect::collect_direct_call_closures_in_stmts (cognitive 30): perry_codegen::codegen::closure_collect::collect_direct_call_closures_in_stmts has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/closure_collect.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"01158d99ec6ca9511e803d685858cd30236fe7be38d1244515301dcce088037a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::helpers::collect_return_class (cognitive 30): perry_codegen::codegen::helpers::collect_return_class has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 5 (12 pts), loops 2 (4 pts) (nesting depth added 17). Of this number, 24 points are the body\u0027s own statements and 6 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/perry-codegen/src/codegen/helpers.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a4319cca58085c223e7246a65e99ee70d6c92185f7a9edd1c11e1b095cef51"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::reach_report::executable_references (cognitive 30): perry_codegen::codegen::reach_report::executable_references has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 5 (7 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/perry-codegen/src/codegen/reach_report.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"731d9ef39d0a00c703139560727e49fd11c6d7a3c4b82e2cbb2910d2a10d298b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::split_regions::split_large_bodies_with_cost (cognitive 30): perry_codegen::codegen::split_regions::split_large_bodies_with_cost has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 9 (15 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/perry-codegen/src/codegen/split_regions.rs"},"region":{"startLine":1850}}}],"partialFingerprints":{"codehealthFindingId/v1":"18747b72db890c77e33067dd5c5350d57df1aa78fc7c9846198483699c8e922e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::split_regions_facts::max_local_id (cognitive 30): perry_codegen::codegen::split_regions_facts::max_local_id has cognitive complexity 30 (threshold 15). Drivers by points: loops 13 (22 pts), match/switch 3 (5 pts), if/else 1 (3 pts) (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/perry-codegen/src/codegen/split_regions_facts.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"222839f75a1f19677c560c1f37573a4b5498913b4d3b02e857dcea0e72d09a74"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::static_constfn::literal_final (cognitive 30): perry_codegen::codegen::static_constfn::literal_final has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 5, 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/perry-codegen/src/codegen/static_constfn.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1306415c721017f28d4ddadd52043b81d5374c9881c52b5222ad3ecc49ded04"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::escape_arrays::collect_length_only_indices_in_stmts (cognitive 30): perry_codegen::collectors::escape_arrays::collect_length_only_indices_in_stmts has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (perry_codegen::collectors::escape_arrays::collect_used_array_indices_in_stmts) 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/perry-codegen/src/collectors/escape_arrays.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5cf4caca4714c1acd24fbfc6f95026f060fe0de328685d8ef2d203c22b904f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::escape_arrays::collect_used_array_indices_in_stmts (cognitive 30): perry_codegen::collectors::escape_arrays::collect_used_array_indices_in_stmts has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (perry_codegen::collectors::escape_arrays::collect_length_only_indices_in_stmts) 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/perry-codegen/src/collectors/escape_arrays.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"6837dcc5c883f9a9523d13366538c1d54d07f7059f91e2493e316619d128ab0d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::escape_arrays::check_array_escapes_in_stmts (cognitive 30): perry_codegen::collectors::escape_arrays::check_array_escapes_in_stmts has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/escape_arrays.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"552977fec571d8a230ce7da1d41ee2dcb610b2dbf472a1c061fccd6f5802a5bd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::escape_check::check_escapes_in_stmts (cognitive 30): perry_codegen::collectors::escape_check::check_escapes_in_stmts has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/escape_check.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e87d4e34fa17ff1874f980890e7b643ba119e48c18071a39bc34e2e44bd1d4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::escape_news::collect_used_new_fields_in_stmts (cognitive 30): perry_codegen::collectors::escape_news::collect_used_new_fields_in_stmts has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/escape_news.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d07232e3f13a46c1db03701413e836e8905cfd771abb710a6871c179906e00"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::escape_objects::collect_used_object_fields_in_stmts (cognitive 30): perry_codegen::collectors::escape_objects::collect_used_object_fields_in_stmts has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/escape_objects.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e42527863c8d2d571080f13c87060a8db1cbdfc9f2efc942382471cddc554c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::escape_objects::check_object_literal_escapes_in_stmts (cognitive 30): perry_codegen::collectors::escape_objects::check_object_literal_escapes_in_stmts has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/escape_objects.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d50a477c9a8b85744686898f9b90e70ccd2072f247cc2b110c256fbdfe967b2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::i32_locals::collect_localset_ids_in_stmts_filtered (cognitive 30): perry_codegen::collectors::i32_locals::collect_localset_ids_in_stmts_filtered has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"562a01e0cb19490693c05be6f9247103c11173ffeefc8513f93778f0d2f148ba"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::index_uses::absorb_writes_into_index_used (cognitive 30): perry_codegen::collectors::index_uses::absorb_writes_into_index_used has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/index_uses.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ead197bf46c80a465da1bbaee3c52469cab06e36f5c15791964befb3fab8bc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::index_uses::walk_index_uses_in_stmts (cognitive 30): perry_codegen::collectors::index_uses::walk_index_uses_in_stmts has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/index_uses.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03332babcc14f941e8b55ec4791704d36b7ef11f37967dce961905ca6a74d3b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::int_valued_ta_locals::collect_facts (cognitive 30): perry_codegen::collectors::int_valued_ta_locals::collect_facts has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/int_valued_ta_locals.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ccc616d6b44bb583aa9ba43451273828d114cf19b4cd7a97a840785e708020"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::loop_bounded_i32::collect_written_locals::walk (cognitive 30): perry_codegen::collectors::loop_bounded_i32::collect_written_locals::walk has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/loop_bounded_i32.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"8699180cf71f6048e55d14981a491a6d6f16b225667d11191b301ebcc412d165"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::loop_bounded_i32::for_each_let (cognitive 30): perry_codegen::collectors::loop_bounded_i32::for_each_let has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/loop_bounded_i32.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"149045f92a6a8173aa96c44fadad8f8d43ce09acfabde50d6c360d8e51f7eb4b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::not_bigint_locals::collect_writes (cognitive 30): perry_codegen::collectors::not_bigint_locals::collect_writes has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/not_bigint_locals.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ae3ed232d13646df595b570a8e83c4b315f8ba02b7390d3c1bc440e4512440"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::object_literal_exports::capability_from_init (cognitive 30): perry_codegen::collectors::object_literal_exports::capability_from_init has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 3, 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/perry-codegen/src/collectors/object_literal_exports.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"1342632449bafe1812b36bec8a4e480ef7eb05c28fa41d7c7dde9cd5783c1b32"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::proven_this::rewrite_array_field_reads_in_stmts (cognitive 30): perry_codegen::collectors::proven_this::rewrite_array_field_reads_in_stmts has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/proven_this.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b252342ade6278e5c1067551bd20cde3f97cc0e6ad1cada26142d89d7aa5fd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::dyn_extern_i18n::emit_i18n_template (cognitive 30): perry_codegen::expr::dyn_extern_i18n::emit_i18n_template has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 5 (12 pts), loops 3, 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/perry-codegen/src/expr/dyn_extern_i18n.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd27663f68ce03f0ecb7d0ab28ac43bd8d3b6448c8afcfb656dc7aa993cbdae5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::gc_map::parse_block (cognitive 30): perry_codegen::gc_map::parse_block has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 5, loops 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/gc_map.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"729839ddbfdf7c291627f159dfd7102294eaf0e0d1a9c43d58bc4a0092fb2552"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_families::late::add_late_keys (cognitive 30): perry_codegen::layout_families::late::add_late_keys has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (6 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/layout_families/late.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bfb385a470e43bc09a167f0680af897de49d3f6a07b0e5ce6d3e8098f09984"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::options::notification::lower_notification_schedule (cognitive 30): perry_codegen::lower_call::options::notification::lower_notification_schedule has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 6 (15 pts), loops 5 (8 pts), if/else 4 (7 pts) (nesting depth added 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. 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/perry-codegen/src/lower_call/options/notification.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4fd96c0c0f2d62f7b1d7c8a4ed7aa62219d86d22c6935250dc594381f3a087"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::opt_report::callbacks::scan_stmts (cognitive 30): perry_codegen::opt_report::callbacks::scan_stmts has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/opt_report/callbacks.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"367a1efb36aece2eaf3694d52f4c3efbb38e1f936b0052c98d5c48a691b2b30e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::loops::classify_for_length_hoist_impl (cognitive 30): perry_codegen::stmt::loops::classify_for_length_hoist_impl has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 6 (8 pts), boolean chains 6 (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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":8297}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed1b4f5f4cb116b7d0587a931adf0101c9e8643229b5155fffbf328df25f170"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_js::minify::copy_template_literal (cognitive 30): perry_codegen_js::minify::copy_template_literal has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (9 pts), boolean chains 4, match/switch 1 (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/perry-codegen-js/src/minify.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f298b63d062b07ad928e97ae8411b03edc63ad4a08f30f3eee75a5d5d5972b7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_wasm::emit::closures::collect_closures_from_stmts (cognitive 30): perry_codegen_wasm::emit::closures::collect_closures_from_stmts has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/emit/closures.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9cc5fd842ed60b4daa9c9e1b5383822e9411d773cf5a718ef261ad5d1f917f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_wasm::minify::copy_template_literal (cognitive 30): perry_codegen_wasm::minify::copy_template_literal has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (9 pts), boolean chains 4, match/switch 1 (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/perry-codegen-wasm/src/minify.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e65ca25f528e5b9ef87a591d729db9a06ba92441b922296faa4379412eed383"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_gc_effects::archive::decode_sections (cognitive 30): perry_gc_effects::archive::decode_sections has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 3 (6 pts), match/switch 1 (5 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/perry-gc-effects/src/archive.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7d3ca141599b078aa99119faef12aa6eea697c59e0ef6ec14688ff60b5231a"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkerPaths::resolve (cognitive 30): WorkerPaths::resolve has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/dynamic_import/worker_paths.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"4faefefb94a27c2c0f4a9bc9d1e7f2023fac2d7cc9f831d3f45c939cb5f5fca9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::analysis::fn_infer::apply::apply_stmts (cognitive 30): perry_hir::analysis::fn_infer::apply::apply_stmts has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/analysis/fn_infer/apply.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb2741a6b2fa72eb711bee8fb7e8d2fc5e4bc1cf66faf6e146aaaf802c3f92d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::analysis::fn_infer::layout::infer_layouts (cognitive 30): perry_hir::analysis::fn_infer::layout::infer_layouts has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 4 (10 pts), loops 4 (6 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/perry-hir/src/analysis/fn_infer/layout.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f111ddeb571a1dd3f27ff2c29b0e0e728994e5316183c7622d6a7b0589ab35f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::analysis::value_types::infer_expr_type (cognitive 30): perry_hir::analysis::value_types::infer_expr_type has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 7 (14 pts), loops 1 (2 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/analysis/value_types.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f90ab7cf136bfbe434ec00c08d31228557a8e884b6745048bbefe939ee9297"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::emitted_closures::collect_closure_refs_in_stmts (cognitive 30): perry_hir::emitted_closures::collect_closure_refs_in_stmts has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/emitted_closures.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4084400c2fd454df3888c896a569d897bd248e4ee14dc1c89468eb9b562f99"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::builder_fold::walk_class (cognitive 30): perry_hir::lower::builder_fold::walk_class has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 3 (11 pts), loops 2 (4 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/perry-hir/src/lower/builder_fold.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba933831c1d27fbbcdf4d6856a7cc5676a77495f981d03acd223b731ade930fd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_patterns::collect_implicit_assignment_expr_names (cognitive 30): perry_hir::lower_patterns::collect_implicit_assignment_expr_names has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (11 pts), match/switch 3 (8 pts) (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_patterns.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb8235811e103751841c3bc927ec87bfbbe7130e517c7ff23fcaea0d4bcc160"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_perex::tooling::dialect::translate (cognitive 30): perry_perex::tooling::dialect::translate has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-perex/src/tooling/dialect.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01eade5031a55d2074d8811500cc34a73086e0d8489f0715fbb58749dde486f"}},{"ruleId":"D2","level":"warning","message":{"text":"RememberedSetClearState::step_counted (cognitive 30): RememberedSetClearState::step_counted has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (27 pts), 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/perry-runtime/src/gc/barrier/maintenance.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36d911f09d2daa772a1ad209faba5acd0518d78908c978c7369acc302298397"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonSourceParser::parse_string_token (cognitive 30): JsonSourceParser::parse_string_token has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (23 pts), match/switch 2 (5 pts), boolean chains 1, 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/perry-runtime/src/json/reviver.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c54d608465c4b23fb8cbf1e961de67b8ecde35a5df0de46f064ba0bf4840457"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::indexing_proto_chain::array_index_get_walk (cognitive 30): perry_runtime::array::indexing_proto_chain::array_index_get_walk has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/array/indexing_proto_chain.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5baf54a5c3620abb2b9b0ea7aa2b0332cccebcdd0d47fb42727431669af3880"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::date::parse::parse_clock_token (cognitive 30): perry_runtime::date::parse::parse_clock_token has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 8, loops 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/date/parse.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"51959fa41dcc0498e7c5e14fcffa4fdf1945c05d612ae85caef72e0e6c349790"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::fs::dir_glob_watch::glob::run_bun_glob_result (cognitive 30): perry_runtime::fs::dir_glob_watch::glob::run_bun_glob_result has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 5, 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/perry-runtime/src/fs/dir_glob_watch/glob.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"200759285f9ea39882ce00d49584baec268ad97894640f16852d712a940fedd5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::module_require::resolve_request (cognitive 30): perry_runtime::module_require::resolve_request has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (28 pts), boolean chains 1, loops 1 (nesting depth added 17). 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/perry-runtime/src/module_require.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2d6bb9eb1b53f2c7fb882bd7fab3a113fc0368a663680573cc1c820470b87b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::collection_proto_thunks::render_incompatible_receiver (cognitive 30): perry_runtime::object::collection_proto_thunks::render_incompatible_receiver 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/perry-runtime/src/object/collection_proto_thunks.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14ad1f4490c865fa21109af709eba5f343fd3c6e14479749853ae0b593a322d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::object_ops::define_property::define_property_on_handle (cognitive 30): perry_runtime::object::object_ops::define_property::define_property_on_handle has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/object_ops/define_property.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadbd25b591def3dcb31432ed2aa9349f1cbc5ef866461995929b4f568ce4167"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::path::posix_basename_ext_inner (cognitive 30): perry_runtime::path::posix_basename_ext_inner has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (27 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/perry-runtime/src/path.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"35604735c2f2da1132812bcd6bcd75516b42d89ac8cb14c5a3748dc150e6aaf1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::proxy::own_keys::js_proxy_own_keys (cognitive 30): perry_runtime::proxy::own_keys::js_proxy_own_keys has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (22 pts), loops 4, 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/perry-runtime/src/proxy/own_keys.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"46879d796d05ecdddb9f29e90e087d3905e90eb9a0061850bc2f95478527d1f0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::quote::escaping::write_escaped_bytes_from (cognitive 30): perry_runtime::string::quote::escaping::write_escaped_bytes_from has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 2, 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/perry-runtime/src/string/quote/escaping.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0fa9849185dde29a7a3fd38a0316937d066a2ca921be6dbb2fcd18394855b1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::symbol::iterator::js_get_iterator (cognitive 30): perry_runtime::symbol::iterator::js_get_iterator has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 3, match/switch 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/perry-runtime/src/symbol/iterator.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"563b023fc2d82ef0899366060c8a2e7089975e4df0c6fe24022c6e3b971d4a1d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::sqlite::better::js_sqlite_stmt_all (cognitive 30): perry_stdlib::sqlite::better::js_sqlite_stmt_all has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (15 pts) (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/perry-stdlib/src/sqlite/better.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"01dbfe356fffdbe0409e6ba4df3420ed611de038b7dd477a81cd9dfd59e90b7f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::tls::dispatch::dispatch_tls_property (cognitive 30): perry_stdlib::tls::dispatch::dispatch_tls_property has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (25 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/tls/dispatch.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"46985a53cdae0d76a41cbc46855a64196c62f86ce4ed4b6f9580687ee7e108be"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::deforest::detect::analyze_producer (cognitive 30): perry_transform::deforest::detect::analyze_producer has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 3, match/switch 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/perry-transform/src/deforest/detect.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ddfdbe5299be049c98348a33fadab885303775d7b6db5bc82b05c8d3a0648f2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_android::widgets::textfield::get_string_value (cognitive 30): perry_ui_android::widgets::textfield::get_string_value has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (30 pts) (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/perry-ui-android/src/widgets/textfield.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2aad7ffd7bb0bc128caeac0997b959bcba615350910eccf1b649112e1488634"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_ios::audio_playback::drain_pending_callbacks (cognitive 30): perry_ui_ios::audio_playback::drain_pending_callbacks has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 2 (4 pts), loops 2, boolean chains 1 (nesting depth added 17). 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/perry-ui-ios/src/audio_playback.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcbf1b94a1fd31da1635f60f939af9c9b409bb06a4697560e1344fdd91940d6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_ios::audio_playback::reapply_solo_state (cognitive 30): perry_ui_ios::audio_playback::reapply_solo_state has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (10 pts), loops 3 (6 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/perry-ui-ios/src/audio_playback.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5dfb4ea7f5e1d372a0274b35856d3ad9c529bbc764d8c1e79023148d01582f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_macos::audio_playback::drain_pending_callbacks (cognitive 30): perry_ui_macos::audio_playback::drain_pending_callbacks has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 2 (4 pts), loops 2, boolean chains 1 (nesting depth added 17). 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/perry-ui-macos/src/audio_playback.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba77741e7fe48e5f67c21e3c5aed944c2cc57eeb22df84d58eae4932903a9ba"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_macos::audio_playback::reapply_solo_state (cognitive 30): perry_ui_macos::audio_playback::reapply_solo_state has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (10 pts), loops 3 (6 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/perry-ui-macos/src/audio_playback.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"542512bbcb1e3272662846196bdd27a58c5c2cf9afb2016a698195917e88d941"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_tvos::audio_playback::drain_pending_callbacks (cognitive 30): perry_ui_tvos::audio_playback::drain_pending_callbacks has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 2 (4 pts), loops 2, boolean chains 1 (nesting depth added 17). 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/perry-ui-tvos/src/audio_playback.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"0598440cbb4b8480af77ad59727180f768d63d24f3a735a05d7ed1202ce6e239"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_tvos::audio_playback::reapply_solo_state (cognitive 30): perry_ui_tvos::audio_playback::reapply_solo_state has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (10 pts), loops 3 (6 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/perry-ui-tvos/src/audio_playback.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c408fa842427cf00cc3dc073ec8758019f66ccc4f520916030ed2620e53a85"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_visionos::audio_playback::drain_pending_callbacks (cognitive 30): perry_ui_visionos::audio_playback::drain_pending_callbacks has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 2 (4 pts), loops 2, boolean chains 1 (nesting depth added 17). 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/perry-ui-visionos/src/audio_playback.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3ac44311600c10d6cc9d4ad44fa2bf1f1f54a3656ad5af061aa859e98e747c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_visionos::audio_playback::reapply_solo_state (cognitive 30): perry_ui_visionos::audio_playback::reapply_solo_state has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (10 pts), loops 3 (6 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/perry-ui-visionos/src/audio_playback.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09cdacb708ab92c6a4875ccabe3ebe5d551a3055e9a8aab013eb6383bf42de1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_watchos::audio_playback::drain_pending_callbacks (cognitive 30): perry_ui_watchos::audio_playback::drain_pending_callbacks has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 2 (4 pts), loops 2, boolean chains 1 (nesting depth added 17). 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/perry-ui-watchos/src/audio_playback.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3b907fb71f6ed419700029ffca19b6c1944a20b3760cc615634553ab082e53"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_watchos::audio_playback::reapply_solo_state (cognitive 30): perry_ui_watchos::audio_playback::reapply_solo_state has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (10 pts), loops 3 (6 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/perry-ui-watchos/src/audio_playback.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c7240553fd00747329476da49a07e18c23a7da0b98938366d218220e32fa08"}},{"ruleId":"D2","level":"warning","message":{"text":"W::stmt (cognitive 30): W::stmt has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 8, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/ctor_phase.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a705f2671258c7d7b27712c88d317ff63d0cf6adaf6538108e4ef838668ca003"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::register_class (cognitive 30): Gen::register_class has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 11 (13 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/perry-wpfacts/src/gen.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3bf5b99b3752a01e0dc46f143e98d6b2adbbcd2c9017ea6101aa873baa29cd"}},{"ruleId":"D2","level":"warning","message":{"text":"FnContract::join (cognitive 30): FnContract::join has cognitive complexity 30 (threshold 15). Drivers by points: loops 7 (11 pts), if/else 6 (10 pts), match/switch 4 (9 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/perry-wpfacts/src/units.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"362210fb68891b85303d8c2e1b6e2f890614c74b8454d6b23b75481ceb3094e9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::units::module_exports (cognitive 30): perry_wpfacts::units::module_exports has cognitive complexity 30 (threshold 15). Drivers by points: loops 7 (13 pts), match/switch 3 (11 pts), if/else 2 (6 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/units.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da26a14b5f61a576eedebefdb10ed57a4b4890fb88022fe6b80cb39e18ab7f8"}},{"ruleId":"D2","level":"warning","message":{"text":"addr_class_inventory.main (cognitive 30): addr_class_inventory.main has cognitive complexity 30 (threshold 15). Drivers by points: loops 9 (18 pts), if/else 10 (12 pts) (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":"scripts/addr_class_inventory.py"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59cae8d760703e6cd0658f2467b22b5bc2d9b1eda446b8af66b09b5a91bd714"}},{"ruleId":"D2","level":"warning","message":{"text":"check_js_body_call_funnel.definition_violations (cognitive 30): check_js_body_call_funnel.definition_violations has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 5 (9 pts), boolean chains 3 (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":"scripts/check_js_body_call_funnel.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"72991f2b855d946213acc33483bf22d59d3f75f5864289ae07aaf001c7c5e236"}},{"ruleId":"D2","level":"warning","message":{"text":"class_id_collisions.main (cognitive 30): class_id_collisions.main has cognitive complexity 30 (threshold 15). Drivers by points: loops 8 (18 pts), if/else 8 (9 pts), ternaries 1 (2 pts), boolean chains 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":"scripts/class_id_collisions.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e28999c56d4c5c5f1bd1ce92d1c74b58067f86fbda70d31210b53b38e90e88"}},{"ruleId":"D2","level":"warning","message":{"text":"package_bench_attr.write_markdown (cognitive 30): package_bench_attr.write_markdown has cognitive complexity 30 (threshold 15). Drivers by points: loops 10 (11 pts), boolean chains 9, if/else 4 (6 pts), ternaries 3 (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":"scripts/package_bench_attr.py"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"89fd724d899972f3fac29c801d2f35678a365b8fd69d6dc8d960151af6e18d02"}},{"ruleId":"D2","level":"warning","message":{"text":"stackmap_anatomy.compact_size (cognitive 30): stackmap_anatomy.compact_size has cognitive complexity 30 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 5 (10 pts), ternaries 1 (4 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":"scripts/stackmap_anatomy.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e99e6ab8051aa7642f525bae0f1a3853ade08b57327386cd572c15dd28ef3c"}},{"ruleId":"D2","level":"warning","message":{"text":"web_runtime.perry_ui_menubar_attach (cognitive 30): web_runtime.perry_ui_menubar_attach has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (27 pts), loops 2, boolean chains 1 (nesting depth added 12). Most of this is not in the body itself: 4 of the 30 points are its own statements and the rest belongs to 8 function items inside it that branch (renderMenuItems, a function literal at line 1712, dismissAll, \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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3982187067d9bacadc7fbe3b96153aa1dac22f6391893c0f1d07cc50252c827"}},{"ruleId":"D2","level":"warning","message":{"text":"Contracts::lookup (cognitive 29): Contracts::lookup has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 1 (3 pts), boolean chains 2, loops 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/perry/src/commands/compile/collect_modules/reexport_prune/side_effects.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5e9ea00a06acc0ca4659b21487d53e73f571931fc531ef6bbc2ad9be4adc45"}},{"ruleId":"D2","level":"warning","message":{"text":"SourcePrefetch::work (cognitive 29): SourcePrefetch::work has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (3 pts), match/switch 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/perry/src/commands/compile/collect_modules/source_prep.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"be223c0783af7855887699705f01e28b0baa0145da016a3bb1f0d276442839a7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::bootstrap::maybe_init_type_checker (cognitive 29): perry::commands::compile::bootstrap::maybe_init_type_checker has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 6 (11 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/perry/src/commands/compile/bootstrap.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8f726fb617495af01a4dcb8baa981496189d211611c77cfc2f89e6057dd421"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::build_cache::eligibility (cognitive 29): perry::commands::compile::build_cache::eligibility has cognitive complexity 29 (threshold 15). Drivers by points: if/else 25, 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/perry/src/commands/compile/build_cache.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e7c757e89dafdca29ee8eb488ebdc318d8e242ba6cec98ad2bdd9fe2f21c0c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::collect_modules::import_meta_require::rewrite_import_meta_require_addons (cognitive 29): perry::commands::compile::collect_modules::import_meta_require::rewrite_import_meta_require_addons has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (26 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/perry/src/commands/compile/collect_modules/import_meta_require.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"918811705a62dcf3659cb765353eab96fcd36041be18385efa87e7f70956f464"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::native_addon_sidecar::addon_payload_files (cognitive 29): perry::commands::compile::native_addon_sidecar::addon_payload_files has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/native_addon_sidecar.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89f6eecbf868994414f330422d4fa8dce4a3e48d1e3bc613141dc94a0231bdd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::resolve::resolve_exports_with_conditions (cognitive 29): perry::commands::compile::resolve::resolve_exports_with_conditions has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (23 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 19). 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/perry/src/commands/compile/resolve.rs"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f1a66479f885a9e485230b9c8806c89c874228c66224c3c64fda128799e8d9"}},{"ruleId":"D2","level":"warning","message":{"text":"Build::resolve_name (cognitive 29): Build::resolve_name has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 2 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/source_need/flow.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9a24711458ead5492a2c84259388066e413b1005084e689efa11a1bbad4b41"}},{"ruleId":"D2","level":"warning","message":{"text":"LoopFacts::walk_expr (cognitive 29): LoopFacts::walk_expr has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 6, loops 1 (2 pts), match/switch 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/perry-codegen/src/stmt/number_local_loop.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd68f833d1a76e2c89054b7484eee6e57b8eb1b856f3be89fa9da68e279ca94"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::array_methods::lower (cognitive 29): perry_codegen::expr::array_methods::lower has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (26 pts), match/switch 2 (3 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/array_methods.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae2d52e5a0e3f3fdfd17331895104084575a7161d96f2b61f21bf03b541966f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::misc_methods::lower (cognitive 29): perry_codegen::expr::misc_methods::lower has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (20 pts), match/switch 4 (6 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/perry-codegen/src/expr/misc_methods.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd5e2e95d584ebd69cd0705bc38800367e8351732711bb4e0529e5a76eeac7d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::new_builtin_arms::lower_non_class_new (cognitive 29): perry_codegen::lower_call::new_builtin_arms::lower_non_class_new has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 7 (11 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/new_builtin_arms.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c2729de225f615e94bd237750ceed8cb23bdf5c8ca8cc1793258ac1315747f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::element_shape_loop::lower_element_shape_versioned_for (cognitive 29): perry_codegen::stmt::element_shape_loop::lower_element_shape_versioned_for has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 12 (14 pts), if/else 10 (12 pts), boolean chains 3 (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/perry-codegen/src/stmt/element_shape_loop.rs"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae515e217b97ef9efc060e4e7278393e479bb85f4c8e40d1ce7a6d93658390b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stubs::static_shape_seed_ll_with_plan (cognitive 29): perry_codegen::stubs::static_shape_seed_ll_with_plan has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stubs.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbe47ad963a9f8fafe469c997430d3e44e95f8efe06fa122ea74796d852417a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_arkts::set_hidden::rewrite_set_hidden_in_expr (cognitive 29): perry_codegen_arkts::set_hidden::rewrite_set_hidden_in_expr has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 5 (10 pts), match/switch 2 (6 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/perry-codegen-arkts/src/set_hidden.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3f9530f9c31fe74916332e1e8d3bfa49d9e8b3e270d9edbf63fcc331c2134e"}},{"ruleId":"D2","level":"warning","message":{"text":"FuncEmitCtx::try_emit_expr_arrays (cognitive 29): FuncEmitCtx::try_emit_expr_arrays has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/emit/expr/arrays.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc6ede0e73a3767084d08a4b83bc0d7512eeb716ee22f4e754b334bd9db06db"}},{"ruleId":"D2","level":"warning","message":{"text":"Driver::new (cognitive 29): Driver::new has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 4 (8 pts), loops 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/perry-component-io/src/lib.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e050ea50d3091beebfa3adb4e6511f4e811c67eb2a0d68a7859dd95493a3e18"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::response_header_values::set (cognitive 29): perry_ext_http::server::response_header_values::set has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (28 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/perry-ext-http/src/server/response_header_values.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c06e1e972c036c27d4acb3fd244313da084348eedf1de889ac01112448b26cd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::turnloop_serve::conn::decode_step (cognitive 29): perry_ext_http::server::turnloop_serve::conn::decode_step has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 3 (7 pts), boolean chains 5, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-http/src/server/turnloop_serve/conn.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb20b55039af56cd60ab2751cc29f362fb8cf986b670bf2b4460d00656fb15bd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::builder_fold::fold_stmts (cognitive 29): perry_hir::lower::builder_fold::fold_stmts has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 3 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/builder_fold.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8615b8ff5c7fef51dd14e881b6ff71d2308263e85e159dcba9745e0ab2ef16"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::native_module::reflect_statics::try_reflect_statics (cognitive 29): perry_hir::lower::expr_call::native_module::reflect_statics::try_reflect_statics has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (25 pts), match/switch 1 (3 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/perry-hir/src/lower/expr_call/native_module/reflect_statics.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9955fc276a46a999176f535fa839c1fe2ae31b027dc2592ce79ba186d19048"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::nested_namespace::try_dns_promises_namespace (cognitive 29): perry_hir::lower::expr_call::nested_namespace::try_dns_promises_namespace has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (28 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/perry-hir/src/lower/expr_call/nested_namespace.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a27786f51853ce098beb19cdb4e56a83686061e1f03a941d942a33b760b13a8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::lower_expr::assignment::lower_expr_assignment (cognitive 29): perry_hir::lower::lower_expr::assignment::lower_expr_assignment has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (21 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/lower_expr/assignment.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8051f5a68b81561416589ca2f9b200a3c342833270929fc23f2efafec000aaae"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::widget_decl::parse_label_node (cognitive 29): perry_hir::lower::widget_decl::parse_label_node has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (26 pts), loops 1 (3 pts) (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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c3aaed16de3a2a3f509bb4baf5f3a86466d0c69c9476358a3b5004bd4033aa"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::block::rebind_nested_forward_scope_lets (cognitive 29): perry_hir::lower_decl::block::rebind_nested_forward_scope_lets has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 3 (6 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_decl/block.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"996de94ecedf4e1fb666fb6dad7df35a29feca6b866c99973f034c23b6882a3b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::body_stmt::gen_capture_scan::collect_idents_expr (cognitive 29): perry_hir::lower_decl::body_stmt::gen_capture_scan::collect_idents_expr has cognitive complexity 29 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 5 (10 pts), match/switch 2 (4 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_decl/body_stmt/gen_capture_scan.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2bec513eeaae8c4fcaf5053203d38dbe5aa69a64e8edca1bd5c800a96b82669"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::monomorph::update_call_sites::infer_expr_type_from_lookup (cognitive 29): perry_hir::monomorph::update_call_sites::infer_expr_type_from_lookup has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (22 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/monomorph/update_call_sites.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"62867b89d4ff252bb8f3983b328e48c7181f7a416425d6f6153b8d975ee8f0a8"}},{"ruleId":"D2","level":"warning","message":{"text":"ArenaSweepObjectsState::apply_block_skip (cognitive 29): ArenaSweepObjectsState::apply_block_skip has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (19 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/perry-runtime/src/gc/oldgen/sweep_objects.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"906c866e24d856a93e31a790723279f5fd566c9cb2261642248c7f1d0c27df5e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::arena::quarantine::report_stale_address_holders (cognitive 29): perry_runtime::arena::quarantine::report_stale_address_holders has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 4 (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/perry-runtime/src/arena/quarantine.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"8769fd2eb72482ebcfd4f02e7862c2ee723b4d7dc3a5fa99c7d7cdf0f5fabf78"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::immutable::js_array_copy_within_value (cognitive 29): perry_runtime::array::immutable::js_array_copy_within_value has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (25 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/perry-runtime/src/array/immutable.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8722dcb5c60098e3366000e3792c7e548eaf566f12982946dfcd443acb93f77"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::child_process::fork::js_child_process_fork (cognitive 29): perry_runtime::child_process::fork::js_child_process_fork has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 6, loops 3, 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/perry-runtime/src/child_process/fork.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a1968c9126bff8edaa0dea9f7dfdac256502c019a409c8f11bcf4eda7bd3a1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::child_process::registry::js_child_process_spawn_background (cognitive 29): perry_runtime::child_process::registry::js_child_process_spawn_background has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 6 (7 pts), loops 2 (4 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/perry-runtime/src/child_process/registry.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"065e7daa6ac33385fecb112a8f969affa73e81d663e16375295241963369a9cf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::component::http::pump::step (cognitive 29): perry_runtime::component::http::pump::step has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (26 pts), match/switch 2, 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/perry-runtime/src/component/http/pump.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a85046cd4d5cc373ef930886032f6bfa03ea7fe9c25b74be00ec1bbbc9cee3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::eh_walker::parse_unwind_info (cognitive 29): perry_runtime::eh_walker::parse_unwind_info has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 6 (11 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/eh_walker.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e06d30bf628a00ea2806ab83cb7ea2a01e991a09b12c2453da957317b6a8c30"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::exception::print_uncaught (cognitive 29): perry_runtime::exception::print_uncaught has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 3 (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/perry-runtime/src/exception.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05cb65d145ed2fe31df003e70ea70ff7fed35d69141d8116b557958ccede95f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::icu_dtf::format_default_numeric_parts (cognitive 29): perry_runtime::intl::icu_dtf::format_default_numeric_parts has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 2 (4 pts), match/switch 1 (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/perry-runtime/src/intl/icu_dtf.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"190bcda659fd062d0e6fd68844f105d66e39bc3ab45939f3bcc36aa80798c1f8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json_tape::lazy_get_rooted_impl (cognitive 29): perry_runtime::json_tape::lazy_get_rooted_impl has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 8, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/json_tape.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd30fc888a48f514ff7739fa8271a864e71b6c9bbe51e42c5a60fe9dd8892fe"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::module_require::resolve_file (cognitive 29): perry_runtime::module_require::resolve_file has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 3 (4 pts), match/switch 1 (3 pts), boolean chains 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/perry-runtime/src/module_require.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccda765c84a58e8d93a9b455be5e1e6a2d7d30af00e535884f45f419d6ef9d69"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::class_object_props::instance_constructor_value (cognitive 29): perry_runtime::object::field_get_set::class_object_props::instance_constructor_value has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 6, 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/perry-runtime/src/object/field_get_set/class_object_props.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"475c2505d5ab3ce3355dba79a3fcd9d3e95bac4847432964ed5ff3e3a40dcd22"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::object_ops_frozen::js_object_freeze (cognitive 29): perry_runtime::object::object_ops_frozen::js_object_freeze has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 1 (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. This shape REPEATS in the file: one other method here (perry_runtime::object::object_ops_frozen::js_object_seal) 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/perry-runtime/src/object/object_ops_frozen.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"88abe98e732a52bb092b76e9ceba635c9d53867df8b38c28ed73ccf26ab6bd65"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::object_ops_frozen::js_object_seal (cognitive 29): perry_runtime::object::object_ops_frozen::js_object_seal has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 1 (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. This shape REPEATS in the file: one other method here (perry_runtime::object::object_ops_frozen::js_object_freeze) 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/perry-runtime/src/object/object_ops_frozen.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5ad6210c35009de0c3bc53e98d4c29ba3f64b604b3db5fbdc8573fcda67fe9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::perf_hooks::js_perf_measure (cognitive 29): perry_runtime::perf_hooks::js_perf_measure has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (24 pts), match/switch 1 (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/perry-runtime/src/perf_hooks.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"345005efa93b1cde6fc5d8b000a8de4285adf2cb0257d5255eeea7e0279bff9f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::split::js_string_split_n (cognitive 29): perry_runtime::string::split::js_string_split_n has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/string/split.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8a59b9308579114e4a5931aa1c4ebed79e0906cb3145aacb0ccc1c8c65eb88"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::typed_feedback::js_typed_feedback_array_index_get_fallback_boxed (cognitive 29): perry_runtime::typed_feedback::js_typed_feedback_array_index_get_fallback_boxed has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 4, 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/perry-runtime/src/typed_feedback.rs"},"region":{"startLine":2251}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1f4a21c25f05716ec5ce7cbfc0f2f0b4bf96842a6a679da141abfcdfac6da7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::util_parse_args::parse_short_option (cognitive 29): perry_runtime::util_parse_args::parse_short_option has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (26 pts), 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/perry-runtime/src/util_parse_args.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9ccc40953f0102fac188e4a57dfab187263dd34521f2c61c9e507efb1f8cbf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::streams::js_readable_stream_controller_enqueue (cognitive 29): perry_stdlib::streams::js_readable_stream_controller_enqueue has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 3, 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/perry-stdlib/src/streams.rs"},"region":{"startLine":2088}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82eb95b554440e4ed2185d1e0ad16041b391188f4e8abc0ed85a9120a088449"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::tls::build_server_config_from_options (cognitive 29): perry_stdlib::tls::build_server_config_from_options has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 3 (9 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/perry-stdlib/src/tls.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f15beef50c04a137fc697a7bb5a2b509c8b63c1b3b0973c38cfed4e28f7226b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::deforest::walk::max_local_id (cognitive 29): perry_transform::deforest::walk::max_local_id has cognitive complexity 29 (threshold 15). Drivers by points: loops 12 (27 pts), if/else 1 (2 pts) (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/deforest/walk.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f95d73457eae84ecf5e50ceac01b0a171390e5366c476ffff71101d40f263f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::analysis::find_max_local_id_in_module (cognitive 29): perry_transform::inline::analysis::find_max_local_id_in_module has cognitive complexity 29 (threshold 15). Drivers by points: loops 12 (27 pts), if/else 1 (2 pts) (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/inline/analysis.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"5597816fea85cddbd5638cd72d4de2911c5ee4d829c2e2f28e6528b4a1f03be9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_android::Java_com_perry_app_PerryBridge_nativeMain (cognitive 29): perry_ui_android::Java_com_perry_app_PerryBridge_nativeMain has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (28 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/perry-ui-android/src/lib.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24d3dfad89ece0a96deb43d61cdbf5e28108f960def81dd84133d4783de3720"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_android::media_playback::poll_tick (cognitive 29): perry_ui_android::media_playback::poll_tick has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 2, match/switch 1 (2 pts), 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/perry-ui-android/src/media_playback.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9cece8c89e52976f21ccfa48bae78b0c545dc783477decf5fb0edd0c8a4393"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_gtk4::widgets::remove_child (cognitive 29): perry_ui_gtk4::widgets::remove_child has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (29 pts) (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/perry-ui-gtk4/src/widgets/mod.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50e9d0505c85dbfc9eaeca1e79f931a9d59916db3584c8356a21b6e8bfa70d6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_ios::deeplinks::dispatch_scene_connection_options (cognitive 29): perry_ui_ios::deeplinks::dispatch_scene_connection_options has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2 (6 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-ios/src/deeplinks.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"546e02bcad5b4132669fc7e67e678c5c59713a5bfe1e29955cfc7b9c8459769b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::widgets::scrollview::scroll_wnd_proc (cognitive 29): perry_ui_windows::widgets::scrollview::scroll_wnd_proc has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 2, match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-windows/src/widgets/scrollview.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18a33ac64105f0d57fb6f231e619876026855da4f358ee8e89b5a69f1c71c30"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::widen_stand_in (cognitive 29): Gen::widen_stand_in has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (8 pts), boolean chains 7 (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/perry-wpfacts/src/gen/class_values.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fa4620b7f0709b02a65b309e2801086f84aa2c424aeae32ab55c2497d0b12d"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::walk_all (cognitive 29): Gen::walk_all has cognitive complexity 29 (threshold 15). Drivers by points: loops 10 (16 pts), if/else 5 (13 pts) (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/perry-wpfacts/src/gen/walk.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6e17198c85f1fae691b41e8c3d36d6864dda33c1fe994381ac787709535d7f"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::mark_use (cognitive 29): Model::mark_use has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 3 (7 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/perry-wpfacts/src/model/operations.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2450c962d609b752ace64d35183714e407462f9e3896e06e72bacbed3110423"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::arg_readers_add (cognitive 29): Model::arg_readers_add has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 6 (14 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/perry-wpfacts/src/solve/store.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec35ef3d0d9956ec95d61876af13dc00cdf8f9946295055d3ccbf5e4c00034b"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::admit_this (cognitive 29): Model::admit_this has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 5, loops 2 (5 pts), 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/perry-wpfacts/src/solve.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf63e4d40e8d706ad4a8606146ae374314cc5ca7f4061e0ca9a013134e4826a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::lib::contracts::literal_field_fns (cognitive 29): perry_wpfacts::lib::contracts::literal_field_fns has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (6 pts), match/switch 2 (6 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/perry-wpfacts/src/lib/contracts.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"66078f952568f9ac0d70ac1f75feb46e93881022445f7a5a8f3a749408520341"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.loop_carried_blocks (cognitive 29): gc_root_dominance_check.loop_carried_blocks has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 4 (6 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":2138}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a38b7d81cd9e444677b2b575e8932ba7f7dfa5ccb381238dc4f8bc95b1ecad5"}},{"ruleId":"D2","level":"warning","message":{"text":"native_export_collisions.positional_literal_params (cognitive 29): native_export_collisions.positional_literal_params has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (21 pts), boolean chains 4, loops 2 (4 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":"scripts/native_export_collisions.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6f7f78b9c0d085501f17015363739eab6177ec75db1266b62ad53940af9b89"}},{"ruleId":"D2","level":"warning","message":{"text":"node_suite_regression_check.main (cognitive 29): node_suite_regression_check.main has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 5 (8 pts), boolean chains 2, ternaries 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":"scripts/node_suite_regression_check.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb3b10668239ebb1733f0b46cf2e8293d66bfd9ecf9e8797555f6d4e1e39685"}},{"ruleId":"D2","level":"warning","message":{"text":"package_bench_attr.cmd_floor (cognitive 29): package_bench_attr.cmd_floor has cognitive complexity 29 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (7 pts), ternaries 3 (7 pts), boolean chains 6 (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":"scripts/package_bench_attr.py"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bd500d448a5da8f01919e5ae0fae602499cd66d9ca37d20254fc6c10799b0e"}},{"ruleId":"D2","level":"warning","message":{"text":"perf_tscwall_lane.run (cognitive 29): perf_tscwall_lane.run has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (16 pts), ternaries 4 (7 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/perf_tscwall_lane.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3decd9cc837ee07ce5b2071da670b51c8ed2959c7b91a7a9c669a3eb601798"}},{"ruleId":"D2","level":"warning","message":{"text":"realm_manifest_coverage.resolve_cell (cognitive 29): realm_manifest_coverage.resolve_cell has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 2 (3 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":"scripts/realm_manifest_coverage.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fe220c6a8d315fcac2d253fb9641bc14b010fc09ab2e2cb0953ae506aa270c"}},{"ruleId":"D2","level":"warning","message":{"text":"unrooted_local_shape.main (cognitive 29): unrooted_local_shape.main has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 5 (10 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":"scripts/unrooted_local_shape.py"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"923123d9c23876b6027400a20da92c32c00d6109172b2e388f42d07f98babb79"}},{"ruleId":"D2","level":"warning","message":{"text":"wpfacts_recompute.run (cognitive 29): wpfacts_recompute.run has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (20 pts), ternaries 2 (6 pts), loops 3 (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":"scripts/wpfacts_recompute.py"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dda50c53bafc0f188b2f76ded48589cb51e6afd9786752ea21e58fc6a4ec6ff"}},{"ruleId":"D2","level":"warning","message":{"text":"web_runtime._perryCodeToKey (cognitive 29): web_runtime._perryCodeToKey has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 9, match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":1831}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd4e6f91a7f63bc864c9f80f2adda8c3f0eda3ee61ee680edaa938c1f9d3652"}},{"ruleId":"D2","level":"warning","message":{"text":"wasm_runtime.__perryCodeToKey (cognitive 29): wasm_runtime.__perryCodeToKey has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 9, match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":3652}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4dfe509d38ae6022a951dea5cae8b17cb1dd2f778c789fde96d3dd659912c8c"}},{"ruleId":"D2","level":"warning","message":{"text":"wasm_runtime.perry_audio_stop (cognitive 29): wasm_runtime.perry_audio_stop has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (16 pts), error handling 3 (6 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 11). Most of this is not in the body itself: 14 of the 29 points are its own statements and the rest belongs to 2 function items inside it that branch (stopOne, a function literal at line 4454). 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/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4440}}}],"partialFingerprints":{"codehealthFindingId/v1":"966ff4a27c7bc4885e4deac4896931d11529e6688792af75aa61690e0ade93d3"}},{"ruleId":"D2","level":"warning","message":{"text":"binding_pins.checkOffline (cognitive 29): binding_pins.checkOffline has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (21 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":"scripts/binding_pins.mjs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0d5147a38f6618a35be2c88854a532f72a76c25909e150367fb3ce67ddb353"}},{"ruleId":"D2","level":"warning","message":{"text":"node_compat_matrix.checkAgainstBaseline (cognitive 29): node_compat_matrix.checkAgainstBaseline has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 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":"scripts/node_compat_matrix.mjs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f694272a79f598c6d31a59e01aa9c86a76fde82b1799ea71e8384525b72f26"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::link::wasi::link_wasi (cognitive 28): perry::commands::compile::link::wasi::link_wasi has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (24 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/perry/src/commands/compile/link/wasi.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e5e4918942babed7887f9f88b6b596fb7c2838b319e021e143593004fe2b10"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::explain::run (cognitive 28): perry::commands::explain::run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 2 (6 pts), match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/explain.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"810dabed6fe26379776ef5caf4611da36df5562d38e05aa6c9d3328c464ffef3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::static_prototype::accessor_owner (cognitive 28): perry_codegen::codegen::static_prototype::accessor_owner has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (24 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/perry-codegen/src/codegen/static_prototype.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"676fdbb4e9d6114a83f1f7678f12f67825f372f47c7851b13dbd20f7a3296977"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::expr_value_type (cognitive 28): perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::expr_value_type has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 5 (9 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. This shape REPEATS in the file: 5 other methods here (perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals, perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::collect_expr_writes_in_closure_stmts, perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::collect_direct_let_ids, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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/perry-codegen/src/collectors/pointer_locals.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24349b61c2eaa8d666ad34042bd3444c9f2ceac42323a3228768a4c81d3acb9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::walk (cognitive 28): perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::walk has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 5 other methods here (perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals, perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::expr_value_type, perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::collect_expr_writes_in_closure_stmts, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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/perry-codegen/src/collectors/pointer_locals.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"533517056563e23c669fae144e3dc52f291a2ec648f8d467c46dda6a1d15595e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::segview::classify_segment_uses_in_expr (cognitive 28): perry_codegen::collectors::segview::classify_segment_uses_in_expr has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (6 pts), boolean chains 4, match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/segview.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"9613351bb46f4a8a2588fd0ebe867392b1748b74137eae79ead224f9aac1c310"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::dialect::types::constant (cognitive 28): perry_codegen::dialect::types::constant has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 6 (10 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/perry-codegen/src/dialect/types.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed2425f3dec9df13ceadc5710f83ea78123ae305a93deff505e2029de22d729"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::call_spread_short::try_lower (cognitive 28): perry_codegen::expr::call_spread_short::try_lower has cognitive complexity 28 (threshold 15). Drivers by points: loops 9 (16 pts), if/else 8 (12 pts) (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/perry-codegen/src/expr/call_spread_short.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"5727637321e1259d1e9a9d74fc2b95a0155e462854d20e98032ed70d8d9f1159"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::literals_vars::typeof_compile_time_answer (cognitive 28): perry_codegen::expr::literals_vars::typeof_compile_time_answer has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 7, match/switch 2 (5 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/literals_vars.rs"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"5569b26a68f7ed6c60769a078ca2b203409e1f0ceed39b3a460b34d40eee6ad6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::object_literal::lower_object_literal (cognitive 28): perry_codegen::expr::object_literal::lower_object_literal has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 5 (11 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/perry-codegen/src/expr/object_literal.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbaca2366022314163afdca9415005355560324487b80b06337ef289d6d837f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::unary::lower (cognitive 28): perry_codegen::expr::unary::lower has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/unary.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"624a3af428cb0a99581529814e9f61a59aaabe515d21ad6520ded5bb2d18389c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::linker::find_clang (cognitive 28): perry_codegen::linker::find_clang has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 5, 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/perry-codegen/src/linker.rs"},"region":{"startLine":1794}}}],"partialFingerprints":{"codehealthFindingId/v1":"069cf6541825be957be9108c3eb5d82ff1ce018f8098152ac4ceb744d60a0271"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::buffer_intrinsic::module_shadows_buffer_read_method (cognitive 28): perry_codegen::lower_call::buffer_intrinsic::module_shadows_buffer_read_method has cognitive complexity 28 (threshold 15). Drivers by points: if/else 20 (40 pts), loops 18 (37 pts), match/switch 2 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (perry_codegen::lower_call::buffer_intrinsic::module_shadows_buffer_read_method::stmt_shadows) 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/perry-codegen/src/lower_call/buffer_intrinsic.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a5466cef91e8019f78a72896c39247198d87c0f0247936e7569c0958c9e12a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::capture_writeback::emit_class_capture_writeback (cognitive 28): perry_codegen::lower_call::capture_writeback::emit_class_capture_writeback has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (25 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/perry-codegen/src/lower_call/capture_writeback.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2eda40f4e270269f2f39f41b82a3fea564a1cf660ec2cd7f5e6a0bc81a7a79"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::console_promise::try_lower_native_method_str_dispatch (cognitive 28): perry_codegen::lower_call::console_promise::try_lower_native_method_str_dispatch has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (22 pts), boolean chains 6 (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/perry-codegen/src/lower_call/console_promise.rs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"d001939fae132ebdaf4c4afb2ac9a9721f4e750a5ef777ef4ccdeaf6e54bcd4b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::native_module_dispatch::lower_native_module_dispatch (cognitive 28): perry_codegen::lower_call::native_module_dispatch::lower_native_module_dispatch has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 6 (8 pts), match/switch 5 (8 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/perry-codegen/src/lower_call/native_module_dispatch.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c997aa3c414c7311b0d02f0d0949a4157e9604fbe85560e9701b2d1785fe6a68"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::new_alloc::constructor_added_key_count_in (cognitive 28): perry_codegen::lower_call::new_alloc::constructor_added_key_count_in has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 4 (7 pts), loops 3, boolean chains 1 (nesting depth added 12). Most of this is not in the body itself: 8 of the 28 points are its own statements and the rest belongs to 2 function items inside it that branch (visit_stmts, visit_expr). 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/perry-codegen/src/lower_call/new_alloc.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"5954f21dc09f4466fdc449446e6fc9de1c8e070ebd3773bc02ad1ab85268b313"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_conditional::lower_test (cognitive 28): perry_codegen::lower_conditional::lower_test has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (26 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/perry-codegen/src/lower_conditional.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07cade67dc4ea7f5dcd423f7648ffbd57a92abe112b20bb9f960cf544994682"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_conditional_array_record::abrupt_args (cognitive 28): perry_codegen::lower_conditional_array_record::abrupt_args has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 5, match/switch 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_conditional_array_record.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"961f2fb9853963efe9b4cb627f21c30a35b495a2642d18aa362c74def608d523"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_wasm::emit::closures::collect_closures_from_expr (cognitive 28): perry_codegen_wasm::emit::closures::collect_closures_from_expr has cognitive complexity 28 (threshold 15). Drivers by points: loops 8 (16 pts), if/else 5 (11 pts), match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/emit/closures.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"9705cc566eef7bd319ebeb37465d6b33a5c7bc5518a32b4b311224d3fe68de7f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_wasm::emit::scoped_js::scoped_js_names::visit (cognitive 28): perry_codegen_wasm::emit::scoped_js::scoped_js_names::visit has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/emit/scoped_js.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3632eb67643b5080331535427c24dc2f4b4dfa5507fd45a2f7af31272e1e494"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_better_sqlite3::js_sqlite_stmt_run (cognitive 28): perry_ext_better_sqlite3::js_sqlite_stmt_run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 1 (6 pts) (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/perry-ext-better-sqlite3/src/lib.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"8779bdc94bfe52ecbad005b57db91f9b987359f16baeba9e0436a6d9461d4411"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_better_sqlite3::js_sqlite_pragma (cognitive 28): perry_ext_better_sqlite3::js_sqlite_pragma has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (28 pts) (nesting depth added 17). 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/perry-ext-better-sqlite3/src/lib.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed1dc786b06cd3578b14955194a475b9a0fc4273cc3ecf1c036038b3e38bfd2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::validation::validate_client_options (cognitive 28): perry_ext_http::validation::validate_client_options has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 3, loops 1 (2 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/perry-ext-http/src/validation.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"01734008048298e8dc7fd723995b61df2c6fa457039021c67549e5b19ec1e659"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::js_transform::local_natives::scan_stmt_for_native_instances (cognitive 28): perry_hir::js_transform::local_natives::scan_stmt_for_native_instances has cognitive complexity 28 (threshold 15). Drivers by points: loops 7 (17 pts), if/else 5 (10 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c33aabb7794461353be30d670363eed9f46caaad0a55c2d08330f16201dc1e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::native_module::buffer_statics::try_buffer_uint8array_statics (cognitive 28): perry_hir::lower::expr_call::native_module::buffer_statics::try_buffer_uint8array_statics has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 2 (6 pts), boolean chains 3 (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/perry-hir/src/lower/expr_call/native_module/buffer_statics.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0fe3db06001556e83ce6d799fc90023db22f32886790872a4b503f6a85fefaf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_new::helpers::lower_text_decoder_new (cognitive 28): perry_hir::lower::expr_new::helpers::lower_text_decoder_new has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 3 (13 pts), if/else 4 (12 pts), loops 1 (3 pts) (nesting depth added 20). 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/perry-hir/src/lower/expr_new/helpers.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"102251b0bb66c24452516cddb734546d51d9c58474ce0915eae34c2e8cd4adbd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::shared_mutable_capture::demote_redeclarations_stmt (cognitive 28): perry_hir::lower::shared_mutable_capture::demote_redeclarations_stmt has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/shared_mutable_capture.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8255b2d03fa355bbe88b55e1485411d0d77aa8487bd026576a76c1e06178c9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::widget_decl::parse_text_content (cognitive 28): perry_hir::lower::widget_decl::parse_text_content has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (19 pts), match/switch 3 (7 pts), loops 1 (2 pts) (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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfc2f3c500710741e0196012e45786889ed3c4e6c8ec6a33feb9738f2588a2b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::block::var_names::collect_var_binding_names_from_stmt (cognitive 28): perry_hir::lower_decl::block::var_names::collect_var_binding_names_from_stmt has cognitive complexity 28 (threshold 15). Drivers by points: loops 6 (15 pts), if/else 6 (12 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_decl/block/var_names.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ba4c76b3845d4b7a3530d02c94800b44e51e1e23a2459b7659a4eb2ad0efcd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::enum_decl::eval_enum_init (cognitive 28): perry_hir::lower_decl::enum_decl::eval_enum_init has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 7 (15 pts), if/else 6 (10 pts), boolean chains 3 (nesting depth added 12). 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/perry-hir/src/lower_decl/enum_decl.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42c5977d2e9c51214f27c231cffa4fecf34aa305835120a1eb39225878e8523"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_patterns::predeclare_implicit_assignment_targets (cognitive 28): perry_hir::lower_patterns::predeclare_implicit_assignment_targets has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (24 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/perry-hir/src/lower_patterns.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7802a6ab50ea46474b40e9bf47bd6cb0d6a8fff25146806bc9f5c52d6e8ef9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::monomorph::infer::infer_type_args (cognitive 28): perry_hir::monomorph::infer::infer_type_args has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 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: one other method here (perry_hir::monomorph::infer::infer_type_args_for_class) 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/perry-hir/src/monomorph/infer.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7db6d08d6920f132c00ea4e5ba07c30ea38aaa15a8c3bc3c682083038879050"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::monomorph::infer::infer_type_args_for_class (cognitive 28): perry_hir::monomorph::infer::infer_type_args_for_class has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 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: one other method here (perry_hir::monomorph::infer::infer_type_args) 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/perry-hir/src/monomorph/infer.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb39ed0c22e2fb50658bc0ce5223f5b417379f100c0ccd1a3f0a2abe742d1da"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::monomorph::update_call_sites::infer_type_args_from_lookup (cognitive 28): perry_hir::monomorph::update_call_sites::infer_type_args_from_lookup has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 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: one other method here (perry_hir::monomorph::update_call_sites::infer_type_args_for_class_from_lookup) 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/perry-hir/src/monomorph/update_call_sites.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"382c27b07e7d150c4314f135aadd1e9105b3cac7edd993904f116823fd615bf1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::monomorph::update_call_sites::infer_type_args_for_class_from_lookup (cognitive 28): perry_hir::monomorph::update_call_sites::infer_type_args_for_class_from_lookup has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 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: one other method here (perry_hir::monomorph::update_call_sites::infer_type_args_from_lookup) 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/perry-hir/src/monomorph/update_call_sites.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"91fb151959bc0f040d22a8080ea59fc6e67ee5e1a69ce40ed1ac8ca0d9bd5049"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_parser::normalize_swc_class_syntax_with_metadata (cognitive 28): perry_parser::normalize_swc_class_syntax_with_metadata has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 8, loops 5 (7 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/perry-parser/src/lib.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3c077307bdc22691908de2795f4a2b455df3b13035751b1c7ea286e289affa"}},{"ruleId":"D2","level":"warning","message":{"text":"RootScanCycleState::step_current_subphase (cognitive 28): RootScanCycleState::step_current_subphase has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/gc/cycle.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"917d879b50578f26a35dcdc1638c652a895c16ad2ccf3449cc6abeff5f833884"}},{"ruleId":"D2","level":"warning","message":{"text":"GcCycleState::step_sweep (cognitive 28): GcCycleState::step_sweep has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 4, loops 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/perry-runtime/src/gc/cycle.rs"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"faabfd44e00d630307ca5b9d0ba13b5906b24622ce63d40d59b0fbcb8081bb40"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::arena::page_meta::flush_deferred_old_page_registrations_batch (cognitive 28): perry_runtime::arena::page_meta::flush_deferred_old_page_registrations_batch has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (24 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/perry-runtime/src/arena/page_meta/mod.rs"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"1211c0c2c962db6c67d6479edf83dbaabfd6db205be7ad8ee7cbaaa87a8a2b3d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::bun_compat::string_width::is_zero_width (cognitive 28): perry_runtime::bun_compat::string_width::is_zero_width has cognitive complexity 28 (threshold 15). Drivers by points: if/else 23 (24 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/perry-runtime/src/bun_compat/string_width.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"348c72abd7f48600eb28a1b02acda11c74566a772e9e5b39da4934a602c7eb2b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::component::cleanup::drain (cognitive 28): perry_runtime::component::cleanup::drain 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/perry-runtime/src/component/cleanup.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d231b475b9e773fc4e696ba77ee2ed9cdd5f867bcbb023ead00a54ab259aab"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::parent_static::js_register_class_computed_method (cognitive 28): perry_runtime::object::class_registry::parent_static::js_register_class_computed_method has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 4, 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/perry-runtime/src/object/class_registry/parent_static.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"174254a859366d20d6173c7eb94b4b3092d019e37145f9503310d8d4b2ce5cc8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::prototype_objects::proto_chain_symbol_slot_inner (cognitive 28): perry_runtime::object::class_registry::prototype_objects::proto_chain_symbol_slot_inner has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (23 pts), boolean chains 2, match/switch 1 (2 pts), 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/perry-runtime/src/object/class_registry/prototype_objects.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3cfd527ad97561192f223cf79a2955c624654a78594eea32a99213dcd6e603"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::accessors::ordinary_object_prototype_property_value (cognitive 28): perry_runtime::object::field_get_set::accessors::ordinary_object_prototype_property_value has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (26 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/perry-runtime/src/object/field_get_set/accessors.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f9c0f8196176e9397f95be301a6bfc799060c52273bd20ef5770ff1c0302cc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_probe::probe_accessor_word (cognitive 28): perry_runtime::object::layout_probe::probe_accessor_word has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 4 (10 pts), boolean chains 4, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/layout_probe.rs"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45cceb802b8d0cc4f8ef80e78c55f2298ed31c63a9737fd63455762eb309b1e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_call_method::object_proto::js_object_default_to_locale_string (cognitive 28): perry_runtime::object::native_call_method::object_proto::js_object_default_to_locale_string has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (25 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/perry-runtime/src/object/native_call_method/object_proto.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a9bd9d806180726558a116ee2fcc564d1c5fac4824436dfc8209cbded0482b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_module_dispatch::dispatch_a_c::nm_dispatch_buffer (cognitive 28): perry_runtime::object::native_module_dispatch::dispatch_a_c::nm_dispatch_buffer has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 3, 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/perry-runtime/src/object/native_module_dispatch/dispatch_a_c.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4aaf6eaa9a5c2d5fd84736a76de77e70814782c2459e0e49640ed9c5781eb50"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::object_ops::define_properties::js_object_define_properties (cognitive 28): perry_runtime::object::object_ops::define_properties::js_object_define_properties has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (19 pts), match/switch 2 (5 pts), 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/perry-runtime/src/object/object_ops/define_properties.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7497f6ababc11b1921e8acf51d3b066d615abcd405d70f6fbb04881845f8b91"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::shapes_integrity::transition_object_integrity (cognitive 28): perry_runtime::object::shapes_integrity::transition_object_integrity has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 5 (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/perry-runtime/src/object/shapes_integrity.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee166203ffa1f1794f65d2e94a1ceaf6f2113c8c65a5a9c447c68ada18966dcf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::os::js_os_cpus::host_cpu_infos (cognitive 28): perry_runtime::os::js_os_cpus::host_cpu_infos has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 4 (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/perry-runtime/src/os.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e30f7acb8b1887722fee53d8276d2de377f44b72be9600a281dbdea144c7f9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::perf_histogram::histogram_method (cognitive 28): perry_runtime::perf_histogram::histogram_method has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 4, 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/perry-runtime/src/perf_histogram.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"1079e0f20e62ce56abbbb7d8891088614f37d29643d1e7466ef5a7d3bce88843"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::regex::perex_replace::string (cognitive 28): perry_runtime::regex::perex_replace::string has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 2 (5 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/perry-runtime/src/regex/perex_replace.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf241580612524294dc0aa249f86e0fed6b08fd02a9060ee3e0dd43af764a5d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::turnloop_proc::translate (cognitive 28): perry_runtime::turnloop_proc::translate has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 4 (6 pts), boolean chains 2 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/turnloop_proc/mod.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"23995e5a87ba27fcc5604b995fc1fc987f8a7c6dd159125aea40a34ca29a9a3e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::sqlite::better::js_sqlite_stmt_get (cognitive 28): perry_stdlib::sqlite::better::js_sqlite_stmt_get has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (11 pts) (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/perry-stdlib/src/sqlite/better.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2442f365d4e1e47d1560a9ba3fa179b0a0488df41c9bea03b13c08879ce7ac"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::streams::transform::perform_transform_close (cognitive 28): perry_stdlib::streams::transform::perform_transform_close has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 3 (7 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/perry-stdlib/src/streams/transform.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc770f4945e4c41759534e4a3d20309bec6994fcc86ddb9660fc2e9a455f751"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::string_decoder::dispatch_string_decoder (cognitive 28): perry_stdlib::string_decoder::dispatch_string_decoder has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 9 (18 pts), if/else 6 (10 pts) (nesting depth added 13). 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/perry-stdlib/src/string_decoder.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51e35d134da5dc2633822fdda1ddd5131ebabc5602944cb97d8a2aa913bf953"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::id_scan::compute_max_local_id (cognitive 28): perry_transform::generator::id_scan::compute_max_local_id has cognitive complexity 28 (threshold 15). Drivers by points: loops 10 (16 pts), if/else 5 (12 pts) (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/perry-transform/src/generator/id_scan.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c9f14745767926c784442537bc0027b5ca10b95099f9f57cdabb1d59a859e4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_gtk4::app::get_app_icon (cognitive 28): perry_ui_gtk4::app::get_app_icon has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 1 (3 pts) (nesting depth added 19). 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/perry-ui-gtk4/src/app.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf5c9a70436f41f5b81c0687ded61f8045e2081da691f8aad5fd1807e6acb3c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_ios::ffi::camera::perry_system_preferences_get (cognitive 28): perry_ui_ios::ffi::camera::perry_system_preferences_get has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (28 pts) (nesting depth added 17). 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/perry-ui-ios/src/ffi/camera.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"210364fcf597ce0b9cabecdd989304dd2af4108031eb5892d4ab198bec9c0ca8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_ios::widgets::button::set_image (cognitive 28): perry_ui_ios::widgets::button::set_image has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 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/perry-ui-ios/src/widgets/button.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbfa3e43006e741d499483629570246a9355d505f1f34a86a8c8ab3c3b1a425"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_visionos::ffi_system::perry_system_preferences_get (cognitive 28): perry_ui_visionos::ffi_system::perry_system_preferences_get has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (28 pts) (nesting depth added 17). 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/perry-ui-visionos/src/ffi_system.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb18146f7d8de83877f8255f1232600d5b0afc831090194d61f1c6edc64193b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_watchos::system::perry_system_preferences_get (cognitive 28): perry_ui_watchos::system::perry_system_preferences_get has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (28 pts) (nesting depth added 17). 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/perry-ui-watchos/src/system.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fcdcb7162a600be5dd898a9942a26538aec4b6bd8cdd6433e179307250bfd60"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::bindings::collect (cognitive 28): perry_wpfacts::bindings::collect has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 6 (8 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 13). Of this number, 25 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":"crates/perry-wpfacts/src/bindings.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7569d67d7114a87dfd932aa60a6c1ad078a4b29d44af380f6733a9010fe58b"}},{"ruleId":"D2","level":"warning","message":{"text":"primary-mainad0-v79-auto.build_arm (cognitive 28): primary-mainad0-v79-auto.build_arm has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (7 pts), boolean chains 6, 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":"docs/audits/gc-rss-instructions-2026-10-03/primary-mainad0-v79-auto.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b30a92499399b7dd6959438ffee2800204b9074b6789af075c08d3a8d627128"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_rekeyed_key_tables.check (cognitive 28): gc_rekeyed_key_tables.check has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gc_rekeyed_key_tables.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"982eb859156c04e672b1d8bf5dc9376442a196b98c50ea54b662418112c68d3b"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_store_site_inventory.check_codegen_claims (cognitive 28): gc_store_site_inventory.check_codegen_claims has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 6 (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":"scripts/gc_store_site_inventory.py"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87e84fb4d8892d73b59eca3bdbc290413bccbae17b22babf4781593eb740d86"}},{"ruleId":"D2","level":"warning","message":{"text":"package_bench.lock_acquire (cognitive 28): package_bench.lock_acquire has cognitive complexity 28 (threshold 15). Drivers by points: error handling 4 (13 pts), if/else 4 (12 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":"scripts/package_bench.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1542a2bdbeffc2f35ee467603cee8d108e575a9be7ddab30b62a5dd67ce6bf"}},{"ruleId":"D2","level":"warning","message":{"text":"raw_handle_debt.main (cognitive 28): raw_handle_debt.main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 3 (6 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/raw_handle_debt.py"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce7b8d70e610b87d7725739013d9cb755ff0a92a48fd86bd0e0f54773a1305b"}},{"ruleId":"D2","level":"warning","message":{"text":"report_gc_ratchet.report (cognitive 28): report_gc_ratchet.report has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 6, ternaries 3, error handling 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, 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":"scripts/report_gc_ratchet.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b118b83910988892d99c8263c4a3df0fe1ce0aeea742cf99492981dc112a5cd"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime_abi_check.expand_macros (cognitive 28): runtime_abi_check.expand_macros has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (10 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/runtime_abi_check.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab21f8225daf9c41cb2d25265a80de55901e0044e8232a59eb81aeb396c67c83"}},{"ruleId":"D2","level":"warning","message":{"text":"tokio_inventory.main (cognitive 28): tokio_inventory.main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 4 (10 pts), boolean chains 4, ternaries 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":"scripts/tokio_inventory.py"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"b539fe19085905e10ef4c938dc046860ce5a55cb7aa81a6ed92b0a202d3ba98c"}},{"ruleId":"D2","level":"warning","message":{"text":"unrooted_local_shape.scan_function (cognitive 28): unrooted_local_shape.scan_function has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (6 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/unrooted_local_shape.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a2532bf864a545d84c20055ed2180d79567d2e766f9c4a717b5e720cd92f45"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::check::scan_imports_for_stubs (cognitive 27): perry::commands::check::scan_imports_for_stubs has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 3 (9 pts), loops 3 (6 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/perry/src/commands/check.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71fe6d16a7cb945e0bc2f1d73a956daf0596e2f9f827b80c9068d0f1ba4386f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::wrap::wrap_commonjs_with_addon_paths::require_site_in_try (cognitive 27): perry::commands::compile::cjs_wrap::wrap::wrap_commonjs_with_addon_paths::require_site_in_try has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (8 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (perry::commands::compile::cjs_wrap::wrap::wrap_commonjs_with_addon_paths) 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/perry/src/commands/compile/cjs_wrap/wrap.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"41085756e011e4eec3e1ef1f4add7aced6b5cb6aac76298d5fdf4bc771432ffc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::collect_modules::dynamic_glob::expand_dynamic_import_glob (cognitive 27): perry::commands::compile::collect_modules::dynamic_glob::expand_dynamic_import_glob has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 2 (3 pts), boolean chains 2, match/switch 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/perry/src/commands/compile/collect_modules/dynamic_glob.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a65e6ced4035cede637479b5ef10c7d65dff5a44f6bab1011c4e0495219359"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::resolve::resolve_package_source_entry (cognitive 27): perry::commands::compile::resolve::resolve_package_source_entry has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 2 (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/perry/src/commands/compile/resolve.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3064d1458832cbe8e072e7dc961c174ad7f778446facba0fd1519d78777e7fd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::runtime_compat::scan_stamp (cognitive 27): perry::commands::compile::runtime_compat::scan_stamp has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 2 (3 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/perry/src/commands/compile/runtime_compat.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"6008043c2908ed1731215214ffcb2c09f220ad6c9edbb7131ca26616a5690a3d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::targets::compile_for_wasm (cognitive 27): perry::commands::compile::targets::compile_for_wasm has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 4 (6 pts), match/switch 2, boolean chains 1 (nesting depth added 8). Of this number, 22 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":"crates/perry/src/commands/compile/targets.rs"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e20aac2922db564c70e6daa9320d4040be46d1a0dc9ea4f297ecc790b8319c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::i18n::run_extract (cognitive 27): perry::commands::i18n::run_extract has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 3 (4 pts), match/switch 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/perry/src/commands/i18n.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7f11c74c4e5331a6781c45c96b4313e77b7dbd868f1c7778528a478fd345ad"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::publish::credentials::auto_export_p12_from_keychain (cognitive 27): perry::commands::publish::credentials::auto_export_p12_from_keychain has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 2, 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/perry/src/commands/publish/credentials.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"0380df62f159bf6d4d8d06e2c54fd25f692cb317acddb23f323580cacd16173d"}},{"ruleId":"D2","level":"warning","message":{"text":"Build::named (cognitive 27): Build::named has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (4 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/reach_report.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"9984eee8e6d7fcf5410e600cc58d2c53868a220c85c13f16671c5212da7dd344"}},{"ruleId":"D2","level":"warning","message":{"text":"Scan::walk_stmt (cognitive 27): Scan::walk_stmt has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 1 (2 pts), match/switch 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/perry-codegen/src/collectors/sealed_buffers.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"d774671123f48bca5e7dc57de3d5b9320bfb564bffe73bda6791c32a1cc92bb0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::boxed_vars::collect_compiler_private_async_control_locals_in_stmts_inner (cognitive 27): perry_codegen::boxed_vars::collect_compiler_private_async_control_locals_in_stmts_inner has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"d600dda06f0009d1e648dc17297e61160e9f40b60b221eb74b98c1d40b1ff02b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::helpers::target_os_of (cognitive 27): perry_codegen::codegen::helpers::target_os_of has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 9, match/switch 1 (3 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, 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/perry-codegen/src/codegen/helpers.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf69785853a36fcb92412e4a957751a1f98f9fb46d1117d37b1ac9c1f29540bc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::inherited_accessors::register (cognitive 27): perry_codegen::codegen::inherited_accessors::register has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/inherited_accessors.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce39f4764a90db1a32155668d2fa7c91dcc2e9497c25d9ffecb1ccb94410c943"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::static_fields::collect_inline_invoked_static_blocks (cognitive 27): perry_codegen::codegen::static_fields::collect_inline_invoked_static_blocks has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 5 (8 pts), match/switch 1 (nesting depth added 10). Most of this is not in the body itself: 4 of the 27 points are its own statements and the rest belongs to 2 function items inside it that branch (walk_stmt, walk_expr). 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/perry-codegen/src/codegen/static_fields.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3732ce87345604bc29d3ffbcb706c980d460f2f3b066efdf284fb4b64da84f4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::hir_facts::collect_owned_buffer_lets (cognitive 27): perry_codegen::collectors::hir_facts::collect_owned_buffer_lets has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (19 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/perry-codegen/src/collectors/hir_facts.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"4966b25842d2f43ab7612718c89f7b7c2053624e684233bbd974d1ef3d53f16a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::i32_locals::walk_writes_for_strict (cognitive 27): perry_codegen::collectors::i32_locals::walk_writes_for_strict has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (4 pts), 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/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"888c451e9e43f292ad11d6a0c48517caa9a32f0ddf4da565764b15e1313aa5fd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::index_uses::walk_index_uses_in_expr (cognitive 27): perry_codegen::collectors::index_uses::walk_index_uses_in_expr has cognitive complexity 27 (threshold 15). Drivers by points: loops 9 (18 pts), match/switch 3 (7 pts), if/else 1 (2 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/index_uses.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbb2f28543f6751198462224700df4fabe8a4d39a066836fb4a9f2b7d0b0c3d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::collect_expr_writes_in_closure_stmts (cognitive 27): perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::collect_expr_writes_in_closure_stmts has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (4 pts), 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. This shape REPEATS in the file: 5 other methods here (perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals, perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::expr_value_type, perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::collect_direct_let_ids, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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/perry-codegen/src/collectors/pointer_locals.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"9491628c74f2a07d508b54f751f13594bd6388ee04a4f96b5caff895b546a95f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::proven_this::method_proven_this_impl (cognitive 27): perry_codegen::collectors::proven_this::method_proven_this_impl has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 10, 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":"crates/perry-codegen/src/collectors/proven_this.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7c95e4380eff102de4033f3a936424909b996e16d96119b0d86493d6405bfa"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::range_facts::bounds_for_buffer_access_width (cognitive 27): perry_codegen::expr::range_facts::bounds_for_buffer_access_width has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 4 (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/perry-codegen/src/expr/range_facts.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"4926b8401bf7fb1da44ac6132903dd908233dc5c96eb5be8804bd94be872ca7d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::inprocess::optimize_emit::optimize_and_emit (cognitive 27): perry_codegen::inprocess::optimize_emit::optimize_and_emit has cognitive complexity 27 (threshold 15). Drivers by points: if/else 19 (24 pts), match/switch 2, 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/perry-codegen/src/inprocess/optimize_emit.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8a3da1e75079af4386a3d2f5738f9745c9e6d6c54b7b8bca8ea0a08effa3a7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_families::variant_slots (cognitive 27): perry_codegen::layout_families::variant_slots has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/layout_families.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c086e76ebba303655b23249685454fbbf1e75d28a699c9affb2ae449a62c93"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::native_value::verify::layout::valid_native_abi_transition (cognitive 27): perry_codegen::native_value::verify::layout::valid_native_abi_transition has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 19, if/else 4 (5 pts), match/switch 2 (3 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/perry-codegen/src/native_value/verify/layout.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"0337f220f10458bd1bae8846555530a4d0a40981863d49f36ee2e31a8190c977"}},{"ruleId":"D2","level":"warning","message":{"text":"JsEmitter::emit_module (cognitive 27): JsEmitter::emit_module has cognitive complexity 27 (threshold 15). Drivers by points: loops 14 (16 pts), if/else 6 (10 pts), boolean chains 1 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/emit/mod.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"5936e5d5d6de4b4bd3c50852919f74e0385fc46ed43a8e8e8531da61895e1df1"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkloadGraphEngine::run (cognitive 27): WorkloadGraphEngine::run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (7 pts), match/switch 2 (5 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/perry-container-compose/src/workload.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d5c4e16109b4c74aacc3c713212fe8b511e801eab1cdfc25d9cfb1fe062f6c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::http2_server::dispatch::js_ext_http2_session_dispatch_method (cognitive 27): perry_ext_http::server::http2_server::dispatch::js_ext_http2_session_dispatch_method has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 1, match/switch 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/perry-ext-http/src/server/http2_server/dispatch.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4888040e73d9bf166199409a085c0124853127d0cba568b0aeca7f970a0f30a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::turnloop_h2::conn::pump (cognitive 27): perry_ext_http::server::turnloop_h2::conn::pump has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 3 (4 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/perry-ext-http/src/server/turnloop_h2/conn.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a91085cc6d699f6826a235ac50ba86f1fd9009eeb3607e9016cd4924807f38"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_gc_effects::instructions::flow (cognitive 27): perry_gc_effects::instructions::flow has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 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/perry-gc-effects/src/instructions.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53842aed11a510b3346053da2572b63e18177971b81d752fe4f307dc978dc2a"}},{"ruleId":"D2","level":"warning","message":{"text":"SolidJsx::element (cognitive 27): SolidJsx::element has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 2 (5 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/perry-hir/src/solid_jsx.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f5b72ee69c90eea61df225a1ef6e5ae9aeb7332be0f4f5fb9a6323c8a540d2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::js_transform::cross_module_natives::scan_expr_for_closure_returns (cognitive 27): perry_hir::js_transform::cross_module_natives::scan_expr_for_closure_returns has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 5 (10 pts), match/switch 3 (6 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/js_transform/cross_module_natives.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"915580d25b40af2ad23845898c9d90a09a4e6d2cd309a387ab1ca1734ccbf72f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::builder_fold_width_hints::hint_walk_expr (cognitive 27): perry_hir::lower::builder_fold_width_hints::hint_walk_expr has cognitive complexity 27 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 4 (11 pts), match/switch 2 (3 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/builder_fold_width_hints.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0517d46f3ee465c3987cd4b0db77db92d5e2da74c4daf6e5833997f2b1b38f7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::dynamic_eval::lower (cognitive 27): perry_hir::lower::dynamic_eval::lower has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 5, loops 4, match/switch 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/perry-hir/src/lower/dynamic_eval.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39ce9f61973458d52b0bf6376e8006d5335aa67838c25b05d15dcf55dbc1b77"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_assign::lower_ident_assignment (cognitive 27): perry_hir::lower::expr_assign::lower_ident_assignment has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 5 (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/perry-hir/src/lower/expr_assign.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea1771670213e2533362895e49493208977ae29b4822bc33bb2b76b422ebed0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::intrinsics::bare_builtins::try_bare_regexp_call (cognitive 27): perry_hir::lower::expr_call::intrinsics::bare_builtins::try_bare_regexp_call has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 1 (3 pts), boolean chains 2 (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/perry-hir/src/lower/expr_call/intrinsics/bare_builtins.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2fb2ba54f5f8224702a30e568b56031a1a6f955332904acb7f75c482f34438"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::intrinsics::eval_strict::check_eval_function_call (cognitive 27): perry_hir::lower::expr_call::intrinsics::eval_strict::check_eval_function_call has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 5 (8 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/intrinsics/eval_strict.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20b8c79aa0379b8cb8fe7bde93665ca02f8d3de29b02fd373f8716aa4429d9f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::post_args_dispatch::try_object_static_alias_call (cognitive 27): perry_hir::lower::expr_call::post_args_dispatch::try_object_static_alias_call has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (27 pts) (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/perry-hir/src/lower/expr_call/post_args_dispatch.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac335348638a15a21f9c4d4921e2e981d46d7d853c26b5e51591d9381e88ec55"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::widget_decl::try_parse_widget_format_expr (cognitive 27): perry_hir::lower::widget_decl::try_parse_widget_format_expr has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 10 (21 pts), if/else 2 (5 pts), boolean chains 1 (nesting depth added 14). 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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1ab44b1f202523d0153e193a2f92484df61728305bc9453fadf0dee1718b9a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::class_validation::validate_class_element_early_errors (cognitive 27): perry_hir::lower_decl::class_validation::validate_class_element_early_errors has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (20 pts), boolean chains 4, match/switch 1 (2 pts), 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/perry-hir/src/lower_decl/class_validation.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e42af1f38e7ce7941f80f4c449fe7c651e4c602b0cdcb78075bedddd3e0bf16"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::type_alias_resolve::fix_stmts (cognitive 27): perry_hir::type_alias_resolve::fix_stmts has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (4 pts), 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/perry-hir/src/type_alias_resolve.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2b7f64b0d65161139194d71efba235573555e2a40a725b2a634340c71511c0"}},{"ruleId":"D2","level":"warning","message":{"text":"SlotIter::next (cognitive 27): SlotIter::next has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (22 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/gc/roots/stack_maps_lazy.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a921bd0ee272a2edf9655f01afc8b9d0e438d9c6f9e53bc3d1b3e14b09f23ac4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::indexing::array_spec_set (cognitive 27): perry_runtime::array::indexing::array_spec_set has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 3, 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/perry-runtime/src/array/indexing.rs"},"region":{"startLine":1766}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee619ebcee4f8b0cdbd3177d9a19d8161c33b4dd6c8d0902b17da2daba630dac"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::join::well_formed_join_size (cognitive 27): perry_runtime::array::join::well_formed_join_size has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (24 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/perry-runtime/src/array/join.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"361be77ea254f3753c6c7c91393094c2c108f7c331a733a08b64158fffee1a2e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::reduce_right::js_array_reduce_right (cognitive 27): perry_runtime::array::reduce_right::js_array_reduce_right has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/array/reduce_right.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a4df260bea6835579d75eeef3d7b70bfc2942d6349d77465f817f86ed3c8df"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::search::js_array_indexOf_jsvalue (cognitive 27): perry_runtime::array::search::js_array_indexOf_jsvalue has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 3 (6 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/array/search.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b47a83b82411b1e8295f78ed7796a4de8af4cf46c35e2ecdb89b9a36c72878b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::builtins::table::render_table (cognitive 27): perry_runtime::builtins::table::render_table has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 8 (10 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/perry-runtime/src/builtins/table.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d7d20b45f88dad42715f2bbc4e60384dfd6fe265ec0e2f204a5dd4afdcf4dd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::component::value::typed::at (cognitive 27): perry_runtime::component::value::typed::at has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (5 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/component/value/typed.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1e5064a5497b0b5ab7edec51ab2bc7564e1619f6bed89c5a8dff40023f3cf5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::fs::stream::utf8_stream::utf8_stream_flush_by_id (cognitive 27): perry_runtime::fs::stream::utf8_stream::utf8_stream_flush_by_id has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (25 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/perry-runtime/src/fs/stream/utf8_stream.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"6953a12c0190d757c4880beee3b75491c5abbdd37d286391881e83b0fec73ce9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::roots::mark_mutable_root_slots_step (cognitive 27): perry_runtime::gc::roots::mark_mutable_root_slots_step has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (27 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/perry-runtime/src/gc/roots.rs"},"region":{"startLine":1565}}}],"partialFingerprints":{"codehealthFindingId/v1":"3192994400508dbd84e6ea78b51c8e7af2644f364eec69d265da7d85b0ec44ff"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::roots::stack_maps::visit_record_slots (cognitive 27): perry_runtime::gc::roots::stack_maps::visit_record_slots has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 3 (4 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/perry-runtime/src/gc/roots/stack_maps.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"e647ce0eead98940479d7f6f360e430c0e6e0ff4a7e76a09c5f88ace5a7ee880"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::duration_format::get_duration_unit_options (cognitive 27): perry_runtime::intl::duration_format::get_duration_unit_options has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 5, 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/perry-runtime/src/intl/duration_format.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a151ed4e554e722ea87351903399ce1096304d857ee670be204b9f2f678067"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::stringify_shape_template::build_shape_prefix_template (cognitive 27): perry_runtime::json::stringify_shape_template::build_shape_prefix_template has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 4, loops 2 (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/perry-runtime/src/json/stringify_shape_template.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"6371620387a181334d50f944424c9722bfe787888d90d550023bec344aa89af8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_stream_event_emitter::own_data_slot (cognitive 27): perry_runtime::node_stream_event_emitter::own_data_slot has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 6 (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/perry-runtime/src/node_stream_event_emitter.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b09442f5ccd79252115781aa21f8585e67b3cf3a0b4ac672c851215926e5e3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_stream_event_emitter::add_stream_listener_for_event_with_options (cognitive 27): perry_runtime::node_stream_event_emitter::add_stream_listener_for_event_with_options has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18 (24 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/perry-runtime/src/node_stream_event_emitter.rs"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"c503894b9a205288bed6f03f630ad3075909c8a7948af6973d51fea497487f04"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_stream_event_emitter::emit_stream_event_rooted (cognitive 27): perry_runtime::node_stream_event_emitter::emit_stream_event_rooted has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/node_stream_event_emitter.rs"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"51dd5fe36df416d4fe7910a77fb4aa5dab7de6eb3846efd556ba57a060791085"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::descriptor_state::holder_word_blocks_store (cognitive 27): perry_runtime::object::descriptor_state::holder_word_blocks_store has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 4, match/switch 2 (4 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/perry-runtime/src/object/descriptor_state.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5d864b721ec69a09bb0a4ab3439290aca6e0328a88e098f8e66a93c54b61b8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::has_property::shape_presence::first_possible_holder (cognitive 27): perry_runtime::object::field_get_set::has_property::shape_presence::first_possible_holder has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (26 pts), 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/perry-runtime/src/object/field_get_set/has_property/shape_presence.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb59e1025a6315eeca60423f0387c920a4e0fa1236cb9e01337bebe6b98712f8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::ic_miss::class_field_chain::learn (cognitive 27): perry_runtime::object::field_get_set::ic_miss::class_field_chain::learn has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 3, 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/perry-runtime/src/object/field_get_set/ic_miss/class_field_chain.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbc0e256e6965c2602ea557de75878148f3279ae35bcc9a90615dc65f73844a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::iterator_prototypes::array_record_close_is_absent (cognitive 27): perry_runtime::object::iterator_prototypes::array_record_close_is_absent has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (24 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/perry-runtime/src/object/iterator_prototypes.rs"},"region":{"startLine":1866}}}],"partialFingerprints":{"codehealthFindingId/v1":"584f51e91b61e6a23d7d2f3751e5c04bef0f21d59f7b4ccae95167aaee432ee1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_probe::probe_get_at (cognitive 27): perry_runtime::object::layout_probe::probe_get_at has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (25 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/perry-runtime/src/object/layout_probe.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3022fc141002fe5cd209875825421e20c8756c8c7f566f6bb6e6637a3c3c3c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::object_ops::accessors::js_object_get_own_field_or_undef (cognitive 27): perry_runtime::object::object_ops::accessors::js_object_get_own_field_or_undef has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 1 (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/perry-runtime/src/object/object_ops/accessors.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"486843048c0de3806371cc576bf5e707567e286501ae99f678c1f9756882289a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::shaped_symbols::define (cognitive 27): perry_runtime::object::shaped_symbols::define has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (24 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/perry-runtime/src/object/shaped_symbols.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"384a9787107b393373ae803b04d75c35278de2ef5759a38de1db53648f711518"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::concat::append_chain_all_heap_strings (cognitive 27): perry_runtime::string::concat::append_chain_all_heap_strings has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (19 pts), loops 4 (5 pts), boolean chains 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/perry-runtime/src/string/concat.rs"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5dac0a4318a1d1ca73da2adb23edff324790eddd2dfa7e4fb6b30f148186ff"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::format::spec_to_exponential (cognitive 27): perry_runtime::string::format::spec_to_exponential has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/string/format.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"15363e57deecf8b387e67ce1e2b14a48bb20f9f4bffa129999a95feeb492b701"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::url::node_compat::legacy_format_from_object (cognitive 27): perry_runtime::url::node_compat::legacy_format_from_object has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/url/node_compat.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"47685dd88d8772c898b3edf9fc292c5f9285ea9377687711170df6e90be45e23"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::common::net_method_values::dispatch_property (cognitive 27): perry_stdlib::common::net_method_values::dispatch_property has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 2 (6 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/perry-stdlib/src/common/net_method_values.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"335ee45376d482ff9a979da008bfba73dfc5e8f8849971d028080b85769bb6ff"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::worker_threads::js_worker_threads_worker_new (cognitive 27): perry_stdlib::worker_threads::js_worker_threads_worker_new has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 3 (7 pts), loops 3 (4 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/perry-stdlib/src/worker_threads.rs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f3e00a069041ce4e4db549ea96d060be02a3e2d4e003dcf852625cdc07e393"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::worker_threads::worker_pump::js_worker_threads_process_pending (cognitive 27): perry_stdlib::worker_threads::worker_pump::js_worker_threads_process_pending has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (6 pts), match/switch 1 (2 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/perry-stdlib/src/worker_threads/worker_pump.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b86c1f871e01a9a29e2643a9a3a9ef64706a5f5bde80b53f9f4d2bc4e5a688"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::deforest::call_sites::match_consume_loop (cognitive 27): perry_transform::deforest::call_sites::match_consume_loop has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 8 (12 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/perry-transform/src/deforest/call_sites.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae1f41e81b07ee85c5241b1f91c92d0f746ddec2b9200eefe81e90767f38575"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::cross_module::walk_stmts (cognitive 27): perry_transform::inline::cross_module::walk_stmts has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (4 pts), 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. This shape REPEATS in the file: one other method here (perry_transform::inline::cross_module::walk_stmts_mut) 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/perry-transform/src/inline/cross_module.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"45675af5c14de0e50cca8cbb16f0107332a8fdc7d28f56b7ecb0af2fab9bf309"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::cross_module::walk_stmts_mut (cognitive 27): perry_transform::inline::cross_module::walk_stmts_mut has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (4 pts), 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. This shape REPEATS in the file: one other method here (perry_transform::inline::cross_module::walk_stmts) 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/perry-transform/src/inline/cross_module.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b6d822e44dfa744658ee84486f887c3641f189bb7a1f5e4a3287f4b46dbec1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::factory_specialize::specialize_captured_class_factories::rewrite_call_init (cognitive 27): perry_transform::inline::factory_specialize::specialize_captured_class_factories::rewrite_call_init has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 3 (6 pts), match/switch 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. This shape REPEATS in the file: 4 other methods here (perry_transform::inline::factory_specialize::specialize_captured_class_factories, perry_transform::inline::factory_specialize::specialize_captured_class_factories::resolve_factory_return_class, perry_transform::inline::factory_specialize::specialize_captured_class_factories::visit_stmts, \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/perry-transform/src/inline/factory_specialize.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d82dfc5d7e6dcac7a93743a5935c437f387abec98146bc1490867d129151f0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_android::widgets::set_background_color (cognitive 27): perry_ui_android::widgets::set_background_color has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (27 pts) (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/perry-ui-android/src/widgets/mod.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"63cb505c63b87b6f2b952cd798fac533c755c75d65bc7fe38e1ad13819e3dfc6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_gtk4::keyboard::gdk_name_to_keycode (cognitive 27): perry_ui_gtk4::keyboard::gdk_name_to_keycode has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-gtk4/src/keyboard.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"5215a1737624655826055e31d8bc1a415253c0dd113a5b3e52e16ba76b3caa65"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_gtk4::widgets::add_child (cognitive 27): perry_ui_gtk4::widgets::add_child has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 1 (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/perry-ui-gtk4/src/widgets/mod.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"871d0438af46930f8a62ac7a9a8b8c9597129fa5fe28a457dfb172d60369efcd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_ios::adaptive_layout::current_snapshot (cognitive 27): perry_ui_ios::adaptive_layout::current_snapshot has cognitive complexity 27 (threshold 15). Drivers by points: if/else 23 (24 pts), boolean chains 3 (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/perry-ui-ios/src/adaptive_layout.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f92ea08185887d4cc290bf6577d7a25931032c2b0de3ffc96276e4989f9a81"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_ios::audio_playback::perry_audio_play (cognitive 27): perry_ui_ios::audio_playback::perry_audio_play has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18 (23 pts), match/switch 4 (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/perry-ui-ios/src/audio_playback.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"843775ea5d4c6ee46570e239d0a5a418b6902d0ed87e6ed772256db517004e30"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_macos::audio_playback::perry_audio_play (cognitive 27): perry_ui_macos::audio_playback::perry_audio_play has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18 (23 pts), match/switch 4 (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/perry-ui-macos/src/audio_playback.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ffa043545ca10813ef527129381b92daa2ed86b2ac22eda4d9a2d2cc8ffa7f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_tvos::audio_playback::perry_audio_play (cognitive 27): perry_ui_tvos::audio_playback::perry_audio_play has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18 (23 pts), match/switch 4 (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/perry-ui-tvos/src/audio_playback.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"38653e27dbce11076191a5a5af9e317e6bd9a273fc46dea80b92015498b44c6c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_visionos::audio_playback::perry_audio_play (cognitive 27): perry_ui_visionos::audio_playback::perry_audio_play has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18 (23 pts), match/switch 4 (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/perry-ui-visionos/src/audio_playback.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"734db47327d3bc11a9413268bfc5c1e5db796cf14aed912525644e78105576bd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_watchos::audio_playback::perry_audio_play (cognitive 27): perry_ui_watchos::audio_playback::perry_audio_play has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18 (23 pts), match/switch 4 (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/perry-ui-watchos/src/audio_playback.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd911e6a4aec4b7ca9733c00ae2e58c9e195b57d2b62386bfebe01ed6ebd5b5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::widgets::webview::install_navigation_handlers (cognitive 27): perry_ui_windows::widgets::webview::install_navigation_handlers has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (23 pts), match/switch 3, 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/perry-ui-windows/src/widgets/webview.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"61bda06efcb0c5616de86c4c9003448f9884a328b83118fb008b4c59b7ccc2e7"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::closed_params (cognitive 27): Gen::closed_params has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (7 pts), loops 4 (5 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/perry-wpfacts/src/gen/export.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7ca4397b00c837e4ea23eb221582ae76b2cee91d6211716605c1d2a86beb6f"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::fill_described (cognitive 27): Gen::fill_described has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 4 (7 pts), match/switch 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/perry-wpfacts/src/gen/import_values.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e02af62741c1f277aabfbe177f11212122545920e5e8da0444dcbab0c188ac"}},{"ruleId":"D2","level":"warning","message":{"text":"gc-current0ed-instruction-profile-v21.run (cognitive 27): gc-current0ed-instruction-profile-v21.run has cognitive complexity 27 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 2 (8 pts), boolean chains 4, ternaries 1 (2 pts) (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":"docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffb8781edbd6a30aca4374584216d42b3e29d11ee2aeb90f59822ce60f252d6"}},{"ruleId":"D2","level":"warning","message":{"text":"gc-final-instruction-profile.run (cognitive 27): gc-final-instruction-profile.run has cognitive complexity 27 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 2 (8 pts), boolean chains 4, ternaries 1 (2 pts) (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":"docs/audits/gc-rss-instructions-2026-10-03/gc-final-instruction-profile.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"9489e33c5a8fa97c78d322affafc9a36417db55e176407b5eb17290aee25e0c3"}},{"ruleId":"D2","level":"warning","message":{"text":"i18n_extract_todo.main (cognitive 27): i18n_extract_todo.main has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (7 pts), boolean chains 4 (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":"docs/scripts/i18n_extract_todo.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"910882223d9250e23053d2ce813afca42df762af66040ac54ebe0fdb068dbd89"}},{"ruleId":"D2","level":"warning","message":{"text":"capture_linux_incident.main (cognitive 27): capture_linux_incident.main has cognitive complexity 27 (threshold 15). Drivers by points: error handling 7 (11 pts), if/else 9 (10 pts), boolean chains 4, loops 1, ternaries 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":"scripts/capture_linux_incident.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaeb6757870d97af3af6f2acd45cede520d887f9f259d65c48805260b5f73da6"}},{"ruleId":"D2","level":"warning","message":{"text":"_CfgParser._expr (cognitive 27): _CfgParser._expr has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 8, 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":"scripts/check_thread_locals.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d7277fbc698e69fdc7771838aacd8887c9b136075688012935d7937982b483"}},{"ruleId":"D2","level":"warning","message":{"text":"repsel_census.census (cognitive 27): repsel_census.census has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 9 (10 pts), loops 6 (8 pts), if/else 6 (7 pts), boolean chains 2 (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":"scripts/compiler_output_harness/repsel_census.py"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"559c581ae474eb16343eeb9a385e253259f3bd3ebc876b69182b66a33f793706"}},{"ruleId":"D2","level":"warning","message":{"text":"constfn_executable_gates.guarded_fast_body (cognitive 27): constfn_executable_gates.guarded_fast_body has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 6 (8 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/constfn_executable_gates.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a260e7fc0b18fe32556764d1710d479a2789c9ba1da6a7bc1ce36e2660d4a2"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.between_blocks (cognitive 27): gc_root_dominance_check.between_blocks has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 4 (6 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":2047}}}],"partialFingerprints":{"codehealthFindingId/v1":"839afba08364b4440a9c29018f93dbb61bfe9d14af961a51199db193b7871765"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check._seed_sites (cognitive 27): gc_root_dominance_check._seed_sites has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 3, 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":2641}}}],"partialFingerprints":{"codehealthFindingId/v1":"f627ac61ad82719d56ecb0e51aac88895b3d6116477989555968575b977c3606"}},{"ruleId":"D2","level":"warning","message":{"text":"global_sink_isolation.audit (cognitive 27): global_sink_isolation.audit has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 5 (7 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":"scripts/global_sink_isolation.py"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"38da6f77a21e4f7ecfa2ff72d95273b12d1865b9a570b3a95847f4615678e152"}},{"ruleId":"D2","level":"warning","message":{"text":"perf_frontier_report.classify_row (cognitive 27): perf_frontier_report.classify_row has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 10, ternaries 2 (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":"scripts/perf_frontier_report.py"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccdc8b8e35aabd57100a54fc958ad5dde0c914e0b6a6cd8a1a24e77372fa4a5"}},{"ruleId":"D2","level":"warning","message":{"text":"subsystem_slots.main (cognitive 27): subsystem_slots.main has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 7 (11 pts), ternaries 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":"scripts/subsystem_slots.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"8487a4e96de6c3a94fee367c61011ec0b929b984837b1218cee5b6eab91da787"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::resolve::prefer_ts_source_for_package_entry (cognitive 26): perry::commands::compile::resolve::prefer_ts_source_for_package_entry has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (5 pts), boolean chains 3 (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/perry/src/commands/compile/resolve.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e950ea993e3a8ca8526442f08da2c62e64edb8cd863e91d110aa4b3b57a93d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::install::print_findings (cognitive 26): perry::commands::install::print_findings has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 2 (3 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/perry/src/commands/install/mod.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4de82eac09d6c7d1ab770a70578fbc371810ccf1ff0d70c4a1181786b07fb5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::publish::preflight::macos_preflight_validation (cognitive 26): perry::commands::publish::preflight::macos_preflight_validation has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/publish/preflight.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"285d7aa894973a46ed48e65be62348ef31e8bdb708d478cf17180bf5ebf029d9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::run::devices::detect_booted_visionos_simulators (cognitive 26): perry::commands::run::devices::detect_booted_visionos_simulators has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 17). 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: 2 other methods here (perry::commands::run::devices::detect_booted_watch_simulators, perry::commands::run::devices::detect_booted_tv_simulators) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/perry/src/commands/run/devices.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a928f520f9e19531654188dea7121ad14801be665a405c59b9989ca6725b99e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::run::devices::detect_booted_watch_simulators (cognitive 26): perry::commands::run::devices::detect_booted_watch_simulators has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 17). 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: 2 other methods here (perry::commands::run::devices::detect_booted_visionos_simulators, perry::commands::run::devices::detect_booted_tv_simulators) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/perry/src/commands/run/devices.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12f125e5028b37e395bacd67cab5a127cd90d9941f1851e0d3e46a4210f941b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::run::devices::detect_booted_tv_simulators (cognitive 26): perry::commands::run::devices::detect_booted_tv_simulators has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 17). 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: 2 other methods here (perry::commands::run::devices::detect_booted_visionos_simulators, perry::commands::run::devices::detect_booted_watch_simulators) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/perry/src/commands/run/devices.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa09a55aa3ae6be6d80857294e0c437a581de224b6afd54a1680dcde75d9f65"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::update::run (cognitive 26): perry::commands::update::run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 5 (9 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/perry/src/commands/update.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"1790efff0573c99d5b26e4e9384b7d7ffc865314899a9c743e740367cd6b2340"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstructorContracts::record (cognitive 26): ConstructorContracts::record has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 5 (8 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/perry-codegen/src/codegen/constructor_contracts.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f618c62b10e429025a98297af7e9b9e45a7a00c1c9e0ee3f67f7daf49e8767"}},{"ruleId":"D2","level":"warning","message":{"text":"FnReader::call (cognitive 26): FnReader::call has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 7 (10 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/dialect/mod.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"00708bdd5df620d8b1e48530b75de4fe8907cc6cd642c240ea4e0320d7d62142"}},{"ruleId":"D2","level":"warning","message":{"text":"LlInst::render_into (cognitive 26): LlInst::render_into has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 3 (5 pts), loops 1 (2 pts) (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/perry-codegen/src/inst.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9885a1a1d41d436502c31a6d00c19f6c4c7624ef06ce4508f89ad271e22a90b"}},{"ruleId":"D2","level":"warning","message":{"text":"Parents::new (cognitive 26): Parents::new has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (8 pts), match/switch 1 (4 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/perry-codegen/src/layout_families/parents.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9eca238b00847a4c31d2c6a4bc0193327e4e3fb52f21f8e86e64444bef4da93"}},{"ruleId":"D2","level":"warning","message":{"text":"Parents::exported_inner (cognitive 26): Parents::exported_inner has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 2 (6 pts), loops 2 (3 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/perry-codegen/src/layout_families/parents.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12bfba33d6fd6e7db4fcdfe7252f955fc5de77546b860bc36d69117b9cc4a82"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::emit_lowered_module (cognitive 26): perry_codegen::codegen::emit_lowered_module has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (21 pts), match/switch 2 (3 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/perry-codegen/src/codegen/mod.rs"},"region":{"startLine":4491}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0b064850ee8ca6909081468ac732e034bf7fdb2b3ae8bdcfd13ff33034c4e2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::entry_outline::outlined_entry_global_let_ids (cognitive 26): perry_codegen::codegen::entry_outline::outlined_entry_global_let_ids has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 6 (8 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 13). Of this number, 14 points are the body\u0027s own statements and 12 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/perry-codegen/src/codegen/entry_outline.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0a14c6e9ae2e233c59438557f2288061efbe5538c8b275b80c1d8da2e89deb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::string_pool::metadata_constants::function_names (cognitive 26): perry_codegen::codegen::string_pool::metadata_constants::function_names has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 2 (6 pts), boolean chains 2, 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/perry-codegen/src/codegen/string_pool/metadata_constants.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"81780741a6b6ca28a44735c6b5b56dde10905b9d7519c3071a056aabbc516221"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::object_literal_exports::object_literal_facts (cognitive 26): perry_codegen::collectors::object_literal_exports::object_literal_facts has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 5, 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/perry-codegen/src/collectors/object_literal_exports.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"af360b21c0beb8a89418f048395c69491a6d3f3646c779ece9cd965ced345aea"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_returns::producer_return_class (cognitive 26): perry_codegen::collectors::ptr_shape_returns::producer_return_class has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 4 (8 pts), loops 3 (4 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/perry-codegen/src/collectors/ptr_shape_returns.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9d5d6a7f278fa8cfdeafddbc82044d3f37d143665d5f6d48d8ddec72270537"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::function::precise_roots::lower_roots_for_rs4gc (cognitive 26): perry_codegen::function::precise_roots::lower_roots_for_rs4gc has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 4, 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/perry-codegen/src/function/precise_roots.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce484f8c2f894fa02100458afd215e387b9d3743b074e21b363285cb77854aef"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_desc::module_literals (cognitive 26): perry_codegen::layout_desc::module_literals has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 7 (11 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/perry-codegen/src/layout_desc.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"1234bb0612fde02da11f8c7984115bed36287f694798174c2f2cdc2f9b879de4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::property_get::dynamic_dispatch::build_direct_method_args (cognitive 26): perry_codegen::lower_call::property_get::dynamic_dispatch::build_direct_method_args has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 4 (9 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/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28a1f9b088c04ed5c37615cd11ad500904558407c74bce04e55606225ae8c75"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::loops::match_packed_f64_versioned_loop (cognitive 26): perry_codegen::stmt::loops::match_packed_f64_versioned_loop has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14, boolean chains 12. 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":5835}}}],"partialFingerprints":{"codehealthFindingId/v1":"11db763ea67670c9e0088255bef8fac8ce86aff131b72813f89173e4210a81db"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::loops::classify_for_length_hoist_rejection (cognitive 26): perry_codegen::stmt::loops::classify_for_length_hoist_rejection has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 5 (7 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":8403}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70f6292597933a5662eac7b7d33cf17afa74863e26b00dcc3eda3f3ce8ec211"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::versioned_indexed_loop::match_candidate (cognitive 26): perry_codegen::stmt::versioned_indexed_loop::match_candidate has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 10 (13 pts), if/else 7 (8 pts), boolean chains 4, loops 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/perry-codegen/src/stmt/versioned_indexed_loop.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c621c105cb8531e0b2ec237cd9bedc00bcc3377b0a22bb11c8c30bfc0f560185"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_swiftui::emit::emit_node (cognitive 26): perry_codegen_swiftui::emit::emit_node has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (5 pts), loops 2 (4 pts), boolean chains 2 (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/perry-codegen-swiftui/src/emit.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"6911953b4ec881bf12201079154e58009e841163c0cd99529865d3835b9a0480"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::interfaces (cognitive 26): Checker::interfaces has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (5 pts), boolean chains 4 (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/perry-component-host/src/contract.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"047c956b072cb838afc4570a5025055efa965a906518f581189c9a3ec19ec4ec"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_component_host::driver::resources::execute (cognitive 26): perry_component_host::driver::resources::execute has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 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/perry-component-host/src/driver/resources.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2147c62047779df5943b886c3d1ed6a583c7d03011a3c1b448c63793f56aa20"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::dynamic_import::visitors::for_each_dynamic_import_mut (cognitive 26): perry_hir::dynamic_import::visitors::for_each_dynamic_import_mut has cognitive complexity 26 (threshold 15). Drivers by points: loops 10 (16 pts), if/else 4 (10 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: 3 other methods here (perry_hir::dynamic_import::visitors::for_each_dynamic_import, perry_hir::dynamic_import::visitors::for_each_worker_new_mut, perry_hir::dynamic_import::visitors::for_each_module_expr) 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/perry-hir/src/dynamic_import/visitors.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e155729925ba40199703af5841ccd7b2717776c3237bb9ffefbbecaaefee12fa"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::dynamic_import::visitors::for_each_dynamic_import (cognitive 26): perry_hir::dynamic_import::visitors::for_each_dynamic_import has cognitive complexity 26 (threshold 15). Drivers by points: loops 10 (16 pts), if/else 4 (10 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: 3 other methods here (perry_hir::dynamic_import::visitors::for_each_dynamic_import_mut, perry_hir::dynamic_import::visitors::for_each_worker_new_mut, perry_hir::dynamic_import::visitors::for_each_module_expr) 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/perry-hir/src/dynamic_import/visitors.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3511f49124b9aed0ee4f202957cbd28ddb26b30d8e79748d4bb8e988a5cd921"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::dynamic_import::visitors::for_each_worker_new_mut (cognitive 26): perry_hir::dynamic_import::visitors::for_each_worker_new_mut has cognitive complexity 26 (threshold 15). Drivers by points: loops 10 (16 pts), if/else 4 (10 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: 3 other methods here (perry_hir::dynamic_import::visitors::for_each_dynamic_import_mut, perry_hir::dynamic_import::visitors::for_each_dynamic_import, perry_hir::dynamic_import::visitors::for_each_module_expr) 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/perry-hir/src/dynamic_import/visitors.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06cd9216ca0499ce320aa46b490f04cb6a48cbef8bebda76f079d4142a7eb72"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::dynamic_import::visitors::for_each_module_expr (cognitive 26): perry_hir::dynamic_import::visitors::for_each_module_expr has cognitive complexity 26 (threshold 15). Drivers by points: loops 10 (16 pts), if/else 4 (10 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: 3 other methods here (perry_hir::dynamic_import::visitors::for_each_dynamic_import_mut, perry_hir::dynamic_import::visitors::for_each_dynamic_import, perry_hir::dynamic_import::visitors::for_each_worker_new_mut) 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/perry-hir/src/dynamic_import/visitors.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"6abdc07725009e8f8122c18ea61cef12f38b909bcf42dd88a0378baad98ba7ef"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::eval_super_scan::scan_class (cognitive 26): perry_hir::lower::eval_super_scan::scan_class has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (8 pts), 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/perry-hir/src/lower/eval_super_scan.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b0cfa925e3c249f021c7c67a7d3b33d2fcfedbd53ac04163404b388a2dfe89"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::intrinsics::native_arena::try_native_arena_public_api (cognitive 26): perry_hir::lower::expr_call::intrinsics::native_arena::try_native_arena_public_api has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (23 pts), match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/intrinsics/native_arena.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c82cf6f002cc08f6e349e11b023a6cc2c92f22ebea1d041c9c09bb9c8919c9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_new::non_ident::lower_new_non_ident (cognitive 26): perry_hir::lower::expr_new::non_ident::lower_new_non_ident has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, match/switch 2 (3 pts), loops 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/perry-hir/src/lower/expr_new/non_ident.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6388bb1426b603388e38e60a70fb9c5b56d89453a9889dfbfb02761ef98d9b59"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_object::resolve_keyvalue_key (cognitive 26): perry_hir::lower::expr_object::resolve_keyvalue_key has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 7 (17 pts), if/else 4 (9 pts) (nesting depth added 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. 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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"853a979dfb3566c28cd59e1e7a386083d9be839050097ad5463ff320f4179f68"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::for_head::rewrite_collection_view_for_of (cognitive 26): perry_hir::lower::for_head::rewrite_collection_view_for_of has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (22 pts), match/switch 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/for_head.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"660b13ebe8eaebbdd958299acd00ea91037f4eff9f62bf6806e1cd421112dcaa"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::widget_decl::reactive_animate::collect_state_value_reads (cognitive 26): perry_hir::lower::widget_decl::reactive_animate::collect_state_value_reads has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 4 (8 pts), boolean chains 1, match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/widget_decl/reactive_animate.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5199267fb09fc91853346b99e937aca6d82823c84668f79c7038e0dc6c0e4610"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::interface_decl::enter_interface_scope (cognitive 26): perry_hir::lower_decl::interface_decl::enter_interface_scope has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_decl/interface_decl.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61c9d32545d73a35e64603fb64d4bba36ffb178200328c7c06f791ccdc96d7f"}},{"ruleId":"D2","level":"warning","message":{"text":"BirthWriteSite::write (cognitive 26): BirthWriteSite::write has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 2 (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/perry-runtime/src/node_stream_constructors/birth.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab4142c8dc4f60f06b356a8358f67759a9acfef7d57a29da8c9db6eb969e527"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::pointer (cognitive 26): Writer::pointer has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (21 pts), match/switch 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/perry-runtime/src/thread/clone_write.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b70c9ac13669bc4ee263a317ca17af95afda7b5604fc49a2aa885605fc3e521"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::generic::al_get (cognitive 26): perry_runtime::array::generic::al_get has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/array/generic.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1662f7bdc306dfa9171720586033d86fdc13402557cd96090caa60979f4110"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::join::try_join_well_formed (cognitive 26): perry_runtime::array::join::try_join_well_formed has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (24 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/perry-runtime/src/array/join.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c507f282ed93a5722ff51c755fd0f747bc3a0e37301cb4de5a585713dc9c2a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::push_pop::js_array_grow (cognitive 26): perry_runtime::array::push_pop::js_array_grow has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19 (20 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/perry-runtime/src/array/push_pop.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9d40561ea29c7ffd8fbfb021b197ff111070e2c54b85a0304a72a1c0aab9d1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::builtins::console::js_console_log_dynamic (cognitive 26): perry_runtime::builtins::console::js_console_log_dynamic has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 3, match/switch 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/perry-runtime/src/builtins/console.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56206d3b9889c145ad6d761739ad6cafd7739c8af978bb0608021a10dd86b99"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::bun_compat::cli_utils::strip_ansi_text (cognitive 26): perry_runtime::bun_compat::cli_utils::strip_ansi_text has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (7 pts), match/switch 1 (2 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/perry-runtime/src/bun_compat/cli_utils.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9582f8cc8e200561d4c35d6d30ea3238a4d6c6e4abb6d0bc77be94f34442e4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::dyn_eval::interp::eval_class_expr (cognitive 26): perry_runtime::dyn_eval::interp::eval_class_expr has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 4 (7 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/perry-runtime/src/dyn_eval/interp.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc23296d82d4322e9f2e7eab9d9ea3d1ca8f6a7aa7de4ad1e0146ac50aa0529"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::exception::marks::unwind_managed_stacks (cognitive 26): perry_runtime::exception::marks::unwind_managed_stacks has cognitive complexity 26 (threshold 15). Drivers by points: if/else 26. 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/perry-runtime/src/exception/marks.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"63308151b9c9dad7502f8f615eb920af4736d6358c1f5e84de9bec737b566cf0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_inspector::runtime_evaluate (cognitive 26): perry_runtime::node_inspector::runtime_evaluate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 2, 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/perry-runtime/src/node_inspector.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"730dea7e67c6245255ef3335d2e9326dcc0c04fd5f0a6700d61598d1d5b4e6f1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::parent_static::symbol_members::class_own_symbol_member_keys (cognitive 26): perry_runtime::object::class_registry::parent_static::symbol_members::class_own_symbol_member_keys has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2 (6 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/perry-runtime/src/object/class_registry/parent_static/symbol_members.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f627d6132fd81bc6b1b29a749d8bb76cb94e99562ae0f40e0daa60890aff61"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::get_slow::keyed_slow_impl (cognitive 26): perry_runtime::object::field_get_set::get_slow::keyed_slow_impl has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 2 (4 pts) (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/perry-runtime/src/object/field_get_set/get_slow.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"059c8a4463ae653f7e46f58afda7cb196db60e4b2fb770058d8ce125a2c613f8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_desc::methods::perry_probe_family_method (cognitive 26): perry_runtime::object::layout_desc::methods::perry_probe_family_method has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 4, 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/perry-runtime/src/object/layout_desc/methods.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fcf8cbd3c3c45b1e2ad4f311e029f64f598b315ded6ab2d3e4ddb09a536410"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_probe::inherited::link_of (cognitive 26): perry_runtime::object::layout_probe::inherited::link_of has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 2 (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/perry-runtime/src/object/layout_probe/inherited.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ba239db64588ad78c57eed78816df6a08aaeda713dad8e40bb914b859ecd4c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::method_call::prepare (cognitive 26): perry_runtime::object::method_call::prepare has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 6, match/switch 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/method_call.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5802eeab2344baefa01717badb9b5dae09e81ad3fba731016f4a452bb7936a8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_module::callable_exports::buffer_constructor_thunk (cognitive 26): perry_runtime::object::native_module::callable_exports::buffer_constructor_thunk has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (22 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/perry-runtime/src/object/native_module/callable_exports.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42c9050a69d6fe76545d56781698b622303bc6eaf30689c2ff046b119a53842"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::prototype_chain::object_set_static_prototype_impl_with (cognitive 26): perry_runtime::object::prototype_chain::object_set_static_prototype_impl_with has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/prototype_chain.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"63256f02f1a4e7acaae192aaac30d91b069229ffbfd6ffc5d573a284f180424e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::process::node_module::source_map::source_map_decode_segment (cognitive 26): perry_runtime::process::node_module::source_map::source_map_decode_segment has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (24 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/perry-runtime/src/process/node_module/source_map.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"733ec55217585d58570df82e5ebd7e52eb948619e575c39a23a322ddee99231e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::format::js_number_to_precision (cognitive 26): perry_runtime::string::format::js_number_to_precision has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (25 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/perry-runtime/src/string/format.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd03bb8cde275ee0349b0c6d440e26caa44703dfd18255953bb84a9dada8519"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::timer::mock::mock_timers_advance_to (cognitive 26): perry_runtime::timer::mock::mock_timers_advance_to has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (5 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. Note where this lives, though: it is a test double declared in the package\u0027s stand-in module, so its branching is FIXTURE SURFACE \u2014 the shape the tests need the stand-in to have \u2014 rather than production logic anyone will read or maintain. The measurement stands, but the usual payoff of splitting it does not: decompose it only if a test is hard to write or hard to read against it. The change that pays here is to shrink what the double has to imitate \u2014 narrow the interface it stands in for, or move it beside the tests that consume it so it is graded with them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/timer/mock.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7b7c24b0cd5b2204a06b4c12cfce85e330b8f15e13f20a01095d44699f633f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::typedarray_props::typed_array_prototype_chain_has (cognitive 26): perry_runtime::typedarray_props::typed_array_prototype_chain_has has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (26 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/perry-runtime/src/typedarray_props.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"280248ba3f2d2cf93f58a9555a057c566df43eeea7a343a3c16d911f1130321c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::value::to_string_radix::js_jsvalue_to_string_radix (cognitive 26): perry_runtime::value::to_string_radix::js_jsvalue_to_string_radix has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (25 pts), match/switch 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/perry-runtime/src/value/to_string_radix.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0a6bc690bc19d8f297dcad473e02c68631b325a123215cdc631dd7521a72dc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::readline::js_readline_on (cognitive 26): perry_stdlib::readline::js_readline_on has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 1 (3 pts), match/switch 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/perry-stdlib/src/readline/mod.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e8a1b337485c3dbc39324735b7e3a31e5574b8e002a4cd1a034196f1c013a2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::turnloop_client::exchange::on_data (cognitive 26): perry_stdlib::turnloop_client::exchange::on_data has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 2, 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/perry-stdlib/src/turnloop_client/exchange.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d3a4974f6ad566371cff30861f49edec967a6c7e74ac046b752d50579ed147"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::aggregate_scalar::scalarize_stmts (cognitive 26): perry_transform::aggregate_scalar::scalarize_stmts has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 4 (6 pts), match/switch 3 (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/perry-transform/src/aggregate_scalar.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"7823734f1d88838d5302b6e05428156c22ef67e2c825a7f07ce1e91c7eaf8218"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::aggregate_scalar::scalarize_return_record_candidate (cognitive 26): perry_transform::aggregate_scalar::scalarize_return_record_candidate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 4 (5 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/perry-transform/src/aggregate_scalar.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7aea31022897a9e10c216f7c39209b1547f91f36c91089170e031f2ab17a3ee"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_geisterhand::chaos::start (cognitive 26): perry_ui_geisterhand::chaos::start has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 2 (5 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/perry-ui-geisterhand/src/chaos.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"64bed7a3a659a52ccc8e279e756ee2d34afbdf9f94499222ff6cfbf96a5c2b94"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_macos::widgets::set_hidden (cognitive 26): perry_ui_macos::widgets::set_hidden has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (26 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-macos/src/widgets/mod.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"d979878f2db8b423e3dda59ff8a582b60eff78b73dde08548f5ff1a899cc5794"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::bind_args (cognitive 26): Model::bind_args has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 4 (5 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/perry-wpfacts/src/solve/call_and_construct.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3f428397ff8cbed124f4734a69a3fa05d4c82c0663967bc8305ba67e21d210"}},{"ruleId":"D2","level":"warning","message":{"text":"ci_plan.table (cognitive 26): ci_plan.table has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (12 pts), ternaries 2 (7 pts), boolean chains 4, loops 2 (3 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":"scripts/ci_plan.py"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"1664d4d4f7421b5c950b317cb4ff16d0c131ec0c980ea3bbb4ca9079b729bd07"}},{"ruleId":"D2","level":"warning","message":{"text":"gate_failure_watch.self_test (cognitive 26): gate_failure_watch.self_test has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 4, loops 3 (4 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":"scripts/gate_failure_watch.py"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df7b10b96241b44da8e49ef23ec7bc0b8ba4ebd7d57b06cff5ee5d6d305d9df"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_1090_evidence_report.benchmark_matrix (cognitive 26): gc_1090_evidence_report.benchmark_matrix has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 7, loops 3 (4 pts), ternaries 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":"scripts/gc_1090_evidence_report.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b274cec7a7e8df7df6f5f7e8a47a0480fbf298b081a36b04d27fbf285e94fd0"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_1090_evidence_report.perf_frontier_summary (cognitive 26): gc_1090_evidence_report.perf_frontier_summary has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 8, boolean chains 5, 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":"scripts/gc_1090_evidence_report.py"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ea3202d5f827205cb50073b3be9a76862fcf3ec2801f94d54ba8e4c7a488f9"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.seeded_violation_test (cognitive 26): gc_root_dominance_check.seeded_violation_test has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), error handling 2 (5 pts), loops 3 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (gc_root_dominance_check.seeded_statepoint_test) 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":2703}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a072db95c34ec5208005b49f0dec194281a4dc8b7d8750f1f98272bb5b8b62b"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.run_stale (cognitive 26): gc_root_dominance_check.run_stale has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 5 (8 pts), ternaries 2 (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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":3330}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51a9b9eb7a4a5306d160c48c88f69ab3cc9c054f8a314ab2455092de958f1a1"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.seeded_statepoint_test (cognitive 26): gc_root_dominance_check.seeded_statepoint_test has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), error handling 2 (5 pts), loops 3 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (gc_root_dominance_check.seeded_violation_test) 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":5656}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92678e8e161b76d1bc08071f735613b9ce95d056f264044d21b02686c279433"}},{"ruleId":"D2","level":"warning","message":{"text":"native_export_collisions.repeated_head_layout (cognitive 26): native_export_collisions.repeated_head_layout has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/native_export_collisions.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b312d1f5f9fa402aa734f8d2d3988e4134cc83bbece81ccf265ec174e682bf"}},{"ruleId":"D2","level":"warning","message":{"text":"package_bench_attr.classify (cognitive 26): package_bench_attr.classify has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 4 (5 pts), boolean chains 4, ternaries 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":"scripts/package_bench_attr.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc5b004b225996b873c014ced2a5fdb89ba7e34eff5a4c42037d492af4e71a1"}},{"ruleId":"D2","level":"warning","message":{"text":"perf_frontier_report.main (cognitive 26): perf_frontier_report.main has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 9 (18 pts), if/else 6 (8 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/perf_frontier_report.py"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3aaac1a129694866bde541d359deda0f596ab795d3541c299fef3c7e28ead28"}},{"ruleId":"D2","level":"warning","message":{"text":"server_ab.run_load (cognitive 26): server_ab.run_load has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 3 (6 pts), boolean chains 3, error handling 1 (3 pts), loops 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":"scripts/turnloop/server_ab.py"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2b37fdd60293fc568e15b94582f38f352c016f17ddc898f995eb1757662cad"}},{"ruleId":"D2","level":"warning","message":{"text":"wasi_imports_check.module_imports (cognitive 26): wasi_imports_check.module_imports has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 3 (7 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":"scripts/wasi_imports_check.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"646e8eb455ed42c5d1e8b9a681933b27c758bbc15d818856f4c300f10eba4571"}},{"ruleId":"D2","level":"warning","message":{"text":"wpfacts_precision.main (cognitive 26): wpfacts_precision.main has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 4, ternaries 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":"scripts/wpfacts_precision.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac96b03c8328ec7e1e2a5f055838efa9c851cb11926366467cfa50b59eb1d42"}},{"ruleId":"D2","level":"warning","message":{"text":"web_runtime._renderTokenizedLine (cognitive 26): web_runtime._renderTokenizedLine has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":2642}}}],"partialFingerprints":{"codehealthFindingId/v1":"861df069ff06b6c59080f3235c6fb5b3902004852d562cc262a01459007c915f"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.renderDetail (cognitive 26): index.html.renderDetail has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, error handling 2 (3 pts), loops 1, ternaries 1 (nesting depth added 10). Most of this is not in the body itself: 6 of the 26 points are its own statements and the rest belongs to 2 function items inside it that branch (apply, a function literal at line 411). 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/perry-ui-geisterhand/src/inspector_ui/index.html"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7d09b910bc3ef62fc3ad556141ca15f397e82d789c6ab85e2adb96d668b63b"}},{"ruleId":"D2","level":"warning","message":{"text":"renderer.createNativeRenderer.insertNode (cognitive 26): renderer.createNativeRenderer.insertNode has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 4, ternaries 3 (4 pts), 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":"packages/perry-solid/src/renderer.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c39e2373fc663ed497c88d881a16190937c86997e1fb733df9162ec5c9b5fa0"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline.main (cognitive 26): pipeline.main has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (18 pts), ternaries 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":"scripts/publish/pipeline.mts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"571fcb1ff0f13cff000735f8be4fe61834d7463e616f1f177e15bfde3cdd5b15"}},{"ruleId":"D2","level":"warning","message":{"text":"platform-visibility.waitForPlatforms (cognitive 26): platform-visibility.waitForPlatforms has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 5, error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/platform-visibility.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"758f89ef919317b6b5000424ea37ade2f27672559355e7d7342ef49fde3407a8"}},{"ruleId":"D2","level":"warning","message":{"text":"__classDispatch (cognitive 26): __classDispatch has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 4, 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/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4896}}}],"partialFingerprints":{"codehealthFindingId/v1":"4186f8f4b72f2d5daa34423218dcfb0f510ba20666298ff8245274bd5ab5d840"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::bootstrap::named_exports::enforce_resolved_bare_imports (cognitive 25): perry::commands::compile::bootstrap::named_exports::enforce_resolved_bare_imports has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (6 pts), match/switch 1 (4 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/perry/src/commands/compile/bootstrap/named_exports.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6ec1a17ae641a4da885318cdd452711e75b24a29153e8156b31bc59446e4e1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::detect::has_top_level_module_exports_assignment (cognitive 25): perry::commands::compile::cjs_wrap::detect::has_top_level_module_exports_assignment has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (12 pts), boolean chains 6, loops 3 (5 pts), match/switch 1 (2 pts) (nesting depth added 11). Of this number, 22 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":"crates/perry/src/commands/compile/cjs_wrap/detect.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d68c774698d1a3d1670173b95cae0184670b247d81d7b6aaf5c79404595b71"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::embed::generate_embedded_asset_object (cognitive 25): perry::commands::compile::embed::generate_embedded_asset_object has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20 (23 pts), loops 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/perry/src/commands/compile/embed.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c19f83b8666722041cefd8f04f6a7f5c9216129a01159239099f0e447e551a5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::geisterhand::artifacts_from_messages (cognitive 25): perry::commands::compile::geisterhand::artifacts_from_messages has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 3 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/geisterhand.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9c3bd84000b4a136d25a1c1c0dca6f825baaef6b336439ab362aa415c3031f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::dev::run (cognitive 25): perry::commands::dev::run has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 4 (7 pts), loops 4 (5 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/dev.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31611ecf2b9338c27b39049e55effc3070518632aca2d0842edbfa883e11ee6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::doctor::check_system_linker (cognitive 25): perry::commands::doctor::check_system_linker has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 1 (5 pts), match/switch 2 (3 pts) (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/perry/src/commands/doctor.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4de09dad60fb1c60578787bc6acadb329ac3c6a254fbb92885e54fc4a6aa43"}},{"ruleId":"D2","level":"warning","message":{"text":"LlFunction::define_header_with_size_attrs (cognitive 25): LlFunction::define_header_with_size_attrs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18, boolean chains 6, 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/perry-codegen/src/function.rs"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0ad92ccfb09408530f212c2c266d04d3e6c0b98885df1268d875bbdc9d879d"}},{"ruleId":"D2","level":"warning","message":{"text":"Walk::visit (cognitive 25): Walk::visit has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (23 pts), boolean chains 1, match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/providers.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ea5c39ca21e654b8d458436e68b7da186e9e6c07eff7453f8317d73d8f7caf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::accessor_numeric::numeric_get_properties (cognitive 25): perry_codegen::codegen::accessor_numeric::numeric_get_properties has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 5 (9 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/perry-codegen/src/codegen/accessor_numeric.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6c4acbe90a8efc413d1f8a42e15654823fdcd3f5b231c509b3749323776e46"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::arguments::arguments_observed_on_every_path::unobserved_paths (cognitive 25): perry_codegen::codegen::arguments::arguments_observed_on_every_path::unobserved_paths has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 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":"crates/perry-codegen/src/codegen/arguments.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05fcb857554088cc6fe418e96a61cd50d43fee9ec0402725a73e65b06902b14"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::method_static::compile_static_method (cognitive 25): perry_codegen::codegen::method_static::compile_static_method has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19 (21 pts), boolean chains 2, loops 2 (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/perry-codegen/src/codegen/method_static.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bd874b521f57c1f9341d3c0913867847e797bc8e6d2dfd7d6d5c4df9774f3f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::reach_report::tokens (cognitive 25): perry_codegen::codegen::reach_report::tokens has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (10 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/perry-codegen/src/codegen/reach_report.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6df247ab8b28de8e6d6f215f848237c58eb6642f0290b59544a5cb3963777a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::integer_locals::collect_flat_row_aliases (cognitive 25): perry_codegen::collectors::integer_locals::collect_flat_row_aliases has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 2 (4 pts), 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/perry-codegen/src/collectors/integer_locals.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b209820e9b28199c61b9148125d8ae0a4df29a5ec01a285570044a7bdb9bc88"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::loop_bounded_i32::scan_level_writes (cognitive 25): perry_codegen::collectors::loop_bounded_i32::scan_level_writes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 2 (4 pts), 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/perry-codegen/src/collectors/loop_bounded_i32.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"05fa5b5b09e02e94c08b136cd4465fba3e0e7ffbab889f376027e730909582ab"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::mutation::expr_has_mutation (cognitive 25): perry_codegen::collectors::mutation::expr_has_mutation has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 11, if/else 4 (9 pts), match/switch 3 (5 pts) (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/perry-codegen/src/collectors/mutation.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c46b74ed6411bb9939774258ed27f1b10a4da36c16231bf27d250067f1ca03"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::typed_locals::collect_live_writes (cognitive 25): perry_codegen::collectors::typed_locals::collect_live_writes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/typed_locals.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"5600cee6a8794cc9c10b1c9718b555310fbd4fa1549e4e94f6a5ae59cf309237"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_desc::create_families::binding_family (cognitive 25): perry_codegen::layout_desc::create_families::binding_family has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 7, 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/perry-codegen/src/layout_desc/create_families.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e6ba8f1d896f4494c88c3ff310bc0d25f983e8b6c0a1f279568a715a23eb24"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::console_promise::lower_closure_call_rooted (cognitive 25): perry_codegen::lower_call::console_promise::lower_closure_call_rooted has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (15 pts), match/switch 5 (6 pts), boolean chains 2, loops 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/perry-codegen/src/lower_call/console_promise.rs"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"2debbf3ff4cbfee870b89f57efc29a99d03705ac03ca35eb969b0cc5dfd927e0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::field_init::ctor_prologue_assigned_fields_inner (cognitive 25): perry_codegen::lower_call::field_init::ctor_prologue_assigned_fields_inner has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 5, match/switch 1 (2 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/field_init.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"d458396d572be884610661309ea85eb88b25f879c0ba3278ca87196acf86a3a5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::func_ref::guarded_path_type (cognitive 25): perry_codegen::lower_call::func_ref::guarded_path_type has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 3 (6 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/func_ref.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"b583b77b2bffa6dbc5a501e37f8b822d69f98a2ea5fd992e315132e112be59eb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::new::lower_new_impl (cognitive 25): perry_codegen::lower_call::new::lower_new_impl has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 4 (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/perry-codegen/src/lower_call/new.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"06eff1c584b7869259f78d8b0e60d47003c584b1369b9e6ace4e6cfa96d310af"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::ui_styling::extract_gradient_obj (cognitive 25): perry_codegen::lower_call::ui_styling::extract_gradient_obj has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (22 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/ui_styling.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"d452d4faf0afea87f23e4daa7046a8482b645b47ab8ea7469d6662fbe09403d5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::loops::iterator_record::lower (cognitive 25): perry_codegen::stmt::loops::iterator_record::lower has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17 (18 pts), boolean chains 6, 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/perry-codegen/src/stmt/loops/iterator_record.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1ae5fbf37fe7ae6847fe957bb800fd1df859c2f16a314b49037a4953a27296"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::region_loop::begin_with (cognitive 25): perry_codegen::stmt::region_loop::begin_with has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2 (5 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/perry-codegen/src/stmt/region_loop/mod.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c690144eed691473ee2a6d786d8fd352d445f31a30cc8fba15a682476f0398"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_arkts::inline::inlined_analysis_init (cognitive 25): perry_codegen_arkts::inline::inlined_analysis_init has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 2 (5 pts), loops 2, 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/perry-codegen-arkts/src/inline.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"45522fe89222efe500a9eb225a5044edad9fc13c868cdafa84088f641a87c0ff"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_component_host::ffi::new_bridge (cognitive 25): perry_component_host::ffi::new_bridge has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 2 (3 pts), boolean chains 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/perry-component-host/src/ffi.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a541606d933e6be8703aec2fac8e2ee5a009099a9267dfe309075fd39f28e4d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::client_events::handle_response_event (cognitive 25): perry_ext_http::client_events::handle_response_event has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 6 (10 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/perry-ext-http/src/client_events.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"7507ca6bd9b1fa18dc573e77f71d353592713b57a21d481d5aab918d86a0e86d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_net::payload_socket::end (cognitive 25): perry_ext_net::payload_socket::end has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20 (24 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/perry-ext-net/src/payload_socket.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"82082094b3d1825ecebdc399366568303b2544ea941bf1a40d42143aa1be6bb9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_net::payload_tls::begin_connected (cognitive 25): perry_ext_net::payload_tls::begin_connected has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (23 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/perry-ext-net/src/payload_tls.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"c156924e48408a65fc0d1674a3249c5078d781d28ff36b9d0b49eb74bdf83f50"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_parcel_watcher::js_parcel_watcher_process_pending (cognitive 25): perry_ext_parcel_watcher::js_parcel_watcher_process_pending has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 3 (8 pts), loops 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/perry-ext-parcel-watcher/src/lib.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d44a77b9b080010c8a4ba0d8e6f6d4d2fc4bd5f8b531efdb1bef2d7d7b3eb6c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_sharp::js_sharp_composite (cognitive 25): perry_ext_sharp::js_sharp_composite has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (10 pts), loops 1 (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/perry-ext-sharp/src/lib.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41da1a86451d5f6616170bdf045f5215ddf95174b8f70864246f789d69fbfb0"}},{"ruleId":"D2","level":"warning","message":{"text":"Encoder::step (cognitive 25): Encoder::step has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 6, match/switch 1 (nesting depth added 5). 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/perry-ext-zlib/src/stream/driver.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a0c4e0a119bd481fa09a8069414b22dd4261c25d7336d4275227abc755e607"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph::new (cognitive 25): Graph::new has cognitive complexity 25 (threshold 15). Drivers by points: loops 9 (13 pts), if/else 4 (12 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-gc-effects/src/graph.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37a45e28b51eb852cb93956b4bc3a4d3f39200baab48e2d6f354a9e4304e55b"}},{"ruleId":"D2","level":"warning","message":{"text":"Proof::block (cognitive 25): Proof::block has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (15 pts), match/switch 2 (7 pts), 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/perry-hir/src/analysis/numeric_order.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f2c6fa67313bc9da7c90833d4558b0061bee8c1477aaa9737b9a3d27159b18"}},{"ruleId":"D2","level":"warning","message":{"text":"Remap::stmt (cognitive 25): Remap::stmt has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (20 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/perry-hir/src/lexical_frames.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9330f9ad5eec2bf9a303fc00b28975de0825f48389c7740b217f55e0ce98c97"}},{"ruleId":"D2","level":"warning","message":{"text":"CensusWalker::stmt (cognitive 25): CensusWalker::stmt has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/shared_mutable_capture.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"e821207dc27a1aa7482c4c4f15fdf8bd5bf2cf5a318abf33ffafb17dd3659f49"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::destructuring::helpers::rewrite_use_state_tuple (cognitive 25): perry_hir::destructuring::helpers::rewrite_use_state_tuple has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 5 (12 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/perry-hir/src/destructuring/helpers.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb033abec3a93e9e5ba61bc6bcf0914719f4128c06edb511954e9e3a90dd3e2a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::const_fold_fn::try_direct_eval_simple_assignment_fold (cognitive 25): perry_hir::lower::const_fold_fn::try_direct_eval_simple_assignment_fold has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 3, 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/perry-hir/src/lower/const_fold_fn.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a97361b928f0eef303893f06cae25b93f47037a997a9ab9e532bc9887d4d8d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::widget_decl::parse_foreach_node (cognitive 25): perry_hir::lower::widget_decl::parse_foreach_node has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 3, 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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be536f919deac796d8dfd8e6b7806d2ee0584b866a6ef132fd232328a3687a1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::class_captures::closure_free_exprs_of_stmt (cognitive 25): perry_hir::lower_decl::class_captures::closure_free_exprs_of_stmt has cognitive complexity 25 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 4 (9 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_decl/class_captures.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"553801535ba692023f7c91c5cf76211515e3b44b6c900127bd9879ba63e2f70e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::class_captures::closure_capture_ids_stmt (cognitive 25): perry_hir::lower_decl::class_captures::closure_capture_ids_stmt has cognitive complexity 25 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 4 (9 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_decl/class_captures.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"e271bcba35e5b2bde31fa93b30dcdca645c0e381176d0aa5788c665514dea664"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::class_captures::append_new_args_expr (cognitive 25): perry_hir::lower_decl::class_captures::append_new_args_expr has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (10 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/perry-hir/src/lower_decl/class_captures.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ab2c20ffb1d8fea37f2eeb659528d7ceef97300ad157ba166514a9ce73debc"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::fill_from_socket (cognitive 25): Connection::fill_from_socket has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-http-client/src/transport.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7ae69398b9aadc04640b0da3d5bf8921e02c1dfa0c6c2ab2e536e4fd3fc367"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::write_raw (cognitive 25): Connection::write_raw has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (6 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-http-client/src/transport.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"498d6e022ed28b2304f7717f28369ec27edc51c480b5d5eac88042e2eaca1a95"}},{"ruleId":"D2","level":"warning","message":{"text":"DirtyHeaderSlotScan::step (cognitive 25): DirtyHeaderSlotScan::step has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (4 pts), boolean chains 2, 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/perry-runtime/src/gc/barrier/remembered_mark.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e8c7290add5e322fc2f8d4aed180c1b7e35df05d1bc1e49cff04d1616a1277"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::arena::page_meta::retag_block_space_inner (cognitive 25): perry_runtime::arena::page_meta::retag_block_space_inner has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, 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/perry-runtime/src/arena/page_meta/mod.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"37acb3e84044dd51ffa394ac1ebd287da32eb435610c483a445f692907fdb0d9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::from_concat::try_append_spread_array_dense (cognitive 25): perry_runtime::array::from_concat::try_append_spread_array_dense has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 4, 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/perry-runtime/src/array/from_concat.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d88b0c94453ccb9c987fff32b09bca735a8afa41647784168930cc82175e69"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::generic::real_array_mutator (cognitive 25): perry_runtime::array::generic::real_array_mutator has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/array/generic.rs"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"98fb286ba51e821636dd4df3066cf3c2be4c941b084b5ab8488b036d2844170f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::header::clean_arr_ptr_resolve (cognitive 25): perry_runtime::array::header::clean_arr_ptr_resolve has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 5 (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/perry-runtime/src/array/header.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea7d73547918513783daf6748a7c3d55596456d5ae26af4ea4e21f10f03a22c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::iter_methods::js_array_reduce (cognitive 25): perry_runtime::array::iter_methods::js_array_reduce has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (19 pts), loops 2 (3 pts), match/switch 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/perry-runtime/src/array/iter_methods.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"9670598485938a6e3a29b0e587107d8a5405edbdd9576903c36b70c1842f05a4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::iterator_step::js_iterator_step (cognitive 25): perry_runtime::array::iterator_step::js_iterator_step has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 1 (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/perry-runtime/src/array/iterator_step.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4affbbecc74a653e7bcb4f6af9b42471021788437fc6beb059df461b9cedcf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::buffer::dataview::js_data_view_get (cognitive 25): perry_runtime::buffer::dataview::js_data_view_get has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (24 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/buffer/dataview.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"5797ab4872c3fe8b0a7ec36a7ff24c667b9bd6f69b8fe9c59f4fc00ead374e6c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::buffer::from::js_uint8array_new (cognitive 25): perry_runtime::buffer::from::js_uint8array_new has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 1 (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/perry-runtime/src/buffer/from.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"e538a6d0062ab56f38349266c6d967618141d0aa2290beef001abf57c27205de"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::child_process::options::cp_apply_live_stdio (cognitive 25): perry_runtime::child_process::options::cp_apply_live_stdio has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (18 pts), boolean chains 3, match/switch 2 (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/perry-runtime/src/child_process/options.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"7071127d4ebbfcbd5597a753513e3b427c4392cea3035c60a35ae47e2a51dab8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::fs::cp::js_fs_cp_options_result (cognitive 25): perry_runtime::fs::cp::js_fs_cp_options_result has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 4, 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/perry-runtime/src/fs/cp.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35a4b8419eb08b0796c3c737f3a35a4b60297df63d26e25f44c4f2fa64df96a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::fs::dir_glob_watch::glob::run_fs_glob_result (cognitive 25): perry_runtime::fs::dir_glob_watch::glob::run_fs_glob_result has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (21 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/perry-runtime/src/fs/dir_glob_watch/glob.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4851d50d3f52a7a4e7ae685f1aba117d5434ca542167aee5acb3da38671c79"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::verify::restore_surviving_dirty_coverage_impl (cognitive 25): perry_runtime::gc::verify::restore_surviving_dirty_coverage_impl has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 6, 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/perry-runtime/src/gc/verify.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea664c575766e3f51dc46eef86d8c2934240f693d8d723ff9c2fb5878de7e062"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::parse_api::parse_slow (cognitive 25): perry_runtime::json::parse_api::parse_slow has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (23 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/perry-runtime/src/json/parse_api.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc3ac7358e2638bca3ac513c06277f1758e90a263d3731ddd659a734af8f3b8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::stringify_flat::try_object (cognitive 25): perry_runtime::json::stringify_flat::try_object has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/json/stringify_flat.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be179aa21ad87e571f5597a507579c5895dc9d7c9413b93c29a1e28b3607d3c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_stream::write_state::clear_buffer (cognitive 25): perry_runtime::node_stream::write_state::clear_buffer has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (6 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/perry-runtime/src/node_stream/write_state.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f145cea8b8a9caa35bb50ead557f6c735ca27a884d0c3a05738fdb5a4ff2d8b4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_submodules::js_node_submodule_export_as_function (cognitive 25): perry_runtime::node_submodules::js_node_submodule_export_as_function has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 5, match/switch 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (perry_runtime::node_submodules::js_node_submodule_namespace_member) 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/perry-runtime/src/node_submodules/mod.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a55d677743ed61b3761dc2bf8e69b9e6c328128376a6b625630ce50412ae57f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_submodules::js_node_submodule_namespace_member (cognitive 25): perry_runtime::node_submodules::js_node_submodule_namespace_member has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 5, match/switch 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (perry_runtime::node_submodules::js_node_submodule_export_as_function) 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/perry-runtime/src/node_submodules/mod.rs"},"region":{"startLine":1834}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62630cab3c5535fdc92d3a5e9ea8c17870448247d7cce9e4db6e7106a029138"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::bigint_dispatch::dispatch_bigint_binary_method (cognitive 25): perry_runtime::object::bigint_dispatch::dispatch_bigint_binary_method has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 1, 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/perry-runtime/src/object/bigint_dispatch.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0747d102f908008392385f02e712f6192300c4631f1996ad9f4114b1400a6e9e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::for_in_stable::stable_single_own_for_in_keys (cognitive 25): perry_runtime::object::field_get_set::for_in_stable::stable_single_own_for_in_keys has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18, 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/perry-runtime/src/object/field_get_set/for_in_stable.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2caef5e960b2da41cd43b042a968848b678b9a10ea3cab9c169307f68e7a25c1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::global_this::array_error::array_prototype_push_thunk (cognitive 25): perry_runtime::object::global_this::array_error::array_prototype_push_thunk has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (23 pts), boolean chains 2 (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/perry-runtime/src/object/global_this/array_error.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"244a51c441e5403bc3c371957f0d0218f05dbe122a876eaccf811b34732e3a21"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_probe::inherited::list_position (cognitive 25): perry_runtime::object::layout_probe::inherited::list_position has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (22 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/perry-runtime/src/object/layout_probe/inherited.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d155d4d1399d532a599a326746140d9ce1f13a4756e5194bc658f915fa99acf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_call_method::compiled_target::compiled_target_call (cognitive 25): perry_runtime::object::native_call_method::compiled_target::compiled_target_call has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18 (21 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/perry-runtime/src/object/native_call_method/compiled_target.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"472f8555e69f4ca2aeb67aa3e9664c8b7ec9dd4b071f2cbe8eee9ee15faba9f4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::object_ops::define_symbol_property::define_symbol_property (cognitive 25): perry_runtime::object::object_ops::define_symbol_property::define_symbol_property has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 7 (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/perry-runtime/src/object/object_ops/define_symbol_property.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d13a1779565d6c5908f47b85948d88cd4c6a131f371784cc2b954c15471d836"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::object_ops_frozen::js_object_is_extensible (cognitive 25): perry_runtime::object::object_ops_frozen::js_object_is_extensible has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18 (23 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/perry-runtime/src/object/object_ops_frozen.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7175a5c5e768f8fa9fc21f87724ecf1347439f4bb07956f2b8936980153815e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::property_ops::common::create_list_from_array_like (cognitive 25): perry_runtime::object::property_ops::common::create_list_from_array_like has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 3 (6 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/perry-runtime/src/object/property_ops/common.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5dd974263652596fb4edead3ffb2b09eb871427d8bb311e45ccb1c3a62a4a02"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::regex::perex_split::forward_split (cognitive 25): perry_runtime::regex::perex_split::forward_split has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 2 (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/perry-runtime/src/regex/perex_split.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"351f33648eafe05961f3da4732534a95635bbab1c1a86ae83fa0d4c513ab7ebf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::compare::js_string_to_well_formed (cognitive 25): perry_runtime::string::compare::js_string_to_well_formed has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (23 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/perry-runtime/src/string/compare.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae94493bee010cdc6f8332c6fe1454a27a3b7db0c20a3a903f9c5c555a7fbe9d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::url::node_compat::legacy_url_format_impl (cognitive 25): perry_runtime::url::node_compat::legacy_url_format_impl has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (18 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":"crates/perry-runtime/src/url/node_compat.rs"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc796c48e55edb96b321e67a0c3a4422b159d5dab7dacff859bd002eb9184cc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::url::parse::resolve_url (cognitive 25): perry_runtime::url::parse::resolve_url has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 4, match/switch 2 (4 pts), 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/perry-runtime/src/url/parse.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"71620ecafa256dc8f443340d333a079411835a1a476b602d2e6c2d08f63d4268"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::turnloop_client::exchange::finish_response (cognitive 25): perry_stdlib::turnloop_client::exchange::finish_response has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 3, 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/perry-stdlib/src/turnloop_client/exchange.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"de81cad1433f5a699aba75e416b4b7f2d26cfc203062b93b2a28b85fb30db560"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::webcrypto::kdf::js_webcrypto_derive_key (cognitive 25): perry_stdlib::webcrypto::kdf::js_webcrypto_derive_key has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 6 (8 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/perry-stdlib/src/webcrypto/kdf.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a81917b1b677dd8c535a9a25ce40030ca9d35a7aadadb849ff322308a0d1847"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::deforest::call_sites::rewrite_call_sites_in_stmts_with_local_pass (cognitive 25): perry_transform::deforest::call_sites::rewrite_call_sites_in_stmts_with_local_pass has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (10 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/deforest/call_sites.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb887f1335cb00b8b579dd8930b87858f778a568abcc07bcf5e3d1abf583e786"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::deforest::walk::max_in_stmt (cognitive 25): perry_transform::deforest::walk::max_in_stmt has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (20 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/perry-transform/src/deforest/walk.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d56d8ea35369c731b87811916ac524feab9e83bcdf7f82f439c5d03ef8af486"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::id_scan::scan_stmt_for_max_local (cognitive 25): perry_transform::generator::id_scan::scan_stmt_for_max_local has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (20 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/perry-transform/src/generator/id_scan.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"22769ce081c868381221844231d9693a2e582c2faf8ab989e2de00d545d4a67c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::lower::abrupt::build_yield_star_return_routes (cognitive 25): perry_transform::generator::lower::abrupt::build_yield_star_return_routes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (23 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/perry-transform/src/generator/lower/abrupt.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"faebd9ca2ec616775d994d289fe8075dbccd24fde41246805a18009cfb9a98c0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::i18n::replace_in_expr (cognitive 25): perry_transform::i18n::replace_in_expr has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (18 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/i18n.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86ffc06965bafa1a9ec1c321bb14f7d5f580d25dcda92e7fd0dd06b8de9aae3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::local_occurrences::count_stmt (cognitive 25): perry_transform::local_occurrences::count_stmt has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (20 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/perry-transform/src/local_occurrences.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"8174a8fce8499c4ec3f191407671468da94713c6703dd93a5cf5093539c2d2e4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui::bin::styling-matrix::cmd_gen (cognitive 25): perry_ui::bin::styling-matrix::cmd_gen has cognitive complexity 25 (threshold 15). Drivers by points: loops 8 (14 pts), if/else 5 (7 pts), match/switch 2 (4 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui/src/bin/styling-matrix.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f5acfb15c2f5146cf40c10387e8d98dcf9909c23eafde172751a49c851437a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_ios::audio_playback::perry_audio_load_sound (cognitive 25): perry_ui_ios::audio_playback::perry_audio_load_sound has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (17 pts), match/switch 4 (6 pts), boolean chains 2 (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/perry-ui-ios/src/audio_playback.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92bd23aae38b02bc089380f49a369223d54ad4afef186c84e8daf0b7e3e3ac4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_ios::menu::build_uimenu (cognitive 25): perry_ui_ios::menu::build_uimenu has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 5 (11 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/perry-ui-ios/src/menu.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0d78e1faff928d8036abe335d3fa3591828df0a7405dbb1d4e2bce558af27f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_ios::widgets::perry_ui_read_widget_value (cognitive 25): perry_ui_ios::widgets::perry_ui_read_widget_value has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (25 pts) (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/perry-ui-ios/src/widgets/mod.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"529978a9094a127026e952aa3fa4a42bc174bd863e37c5b4d62b699b8cc75133"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_macos::audio_playback::perry_audio_load_sound (cognitive 25): perry_ui_macos::audio_playback::perry_audio_load_sound has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (17 pts), match/switch 4 (6 pts), boolean chains 2 (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/perry-ui-macos/src/audio_playback.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1e1d4c1a11d7cf409e1f97f3338a3348c00ebbfc06d02bdaf85d4c60289741"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_macos::widgets::perry_ui_read_widget_value (cognitive 25): perry_ui_macos::widgets::perry_ui_read_widget_value has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (25 pts) (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/perry-ui-macos/src/widgets/mod.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ccd4807d80c6afbadbb376532369d9bf208d131ff328111bd9e15bda284617"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_tvos::audio_playback::perry_audio_load_sound (cognitive 25): perry_ui_tvos::audio_playback::perry_audio_load_sound has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (17 pts), match/switch 4 (6 pts), boolean chains 2 (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/perry-ui-tvos/src/audio_playback.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"57700c8106b90af425fe43b1928d44ec9d188053fad7d5e9eb6533b40597f315"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_tvos::menu::build_uimenu (cognitive 25): perry_ui_tvos::menu::build_uimenu has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 5 (11 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/perry-ui-tvos/src/menu.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ea0ac2c8dabcd8c34b0b95d6610c1d74f267e9074bbb08faee37e50ffdd7b3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_visionos::audio_playback::perry_audio_load_sound (cognitive 25): perry_ui_visionos::audio_playback::perry_audio_load_sound has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (17 pts), match/switch 4 (6 pts), boolean chains 2 (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/perry-ui-visionos/src/audio_playback.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc7b0b7070cf91454dcb01e6b9d7718e598cdd7db5482f85fe6896bb135c3a8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_visionos::menu::build_uimenu (cognitive 25): perry_ui_visionos::menu::build_uimenu has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 5 (11 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/perry-ui-visionos/src/menu.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2d5a5294904daaa562fce578e8e2f9aee4249fbdbda22cbabb93f14fb91b7f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_visionos::widgets::perry_ui_read_widget_value (cognitive 25): perry_ui_visionos::widgets::perry_ui_read_widget_value has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (25 pts) (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/perry-ui-visionos/src/widgets/mod.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"9979faeede94067149be757ad58a7cbf26801cb88094ef837d187bb8bf2aff8b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_watchos::audio_playback::perry_audio_load_sound (cognitive 25): perry_ui_watchos::audio_playback::perry_audio_load_sound has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (17 pts), match/switch 4 (6 pts), boolean chains 2 (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/perry-ui-watchos/src/audio_playback.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"38dda7ab8f61c18fdcc78ea991ee70c22cec64073531941a65240f843d672c18"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_watchos::state::state_set (cognitive 25): perry_ui_watchos::state::state_set has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 7 (12 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/perry-ui-watchos/src/state.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb734071fe20fe7d8d0777cf26460f4ed0ab619175c089ffe8a0206de3864336"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::widgets::pdf_view::paint_pdf (cognitive 25): perry_ui_windows::widgets::pdf_view::paint_pdf has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (23 pts), boolean chains 2 (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/perry-ui-windows/src/widgets/pdf_view.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ab0061397f5f9db25e9c50dcf1986c05cec598ec1f90d3d7d5e7936263dac0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wit::typescript::generate (cognitive 25): perry_wit::typescript::generate has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 3 (6 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/perry-wit/src/typescript.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4c909b5c21f114f7c0d1345eb8ef979ab59dc7818c232a1538b060493c428c"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::compute_birth_keys (cognitive 25): Gen::compute_birth_keys has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 4 (7 pts), boolean chains 3 (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/perry-wpfacts/src/gen/walk.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a801fff006dbf6a70cd97ab38c513c3f13f35c66ce144375ff9b3d42895a253"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::method_on (cognitive 25): Model::method_on has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 3 (4 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/perry-wpfacts/src/solve/call_and_construct.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24eecac80bb5d41c36de1c34beae6c76b80570f8315d485be4712ac2c14e2e3"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::escape_this (cognitive 25): Model::escape_this has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 5 (7 pts), boolean chains 4, match/switch 1 (2 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/perry-wpfacts/src/summary.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"81458c4ffdacb95c7990542b55aea834afd36acaa9b774df7362ab016790814a"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::summarize_and_replay (cognitive 25): Model::summarize_and_replay has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (5 pts), boolean chains 4, 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/perry-wpfacts/src/summary.rs"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed03c5a3bc7bfb09f91095b66a5a570444249b2c9134449c9b6770a404f617d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::builtins::own_method_inner (cognitive 25): perry_wpfacts::builtins::own_method_inner has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 8 (13 pts), if/else 5 (10 pts), boolean chains 2 (nesting depth added 10). 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/perry-wpfacts/src/builtins.rs"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5559d505667eaf0e5cc60b29eaa3dfe60ac05186ba7abf094166ffb1687ea13d"}},{"ruleId":"D2","level":"warning","message":{"text":"native-sites-observer-v17.capture_native_pages (cognitive 25): native-sites-observer-v17.capture_native_pages has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (6 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/audits/gc-rss-instructions-2026-10-03/native-sites-observer-v17.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"485d575bbd4505c29d3e6528887664785c0eb145841228b745095f2303d269c1"}},{"ruleId":"D2","level":"warning","message":{"text":"copied_minor_fallback_report.run_strict_fallback_evidence_gates (cognitive 25): copied_minor_fallback_report.run_strict_fallback_evidence_gates has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/copied_minor_fallback_report.py"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"9578a23ed5976cf2c3f666771fb4ea3d645ac9a1de07b240f4a630cfb19d4708"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.statepoint_corpus_stats (cognitive 25): gc_root_dominance_check.statepoint_corpus_stats has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (14 pts), loops 4 (10 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":5427}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a31a418585186ec2f213b9091901dd89568fed4606e624da18cadfa92fe1667"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_runtime_root_holders.report (cognitive 25): gc_runtime_root_holders.report has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 5 (10 pts), boolean chains 2 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gc_runtime_root_holders.py"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70b709735fb8c3a460ae6f2823f86a617a540f82e137218e3432727949882c5"}},{"ruleId":"D2","level":"warning","message":{"text":"global_sink_isolation.declaration_kind (cognitive 25): global_sink_isolation.declaration_kind has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (5 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":"scripts/global_sink_isolation.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e960c4d14f852cce78468a403e16e388c3dc388d9a41641835935de46bd28d"}},{"ruleId":"D2","level":"warning","message":{"text":"native_abi_evidence_report.explain_lowering_accounting (cognitive 25): native_abi_evidence_report.explain_lowering_accounting has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 7, loops 2 (3 pts), ternaries 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":"scripts/native_abi_evidence_report.py"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b2a3d9952c937b36f5e55d44815cc85cb7df6e8c3b706e4b416d0a26eb8798"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceIndex.locate (cognitive 25): SourceIndex.locate has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 2 (4 pts), loops 1 (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":"scripts/package_bench_attr.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac2297b3f6031bd138fd325ae6c330227783381a8b9996bc540060f44e10537"}},{"ruleId":"D2","level":"warning","message":{"text":"package_bench_attr.aggregate (cognitive 25): package_bench_attr.aggregate has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 4 (14 pts), if/else 2 (5 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/package_bench_attr.py"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5dafb8cae2ce2fe04c471f13fcbf159c5251c2538d47ef86c03009a7929611"}},{"ruleId":"D2","level":"warning","message":{"text":"hone_editor_render_line (cognitive 25): hone_editor_render_line has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, error handling 1 (2 pts), loops 1 (2 pts), ternaries 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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":2313}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d4abd33b039f9fafdea83dbf7427c4942a42d5361fce66f23a0c0ab51fe1ad"}},{"ruleId":"D2","level":"warning","message":{"text":"Fixer::collect_usages_in_expr (cognitive 24): Fixer::collect_usages_in_expr has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/fixer.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe05f3fbb0be617a3a173304eaf9130f113dff7694f6c27cd6d7fc6443697c3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::bundle_apple::bundle_for_watchos (cognitive 24): perry::commands::compile::bundle_apple::bundle_for_watchos has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 3 (5 pts), boolean chains 1, 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/perry/src/commands/compile/bundle_apple.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10f4443f36c528e88bc50074fcccf1b2fb1913ccab856a1a8a639fec5ce2c4f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::collect_modules::feature_detect::computed_members::for_each_expr (cognitive 24): perry::commands::compile::collect_modules::feature_detect::computed_members::for_each_expr has cognitive complexity 24 (threshold 15). Drivers by points: loops 9 (13 pts), if/else 5 (11 pts) (nesting depth added 10). Of this number, 16 points are the body\u0027s own statements and 8 belong to 4 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/perry/src/commands/compile/collect_modules/feature_detect/computed_members.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc951b333e1bb1cda303030781f4e734d6a46644abfc72f66a4cbf543f06fe5e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::collect_modules::static_require_transform::resolve_require_path (cognitive 24): perry::commands::compile::collect_modules::static_require_transform::resolve_require_path has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (3 pts) (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/perry/src/commands/compile/collect_modules/static_require_transform.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1276702aa3a3cf3a572deac6985111d07f0abdc1adefce9eb8252e3af60025"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::fallback_diag::emit (cognitive 24): perry::commands::compile::fallback_diag::emit has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3 (4 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/fallback_diag.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ad5a002c86cc4c503499313eb168d0cb33eb3addf64f0543414c699c2876c2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::targets::compile_for_web (cognitive 24): perry::commands::compile::targets::compile_for_web has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 4 (6 pts), match/switch 2, boolean chains 1 (nesting depth added 8). Of this number, 19 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":"crates/perry/src/commands/compile/targets.rs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f46f6c6b09fe74d0f202f9e2cb483e7b6cdbc9cfe5295149e0c970581f3186"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::run::android::inject_gradle_dependencies (cognitive 24): perry::commands::run::android::inject_gradle_dependencies has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (6 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/run/android.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"083d0b26b24c6579b656d5db1d7248263182f50fd03abbbd167d0b059888660d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::run::android::inject_android_deeplinks (cognitive 24): perry::commands::run::android::inject_android_deeplinks has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 3 (5 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/perry/src/commands/run/android.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b0d3dc367854d7500eb79ccffcb6a2cb50679754cb424ad1ab9513c936f505"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::run::resign::create_dev_profile_via_api (cognitive 24): perry::commands::run::resign::create_dev_profile_via_api has cognitive complexity 24 (threshold 15). Drivers by points: if/else 20 (24 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/perry/src/commands/run/resign.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e46bc4d339569f99782491fe4dc395625de402870acc2259111b216ae3f00e1"}},{"ruleId":"D2","level":"warning","message":{"text":"Census::body (cognitive 24): Census::body has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 5 (11 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/perry-codegen/src/layout_families/late.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"65bb99016a1850279f1ac2a413d7948bb935d537b1db22cfa8e3817971027bc1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::boxed_vars::collect_let_types_in_stmts (cognitive 24): perry_codegen::boxed_vars::collect_let_types_in_stmts has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (4 pts), 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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe0f208b811c978adf626e528cdcbe805e3ca1aee24f51348410789d37e847f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::fn_info_facts::record_fn_info_facts (cognitive 24): perry_codegen::codegen::fn_info_facts::record_fn_info_facts has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 12 (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/perry-codegen/src/codegen/fn_info_facts.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a12abd9ae97b87104c052446e263dec793f7e325fd50195ca6f8efbacb8e63a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::integer_contract::prove (cognitive 24): perry_codegen::codegen::integer_contract::prove has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (18 pts), loops 1 (3 pts), boolean chains 2, match/switch 1 (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/perry-codegen/src/codegen/integer_contract.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8eece1ccba8e8a98a26b247815977d719f40f57762bd7db4a3db33c1ab95cc7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::param_guard::guarded_falsy_field_default_method_candidate (cognitive 24): perry_codegen::codegen::param_guard::guarded_falsy_field_default_method_candidate has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 14, if/else 8 (9 pts), match/switch 1 (nesting depth added 1). Most of this is not in the body itself: 11 of the 24 points are its own statements and the rest belongs to 3 function items inside it that branch (scan_only_direct_conditions, is_matching_prologue, field_default). 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/perry-codegen/src/codegen/param_guard.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b77600d1dc544983a35cb7da032c452f269e978a5a46aa148222e2ea8bbfb0d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::static_shape_ids::decode_static_seed (cognitive 24): perry_codegen::codegen::static_shape_ids::decode_static_seed has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, 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/perry-codegen/src/codegen/static_shape_ids.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de9d3a0e421cc568cf858175ace4c4bd23a7598df20bd8dcd71b20a592e7162"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::typed_abi::typed_receiver_chain_fields (cognitive 24): perry_codegen::codegen::typed_abi::typed_receiver_chain_fields has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 6, match/switch 2 (5 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/perry-codegen/src/codegen/typed_abi.rs"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d73ad044b83dec96870c6c749666ad8729ece02c352ed3e2a162805ebc055e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::hot_callees::count_alloc_sites_in_stmts (cognitive 24): perry_codegen::collectors::hot_callees::count_alloc_sites_in_stmts has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (4 pts), 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/perry-codegen/src/collectors/hot_callees.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"6355d9dfdc64a743d48896b2f0e25c9a68496ae1903744dcde2e7755b4053f2d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::int_valued_ta_locals::collect_int_valued_ta_locals (cognitive 24): perry_codegen::collectors::int_valued_ta_locals::collect_int_valued_ta_locals has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 7, loops 5 (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/perry-codegen/src/collectors/int_valued_ta_locals.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86d4a28565e21d7396a8fc568e9747442519440013e9d6394caaf4935b2c919"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::int_valued_ta_locals::collect_loop_reseeded_locals (cognitive 24): perry_codegen::collectors::int_valued_ta_locals::collect_loop_reseeded_locals has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (21 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/int_valued_ta_locals.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef0222b68acc836e5b785e19d16febc39319ea2fa70f0dced1484776049f084"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_numeric::collect_numeric_by_construction_locals_in_region (cognitive 24): perry_codegen::collectors::ptr_shape_numeric::collect_numeric_by_construction_locals_in_region has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 5 (7 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/ptr_shape_numeric.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2f78949d92c9631de2c94c79538c544928966772584c4d2e2640ad14e4ec6d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::typed_locals::lets_in_loops::walk (cognitive 24): perry_codegen::collectors::typed_locals::lets_in_loops::walk has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/typed_locals.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d857629b7a0c7d98bbd02d4fdf2bb762d5074f21a84c0194deedd059717fdc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::binary::lower_arithmetic_operand (cognitive 24): perry_codegen::expr::binary::lower_arithmetic_operand has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (23 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/perry-codegen/src/expr/binary.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37d6c060498bd4dbee4b02164eb2e77c4a496ab458264f0de4e62eeb7acd2b6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::inprocess::native_homes::split_slow_arms (cognitive 24): perry_codegen::inprocess::native_homes::split_slow_arms has cognitive complexity 24 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (7 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/inprocess/native_homes.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"3067cd890bc0a71ee19949e1ed6cb1496b5ed807d2a6a2ddd82dae3af8f5d48b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_desc::walk_stmts (cognitive 24): perry_codegen::layout_desc::walk_stmts has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (4 pts), 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/perry-codegen/src/layout_desc.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"1229a0ce0a16e1e8d97078e4359248b09dbdb0e4b1a70e2470e99ba9b6e8e227"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_desc::array_families::stmts_mut (cognitive 24): perry_codegen::layout_desc::array_families::stmts_mut has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (4 pts), 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/perry-codegen/src/layout_desc/array_families.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed8865c968e3e6e1d67375a05216df77c8e1fd607c4de2511a8fc4e8a2549d7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_desc::create_families::program_proto_exports (cognitive 24): perry_codegen::layout_desc::create_families::program_proto_exports has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 3 (6 pts), match/switch 1 (4 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/perry-codegen/src/layout_desc/create_families.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e62c64e6f328155a42549934f5c6568dfc4316b0a5a017ef5fee119cea1bd8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_families::assign_slots::assign (cognitive 24): perry_codegen::layout_families::assign_slots::assign has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (4 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/perry-codegen/src/layout_families.rs"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df369788f51615547a59a683dc66944f2dd3b9ce52ddbe70e0ebb5c76016e7b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::linker::compile_ll_inprocess_in (cognitive 24): perry_codegen::linker::compile_ll_inprocess_in has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (21 pts), match/switch 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/linker.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde26f643274c4f5a5dcb197b7e0050e627c22f09e50af17663617a6440dede1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::ctor_prologue_stores::prologue_store_plan (cognitive 24): perry_codegen::lower_call::ctor_prologue_stores::prologue_store_plan has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 6, 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/perry-codegen/src/lower_call/ctor_prologue_stores.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3f8e1a9736e6a5cc7ac35ed59106db944125efe0b29a486ee14f67cee5d138"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::element_shape_loop::element_shape_loop_pure_expr_collect (cognitive 24): perry_codegen::stmt::element_shape_loop::element_shape_loop_pure_expr_collect has cognitive complexity 24 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 4 (9 pts), boolean chains 6 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/element_shape_loop.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8890e169fefc4bc0b85eba7088b3b18689f8e854678d87047abc992060c571f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::if_stmt::lower_if (cognitive 24): perry_codegen::stmt::if_stmt::lower_if has cognitive complexity 24 (threshold 15). Drivers by points: if/else 19 (22 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/perry-codegen/src/stmt/if_stmt.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"270374bfffbfb5bd04ead2962504b82dcea8f561dc8a3432958c718cfed71b25"}},{"ruleId":"D2","level":"warning","message":{"text":"SocketOwner::raw_option (cognitive 24): SocketOwner::raw_option has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 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/perry-component-host/src/sync_wasi/sockets.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"165a6a08b4c4af6334846ea3f21d416453c04ecebe92eea2144914e86f9dd3e3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::agent::release_request (cognitive 24): perry_ext_http::agent::release_request has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (21 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, 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/perry-ext-http/src/agent.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6e4129d9ee754bec40895a4844d71a17335d5bcc7a76bc205931eaed220f95"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::client_events::handle_response_end_event (cognitive 24): perry_ext_http::client_events::handle_response_end_event has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (8 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/perry-ext-http/src/client_events.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d26ccddb78441aa277aa4a48036dda0d053827566d402020ec48e2f8f1f311a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::client_overload::parse_client_args (cognitive 24): perry_ext_http::client_overload::parse_client_args has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (22 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/perry-ext-http/src/client_overload.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20a278173648772a68322a35257c95730c6ef45ff54865eee80281f3600bb09"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::response_headers::build_response_headers_object (cognitive 24): perry_ext_http::response_headers::build_response_headers_object has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (3 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/perry-ext-http/src/response_headers.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae900fa238dc775208e7bc62979ee23878e25637056797c93b30952b282124ae"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::types::jsvalue_to_body_bytes (cognitive 24): perry_ext_http::server::types::jsvalue_to_body_bytes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (23 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/perry-ext-http/src/server/types.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece843345ab7f00c8cb7d1fbe3cb52673f2fab37fa8540cdb96ce0ad0afc3905"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_net::payload_socket::connect (cognitive 24): perry_ext_net::payload_socket::connect has cognitive complexity 24 (threshold 15). Drivers by points: if/else 19 (21 pts), boolean chains 2, 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/perry-ext-net/src/payload_socket.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3d8f17302c3fd8edc0633eeb7ef451a5f983af8d8a3b9fe185f70cae1a216c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_ws::scan_ws_roots (cognitive 24): perry_ext_ws::scan_ws_roots has cognitive complexity 24 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 5 (10 pts) (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/perry-ext-ws/src/lib.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c00c11f779795e74bcebbbbc9ab56599181b12a5f9108f78f187c30012768fe"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::const_fold_fn::try_const_fold_eval (cognitive 24): perry_hir::lower::const_fold_fn::try_const_fold_eval has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 3 (6 pts), boolean chains 5, loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/const_fold_fn.rs"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2de1592480a9e88d21b065a17df00c19c90faa898131c0267daf9f31a2b8e9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::post_args_dispatch::try_proxy_call (cognitive 24): perry_hir::lower::expr_call::post_args_dispatch::try_proxy_call has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (24 pts) (nesting depth added 17). 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/perry-hir/src/lower/expr_call/post_args_dispatch.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f151a0ac03f833053178629c5b4fdc8f39add55f2be26f370b6759e4523532c9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::lower_expr::reactive_text::try_desugar_reactive_text (cognitive 24): perry_hir::lower::lower_expr::reactive_text::try_desugar_reactive_text has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 4 (5 pts), boolean chains 1, 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/perry-hir/src/lower/lower_expr/reactive_text.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c5c2063f4bf0ac8aad846d2ca7e9fedfdd6ba9856dd1b32e3a8a76dfcef922"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::module_decl::register_exported_local_variables (cognitive 24): perry_hir::lower::module_decl::register_exported_local_variables has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 15). Of this number, 15 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/perry-hir/src/lower/module_decl.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47663ae7390e5a5fd70f3b8ce89591a89a6d0fe422f93be80a756e370b0ec01"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::typed_parse::extract_typed_parse_source_order (cognitive 24): perry_hir::lower::typed_parse::extract_typed_parse_source_order has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 3 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/typed_parse.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bdf7bf0a5d17a361f621dd33789e4589cb4e5507c7b703ee57651a3bbd9b275"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_types::url_encoding_constructor_type (cognitive 24): perry_hir::lower_types::url_encoding_constructor_type has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 3, boolean chains 1 (nesting depth added 11). Of this number, 22 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. 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/perry-hir/src/lower_types.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cec03f91474d32e0f798894206ed0c45161ca1e48115bf5f99c8aa271dd5bd8"}},{"ruleId":"D2","level":"warning","message":{"text":"RememberedSetRootMarkState::step (cognitive 24): RememberedSetRootMarkState::step has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 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/perry-runtime/src/gc/barrier/remembered_mark.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62e8b506de06978a3cba3521bac66adfc5675928398d93d1ba620813c889668"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::generic_object::object_splice (cognitive 24): perry_runtime::array::generic_object::object_splice has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 5 (8 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/perry-runtime/src/array/generic_object.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"141120fe45074d4c3f1f2c546491eb01c5b33a399a632f58fd6980bdebcd879d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::immutable::js_array_to_spliced (cognitive 24): perry_runtime::array::immutable::js_array_to_spliced has cognitive complexity 24 (threshold 15). Drivers by points: if/else 19 (21 pts), loops 3 (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/perry-runtime/src/array/immutable.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"65216acd0da4632388d5c5f3e6aebb1ca1753337bfdc6ac3eb363fe48575dbd3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::builtins::globals::percent_decode (cognitive 24): perry_runtime::builtins::globals::percent_decode has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 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/perry-runtime/src/builtins/globals.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26054a121db671b89c782c53489c7eef0e424731bd402250124c82e93327f4d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::builtins::numbers::float_prefix_end (cognitive 24): perry_runtime::builtins::numbers::float_prefix_end has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 11, if/else 6 (8 pts), loops 3 (5 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/perry-runtime/src/builtins/numbers.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"40805390205b08ec5803812fcdc3aa45bd88c8f21e72f5381ade55954f2410a9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::child_process::sync_run::cp_run_to_completion (cognitive 24): perry_runtime::child_process::sync_run::cp_run_to_completion has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 6 (9 pts), boolean chains 6 (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/perry-runtime/src/child_process/sync_run.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"b891b1ef5fd25842c268e5d180a0a4512e2509d1ec4ff0689335d43f93ec0b79"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::fs::fd_ops::js_fs_readv_sync (cognitive 24): perry_runtime::fs::fd_ops::js_fs_readv_sync has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 2 (3 pts), match/switch 1 (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/perry-runtime/src/fs/fd_ops.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db2f419c01fbc15ae9ad22e872451324d7bb59741ff307a9feed57c6597c1f7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::i18n::perry_i18n_interpolate (cognitive 24): perry_runtime::i18n::perry_i18n_interpolate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (6 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/perry-runtime/src/i18n.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8191929580ce1427fdbd21c25d2b3516764aef6be12098085b14616a8a2ffb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::date_collator::date_time_format_resolved_options_object (cognitive 24): perry_runtime::intl::date_collator::date_time_format_resolved_options_object has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (21 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/perry-runtime/src/intl/date_collator.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47f7ef54ed08ed7702c27283c5922697fedc78db4bbf369c29c2f9cd9c6b6d5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::module_require::require_path (cognitive 24): perry_runtime::module_require::require_path has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (23 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/perry-runtime/src/module_require.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"6994fd9aba8244c9bf116c06c2ae5fedc76b9341723738930ef02cb66b673326"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::alloc::object_alloc_null_proto_with_key_attrs_and_inline (cognitive 24): perry_runtime::object::alloc::object_alloc_null_proto_with_key_attrs_and_inline has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 4 (8 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/perry-runtime/src/object/alloc.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"832a319f3df199fadc4649c1852b6f3189fb6af61f32e96b2c12ef0b08c18ce4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::construct::extends_target_must_throw (cognitive 24): perry_runtime::object::class_registry::construct::extends_target_must_throw has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (20 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/perry-runtime/src/object/class_registry/construct.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"35eef1010acca74bc89ad53dee00786dc284a462298af0ea5d4566459b7d65ea"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::gc_roots::scan_class_side_table_roots_mut (cognitive 24): perry_runtime::object::class_registry::gc_roots::scan_class_side_table_roots_mut has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 4 (12 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/perry-runtime/src/object/class_registry/gc_roots.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d23b5c4382efe251f0e4cbf5e2cfd628504746c46a6f79afbdc92ee15e9bb9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::enumeration::keys_contain_array_index (cognitive 24): perry_runtime::object::field_get_set::enumeration::keys_contain_array_index has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (4 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/perry-runtime/src/object/field_get_set/enumeration.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cfbba92701bd755fd832afefb4eb57ca6566fde8271b6d9a444cecb26936fa"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_module::scan_native_callable_export_roots_mut (cognitive 24): perry_runtime::object::native_module::scan_native_callable_export_roots_mut has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14, loops 9 (10 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/perry-runtime/src/object/native_module.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"a917690062eb874ee59134eff9ece7f17d1da3184dbd263a1ea5b607ce72ee05"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_module::constructor_shapes::install_event_emitter_statics (cognitive 24): perry_runtime::object::native_module::constructor_shapes::install_event_emitter_statics has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/native_module/constructor_shapes.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b22155347b41104d915e86eeca633778142adc061be90a478fd8db51575b46"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_module::vtable_impls::vt_get_own_field (cognitive 24): perry_runtime::object::native_module::vtable_impls::vt_get_own_field has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (22 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/perry-runtime/src/object/native_module/vtable_impls.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d33472eab6563091a8aab4c02046000b0c372930f64969b03139a2c50ab0aea"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::spread::birth_slow (cognitive 24): perry_runtime::object::spread::birth_slow has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 2 (5 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/perry-runtime/src/object/spread.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"b421dfdfbe3c572b2916d187858cf8adbeeeec0784ca75feb496da2be7074dcf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::path::normalize_str (cognitive 24): perry_runtime::path::normalize_str has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (21 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/perry-runtime/src/path.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2b62126c762f0f55cbcdecfebc89bdc6f7b2a3f1510106613cc6f3b14114e2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::process::node_module::find_nearest_package_json (cognitive 24): perry_runtime::process::node_module::find_nearest_package_json has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 2 (4 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/perry-runtime/src/process/node_module.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"23fec9d27b40b617fafbe1596ff91be347a9121e3107f3d62b8c3ac446a49b7f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::process::node_module::source_map::source_map_lookup (cognitive 24): perry_runtime::process::node_module::source_map::source_map_lookup has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/process/node_module/source_map.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"993da46dba3d1342be3f02463286ba19118d1f322e65fa62b517ca912e54cec8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::punycode::decode (cognitive 24): perry_runtime::punycode::decode has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4 (5 pts), 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/perry-runtime/src/punycode.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"867f9e61625e18b6a3a2c2f2dd5379e52f62e1cbf7b84ccd29afc860ec919c01"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::regex::perex_substitution::scan (cognitive 24): perry_runtime::regex::perex_substitution::scan has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 3, match/switch 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":"crates/perry-runtime/src/regex/perex_substitution.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71056789f89717fe815d4b0594d365af9b998539723304527d27472c1fc2018"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::url::node_compat::file_url_to_path_bytes (cognitive 24): perry_runtime::url::node_compat::file_url_to_path_bytes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (21 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/perry-runtime/src/url/node_compat.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"6499efff9d307bcf67be557f5ee28f9c1f0876d009e2201c41138fa9444d854d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::util_parse_args::specs_from_value (cognitive 24): perry_runtime::util_parse_args::specs_from_value has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 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":"crates/perry-runtime/src/util_parse_args.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"e898afaee13c0a865189e1a20d5d27fb2d71f0d758298be51e7d062c1e2806c4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::streams::readable_pull_microtask (cognitive 24): perry_stdlib::streams::readable_pull_microtask has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/streams.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a28509ae1bd793a351021182130e4c1c7734d718f5e9f2a7d41d54d890a59f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::streams::subclass::dispatch_stream_method (cognitive 24): perry_stdlib::streams::subclass::dispatch_stream_method has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 4 (8 pts), boolean chains 5 (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/perry-stdlib/src/streams/subclass.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"3656661833c89e4b42a1987c612079f2c51e742275ce91e9796b5cad77d7493e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::turnloop_client::exchange::start_locked (cognitive 24): perry_stdlib::turnloop_client::exchange::start_locked has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 4 (8 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/perry-stdlib/src/turnloop_client/exchange.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"de85f92fd1c61d8a2f0acb35e26517bb62edd5d0c58675587f0d57ca949fa32a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::aggregate_scalar::collect_return_record_assignments (cognitive 24): perry_transform::aggregate_scalar::collect_return_record_assignments has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/aggregate_scalar.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cdf236690e8d74610862e7a85b5866e0a23e6844d045623b6c638954459a28d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::aggregate_scalar::collect_aliases (cognitive 24): perry_transform::aggregate_scalar::collect_aliases has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/aggregate_scalar.rs"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec59a2e3d075282e4c15af3b8be7c6d331438b8f5e307e788688b743a79020c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::break_continue::rewrite_escape_in_stmts (cognitive 24): perry_transform::generator::break_continue::rewrite_escape_in_stmts has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 2 (4 pts), boolean chains 1, 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/perry-transform/src/generator/break_continue.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43d8b0f42d73cd9df264d033cc8fda5c9587d5796d94607670e6e3d43f16df2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::prototype_birth::run (cognitive 24): perry_transform::prototype_birth::run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 5 (6 pts) (nesting depth added 11). Of this number, 19 points are the body\u0027s own statements and 5 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":"crates/perry-transform/src/prototype_birth.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ea9fc369870243d42a576162b1bead10e22a0e1ca114f846bd2aa6ffd2383a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_tvos::widgets::button::set_image (cognitive 24): perry_ui_tvos::widgets::button::set_image has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (23 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/perry-ui-tvos/src/widgets/button.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"3051bfb0c213aa170c6735f5b51c60cb8bce99c7883bfc93f3658f3fafc54536"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_visionos::widgets::button::set_image (cognitive 24): perry_ui_visionos::widgets::button::set_image has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (23 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/perry-ui-visionos/src/widgets/button.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea03215c0043f306eca813ff1bb2ec1c9239c72b48f7af6fe3c82a7f4e3afba"}},{"ruleId":"D2","level":"warning","message":{"text":"Emitter::lift (cognitive 24): Emitter::lift has cognitive complexity 24 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 7 (9 pts), match/switch 3 (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/perry-wit/src/guest_c/values.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6a900f6af1d556af8cf14245aba91d084f4cbeb1caa52ba3c54067830fc4cb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::dump::apply_sabotage (cognitive 24): perry_wpfacts::dump::apply_sabotage has cognitive complexity 24 (threshold 15). Drivers by points: loops 4 (10 pts), match/switch 4 (7 pts), if/else 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/perry-wpfacts/src/dump.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d609aa196fc1aaa1e7e090a82b16b291473cab55179685bf4b1f964f19af6f7"}},{"ruleId":"D2","level":"warning","message":{"text":"latest-main2026-normal-auto-driver.build_arm (cognitive 24): latest-main2026-normal-auto-driver.build_arm has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 6, loops 3 (5 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":"docs/audits/gc-rss-instructions-2026-10-03/latest-main2026-normal-auto-driver.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3104728074df2a0d8005b1bf9aa6c867379117c54afe3f9a495f82453e6bb890"}},{"ruleId":"D2","level":"warning","message":{"text":"summarize-gc-comparison.summarize (cognitive 24): summarize-gc-comparison.summarize has cognitive complexity 24 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 4 (8 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/audits/gc-rss-instructions-2026-10-03/summarize-gc-comparison.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"706bdeb4ca0f1f21d49bf404abce9c874a94e0db6ce4063581a7461f48ba2cea"}},{"ruleId":"D2","level":"warning","message":{"text":"i18n_merge_translations.main (cognitive 24): i18n_merge_translations.main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 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":"docs/scripts/i18n_merge_translations.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0a0cf22fe9083a3441708fc1c7adff39a050c8a733b35bdb3755d3c4238a8a"}},{"ruleId":"D2","level":"warning","message":{"text":"check_npm_publish_freshness.self_test (cognitive 24): check_npm_publish_freshness.self_test has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (17 pts), loops 3 (4 pts), boolean chains 2, error handling 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check_npm_publish_freshness.py"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d851a635069c4306d36d8b2fe9ea717e519786826657e02d2bc81821a69845d"}},{"ruleId":"D2","level":"warning","message":{"text":"analyzers._selector_matches (cognitive 24): analyzers._selector_matches has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 12, if/else 8 (10 pts), loops 2 (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":"scripts/compiler_output_harness/analyzers.py"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f0ba5008d3a2c318c34457dd293c956a1a4fb0b5e7da89007ceea27df7e3bb"}},{"ruleId":"D2","level":"warning","message":{"text":"component_host_acceptance.main (cognitive 24): component_host_acceptance.main has cognitive complexity 24 (threshold 15). Drivers by points: loops 6 (11 pts), ternaries 6 (8 pts), if/else 4 (5 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/component_host_acceptance.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efe6a43428d4bf8d2125e5ccfd11ea00bfd5726d4cda8564d56527cebed0e75"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_1090_evidence_report.perf_summary (cognitive 24): gc_1090_evidence_report.perf_summary has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gc_1090_evidence_report.py"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4de709127d36851983fb7f115eeaaca38e9ce541fd501df9fbf8638e573486f"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_rekeyed_key_tables.collect_sites (cognitive 24): gc_rekeyed_key_tables.collect_sites has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gc_rekeyed_key_tables.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6c84833ac57e354515a21252268e3baf9e16fef09b04e2010d8dfeef85d90f"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.phi_replacing_edges (cognitive 24): gc_root_dominance_check.phi_replacing_edges has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (6 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":2087}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dadc34ade1fb0e8905f1b33a8df2dabe9473a27d83fa78af9c33a18a72b1917"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.local_flag_cells (cognitive 24): gc_root_dominance_check.local_flag_cells has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (6 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":3841}}}],"partialFingerprints":{"codehealthFindingId/v1":"977dc883a71da4c15d065086032f3303578aec156b47766af049cdcb3fac5950"}},{"ruleId":"D2","level":"warning","message":{"text":"package_bench_attr.analyze (cognitive 24): package_bench_attr.analyze has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9, ternaries 5 (7 pts), boolean chains 5, loops 3 (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":"scripts/package_bench_attr.py"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b193b619a72f99f79c026ad58777f962903c4a26ce6f52d8ad3d28807b675e"}},{"ruleId":"D2","level":"warning","message":{"text":"parity_normalize.normalize_parity_output (cognitive 24): parity_normalize.normalize_parity_output has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 pts), ternaries 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":"scripts/parity_normalize.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"706941d1dd775b1b9143f89cb0e9dc22c6662ea376a07c8dcc67c0af4f867a4e"}},{"ruleId":"D2","level":"warning","message":{"text":"sso_unbox_inventory.scan_codegen (cognitive 24): sso_unbox_inventory.scan_codegen has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/sso_unbox_inventory.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"386138571c56b52188a3c2049291b14019551ceae0d4ae170c4e9ad88a38215e"}},{"ruleId":"D2","level":"warning","message":{"text":"sso_unbox_inventory.main (cognitive 24): sso_unbox_inventory.main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 5 (10 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":"scripts/sso_unbox_inventory.py"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c815237269b8a0e2ee45424f36b5e8610f6c5ffc85ee4b9f8a26acfca5237dd"}},{"ruleId":"D2","level":"warning","message":{"text":"thread_exit_address_globals.scan (cognitive 24): thread_exit_address_globals.scan has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 5 (7 pts), ternaries 1 (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":"scripts/thread_exit_address_globals.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"0210dcf879e2ade3cd6ad79694e34c3d19ed1b7699cbc2b43b2fde763848af80"}},{"ruleId":"D2","level":"warning","message":{"text":"tls_budget_check.parse_report (cognitive 24): tls_budget_check.parse_report has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, loops 2 (3 pts), ternaries 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":"scripts/tls_budget_check.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7af4593a1bc6e976ebce56e3c28082fee6ebb3b3f5cecfb91150820bc2c4ce5"}},{"ruleId":"D2","level":"warning","message":{"text":"tokio_inventory.wasi_fixture_problems (cognitive 24): tokio_inventory.wasi_fixture_problems has cognitive complexity 24 (threshold 15). Drivers by points: loops 6 (15 pts), if/else 2 (7 pts), boolean chains 2 (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":"scripts/tokio_inventory.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea8e70a58c43fed74dba7eea8cc089cb3b10123fef5444f857e16da54d16344"}},{"ruleId":"D2","level":"warning","message":{"text":"Solver.store_into (cognitive 24): Solver.store_into has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, ternaries 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":"scripts/wpfacts_recompute.py"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eec82487352eaf2d272674c56bbec5474005e6d919c89383fce1a670b0b2316"}},{"ruleId":"D2","level":"warning","message":{"text":"external-tools.checkPins (cognitive 24): external-tools.checkPins has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 4, loops 2 (3 pts), 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":"scripts/soak/external-tools.mts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"992df85fc299d6185dafa94a3530519cf5c559fccd7b76bb27cc7d5fca57973b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_audio_play (cognitive 24): perry_audio_play has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 2 (6 pts), boolean chains 4, ternaries 2 (nesting depth added 8). Of this number, 20 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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4392}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6987231b4c4ea55623a181dfd1916079b1e2a7238996cc19bae59f08acc9197"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::audit::display_audit_results (cognitive 23): perry::commands::audit::display_audit_results has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 3 (7 pts), match/switch 2 (3 pts) (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/perry/src/commands/audit.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"d802e4efded6890896f468f3e2cd2a350447cbddf3df1f5b25fa3bbab3875bd9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::collect_modules::source_prep::prepare_from_raw (cognitive 23): perry::commands::compile::collect_modules::source_prep::prepare_from_raw has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4, loops 2 (3 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/perry/src/commands/compile/collect_modules/source_prep.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4557a6d6c476c24a3ad7f5da9ada9aa581b9124f80f59526c19d13c8453f9d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::collect_modules::static_require_transform::resolve_static_require (cognitive 23): perry::commands::compile::collect_modules::static_require_transform::resolve_static_require has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (22 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":"crates/perry/src/commands/compile/collect_modules/static_require_transform.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"06821fe58497309d228f7326c6aa0150eceb33aa21a0ae8ac95dc286945d8328"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::reachability::rewrite_pruned_edges (cognitive 23): perry::commands::compile::reachability::rewrite_pruned_edges has cognitive complexity 23 (threshold 15). Drivers by points: loops 4 (9 pts), match/switch 2 (8 pts), if/else 2 (5 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/perry/src/commands/compile/reachability.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c693d98b956b35dd6197ff566e2a1fb9928f95881b372fa92b7fd363311cfa"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::resolve::resolve_package_entry (cognitive 23): perry::commands::compile::resolve::resolve_package_entry has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 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":"crates/perry/src/commands/compile/resolve.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dac300a63626e52552eaf9d3b3409e16872740d393436be6e5279d09a396088"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::strip_dedup::strip_duplicate_objects_from_well_known_lib (cognitive 23): perry::commands::compile::strip_dedup::strip_duplicate_objects_from_well_known_lib has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3, 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/perry/src/commands/compile/strip_dedup.rs"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba4acbf476d068308ffb26358d56be85a77922a0b7f425985ad62009d3db3eb"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph::propagate (cognitive 23): Graph::propagate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 6 (11 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/perry-codegen/src/layout_desc/array_families.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76c0baf897605b8287472bd06ef32681cd3d306d78daeaa11a6c48f79a291d6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::boxed_vars::collect_self_recursive_closure_ids (cognitive 23): perry_codegen::boxed_vars::collect_self_recursive_closure_ids has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (4 pts), 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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a206b895720624cfaa4108a2de0b8a06147d196692c894f114e2a4512d899de"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::escape_check::find_new_candidates (cognitive 23): perry_codegen::collectors::escape_check::find_new_candidates has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (4 pts), boolean chains 2, 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/perry-codegen/src/collectors/escape_check.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89709819eb4ebeb9dc77a56bd4b12a28bc04268dc510a4c1c20f27d9e30fec0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::proven_args::method_proven_shape_args (cognitive 23): perry_codegen::collectors::proven_args::method_proven_shape_args has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 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/perry-codegen/src/collectors/proven_args.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a990194ddeacb97d803e78a8bff48544de0c2589164d2348631f9e9e69bc9cb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::read_before_write::da_expr (cognitive 23): perry_codegen::collectors::read_before_write::da_expr has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (2 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/perry-codegen/src/collectors/read_before_write.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98f9d06e6dbcf30cab1b36e166a6118f732283dc375ea0502fc57e8ad1c96c5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::eh_mode::rewrite_phi_predecessors (cognitive 23): perry_codegen::eh_mode::rewrite_phi_predecessors has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/eh_mode.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"222b762c80c5de53266dba0ffdb72198a847e31c2b1a3691ea94bfe017f4f88a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::class_env::lower (cognitive 23): perry_codegen::expr::class_env::lower has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 3 (6 pts) (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/perry-codegen/src/expr/class_env.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddf0d8e6ff5b8e9e1e06cb756905efd536dd56a900f1a381514837a68079232"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::i32_fast_path::try_lower_flat_const_index_get (cognitive 23): perry_codegen::expr::i32_fast_path::try_lower_flat_const_index_get has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 3, 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/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16afe47098fc797fccbe899f980c8c5b932eb6a8fdea5ddee4b6f40d5ab4c02"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_desc::methods::emit (cognitive 23): perry_codegen::layout_desc::methods::emit has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (6 pts), match/switch 1 (2 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/perry-codegen/src/layout_desc/methods.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e5f10592fae869fc6ca567b42bcecef8ddb2482a685a1af020397f112443f6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::property_get::fetch_chain::try_lower_fetch_chain (cognitive 23): perry_codegen::lower_call::property_get::fetch_chain::try_lower_fetch_chain has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/property_get/fetch_chain.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e216c4a0897d766b1d2875647876ab422d89db176b150ddb015142f7713ca1ce"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::ui_tables::lower_ui_args_by_kind (cognitive 23): perry_codegen::lower_call::ui_tables::lower_ui_args_by_kind has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (8 pts), loops 3, 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/perry-codegen/src/lower_call/ui_tables.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"523d97cd28baf10627ac18a28836c654838c2709a0de61d7a73f09383c0c0959"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::native_value::verify::abi::validate_buffer_span_pairs (cognitive 23): perry_codegen::native_value::verify::abi::validate_buffer_span_pairs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (perry_codegen::native_value::verify::abi::validate_pod_view_span_pairs) 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/perry-codegen/src/native_value/verify/abi.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"866d2988dab2e6eb8976d12badd481fd5483b99497205d10682ac0a04c75fd03"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::native_value::verify::abi::validate_pod_view_span_pairs (cognitive 23): perry_codegen::native_value::verify::abi::validate_pod_view_span_pairs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (perry_codegen::native_value::verify::abi::validate_buffer_span_pairs) 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/perry-codegen/src/native_value/verify/abi.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8c139d60833114dc1dffa3fc77e1ca561b58fdc28839397dca94909c42b4f0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::proto_constants::lower_class_holder_read (cognitive 23): perry_codegen::proto_constants::lower_class_holder_read has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 4 (6 pts), match/switch 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/perry-codegen/src/proto_constants.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"8080858132f0e179862e2fc7d2700e761e7d1c7ec427468be07f7a80fd93090d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::loops::match_strided_tagged_fill_loop (cognitive 23): perry_codegen::stmt::loops::match_strided_tagged_fill_loop has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (11 pts), match/switch 6 (9 pts), boolean chains 3 (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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"b303d552fac771a7dd60028eb88868ce2440b59303c5fccc5704d8ca86f34d7f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::loops::packed_f64_range_loop_pure_expr_collect (cognitive 23): perry_codegen::stmt::loops::packed_f64_range_loop_pure_expr_collect has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 5, match/switch 1 (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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":3121}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f4b91c16abec3e21a8cc70d3d913a6d17edaa8d50a8457bd9343762863c35b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::try_stmt::lower_try (cognitive 23): perry_codegen::stmt::try_stmt::lower_try has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (23 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/perry-codegen/src/stmt/try_stmt.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d26944b4d082e2ccd39fc956e99d2ce12c27c08131f694a61ccdee613ae7ff3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_arkts::emit_index_ets (cognitive 23): perry_codegen_arkts::emit_index_ets has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 7 (9 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/perry-codegen-arkts/src/lib.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"800d16a4d221efcaa260afd144d697c870865564b797324cfe520ce50ba2db25"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_arkts::inline::inline_calls_in_expr (cognitive 23): perry_codegen_arkts::inline::inline_calls_in_expr has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 6 (11 pts), loops 4 (8 pts), if/else 3 (4 pts) (nesting depth added 10). 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/perry-codegen-arkts/src/inline.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2f21e5648df12992dc87377e1c6797d81912e22645352dc2b916795cd78ae3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_arkts::inline::collect_local_ids_in_stmts (cognitive 23): perry_codegen_arkts::inline::collect_local_ids_in_stmts has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (20 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-arkts/src/inline.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"c974ac68993d7d2eb272f1746a7449531e476bead5be1ed176e6a1125543fe68"}},{"ruleId":"D2","level":"warning","message":{"text":"JsEmitter::emit_params (cognitive 23): JsEmitter::emit_params has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 9). Of this number, 21 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/perry-codegen-js/src/emit/decls.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"8168ca1d22632f515326d7c49d4187f07b622c9e98a57548b5aad4a88ca71e2a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_component_io::embedding::option (cognitive 23): perry_component_io::embedding::option has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-component-io/src/embedding.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eff1c713759a91a669d395d05cf70838de53055ce35f9ccbffe3e9909bd77a1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_better_sqlite3::params_from_array (cognitive 23): perry_ext_better_sqlite3::params_from_array has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (20 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/perry-ext-better-sqlite3/src/lib.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07020f1409c1ab1f56497c4ef467565e4015dcc56dae9fffced174f53da70b6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::client_turnloop::prepare (cognitive 23): perry_ext_http::client_turnloop::prepare has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (22 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/perry-ext-http/src/client_turnloop/mod.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4e9cfcfd57c5a531dd2dde0dbad85ef0d1aba63cc4d7d5e6f98d91957e5025"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::root_scanner::scan_http_roots (cognitive 23): perry_ext_http::root_scanner::scan_http_roots has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 7 (10 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/perry-ext-http/src/root_scanner.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7af791691374a01e73bbac8c24f728d046da28878b4956cf1e9850e8809f572"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::bun_server::process_pending_promises (cognitive 23): perry_ext_http::server::bun_server::process_pending_promises has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 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/perry-ext-http/src/server/bun_server.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"f779c783e9dd7fa2bc63dd33424950f3245fa922b9befd2e4cad72ab7de0ba40"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::server::process_pending (cognitive 23): perry_ext_http::server::server::process_pending has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 2 (3 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/perry-ext-http/src/server/server.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c444c8d9e710499e34235efcb0606fcd649a5e71ddb173a70ab1a0ffbca065d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::turnloop_h2::conn::flush (cognitive 23): perry_ext_http::server::turnloop_h2::conn::flush has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 2 (4 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":"crates/perry-ext-http/src/server/turnloop_h2/conn.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6709fbd1fa92f2306aead61ea10cb84dad1b89b1924cf6723220b70ad8c78fe"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::analysis::remap_local_ids_in_stmt_propagating (cognitive 23): perry_hir::analysis::remap_local_ids_in_stmt_propagating has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (4 pts), match/switch 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. This shape REPEATS in the file: one other method here (perry_hir::analysis::remap_local_ids_in_stmt) 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/perry-hir/src/analysis.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae8e9c480c9852d95ba58bdfaf842cdeba0f9e08764e10db999e8298d8a0367"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::analysis::remap_local_ids_in_stmt (cognitive 23): perry_hir::analysis::remap_local_ids_in_stmt has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (4 pts), match/switch 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. This shape REPEATS in the file: one other method here (perry_hir::analysis::remap_local_ids_in_stmt_propagating) 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/perry-hir/src/analysis.rs"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"b738a2f00b425210401836b3ab77a7bd74d9e03b62ab7001b4c24731b33084f4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::analysis::fn_infer::apply::apply_param_types (cognitive 23): perry_hir::analysis::fn_infer::apply::apply_param_types has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 5 (7 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/perry-hir/src/analysis/fn_infer/apply.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f011da487e75f0e5385de9a515cda394563fe3eaedde8ccab21d362e8e0f7b4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::js_transform::local_natives::detect_native_instance_creation_with_context (cognitive 23): perry_hir::js_transform::local_natives::detect_native_instance_creation_with_context has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 3 (9 pts) (nesting depth added 14). 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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"18dfe0ef9b5e781d1c53734aaeb8e163a944e8aa383d4933de2aab2a689e1f1d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::const_fold_fn::try_indirect_eval_general (cognitive 23): perry_hir::lower::const_fold_fn::try_indirect_eval_general has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 2 (3 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/perry-hir/src/lower/const_fold_fn.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d766b788aac4cc01c9c78b9c6e146a17c8a568703965ebb077777f50dce8a6f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::nested_namespace::try_punycode_ucs2_namespace (cognitive 23): perry_hir::lower::expr_call::nested_namespace::try_punycode_ucs2_namespace has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (21 pts), boolean chains 2 (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/perry-hir/src/lower/expr_call/nested_namespace.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a6077defde980d128fa6d4a50b8c172bb32d61d88084f6ac5f7c41137a0aea"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::shared_mutable_capture::retype_capture_holders (cognitive 23): perry_hir::lower::shared_mutable_capture::retype_capture_holders has cognitive complexity 23 (threshold 15). Drivers by points: loops 8 (15 pts), if/else 3 (8 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/shared_mutable_capture.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dce9fc67d284f640936c6711c1d4282718541cdc0ef1977679d125bc47cf270"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::stmt::emit_for_of_pattern_binding (cognitive 23): perry_hir::lower::stmt::emit_for_of_pattern_binding has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 3 (8 pts), loops 2 (4 pts) (nesting depth added 14). 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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"9919bc8693600b628169885d89b8908fd40790b796d9c74ce2849052369460bf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::class_captures::insert_stashes_before_returns (cognitive 23): perry_hir::lower_decl::class_captures::insert_stashes_before_returns has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (7 pts), match/switch 2 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_decl/class_captures.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"652717af08be369405917e81c47427fc58692633c4d03a461c5a86ca332082f9"}},{"ruleId":"D2","level":"warning","message":{"text":"CopyingNurseryCollector::move_young (cognitive 23): CopyingNurseryCollector::move_young has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 4, 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/perry-runtime/src/gc/copying.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcf04521415229100d7a6f9d975522f5ead182279ef5b25b08a7ec1cec7e227"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentTimers::sift_down (cognitive 23): AgentTimers::sift_down has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (20 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/perry-runtime/src/timer/store.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"485affda1ee57a804cc8a145f9958e44cc2a328dad14ac610cb326c40f56f6e3"}},{"ruleId":"D2","level":"warning","message":{"text":"Api::inventory_with_clock (cognitive 23): Api::inventory_with_clock has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (20 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/perry-runtime/src/tls/roots/macos.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebaad68e76ee6265dc59b53e7db9df91feaa209ae9e63a0dc73ac71177d6c65"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::arena::region::reservation::map (cognitive 23): perry_runtime::arena::region::reservation::map has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 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/perry-runtime/src/arena/region/reservation.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf31dfcc9074ac3fc745e545ab6ecaace4f50ae78ebbb7a78ae9bd473845383d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::from_concat::proxy_from::array_from_proxy (cognitive 23): perry_runtime::array::from_concat::proxy_from::array_from_proxy has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (20 pts), 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/perry-runtime/src/array/from_concat/proxy_from.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7cce67f0907123d9f030eb2d615a825dc34bb5239737087ec4ef3795f11ba25"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::iter_object::dispatch_array_iterator_method_inner (cognitive 23): perry_runtime::array::iter_object::dispatch_array_iterator_method_inner has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (20 pts), match/switch 2 (3 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/array/iter_object.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bef7d4d652d2a5550dc7023bac0aec65be8e71a07cd9423f528c74bcdf99c9b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::numeric_range::array_numeric_range_add_impl (cognitive 23): perry_runtime::array::numeric_range::array_numeric_range_add_impl has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/array/numeric_range.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"37857b41808d6074bab2070d40cabd0c0d3d694b0442224a747662a156c208ce"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::fs::deferred::perform_deferred_fs_op (cognitive 23): perry_runtime::fs::deferred::perform_deferred_fs_op has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 4 (6 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/perry-runtime/src/fs/deferred.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"087016a61d4e71ffd554ed0623a6850ce2d4e99f03e9d34d25ee3de57ccd2dc7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::idle_reclaim::drive_active_cycle (cognitive 23): perry_runtime::gc::idle_reclaim::drive_active_cycle has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (22 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/perry-runtime/src/gc/idle_reclaim.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f462e41a1c805b2f4f86518be895dc5a27eae6cc212b01ff8e5488573c1ab8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::layout_slot_visit::visit_object_layout_slots (cognitive 23): perry_runtime::gc::layout_slot_visit::visit_object_layout_slots has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 1 (3 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/gc/layout_slot_visit.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66b107e5ea6034bce68a48e8bb10eba39402c4b8d0ca17589f7cf53b3bf3c5a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::oldgen::evacuation_policy_final_decision (cognitive 23): perry_runtime::gc::oldgen::evacuation_policy_final_decision has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 7 (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/perry-runtime/src/gc/oldgen.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a562ca12f17f1408671cd70ac7b4b80faa0e0f99e0f7f112d8d5c6f29aaaf0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::roots::stack_maps::verify_native_slots_post_walk (cognitive 23): perry_runtime::gc::roots::stack_maps::verify_native_slots_post_walk has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (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":"crates/perry-runtime/src/gc/roots/stack_maps.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83623ab3ca8322fb4b8908de3c2f8f9c9fb499299f3d24fca8dbcc7bf508de7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::format_number_parts (cognitive 23): perry_runtime::intl::format_number_parts has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (18 pts), loops 1 (3 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/perry-runtime/src/intl.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5ff8d0dce752179a00ff08e2db50eab000cd3779337933cedcb5f5c4c19d99"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::number_format::currency_instance_parts (cognitive 23): perry_runtime::intl::number_format::currency_instance_parts has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 10, if/else 8 (10 pts), loops 1 (2 pts), 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/perry-runtime/src/intl/number_format.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"7694647ac5fad4f132452a814c9d64b26e704ff8cf187e23b73893073729e66c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::stringify_primitive_array::emit_validated (cognitive 23): perry_runtime::json::stringify_primitive_array::emit_validated has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/json/stringify_primitive_array.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3f5cc745c819859d433c300edd268675a6e04d85225f6475b7f75435f9236a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::stringify_record_output::emit_cached_record_uncached (cognitive 23): perry_runtime::json::stringify_record_output::emit_cached_record_uncached has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (8 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/perry-runtime/src/json/stringify_record_output.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"7880d6ce889ecad7841e9d046d30610b5718921f995783ec24de413cfc337c6f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json_tape::scan::skip_string (cognitive 23): perry_runtime::json_tape::scan::skip_string has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (19 pts), 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/perry-runtime/src/json_tape/scan.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffbbd91059beed38dc4210b3712d39d1f07485b38a162cfc66bf80194ef387a2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::map::compact_map_entries (cognitive 23): perry_runtime::map::compact_map_entries has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (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/perry-runtime/src/map.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7bcc8753ed2362e8a229e3d8fd9858b48604e4e4555cad5660cbb36118a12d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::alloc::js_object_copy_own_fields (cognitive 23): perry_runtime::object::alloc::js_object_copy_own_fields has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 4, loops 1, match/switch 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/perry-runtime/src/object/alloc.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e6ef3a4a01d8ee4d5d0605407598c3affe853c2c7d99238d955947e090648a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::class_registry_census (cognitive 23): perry_runtime::object::class_registry::class_registry_census has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 3 (6 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/perry-runtime/src/object/class_registry.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"c701ca6a3df958091242babb16d9c70877a8f16eecfbdf828df8c859d7f66e8f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::state::class_own_string_member_names (cognitive 23): perry_runtime::object::class_registry::state::class_own_string_member_names has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (21 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/perry-runtime/src/object/class_registry/state.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d6b01eab5e459540c5ff7a29fdf1d27be8c1ae6d56a75c7c71b35c54248d44"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::define_own_data::define_other (cognitive 23): perry_runtime::object::define_own_data::define_other has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 2, match/switch 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":"crates/perry-runtime/src/object/define_own_data.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75a8ec6553c219a5a8adca67a0fe6e54626a12f48e865159114f522c1054bf2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::descriptors::class_ref_wtf8_own_property (cognitive 23): perry_runtime::object::descriptors::class_ref_wtf8_own_property has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (23 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/perry-runtime/src/object/descriptors.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"689b0592dcc7feefae19028e6ac10117d535883f1bb27834b07f586e1fb54fc8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_set_by_name::fast_paths::try_readd_stable_tombstone (cognitive 23): perry_runtime::object::field_set_by_name::fast_paths::try_readd_stable_tombstone has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 8 (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/perry-runtime/src/object/field_set_by_name/fast_paths.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"64eb295148ba0c1f15a32d4ad683083c11102df825b022259795517c0d1ed45d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::method_call::lookup_is_observable (cognitive 23): perry_runtime::object::method_call::lookup_is_observable has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 1 (4 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/perry-runtime/src/object/method_call.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ace36f2f3d6061dae6738bf108984227e419868694a9ef29af22deb1ad81b19"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_call_method::class_receiver_fast_guard (cognitive 23): perry_runtime::object::native_call_method::class_receiver_fast_guard has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (19 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/perry-runtime/src/object/native_call_method.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"48229e438cbafe11add065f8e70c7f59a28ee37c84266c5ae103ccb14183629b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::object_ops_frozen::js_object_is_frozen (cognitive 23): perry_runtime::object::object_ops_frozen::js_object_is_frozen has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (20 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, 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/perry-runtime/src/object/object_ops_frozen.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e81658fa70574ad5d6336ee0ab6dfd3b2a887c2ee899cf03fd199c4abaa5936"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::overflow::delete (cognitive 23): perry_runtime::object::overflow::delete has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 2 (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/perry-runtime/src/object/overflow.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a755bc7a64fcd72eeb40368e0c8d5be04379922dfe0c84016bc26c4c7a78d1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::property_ops::metadata::metadata_key_part (cognitive 23): perry_runtime::object::property_ops::metadata::metadata_key_part has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (23 pts) (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/perry-runtime/src/object/property_ops/metadata.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"b906b50209997e50b4d5aa63c3369b734a873d2bc56f6582265a53a251b2c182"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::proxy::reflect::proxy_get_own_property_descriptor (cognitive 23): perry_runtime::proxy::reflect::proxy_get_own_property_descriptor has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 5 (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/perry-runtime/src/proxy/reflect.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e978392d83525333575501b5ea7ad6ce9f946f37ccca93e9f65c87dd01b9a0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::set::js_set_symmetric_difference (cognitive 23): perry_runtime::set::js_set_symmetric_difference has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 2 (6 pts), loops 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/perry-runtime/src/set.rs"},"region":{"startLine":2152}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5490f3bf5366ceb5b7c109085d8632edec7d6a3d9b0f090957608de5ab6b8e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::set::index::key_identity (cognitive 23): perry_runtime::set::index::key_identity has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (21 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/perry-runtime/src/set/index.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"099db147f96ef41d86f741cbe616dc4989570a65714b89660cf856e8e1061aac"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::readline::pump::coalesce_escape_sequences (cognitive 23): perry_stdlib::readline::pump::coalesce_escape_sequences has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 1 (2 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/perry-stdlib/src/readline/pump.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b328594af3f9cd893ce1fa007ec8888b3f3ed43023e0de4ca9a0f4d13dc2ef"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::sqlite::database_sync::open_raw (cognitive 23): perry_stdlib::sqlite::database_sync::open_raw has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17 (22 pts), 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/perry-stdlib/src/sqlite/database_sync.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c228f3843a6dc050e6953455b257f90e3614861d429306c000340c6578bfb83"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::tls::module_api::js_tls_convert_alpn_protocols (cognitive 23): perry_stdlib::tls::module_api::js_tls_convert_alpn_protocols has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/tls/module_api.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bef32fa6d4808c2717a95d65e1d0d3767c53992f6f1cceebf10f5dcb790b148"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::turnloop_client::exchange::on_head (cognitive 23): perry_stdlib::turnloop_client::exchange::on_head has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 1 (4 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/perry-stdlib/src/turnloop_client/exchange.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b41cb2964f76bf7ef69fba56b4a231eb93ee2290631452a4877730ef5693056"}},{"ruleId":"D2","level":"warning","message":{"text":"Rewriter::stmts (cognitive 23): Rewriter::stmts has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (5 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/perry-transform/src/crypto_hash_chain.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcd3f9849e8a15473a30854b3003adbe4e73ecd70eff6bd07544e73046f7e4c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::async_to_generator::strip_in_stmt (cognitive 23): perry_transform::async_to_generator::strip_in_stmt has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/async_to_generator.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"074d60141c4a9d75dad8bfdebabcd9bc149b822bd3a7762c0b296bc9abce19bc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::async_to_generator::collect_async_step_closures (cognitive 23): perry_transform::async_to_generator::collect_async_step_closures has cognitive complexity 23 (threshold 15). Drivers by points: loops 9 (15 pts), if/else 3 (8 pts) (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/perry-transform/src/async_to_generator.rs"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2520ecd0b3ac4ef6f69397fef2e537029344437b4c3b1ea73e7a5bd5177337e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::private_frame::lower_list::ids (cognitive 23): perry_transform::generator::private_frame::lower_list::ids has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (5 pts), match/switch 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (perry_transform::generator::private_frame::lower_list, perry_transform::generator::private_frame::lower_list::catch_binders) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/perry-transform/src/generator/private_frame.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"4386c8254c50cdf39a87a704c9d50605346c33e003273efddfb172617570a334"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::imul::detect_math_imul_polyfill (cognitive 23): perry_transform::inline::imul::detect_math_imul_polyfill has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/inline/imul.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"018408150fa1fa0b855d37bb08a1214cd2410c313c7ee58d29028dd3fcc18848"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::substitute::substitute_locals_inner (cognitive 23): perry_transform::inline::substitute::substitute_locals_inner has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 3 (4 pts), loops 1 (2 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/inline/substitute.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"91130dfd4a66505c2c9de81091f603a5512b191c1f97903d087476cf2b55c5ab"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::unroll::refresh_in_expr (cognitive 23): perry_transform::unroll::refresh_in_expr has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 3 (7 pts), match/switch 2 (4 pts) (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/perry-transform/src/unroll/mod.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"a768f7b7662da6d8cc22bef345c3dc413d746d1c69631a4688830932c8efa6ed"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_gtk4::camera::schedule_frame_processing (cognitive 23): perry_ui_gtk4::camera::schedule_frame_processing has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 3 (4 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/perry-ui-gtk4/src/camera.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3d23311c8e8e1e0a9eab437f99f4c443618b612af0950b9457a5bc71176304"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_gtk4::drag_drop::deliver_drop (cognitive 23): perry_ui_gtk4::drag_drop::deliver_drop has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 3 (6 pts), 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/perry-ui-gtk4/src/drag_drop.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9912fe6ea3fba2a722881e3ca7dfd07d9d4e885df926ec91fe613b0fa44015"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_gtk4::widgets::set_alignment (cognitive 23): perry_ui_gtk4::widgets::set_alignment has cognitive complexity 23 (threshold 15). Drivers by points: loops 2 (8 pts), match/switch 2 (8 pts), if/else 4 (7 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/perry-ui-gtk4/src/widgets/mod.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3b974872df564e6ae35fe29fbbd69943904516cece17a06ca68cb3f6511a9e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_macos::app::register_global_hotkey (cognitive 23): perry_ui_macos::app::register_global_hotkey has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-macos/src/app.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a2534798e72ad2e6a9ceded8f7ba3c0a75618110ba217bc810cc3430b3e742"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_macos::pointer::handle_event (cognitive 23): perry_ui_macos::pointer::handle_event has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (4 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/perry-ui-macos/src/pointer.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9eb0ce45821a7e548b39149555403152d40b16c5031b34fa3ca6ed985a0dbf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_macos::widgets::max_width::set_max_width (cognitive 23): perry_ui_macos::widgets::max_width::set_max_width has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 4 (5 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":"crates/perry-ui-macos/src/widgets/max_width.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84a8d042d3733ae0bd3af817fce8a6467a674795f25758d788d838473966efd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::layout::measure_stack_intrinsic (cognitive 23): perry_ui_windows::layout::measure_stack_intrinsic has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, loops 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/perry-ui-windows/src/layout.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce260aceec7911db0b04ec1957086bab3bd9c8c6eacdf87a0b4b1c30c0b44f1c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wasm_host::tables::perry_wasm_host_instance_table_get (cognitive 23): perry_wasm_host::tables::perry_wasm_host_instance_table_get has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 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/perry-wasm-host/src/tables.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0093401acf3996937f366fd88e216e54266e7479fd9fa7956e9b7f34257b2bd3"}},{"ruleId":"D2","level":"warning","message":{"text":"Flat::call (cognitive 23): Flat::call has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 4 (7 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/decl_units.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcae0f9f82ddcb02de34eacce442037106ff8a50e9fe4489b3e8e3152df6bd31"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::register_fn (cognitive 23): Gen::register_fn has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 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/perry-wpfacts/src/gen.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"161e4dbe65ab666e2f8de2e7e855aad567b0272f7e469f86ff5a90333e192774"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::call_expr (cognitive 23): Gen::call_expr has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (10 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/perry-wpfacts/src/gen_call.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e81e588863e92df2c0c6c41c7c21faa1d46f493123ba44635fd0029a7f9a2d7"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::fill_instance (cognitive 23): Model::fill_instance has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 8, match/switch 2 (3 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/perry-wpfacts/src/summary.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"376dc5d750354249f9f37747ad5e33e6e9fbb0aae753f1659a38399d9f4b1c1a"}},{"ruleId":"D2","level":"warning","message":{"text":"check_statepoint_linear_size.main (cognitive 23): check_statepoint_linear_size.main has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 5 (7 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":"scripts/check_statepoint_linear_size.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0976e5e9f350f717bd1e4ec8ca306c95c76599a7e63e2f5bc9ba86c9e1a1f64"}},{"ruleId":"D2","level":"warning","message":{"text":"capture._native_rep_artifact_paths (cognitive 23): capture._native_rep_artifact_paths has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (3 pts), ternaries 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":"scripts/compiler_output_harness/capture.py"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"516f3ededb5787e944fd84252d55c0f919cd26ccd0e8b1dea25f1a87f42c35c0"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check._macro_defined_symbols (cognitive 23): gc_root_dominance_check._macro_defined_symbols has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (3 pts), ternaries 1 (3 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7db261b12dc4ddcef31f06be2ca736f83298f3e92ea11a561798a99c2eb35c6"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.dominators (cognitive 23): gc_root_dominance_check.dominators has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts), ternaries 1 (4 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":1982}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adc81fd4600bebc020d63219675340782f806a089d2862f128fff04701fff64"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.native_heap_source_kind (cognitive 23): gc_root_dominance_check.native_heap_source_kind has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), ternaries 1 (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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":4830}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb145d745359060b74cde4e8807292552bf8b24cabafd141debef6f031399ea1"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_store_site_inventory.run_self_tests (cognitive 23): gc_store_site_inventory.run_self_tests has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 9 (10 pts), ternaries 1 (2 pts), error handling 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":"scripts/gc_store_site_inventory.py"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"433bb5ae6f0e058505f1acafe35fdcd6750c08745e0b99c4175d820d4b2def95"}},{"ruleId":"D2","level":"warning","message":{"text":"global_sink_isolation.check_asserted (cognitive 23): global_sink_isolation.check_asserted has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 4 (7 pts), ternaries 1 (2 pts), boolean chains 1, error handling 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":"scripts/global_sink_isolation.py"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b0c73d6bbe57a2eaf386e16d8c17846500d78bddbc12ad709414eb5c553420"}},{"ruleId":"D2","level":"warning","message":{"text":"string_payload_access_inventory.main (cognitive 23): string_payload_access_inventory.main has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 5 (10 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":"scripts/string_payload_access_inventory.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a733150feeb55f873a857c0a05eae3abbc8d8daa7882639572c8b8c02f5acdb"}},{"ruleId":"D2","level":"warning","message":{"text":"tokio_inventory.lock_entries (cognitive 23): tokio_inventory.lock_entries has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (5 pts), boolean chains 1, 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":"scripts/tokio_inventory.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf75739204801b1dc07c032d27a03789cb7d930d1134eb54b9ca18c60c516fba"}},{"ruleId":"D2","level":"warning","message":{"text":"wpfacts_precision.static_sites (cognitive 23): wpfacts_precision.static_sites has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), error handling 1 (4 pts), ternaries 1 (3 pts), loops 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":"scripts/wpfacts_precision.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"905b58de4c15b9c3be0c6bb7c3e7fb9ffcebea57bd0f177bcd22ad5e8b9d81b4"}},{"ruleId":"D2","level":"warning","message":{"text":"class_call_method (cognitive 23): class_call_method has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 2 (7 pts), boolean chains 3, loops 1 (2 pts) (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/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"860b708a5b126f5084247321a692545dff5d5b8d66d69b9d576f5e528bd71b40"}},{"ruleId":"D2","level":"warning","message":{"text":"Scan::visit_named_export (cognitive 22): Scan::visit_named_export has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 2 (6 pts), 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/perry/src/commands/compile/cjs_wrap/family_syntax.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"114ba392140779ef7a8f2766d73930e4058e5f00abdc459d96b96913723f60ec"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::asset_modules::generate (cognitive 22): perry::commands::compile::asset_modules::generate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (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/perry/src/commands/compile/asset_modules.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad509fd331cdf4bf5f51c126e2b6cda98e655386a0832d8906379d88e3414f46"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::hoist_classes::identifier_used_as_value_outside (cognitive 22): perry::commands::compile::cjs_wrap::hoist_classes::identifier_used_as_value_outside has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 7, loops 3 (5 pts) (nesting depth added 7). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/cjs_wrap/hoist_classes.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"723432ecf4baec1c0768dd4b67796cd65fad51c0ccfc22d040e8e0341d1ea256"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::native_addon_sidecar::runtime_payload_file (cognitive 22): perry::commands::compile::native_addon_sidecar::runtime_payload_file has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 6 (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/perry/src/commands/compile/native_addon_sidecar.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2634978d83b8b0a3f749d90a40df1723c95516d6dd362d1b07effe5a8e58c8cb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::reachability::tree_shake (cognitive 22): perry::commands::compile::reachability::tree_shake has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 6 (10 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/perry/src/commands/compile/reachability.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7dcb96969bf06696b0b8a74b9857fcdc689734562008a31a1b03d5d3b58728"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::init::run (cognitive 22): perry::commands::init::run has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 12, if/else 10. 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/perry/src/commands/init.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c79ad87b789cf189620e5ebe9effcc91f5b243c5a2a535317d4b13cbdd21ba"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::run::devices::detect_booted_simulators (cognitive 22): perry::commands::run::devices::detect_booted_simulators has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (6 pts) (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/perry/src/commands/run/devices.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff659b03360145411b9e27027b02ef0de4ff27296f75f150070cb0b5ecb38b59"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::run::remote::extract_app_from_ipa (cognitive 22): perry::commands::run::remote::extract_app_from_ipa has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2, 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/perry/src/commands/run/remote.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4fcfe9ae8a4bf66320200bbefd87d80189a69fb545a28f0bae308f43efba16"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::setup::macos::export_cert_from_keychain (cognitive 22): perry::commands::setup::macos::export_cert_from_keychain has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 1, match/switch 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":"crates/perry/src/commands/setup/macos.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8ffe6391d3bb604ae83a71f3e2a2763c08acf5aa09d60f7543ea94af3321ee"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::update_checker::transactional_install (cognitive 22): perry::update_checker::transactional_install has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4, match/switch 1 (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/perry/src/update_checker.rs"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"129bd98af9e9f1e37169078f71bd93a7ca2e2a2a034d34df2597c8c8eca51cd2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_audio_miniaudio::perry_audio_play (cognitive 22): perry_audio_miniaudio::perry_audio_play has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (18 pts), match/switch 4 (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/perry-audio-miniaudio/src/lib.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9e43e9a795c13391aece63166ace7c63e2cbc757ba31a02e330abd185a486a"}},{"ruleId":"D2","level":"warning","message":{"text":"UseWalk::walk_stmt (cognitive 22): UseWalk::walk_stmt has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 1 (2 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/perry-codegen/src/collectors/ptr_numarray.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b79faf55aa763faeda96c667b05154bf8b67cab978d54b825c019bb61061b5"}},{"ruleId":"D2","level":"warning","message":{"text":"Env::kind (cognitive 22): Env::kind has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 4 (7 pts), boolean chains 6 (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/perry-codegen/src/collectors/typed_locals.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"d415ec68a35b16eb0ca5d3a3e74fde4fe8390ae465fa90d536bf96bc561342e7"}},{"ruleId":"D2","level":"warning","message":{"text":"Flow::expression (cognitive 22): Flow::expression has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/layout_desc/array_families.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ccd0ed63b13a01d4af761803129df754f597899bc13d9538e56306f882f0cf"}},{"ruleId":"D2","level":"warning","message":{"text":"Factories::walk_classes (cognitive 22): Factories::walk_classes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 4 (7 pts), match/switch 2 (6 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/perry-codegen/src/layout_families/late.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8c854d6dadafb35ca73bb4ef943f8315dd5800a75b1f293ab9e033b9a0e7e9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::boxed_vars::collect_outer_writes_in_expr (cognitive 22): perry_codegen::boxed_vars::collect_outer_writes_in_expr has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (8 pts), match/switch 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":"crates/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabe54fac3d81e30b8bf8718bf7bada0441b69541ff1dab75f03541685ea0490"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::boxed_vars::collect_write_ids_in_expr (cognitive 22): perry_codegen::boxed_vars::collect_write_ids_in_expr has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (8 pts), match/switch 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":"crates/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e14f81675cca32d8486e629e8091882cddb96ed6616fb891aa1b2b5c2493f50"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::boxed_locals::collect_module_boxed_vars (cognitive 22): perry_codegen::codegen::boxed_locals::collect_module_boxed_vars has cognitive complexity 22 (threshold 15). Drivers by points: loops 8 (14 pts), if/else 3 (8 pts) (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/perry-codegen/src/codegen/boxed_locals.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4b3e56431ee30b8fb54a7bf25f165b071f572dee9c4b106de30b5cbc4399a4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::function::normalize_clone_ir (cognitive 22): perry_codegen::codegen::function::normalize_clone_ir has cognitive complexity 22 (threshold 15). Drivers by points: loops 4 (7 pts), boolean chains 6, if/else 3 (6 pts), match/switch 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/perry-codegen/src/codegen/function.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"5813cf95f696b5fbd4cd0ac80f217c0e4f7e53fef8aa9951f73e50cc8cf8a23d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::helpers::emit_namespace_populator (cognitive 22): perry_codegen::codegen::helpers::emit_namespace_populator has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/helpers.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94d7b0a3e48e01d2772c67dc30786df887b618e7979086d51ab74e4927ad536"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::escape_arrays::collect_length_only_indices_in_expr (cognitive 22): perry_codegen::collectors::escape_arrays::collect_length_only_indices_in_expr has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (22 pts) (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/perry-codegen/src/collectors/escape_arrays.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee75f352d68c851cd35d1b7514473d76067e11ccd441537742a2ff63d9f9ee9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::escape_arrays::find_array_candidates (cognitive 22): perry_codegen::collectors::escape_arrays::find_array_candidates has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (4 pts), match/switch 1 (2 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/perry-codegen/src/collectors/escape_arrays.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"d222f66895703bca6a19c9d5a7647fcd9aff04f94cb7c183d4d841ea046141b9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::hot_callees::walk_expr (cognitive 22): perry_codegen::collectors::hot_callees::walk_expr has cognitive complexity 22 (threshold 15). Drivers by points: loops 8 (16 pts), match/switch 2 (4 pts), if/else 1 (2 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/hot_callees.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"2816948561cf8e41428578911919d5eb8fefd8b18002b819c4074425955e8b66"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::i32_locals::collect_integer_let_ids (cognitive 22): perry_codegen::collectors::i32_locals::collect_integer_let_ids has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (12 pts), boolean chains 4, loops 2 (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/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b1d8eed7fd1411d9e48ba2f3d2771448b7e6c9fbf20ab7dbcc2dc31b04d109"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::refs::collect_let_ids (cognitive 22): perry_codegen::collectors::refs::collect_let_ids has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (4 pts), 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/perry-codegen/src/collectors/refs.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d33525f7e9604144dc7cce0816368ec6200460b9c580bb5b61ef17fbb4b579"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::segview::max_local_id_in_module (cognitive 22): perry_codegen::collectors::segview::max_local_id_in_module has cognitive complexity 22 (threshold 15). Drivers by points: loops 9 (15 pts), if/else 2 (5 pts), match/switch 1 (2 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/perry-codegen/src/collectors/segview.rs"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd2752b05074b799df08b537cb9595fdd764a27c5b2efadefb48eb688a000d9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::straight_line_stores::count_in_stmt (cognitive 22): perry_codegen::collectors::straight_line_stores::count_in_stmt has cognitive complexity 22 (threshold 15). Drivers by points: loops 7 (16 pts), if/else 2 (5 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/straight_line_stores.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"69badecf9baf66ac0218f1ad92cb35ccfce5f7af5a9f59531f1bdac42bae06dd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::uppercase_strings::check_uses_in_expr (cognitive 22): perry_codegen::collectors::uppercase_strings::check_uses_in_expr has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 1 (2 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/perry-codegen/src/collectors/uppercase_strings.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa6463002f6f48b25c7b693337de1aad32951b7c4e2bb7e369af93ca1ba1d48"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::slot_rep::collect_canonical_str_ineligible_locals::scan_declared (cognitive 22): perry_codegen::expr::slot_rep::collect_canonical_str_ineligible_locals::scan_declared has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (4 pts), match/switch 1 (2 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. This shape REPEATS in the file: one other method here (perry_codegen::expr::slot_rep::collect_canonical_str_ineligible_locals) 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/perry-codegen/src/expr/slot_rep.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"7207aea7b4a940d0851584629443c0108967bbe1a8bcdd64e3f8422803186ac8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::typed_element::emit_store (cognitive 22): perry_codegen::expr::typed_element::emit_store has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 3 (8 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/perry-codegen/src/expr/typed_element.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0504ec28c05cd366fccafda93beec6a829acb8a045e88c1d0c42a410e7fc542"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_desc::function_families::collect (cognitive 22): perry_codegen::layout_desc::function_families::collect has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 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/perry-codegen/src/layout_desc/function_families.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3e8092794a8daf6a56daa826245628aac1247fc0bfd4ac06a021979340b139"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::loop_purity::collect_body_declared_locals (cognitive 22): perry_codegen::loop_purity::collect_body_declared_locals has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (4 pts), 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/perry-codegen/src/loop_purity.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba529c5f5f73b23d55fa1cfda73891c2dc177d5ffe5445cec139589ae20e5922"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::new_helpers::collect_decl_local_ids (cognitive 22): perry_codegen::lower_call::new_helpers::collect_decl_local_ids has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (4 pts), 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/perry-codegen/src/lower_call/new_helpers.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"396b7c22ed73baa78bef71fba31346db04225bad3a0e971431213bf32917fac3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::property_get::map_set::try_lower_map_set_methods (cognitive 22): perry_codegen::lower_call::property_get::map_set::try_lower_map_set_methods has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 6 (16 pts), if/else 4, boolean chains 2 (nesting depth added 10). 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/perry-codegen/src/lower_call/property_get/map_set.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"93bbea21fdc3e8cf4455a2ba54a96a55f2c954b2a3837cc4a5d73d8144158857"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::native_value::pod::compute_layout_from_specs (cognitive 22): perry_codegen::native_value::pod::compute_layout_from_specs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (7 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/perry-codegen/src/native_value/pod.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ff478630fd7c349d957ecff56c56991876057ae45f83692f9d1bfead04b883"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::root_reload::facts_of (cognitive 22): perry_codegen::root_reload::facts_of has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (8 pts), boolean chains 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/root_reload.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4a2d67b441e15281b86e5671bc718f15b080b17ee200e8dbf67147ec952d93"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::type_analysis_facts::lookup_codegen_named_property_inner (cognitive 22): perry_codegen::type_analysis_facts::lookup_codegen_named_property_inner has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 1 (2 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/perry-codegen/src/type_analysis_facts.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"258707c3be33c3693d9f4487b925247d131689c59ed1ec38cf026b722c48b425"}},{"ruleId":"D2","level":"warning","message":{"text":"Types::value (cognitive 22): Types::value has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 6 (9 pts), match/switch 2 (nesting depth added 9). 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/perry-component-host/src/async_values/reader_types.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"709319cda1557ec763c2802fc367e293c69191c7029abbd62e3c10db534bae54"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_component_host::async_values::reader_cleanup::visitors::emit (cognitive 22): perry_component_host::async_values::reader_cleanup::visitors::emit has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts), match/switch 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/perry-component-host/src/async_values/reader_cleanup.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5dde7b3aba75f68b6c15216551d54f8c590d22b5f83c63984412160bbc6a8e"}},{"ruleId":"D2","level":"warning","message":{"text":"DockerProtocol::run_args (cognitive 22): DockerProtocol::run_args has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11, loops 8 (11 pts) (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/perry-container-compose/src/backend/docker.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4370e2839fa5d393061c29087d91df37fa100964db367c03403b46a88d90fb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_better_sqlite3::dispatch_ext::call (cognitive 22): perry_ext_better_sqlite3::dispatch_ext::call has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 3 (7 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/perry-ext-better-sqlite3/src/dispatch_ext.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7978ce9b37f64179e4af8f42ea8b0163bb5a05b3c8da3cf527b5279c3834537"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::dispatch_request_snapshot (cognitive 22): perry_ext_http::dispatch_request_snapshot has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 1 (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/perry-ext-http/src/lib.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc0343d8f2733c5e49cf15250567db94c2d27e90030e2fb955c608630165ea8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::handle_dispatch::js_ext_http_server_response_dispatch_method (cognitive 22): perry_ext_http::server::handle_dispatch::js_ext_http_server_response_dispatch_method has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 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/perry-ext-http/src/server/handle_dispatch.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"90081375551549246d65c3d16d502e190a506a83475eae26e316f0b6f4ff299b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::response::js_node_http_res_write_full (cognitive 22): perry_ext_http::server::response::js_node_http_res_write_full has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (21 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/perry-ext-http/src/server/response.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"6659a25c53bee22629c496728b7c4c922a7cc0e1064bd20f0d5ec349994f6319"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::transport_error::fallback_errno (cognitive 22): perry_ext_http::transport_error::fallback_errno has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (21 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/perry-ext-http/src/transport_error.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"231b0d44aafb3654d079ef76dbf45e1c5c74eaf02b2c32ed8d0f6d98d45a137a"}},{"ruleId":"D2","level":"warning","message":{"text":"BunResolver::resolve (cognitive 22): BunResolver::resolve has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-typescript/src/bun.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"9736dcdba26c71eef46a7c779eb48a4d6cf07b5f0ba762fb9ebb1f3e3215ef4d"}},{"ruleId":"D2","level":"warning","message":{"text":"Zstd::read (cognitive 22): Zstd::read has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (4 pts), boolean chains 1, 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/perry-ext-zlib/src/stream/driver.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7aa67a465b2adff0b47c813b8abaa7adace0ec732ddb7c027f11494563971ea"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::dynamic_import::exported_bindings (cognitive 22): perry_hir::dynamic_import::exported_bindings has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (6 pts), loops 4 (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/perry-hir/src/dynamic_import.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"d683e4977cd5c5628d430004f42279effc17ed0b14ef96f44bfe6491bb87f311"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::jsx::lower_jsx_element (cognitive 22): perry_hir::jsx::lower_jsx_element has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 4 (9 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/perry-hir/src/jsx.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90ba38833b60e6bcac35fd7d65543987b1a597f2285744152c19c3c489b1b77"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::builder_fold::walk_stmt (cognitive 22): perry_hir::lower::builder_fold::walk_stmt has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (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/perry-hir/src/lower/builder_fold.rs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"772ec7f529f03ee0bf8fc1c559cbc357cadd9e910029915777e113a99471c2c7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::intrinsics::native_arena::try_native_arena_intrinsics (cognitive 22): perry_hir::lower::expr_call::intrinsics::native_arena::try_native_arena_intrinsics has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 5, 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/perry-hir/src/lower/expr_call/intrinsics/native_arena.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de8e7284a1b009339035b3353ae94181ae369f2b3c97d3d7d84995f2ce5217e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_object::lower_object::is_closed_shape (cognitive 22): perry_hir::lower::expr_object::lower_object::is_closed_shape has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 3 (8 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. This shape REPEATS in the file: one other method here (perry_hir::lower::expr_object::lower_object) 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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"663ae9d281584d189f6e439ab4aa2df1a328379450f84962e32161d592d1215d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::lower_module_fn::collect_assigned_function_binding_candidates::collect_from_expr (cognitive 22): perry_hir::lower::lower_module_fn::collect_assigned_function_binding_candidates::collect_from_expr has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (7 pts), boolean chains 1, match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (perry_hir::lower::lower_module_fn::collect_assigned_function_binding_candidates::collect_from_stmt) 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/perry-hir/src/lower/lower_module_fn.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"34835abe1ffcd053485eebcfea4fa639683ee8c9dbe4c1ea7850ac86fcb23ffe"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::misc::number_to_js_key (cognitive 22): perry_hir::lower::misc::number_to_js_key has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (14 pts), loops 2 (4 pts), boolean chains 3, match/switch 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/perry-hir/src/lower/misc.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cc85f24ff83034f716ea836723940313e1bc2a36f2d5bffbf615cf9117cf70"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::shared_mutable_capture::detect_shared_in_body (cognitive 22): perry_hir::lower::shared_mutable_capture::detect_shared_in_body has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 6 (8 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/shared_mutable_capture.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b371e407af3607248ed121c59a9c6fb1a72269206af7a726faf2a5b5f0f4f85"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::class_field_assign::settle_reservations (cognitive 22): perry_hir::lower_decl::class_field_assign::settle_reservations has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 4 (8 pts), loops 2 (4 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/perry-hir/src/lower_decl/class_field_assign.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e404d5a4555e8a41465ddcfe998f4a91f29e53f15abbbcea67cd8cadae211e2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::class_members::collect_method_captures::collect_let_ids (cognitive 22): perry_hir::lower_decl::class_members::collect_method_captures::collect_let_ids has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (4 pts), 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/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"3909cab523f8ee3716db698aba0ffd1f0a7ddbb79d759588a3da8af4679c88f2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::helpers::expr_uses_arguments (cognitive 22): perry_hir::lower_decl::helpers::expr_uses_arguments has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 9, match/switch 5 (9 pts), if/else 2 (4 pts) (nesting depth added 6). 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/perry-hir/src/lower_decl/helpers.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d77d44dacef9cc7c1d64a57896ee72f6123b84f0892823c4b3689b0a089cade"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::tdz_check::for_each_stmt_part (cognitive 22): perry_hir::tdz_check::for_each_stmt_part has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/tdz_check.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad0303af6f4064138b14e15f139fb2f83660839eb51443ab9dce60c747121ee"}},{"ruleId":"D2","level":"warning","message":{"text":"CopyingNurseryCollector::finish_ephemerons (cognitive 22): CopyingNurseryCollector::finish_ephemerons has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 2 (3 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/perry-runtime/src/gc/ephemeron.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5765dd245a187c346969c360c98e73c841b0483b6caaba0b103da2d338cdc14"}},{"ruleId":"D2","level":"warning","message":{"text":"GcCycleState::step_weak_ephemerons (cognitive 22): GcCycleState::step_weak_ephemerons has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/gc/cycle/weak_ephemerons.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0562165426413329178aed9b43f530d63bf2dbe0fa138e792e27afe3385b507f"}},{"ruleId":"D2","level":"warning","message":{"text":"ArenaSweepObjectsState::sweep_whole_block (cognitive 22): ArenaSweepObjectsState::sweep_whole_block has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 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/perry-runtime/src/gc/oldgen/sweep_objects.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbb2923e5fd51e241a95e393b612e6ea1b5500f182ab976c63f85f6d6148581"}},{"ruleId":"D2","level":"warning","message":{"text":"DirectParser::decode_chunk (cognitive 22): DirectParser::decode_chunk has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (5 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/perry-runtime/src/json/parser_escape_chunk.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c2dfbbb1aafee06728846fff27e63af55d24a543b3348c67fbda551d10626f"}},{"ruleId":"D2","level":"warning","message":{"text":"PathModuleRegistry::require_with (cognitive 22): PathModuleRegistry::require_with has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 3 (6 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/perry-runtime/src/module_require/path_registry.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"585b1b972d364965295d464aa6104a364a7a152fceef4d2a673e617e36f472e7"}},{"ruleId":"D2","level":"warning","message":{"text":"CanonicalTable::free_nodes (cognitive 22): CanonicalTable::free_nodes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 3, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/canonical_keys.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f283933dd0abe9bf7a4c10b70d4fcfffdc95e71a83ed3742ab3d340183979c2"}},{"ruleId":"D2","level":"warning","message":{"text":"ShapeSlab::for_each (cognitive 22): ShapeSlab::for_each has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 4 (10 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/perry-runtime/src/object/shapes_store/slab.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4029a31c24c4c1bf9e1ab021e5296eb7c8aeb50663607e166bba9c94260734"}},{"ruleId":"D2","level":"warning","message":{"text":"GuardState::own_data_field (cognitive 22): GuardState::own_data_field has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 1, match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/param_type_guard.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae92b84771e1f2284546200fe4be3005c361dbbd7804fbd972eea36209cdd971"}},{"ruleId":"D2","level":"warning","message":{"text":"NamedStateKey::write_existing (cognitive 22): NamedStateKey::write_existing has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/runtime_state_key.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d363c05a3847f3183fcc4f5e55e1081475d48d067eede0f4b6ddef5724ee9e76"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::arena::reset::old_arena_reclaim_selected_dead_blocks (cognitive 22): perry_runtime::arena::reset::old_arena_reclaim_selected_dead_blocks has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (20 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/perry-runtime/src/arena/reset.rs"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"0829f0300866580640dc45beb8f28c11ff4d05e4fdec6b34cbb26e677102581c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::indexing::try_strict_dense_number_store (cognitive 22): perry_runtime::array::indexing::try_strict_dense_number_store has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 7 (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/perry-runtime/src/array/indexing.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1776978ad31292919b40d2ca1594ae9ff47ce82acdf6067893db8614bdeaec"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::indexing_read_cold::read_cold_entry (cognitive 22): perry_runtime::array::indexing_read_cold::read_cold_entry has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 6 (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/perry-runtime/src/array/indexing_read_cold.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc50a81aee8fb2f1c811e17fa2b4d3df8693724517d7832b9a0fa805c14d0bab"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::iter_methods::js_array_map (cognitive 22): perry_runtime::array::iter_methods::js_array_map has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 1 (3 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/perry-runtime/src/array/iter_methods.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"021cd4087ab6460d8e6bde006eed31cea006cc8ba9dfc449d62ba9a6a34fd712"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::iter_methods::js_array_some_captureless (cognitive 22): perry_runtime::array::iter_methods::js_array_some_captureless 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/perry-runtime/src/array/iter_methods.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42276335c5855a4330cbf3673ce92cbc17c0ee6b52a41fcac894c01df6d0f26"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::buffer::query::js_buffer_byte_length_value (cognitive 22): perry_runtime::buffer::query::js_buffer_byte_length_value has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 9 (nesting depth added 3). 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, 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/perry-runtime/src/buffer/query.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fe18c029514d11919fb510ad1a4ef0298315ea02f5ac7642b7ca6e3a2752bc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::builtins::console::decode_dir_bool_option (cognitive 22): perry_runtime::builtins::console::decode_dir_bool_option has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 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/perry-runtime/src/builtins/console.rs"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"6928df8369c8cbc0e2aa240e5da3bcb36dd8cb718444d4f3e1bbe64a26900da5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::cluster_sched::drain_json_frames (cognitive 22): perry_runtime::cluster_sched::drain_json_frames has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/cluster_sched.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e64cdb72f0eb7709db8aa26ebc863d6a73a4734c0b1a56320a85e0c9bbd13c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::component::callback::invoke_for (cognitive 22): perry_runtime::component::callback::invoke_for has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16 (20 pts), loops 1, match/switch 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/perry-runtime/src/component/callback.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"259066baecb383bd43fb71d4e5c69ea65a5366ce3fd5cc8a0c6d41b91c77e874"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::date::js_date_apply_setter (cognitive 22): perry_runtime::date::js_date_apply_setter has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (20 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/perry-runtime/src/date.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f5cd0b362f425623799d3049c58c2e8265733d0689f54cb0f3fea45b22a0fe"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::fs::stream::read_stream_pump (cognitive 22): perry_runtime::fs::stream::read_stream_pump has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/fs/stream.rs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25ff206c4fceb8c4f376e4fdc63097c76cdf1ad5dc8545f1143ed5cf99eaeb7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::fs::stream::write_turn::write_stream_drain_step (cognitive 22): perry_runtime::fs::stream::write_turn::write_stream_drain_step has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 3 (5 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/fs/stream/write_turn.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f57b7417c4c950b6153706058bfa4215614e24bfea38082d488bec6658fed2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::barrier::remembered_mark::dirty_slot_ranges_for (cognitive 22): perry_runtime::gc::barrier::remembered_mark::dirty_slot_ranges_for has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/gc/barrier/remembered_mark.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"04748ab5ab8563a08b75b2c69c33bba5f91ea91e164108cbf3a6ff9f3efe888c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::promoted_cohort::survival::dead_parent_refers_into (cognitive 22): perry_runtime::gc::promoted_cohort::survival::dead_parent_refers_into has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (5 pts), boolean chains 3, 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/perry-runtime/src/gc/promoted_cohort/survival.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"878d1fd47cdb46010e1752d861f6e81e76c44a3eaf77999f14b5b45bb7e94963"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::tenuring::retune_after_scavenge (cognitive 22): perry_runtime::gc::tenuring::retune_after_scavenge has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (21 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/perry-runtime/src/gc/tenuring.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"97570a5dbaf6f1d2a4f25e5873fadc88b4276f96b85ecbae927ac7ed46117896"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::canon_aliases::canonicalize_unicode_extension_types (cognitive 22): perry_runtime::intl::canon_aliases::canonicalize_unicode_extension_types has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 4 (6 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/intl/canon_aliases.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"96acf707afdfe8ff3203850a271e54653d20d893a95a8ca6d6ce343a1274d96b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::date_collator::temporal::temporal_locale_string (cognitive 22): perry_runtime::intl::date_collator::temporal::temporal_locale_string has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, match/switch 3 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/intl/date_collator/temporal.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc132951d844e56972cb61f2281cd4cf289bb2ee3eb67e835e3289446939477"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::icu_dtf::format_components (cognitive 22): perry_runtime::intl::icu_dtf::format_components has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10, boolean chains 7, match/switch 4 (5 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/perry-runtime/src/intl/icu_dtf.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"4387ed20f0cefb8724e5796c783d07a56c0e0b25af1f78e28a47655009729fd4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::locale::apply_options (cognitive 22): perry_runtime::intl::locale::apply_options has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (22 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/perry-runtime/src/intl/locale.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"297c7ca87001509eb0302548b79c6cca5d881c9c2bb2abacd2c3e8232dea0568"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::replacer::stringify_array_with_replacer_pretty (cognitive 22): perry_runtime::json::replacer::stringify_array_with_replacer_pretty has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 3 (6 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/perry-runtime/src/json/replacer.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"effcebfe9f586c675a3d39eb8e6cf3e881c3fbeaf039fba45e41974cb459fb60"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_stream_constructors::birth_memo::input (cognitive 22): perry_runtime::node_stream_constructors::birth_memo::input has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 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/perry-runtime/src/node_stream_constructors/birth_memo.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a2c62ddb7ccc0ee7c8c500859ad7fe74bf5ae7a22868f81baf4e3bb67376be"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_stream_event_emitter::remove_stream_listener_for_event (cognitive 22): perry_runtime::node_stream_event_emitter::remove_stream_listener_for_event has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (19 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/perry-runtime/src/node_stream_event_emitter.rs"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"a720710a2c8f9892b28e34d6b69010a1573301a163fae624a5b24a3fb02c5789"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_stream_event_emitter::remove_all_stream_listeners (cognitive 22): perry_runtime::node_stream_event_emitter::remove_all_stream_listeners has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/node_stream_event_emitter.rs"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1cd941da3d5c7e00ccbf7561e25f5356b8334d364a1298e83df15ff26e901d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_stream_readwrite::flush_pending_readable_chunks (cognitive 22): perry_runtime::node_stream_readwrite::flush_pending_readable_chunks has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 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/perry-runtime/src/node_stream_readwrite.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"f020776d098ca0f23e7e018a87d3e9ec8e586cd0c6916472a049c5e2f4f8c781"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::class_object_template::record_prototype_template (cognitive 22): perry_runtime::object::field_get_set::class_object_template::record_prototype_template has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, loops 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/field_get_set/class_object_template.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fc47b528a7438039788c553bdab5d15c72aca7df89dcc27a7895202caa5c33"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::class_object_template::evaluation_chain_lost_method (cognitive 22): perry_runtime::object::field_get_set::class_object_template::evaluation_chain_lost_method has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 5 (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/perry-runtime/src/object/field_get_set/class_object_template.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c6bc18db3b680457a6dcae406b95c72f1dc19d73918626473fc1a101842fa9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::field_ops::js_object_set_field (cognitive 22): perry_runtime::object::field_get_set::field_ops::js_object_set_field has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 6 (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/perry-runtime/src/object/field_get_set/field_ops.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1c5640dea0943ba374463ffb208e464d3ba7dc479ec543a4ce58505adf23c5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::get_field_by_name::class_wtf8::class_value_get_wtf8_field (cognitive 22): perry_runtime::object::field_get_set::get_field_by_name::class_wtf8::class_value_get_wtf8_field has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (22 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/perry-runtime/src/object/field_get_set/get_field_by_name/class_wtf8.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37ab767f3715c190577df420d40fa82f2f72318edde25f75197d5b2b59fabd8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::ic_miss::js_object_get_field_by_name_f64 (cognitive 22): perry_runtime::object::field_get_set::ic_miss::js_object_get_field_by_name_f64 has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 3 (nesting depth added 10). 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/perry-runtime/src/object/field_get_set/ic_miss.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e963a1fe8caca7f4447d8d0f4932571760caf71cbdd36a16848cfe0528fd1be"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::global_this::proto_methods::populate_builtin_prototype_methods (cognitive 22): perry_runtime::object::global_this::proto_methods::populate_builtin_prototype_methods has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3 (6 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/perry-runtime/src/object/global_this/proto_methods.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca047fe887b041615ae5b731c97d36da7f87d9f450623de8c1f2d6d342258545"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_probe::colour_masks (cognitive 22): perry_runtime::object::layout_probe::colour_masks has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 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/perry-runtime/src/object/layout_probe.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a475b7b6ec35e8f3968427e256595677fa050b5a9f92eebb3af748013cb1d0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_probe::inherited::chain_from (cognitive 22): perry_runtime::object::layout_probe::inherited::chain_from has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 3 (6 pts), boolean chains 1, 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/perry-runtime/src/object/layout_probe/inherited.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8faeb74d19287316c5c27a48d2c931a15ceca94367991f8984427abf2989ab"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_module::namespace_builders::global_agent_append_https_name_fields (cognitive 22): perry_runtime::object::native_module::namespace_builders::global_agent_append_https_name_fields has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 1 (3 pts), loops 1 (2 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/perry-runtime/src/object/native_module/namespace_builders.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"392a998122b1c16454157f1b01c5a0b8d2df5929b18fb6fb6336cfc79be2c3d3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::property_ops::set::js_super_put_value_set (cognitive 22): perry_runtime::object::property_ops::set::js_super_put_value_set has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 4 (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/perry-runtime/src/object/property_ops/set.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6600920b5e2d6eece4ded31b221e12d511ef245c0358c292560f3ebdc44363b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::shape_mint_census::dump (cognitive 22): perry_runtime::object::shape_mint_census::dump has cognitive complexity 22 (threshold 15). Drivers by points: loops 9 (12 pts), if/else 10 (nesting depth added 3). 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/perry-runtime/src/object/shape_mint_census.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b08716114505b07689f1eaf517a0c3f949b1289d703849822d925bedf257c30"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::shape_store::try_function_store (cognitive 22): perry_runtime::object::shape_store::try_function_store has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 4 (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/perry-runtime/src/object/shape_store.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b508bb6d585f1cabc84814b4a4f309909f9b76121f9c48bdec2273847b4e1d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::proxy::get::proxy_get_with_receiver_impl (cognitive 22): perry_runtime::proxy::get::proxy_get_with_receiver_impl has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (5 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/perry-runtime/src/proxy/get.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb95abf5da748d818f120ef9bd8aa91cdbe0e1ddf27a95b3ae7ac8d64e0b665"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::regex::escape::js_regexp_escape (cognitive 22): perry_runtime::regex::escape::js_regexp_escape has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (6 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/perry-runtime/src/regex/escape.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"74515ea48d362ca5e3858b258957ed20b5731a7112b040c304fdc3f3b1e41619"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::compare::utf16_cmp_bytes (cognitive 22): perry_runtime::string::compare::utf16_cmp_bytes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (4 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/perry-runtime/src/string/compare.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"184ab8c6ebe6e171254c0aaf2dbd6514148d8bbe5522ff1b656d75a3ffae9e49"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::provenance::valid_wtf8_metadata (cognitive 22): perry_runtime::string::provenance::valid_wtf8_metadata has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 9, 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/perry-runtime/src/string/provenance.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"be21143d19133b83b5fd354dafaa720f99c3063586f7069a675833af8e413f8d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::utf16_shape::count (cognitive 22): perry_runtime::string::utf16_shape::count has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (4 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/perry-runtime/src/string/utf16_shape.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"13aecf2d1b668833a05041aeeca5bbc0eb39ba0b65f4302bfb59d1e4bf9399e7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::typedarray::access::js_typed_array_set_from (cognitive 22): perry_runtime::typedarray::access::js_typed_array_set_from has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (6 pts), match/switch 3, 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/perry-runtime/src/typedarray/access.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"efeff148a40f3efb26874e05d88d5632811d58ef71d1a18c56e634bbc2ce62a0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::streams::byob::js_reader_read_with_view (cognitive 22): perry_stdlib::streams::byob::js_reader_read_with_view has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 6 (8 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/perry-stdlib/src/streams/byob.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa04f544a56d21e7e6e16f4241bcd5072e01f941f26547a5b308f0ed093edc3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::streams::tee::tee_pull_microtask (cognitive 22): perry_stdlib::streams::tee::tee_pull_microtask has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5, 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/perry-stdlib/src/streams/tee.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"269d843337d3a0ba24be1a4c1ada165ee4608cad09b3ccc390cc11aff6eceb81"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::tls::validate_server_options (cognitive 22): perry_stdlib::tls::validate_server_options has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 3, 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/perry-stdlib/src/tls.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"430a319fa06ded09a94ee46621bbb477c289c92ed1d69bfaa4fa1b78a633588e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::aggregate_scalar::run (cognitive 22): perry_transform::aggregate_scalar::run has cognitive complexity 22 (threshold 15). Drivers by points: loops 11 (16 pts), if/else 3 (6 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/aggregate_scalar.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8dfdf709f1907753f73e1f8cc3c6c2b9ac2cd3bdc8f1c4490a4c056b493b12"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::lower::yield_await::await_async_generator_yield_operands (cognitive 22): perry_transform::generator::lower::yield_await::await_async_generator_yield_operands has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (4 pts), match/switch 2 (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/perry-transform/src/generator/lower/yield_await.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"593677cc6e0594ea542f49623818700df6d77fc816b2cf1da2aa0d726490fe53"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::closure_analysis::collect_declared_local_ids (cognitive 22): perry_transform::inline::closure_analysis::collect_declared_local_ids has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (4 pts), 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/perry-transform/src/inline/closure_analysis.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf41efa81dfafb3b086bd8804083e1f4ff090a0630139d7914186cf464e57c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Dir::open_at (cognitive 22): Dir::open_at has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 5, 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/perry-wasi/src/filesystem.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d48ebfb0a746a9ca4ccc9d1e089506ecfee808b16f197550885486839199f7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wasi::filesystem::primitives::windows::fs::open_unchecked::open_at (cognitive 22): perry_wasi::filesystem::primitives::windows::fs::open_unchecked::open_at has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (6 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/perry-wasi/src/filesystem/primitives/windows/fs/open_unchecked.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa88b526c1f15c2f90195499d00d0fdc0372a9439123dc3de38c47ed32e3ea4b"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::owner_extent::num (cognitive 22): Gen::owner_extent::num has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/gen/define_keys.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff5572294c3f52c1bce6eb1b86675d4410a838b04f7d5c36017890d47235ba0"}},{"ruleId":"D2","level":"warning","message":{"text":"Observe.stop (cognitive 22): Observe.stop has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, 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":"docs/audits/gc-rss-instructions-2026-10-03/current0ed-meta-observer-v19.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14983ce0ad404f99c6c167815383e96eb41a1c72aa28073ee98cece333876bf"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-gc-paired-instruction-domains-v1.main (cognitive 22): verify-gc-paired-instruction-domains-v1.main has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (8 pts), if/else 3 (6 pts), boolean chains 5, ternaries 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":"docs/audits/gc-rss-instructions-2026-10-03/verify-gc-paired-instruction-domains-v1.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc269ddd1e58129f7de01b723ff4068ae0d6a8b8fcd6d53f20a3ea2f07ea1ad2"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-gc-window-v6r1-inputs.main (cognitive 22): verify-gc-window-v6r1-inputs.main has cognitive complexity 22 (threshold 15). Drivers by points: loops 7 (9 pts), boolean chains 7, if/else 3 (4 pts), ternaries 1 (2 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":"docs/audits/gc-rss-instructions-2026-10-03/verify-gc-window-v6r1-inputs.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5035aad44a976963a0f00da03cff6f06530b623096506b448a76e480c3662b"}},{"ruleId":"D2","level":"warning","message":{"text":"check_dev_debug.check (cognitive 22): check_dev_debug.check has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 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":"scripts/check_dev_debug.py"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ae1b00c3ae06f9c801dbe03c7e87717a0ded5b32790c395732df6eabfe38bf"}},{"ruleId":"D2","level":"warning","message":{"text":"analyzers.runtime_counter_summary (cognitive 22): analyzers.runtime_counter_summary has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, if/else 3 (6 pts), ternaries 1 (4 pts), loops 1 (2 pts) (nesting depth added 7). 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":"scripts/compiler_output_harness/analyzers.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"3192fa4b6bd8b4578b6a4b397c3f2dbbfa1e3e6c224106b91b2661bac549577b"}},{"ruleId":"D2","level":"warning","message":{"text":"component_command_acceptance.main (cognitive 22): component_command_acceptance.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 4 (8 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":"scripts/component_command_acceptance.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2eb759d38b0a8bed41621b777bf0d0d640a1a8612bf600ca3a2028ade8c7611"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.build_cfg (cognitive 22): gc_root_dominance_check.build_cfg has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 5 (10 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"125703b1073cfea8e11cfa0e623b7bc2aec63d6b9b4d62296ba32c9dc2dc6767"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.compute_poll_reaching (cognitive 22): gc_root_dominance_check.compute_poll_reaching has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 6 (10 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":1953}}}],"partialFingerprints":{"codehealthFindingId/v1":"775a46d99df5b95b790560552816fa787782bdbc646761c5c61b4cbe2b5f38f5"}},{"ruleId":"D2","level":"warning","message":{"text":"native_abi_evidence_report.packet_workload_contract (cognitive 22): native_abi_evidence_report.packet_workload_contract has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, loops 3, ternaries 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":"scripts/native_abi_evidence_report.py"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"1084df10c1a7ebe20687bfcadfb70a369efdb7a5fd3e05ae104c289580d377d9"}},{"ruleId":"D2","level":"warning","message":{"text":"native_export_collisions.tokens (cognitive 22): native_export_collisions.tokens has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), ternaries 1 (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":"scripts/native_export_collisions.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"997b8a25d95ebf567090e972265896bf2733dfa248f6152a2209fd77944efde2"}},{"ruleId":"D2","level":"warning","message":{"text":"native_handle_ledger.scan (cognitive 22): native_handle_ledger.scan has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/native_handle_ledger.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8dcff2c9112ffcc01dfff802bad85f1e3561a5a572cfaaf4057c5d335946071"}},{"ruleId":"D2","level":"warning","message":{"text":"package_bench.cmd_compile (cognitive 22): package_bench.cmd_compile has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, error handling 1 (2 pts), loops 1, ternaries 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":"scripts/package_bench.py"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4e1a7e997aa2569dda48abe5d11885970d3109a0aa1ba4a6c361cf01c24fad"}},{"ruleId":"D2","level":"warning","message":{"text":"parity_matrix_trend.report_results (cognitive 22): parity_matrix_trend.report_results has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 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":"scripts/parity_matrix_trend.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee98e3ac44d2bb125ad52c988dd54da6dcba6dfdfb11ccd6357fb55efdf2b42"}},{"ruleId":"D2","level":"warning","message":{"text":"registry_lifetime_check.strip_cfg_test (cognitive 22): registry_lifetime_check.strip_cfg_test has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (5 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":"scripts/registry_lifetime_check.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7c02244288474699f2ab026a9783346d9cd8602e4c1fd34755aaca334acde1"}},{"ruleId":"D2","level":"warning","message":{"text":"registry_lifetime_check.function_spans (cognitive 22): registry_lifetime_check.function_spans has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (17 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":"scripts/registry_lifetime_check.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c300600a4b0dcb02d3a7f993aeee02129c2b519231c43aba200e44c0c76fdbe"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime_abi_check.check (cognitive 22): runtime_abi_check.check has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (6 pts), 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":"scripts/runtime_abi_check.py"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"9022854b8fa359102fb4b98af56afa9f7e5b1d6a84b6a4de5eae666f9b37e665"}},{"ruleId":"D2","level":"warning","message":{"text":"tokio_inventory.manifest_problems (cognitive 22): tokio_inventory.manifest_problems has cognitive complexity 22 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 1 (5 pts), ternaries 1 (5 pts), 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":"scripts/tokio_inventory.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ed4a9ed3032bfcb2e12d7d9c4a7ce58d20d97687dbf8e225968067b82ec70f"}},{"ruleId":"D2","level":"warning","message":{"text":"PerfStat.finish (cognitive 22): PerfStat.finish has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/server_ab.py"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af22447d5505a5e92d015d29ec399b1c8a1834c63b5a242a5b19082c83ce28b"}},{"ruleId":"D2","level":"warning","message":{"text":"Solver.escape (cognitive 22): Solver.escape has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (4 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wpfacts_recompute.py"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"62176da606ff8b811381ac847cfd60be4a0d84206415f23d65af5d38690f7661"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::collect_modules::feature_detect::module_uses_json_format::expr_uses_json_format (cognitive 21): perry::commands::compile::collect_modules::feature_detect::module_uses_json_format::expr_uses_json_format has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 5 (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/perry/src/commands/compile/collect_modules/feature_detect.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ceee8ebe94f544dbf2950b13910ba1d3f92abef15972bdfcf6e3510929b10ad"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::resources::compile_backend_shader_sources (cognitive 21): perry::commands::compile::resources::compile_backend_shader_sources has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 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/perry/src/commands/compile/resources.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a179ab5c9ffcb1f0385a4a95b42f24bf189fa61372e490d440afb962f871e3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::strip_dedup::stub_symbols::try_localize_stdlib_stub_symbols (cognitive 21): perry::commands::compile::strip_dedup::stub_symbols::try_localize_stdlib_stub_symbols has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 4 (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. This shape REPEATS in the file: one other method here (perry::commands::compile::strip_dedup::stub_symbols::try_localize_stdlib_stub_symbols_unix) 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/perry/src/commands/compile/strip_dedup/stub_symbols.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e8fc8cccdaccbc980f17ad7a7447ca87406b25e272193a566e51c62304095e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::strip_dedup::stub_symbols::try_localize_stdlib_stub_symbols_unix (cognitive 21): perry::commands::compile::strip_dedup::stub_symbols::try_localize_stdlib_stub_symbols_unix has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 4 (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. This shape REPEATS in the file: one other method here (perry::commands::compile::strip_dedup::stub_symbols::try_localize_stdlib_stub_symbols) 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/perry/src/commands/compile/strip_dedup/stub_symbols.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f6ce33ab6696c3cdce5dad27c76166f6fad9684f4ac67f78945697b597d84d"}},{"ruleId":"D2","level":"warning","message":{"text":"Facts::bindings_stmts (cognitive 21): Facts::bindings_stmts has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (5 pts), loops 2 (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/perry-codegen/src/codegen/opts/computed_names.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c52cb85c2b1f40e8050be9b5bf4bfbf549dc87c343911cee7ed69067eb8d45"}},{"ruleId":"D2","level":"warning","message":{"text":"GuardGraphBuilder::class_chain_fields (cognitive 21): GuardGraphBuilder::class_chain_fields has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (6 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/perry-codegen/src/codegen/param_guard.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b402c67c54eb7eb597bd56c01685cb4a6f55b1f16eae83426586f4905bc57d"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayFactCollector::collect_stmt (cognitive 21): ArrayFactCollector::collect_stmt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), 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/perry-codegen/src/collectors/hir_facts.rs"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"36469be92e4171cf70622391933559549ed60c36b14b9896c0add86ecd0b9c8d"}},{"ruleId":"D2","level":"warning","message":{"text":"Probe::stmt (cognitive 21): Probe::stmt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), 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/perry-codegen/src/collectors/sealed_buffers.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"079a08259770e7cf235fd16a5a5730870a132c08c3ff0b9572728dae501676c5"}},{"ruleId":"D2","level":"warning","message":{"text":"Scan::walk_module (cognitive 21): Scan::walk_module has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 6 (10 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/perry-codegen/src/collectors/sealed_buffers.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"15254e6bfc6ba560271024a6bf52b7c124de846247bacc26117d8cf39532c157"}},{"ruleId":"D2","level":"warning","message":{"text":"Plan::expression (cognitive 21): Plan::expression has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 6, 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/perry-codegen/src/stmt/indexed_owner_loop.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f750d00046e1eb52f42cebb52ca353b566132cca3a741a954806ae5350ac4da"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::boxed_vars::collect_prealloc_box_ids_in_stmts (cognitive 21): perry_codegen::boxed_vars::collect_prealloc_box_ids_in_stmts has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (7 pts), 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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"9085581aaeef06bc26d9888ec4aab94c58ca742a10e7ae92ef637e7ba15e27c2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::static_constfn::static_method_lanes (cognitive 21): perry_codegen::codegen::static_constfn::static_method_lanes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 4 (5 pts), boolean chains 1, 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/perry-codegen/src/codegen/static_constfn.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1d1f8627c9383559aa4dffffb5c241b0b1fbabab6fca50adecd13175163994"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::typed_abi::lower::lower_typed_i1_expr_with_env (cognitive 21): perry_codegen::codegen::typed_abi::lower::lower_typed_i1_expr_with_env has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 3 (7 pts), boolean chains 3 (nesting depth added 10). 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/perry-codegen/src/codegen/typed_abi/lower.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fc8806b0dc5721581dee9549e6838c395b9728bdcf956a6b616a6759f7ce6d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::typed_entry::emit_tiered_entry_dispatch (cognitive 21): perry_codegen::codegen::typed_entry::emit_tiered_entry_dispatch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 2, match/switch 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/perry-codegen/src/codegen/typed_entry.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e98039f87d5ea54142b57df06ea736a0e4ef326dd416963d95da07bfe35290e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::all_pointer_arrays::collect_all_pointer_array_locals (cognitive 21): perry_codegen::collectors::all_pointer_arrays::collect_all_pointer_array_locals has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2, loops 1 (2 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/perry-codegen/src/collectors/all_pointer_arrays.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7269c306969a4fb7206abbd3754cb71a480177411740263291d63cc59ee1b066"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::byte_read_key::collect_numeric_typed_locals::walk (cognitive 21): perry_codegen::collectors::byte_read_key::collect_numeric_typed_locals::walk has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (4 pts), 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/perry-codegen/src/collectors/byte_read_key.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ce342f8fe7d2db9c2a3c14512fca6cbb5864423b6f768cafcf7e3357ee97e0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::definite_init::shallow_expr_at (cognitive 21): perry_codegen::collectors::definite_init::shallow_expr_at has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/definite_init.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0be14c11eda0eec5a531d887f09faee93838605d81a030115fdb4ac62a2c7bb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::escape_objects::collect_used_object_fields_in_expr (cognitive 21): perry_codegen::collectors::escape_objects::collect_used_object_fields_in_expr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (21 pts) (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/perry-codegen/src/collectors/escape_objects.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"162d1d5d8dae49c9f300bb72bfe9b1d9d039e7fb8eccaea8941396bb434c1ea1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::loop_bounded_i32::derive_guards (cognitive 21): perry_codegen::collectors::loop_bounded_i32::derive_guards has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 4 (10 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/perry-codegen/src/collectors/loop_bounded_i32.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"d489815ea33ceff3d73e26a684fbcd26f9e413525f6fdebaab233968c50ef9db"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::param_ranges::visit_stmt (cognitive 21): perry_codegen::collectors::param_ranges::visit_stmt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (2 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/perry-codegen/src/collectors/param_ranges.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a7069b6d89c94a44b07ca98857c12a2e3fd858efa6683e9f0b429c2a27ce36"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_returns::find_return_shape_candidates (cognitive 21): perry_codegen::collectors::ptr_shape_returns::find_return_shape_candidates has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (19 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/perry-codegen/src/collectors/ptr_shape_returns.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"8354691e6d7d50eab9fe155188a7db7cdd26e135a4559262dce1581b01ddc831"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::dialect::types::ty_and_val (cognitive 21): perry_codegen::dialect::types::ty_and_val has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), match/switch 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/perry-codegen/src/dialect/types.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dbb7b9b7ced3896781f93cbee522f84f37a60056db7ede23066d1508641d0d8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::gc_call_effects::direct_callee_span (cognitive 21): perry_codegen::gc_call_effects::direct_callee_span has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 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":"crates/perry-codegen/src/gc_call_effects.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef669e5bcb7c721f44f5ed6f951d05cdce4df557c0a3ffb9be10502cd410593"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_desc::create_families::descriptor_attrs (cognitive 21): perry_codegen::layout_desc::create_families::descriptor_attrs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 3 (5 pts), boolean chains 1, 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/perry-codegen/src/layout_desc/create_families.rs"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"635908e6a6c81b4e42c1ffa93ca57315086ce159a5e7adb5539988d647060428"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::private_method::try_lower_private_method_call (cognitive 21): perry_codegen::lower_call::private_method::try_lower_private_method_call has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15, loops 3 (4 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/private_method.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9535718e183f6e71742a35b51770d9204af447493c1fdd13fa2fa16e2fa26428"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::scalar_method::try_lower_scalar_replaced_method_call (cognitive 21): perry_codegen::lower_call::scalar_method::try_lower_scalar_replaced_method_call has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, loops 4 (5 pts), match/switch 1 (2 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/perry-codegen/src/lower_call/scalar_method.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"add83b75774b78b28d5483bc7e24e53d72548796c74212e4070ef8b3e6d2e62d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::ui_styling::apply_inline_style (cognitive 21): perry_codegen::lower_call::ui_styling::apply_inline_style has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 3 (8 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":"crates/perry-codegen/src/lower_call/ui_styling.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"66cd4aeeda41dd26ddb6e80dd00d193eee24ac755102d759c06d3b5e69679861"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_string_concat::lower_string_concat_chain (cognitive 21): perry_codegen::lower_string_concat::lower_string_concat_chain has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (8 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_string_concat.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"26cac55656db486818886d6e815ee8d5acd00d85c52475d47fd2fbb9ae4e5838"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::stable_packed_loop::try_lower_index_get (cognitive 21): perry_codegen::stmt::stable_packed_loop::try_lower_index_get has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (19 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":"crates/perry-codegen/src/stmt/stable_packed_loop.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23c6f9b757b5bcf5a4568d417329063dbd3f71f86d4c4e939b3153398118272"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::type_analysis::numeric::expr_produces_canonical_raw_f64 (cognitive 21): perry_codegen::type_analysis::numeric::expr_produces_canonical_raw_f64 has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 8, 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/perry-codegen/src/type_analysis/numeric.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab19126354b16205de06896ff39d64579a8c9573542a6574c32019abba3fae7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::type_analysis_class_fields::class_field_global_index::walk (cognitive 21): perry_codegen::type_analysis_class_fields::class_field_global_index::walk has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, 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. This shape REPEATS in the file: one other method here (perry_codegen::type_analysis_class_fields::class_field_global_index) 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/perry-codegen/src/type_analysis_class_fields.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7ae4c39fcc18556caadf8a4f69dffbc7e3105e3116c4f2695599ebab69676b"}},{"ruleId":"D2","level":"warning","message":{"text":"State::open_at (cognitive 21): State::open_at has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 7 (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/perry-component-host/src/sync_wasi/filesystem.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9697295ced4192eeb66a42b777d86397fce3eb3768b8461d77962d9780f8260"}},{"ruleId":"D2","level":"warning","message":{"text":"AppleContainerProtocol::run_args (cognitive 21): AppleContainerProtocol::run_args has cognitive complexity 21 (threshold 15). Drivers by points: loops 8 (11 pts), if/else 10 (nesting depth added 3). 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/perry-container-compose/src/backend/apple.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"69dc1726b4972a2206f2743c25c20275f0eca7ac768d67984fdb11b06f9b4960"}},{"ruleId":"D2","level":"warning","message":{"text":"Registry::flush (cognitive 21): Registry::flush has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 4 (8 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-db-turnloop/src/lib.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c36fe03116cad1bb24915d3126fc3ce0a5e32bfcf0045e27f64bf28a3fd894"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::http2_server::controls::queue_session_settings (cognitive 21): perry_ext_http::server::http2_server::controls::queue_session_settings has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (19 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/perry-ext-http/src/server/http2_server/controls.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6a002d40261a8a2c740efdfeee61cbe359e00d739664368fb71dc7a68bd72e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::http2_server::dispatch::js_ext_http2_stream_dispatch_method (cognitive 21): perry_ext_http::server::http2_server::dispatch::js_ext_http2_stream_dispatch_method has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 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/perry-ext-http/src/server/http2_server/dispatch.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"24567790a73d96431d8728f0e2d3746aa203092ce3fb8d042e08e0e3b2bf33f6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::response::js_node_http_res_write_head (cognitive 21): perry_ext_http::server::response::js_node_http_res_write_head has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (20 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/perry-ext-http/src/server/response.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e8ab044cf124f3b02f240c434f2c7bfc99f6da24b4cf5a5ce50bce5ce367c7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::response::js_node_http_res_write_with_cb (cognitive 21): perry_ext_http::server::response::js_node_http_res_write_with_cb has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (19 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/perry-ext-http/src/server/response.rs"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"33687188efc280869a1716f86daca39ac06ce2006df78ca940dcd9b41c6a116b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::server::listen_http_server (cognitive 21): perry_ext_http::server::server::listen_http_server has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (18 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, 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/perry-ext-http/src/server/server.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"645d0f34d71c547e345e08b4f0e6f8030fd4ea72ac7c42a24f189c1c75fcc559"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::server::js_node_http_server_remove_listener (cognitive 21): perry_ext_http::server::server::js_node_http_server_remove_listener has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (20 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":"crates/perry-ext-http/src/server/server.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e9967a85741376688c24b71c2d3137b04d36467b072a999e1d5f963f284710"}},{"ruleId":"D2","level":"warning","message":{"text":"Encoder::step (cognitive 21): Encoder::step has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 3 (4 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/perry-ext-zlib/src/stream/zlib_encoder.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb1dbd716589181ba75c13b72ca3cb6a6ee252e0a42078695399d93703f1d96"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::analysis::fn_infer::collect_units (cognitive 21): perry_hir::analysis::fn_infer::collect_units has cognitive complexity 21 (threshold 15). Drivers by points: loops 10 (14 pts), if/else 3 (7 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/analysis/fn_infer.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0398ac17ae20ffd5b4e93d7cd9ed60632d288fd432dcbca255b2eb66251cd57"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::analysis::fn_infer::class_member_index (cognitive 21): perry_hir::analysis::fn_infer::class_member_index has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 6 (10 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/perry-hir/src/analysis/fn_infer.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cb050e29f08707b3bb55fef91cf6f00224e644450d9dc8a8e2802d737b119d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::analysis::fn_infer::callee::round (cognitive 21): perry_hir::analysis::fn_infer::callee::round has cognitive complexity 21 (threshold 15). Drivers by points: loops 8 (12 pts), if/else 3 (6 pts), match/switch 2, boolean chains 1 (nesting depth added 7). 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/perry-hir/src/analysis/fn_infer/callee.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7cae1b6ffb88bb9df2f1963ad0a095f1af999b4d45b3eb7dfd94d191e25e9f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::analysis::value_types::infer_binary_type (cognitive 21): perry_hir::analysis::value_types::infer_binary_type has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 7, match/switch 1 (nesting depth added 3). 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/perry-hir/src/analysis/value_types.rs"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d3b2286cc6fe4137a7fa8aa411730fa219e3840f4eb17ff0d475eb0ca5ed0c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::dynamic_import::collect_dynamic_import_param_literals (cognitive 21): perry_hir::dynamic_import::collect_dynamic_import_param_literals has cognitive complexity 21 (threshold 15). Drivers by points: loops 8 (11 pts), if/else 4 (10 pts) (nesting depth added 9). 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/perry-hir/src/dynamic_import.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa877b5f281fa4efe9fed0df70f4abdad1a1ccd2a8c5e9982371faaf2a419990"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_assign::hoist_compound_member_assign (cognitive 21): perry_hir::lower::expr_assign::hoist_compound_member_assign has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 9 (10 pts), if/else 7 (8 pts), boolean chains 3 (nesting depth added 2). 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/perry-hir/src/lower/expr_assign.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fdc4d31e32b831fcfaf0d44c4be952315ca7ec7326be8d47f01ac486e45f835"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::fn_ctor_env::indirect_eval_factory_shape (cognitive 21): perry_hir::lower::fn_ctor_env::indirect_eval_factory_shape has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3, loops 2 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/fn_ctor_env.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a31a7f1c6e5921ddb0f7115b04cd7abb7c0a06ddba2103ccad08657311e15f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::fn_ctor_env::object_tostring_body (cognitive 21): perry_hir::lower::fn_ctor_env::object_tostring_body has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 3 (4 pts), boolean chains 3, 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/perry-hir/src/lower/fn_ctor_env.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da43f85c73a4901320b0c35bff3041ca37f27be4d1fd1dcb931c01c2bc99cde"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::fn_ctor_env::eval_const_expr (cognitive 21): perry_hir::lower::fn_ctor_env::eval_const_expr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 4 (7 pts), loops 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/perry-hir/src/lower/fn_ctor_env.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3a78c6cc3b12c6e378625522b81f95448467948558d4fdd2082d6a46ddcaf4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::module_tdz::function_positions (cognitive 21): perry_hir::lower::module_tdz::function_positions has cognitive complexity 21 (threshold 15). Drivers by points: loops 9 (13 pts), if/else 4 (7 pts), boolean chains 1 (nesting depth added 7). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/module_tdz.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ecf525aad7e3d99dd69ba6696a111b31d6eb2e0da04bb041077285a4422da20"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::widget_decl::parse_image_node (cognitive 21): perry_hir::lower::widget_decl::parse_image_node has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (18 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d59c8f692444535e0e78377f6edd9896eabcc3ba9f3195ca198622e5c28e05"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::widget_decl::parse_modifiers_from_args (cognitive 21): perry_hir::lower::widget_decl::parse_modifiers_from_args has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 1 (3 pts) (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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa634ebd3101b86527656ba9f6473f6f6a66d1b646c956526359946ed6910351"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::widget_decl::reactive_animate::try_desugar_reactive_animate (cognitive 21): perry_hir::lower::widget_decl::reactive_animate::try_desugar_reactive_animate has cognitive complexity 21 (threshold 15). Drivers by points: loops 7 (10 pts), if/else 7 (8 pts), match/switch 2 (3 pts) (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/perry-hir/src/lower/widget_decl/reactive_animate.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"df94cb119f0d6aa95d041fa1daf54cc70e2da1f8cb8d40cfcbf9f394fdd08d57"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::block::compute_prealloc_for_hoisted_closures (cognitive 21): perry_hir::lower_decl::block::compute_prealloc_for_hoisted_closures has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 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":"crates/perry-hir/src/lower_decl/block.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4482519a71d7dcf3c79b6bea6c31701130e2d328de177752b8f40195f6baa1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::block::var_names::annexb_nested_stmt (cognitive 21): perry_hir::lower_decl::block::var_names::annexb_nested_stmt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (7 pts), match/switch 3 (6 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_decl/block/var_names.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"843fc6226d25ee3bcecfa4149508105252b5ef9f9108fe7dbb5ea0cf5b892ca0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::class_validation::validate_legacy_decorator_surface (cognitive 21): perry_hir::lower_decl::class_validation::validate_legacy_decorator_surface has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 2 (7 pts), 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/perry-hir/src/lower_decl/class_validation.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9002c2d022667a8f39b9f0f9192d0c625b5b01f5e1a9804dda58c604ed6cb6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_patterns::unescape_hex_escape (cognitive 21): perry_hir::lower_patterns::unescape_hex_escape has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). Of this number, 14 points are the body\u0027s own statements and 7 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":"crates/perry-hir/src/lower_patterns.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20cc7a140056d544804691c34e5a18631a57a52a13d5903f17e6f32987a5975"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_patterns::lower_assign_target_to_expr (cognitive 21): perry_hir::lower_patterns::lower_assign_target_to_expr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_patterns.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67da19be1ea3f3063a0081610f026879c911f56a528f29d2299f1d7e474bea9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_patterns::collect_implicit_assignment_target_names (cognitive 21): perry_hir::lower_patterns::collect_implicit_assignment_target_names has cognitive complexity 21 (threshold 15). Drivers by points: if/else 2 (7 pts), match/switch 3 (7 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_patterns.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88e8c1764493ce4000b81cfa9a51604bc911158d39c7b547c72beaef0a0db8f"}},{"ruleId":"D2","level":"warning","message":{"text":"WebSocket::read_message (cognitive 21): WebSocket::read_message has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (8 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/perry-http-client/src/ws/mod.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"169c25c2e997c6584756775c890376a25582f07f853fb95eacd7d375e9908e47"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphemeState::width (cognitive 21): GraphemeState::width has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 5 (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/perry-runtime/src/bun_compat/string_width.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"49145d22fc2e0c0c9009682cd95708c7da8a3f86d27459e5b73e297aef46494a"}},{"ruleId":"D2","level":"warning","message":{"text":"HeapChildSlotIterator::next (cognitive 21): HeapChildSlotIterator::next has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 1, 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/perry-runtime/src/gc/layout/child_slots.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"c397dee250a32a81a81554335102848f423c68b444dd7c6ba4044894baef5229"}},{"ruleId":"D2","level":"warning","message":{"text":"RecordWalk::next (cognitive 21): RecordWalk::next has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/gc/roots/stack_maps_lazy.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e1abfc32cb81ab4e8c8b76ca70e5664a3fd33466b63545ebd3f624133fc4dd"}},{"ruleId":"D2","level":"warning","message":{"text":"NumericIndex::rebuild_dense (cognitive 21): NumericIndex::rebuild_dense has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 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/perry-runtime/src/map.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed249d7a35e2a69ca0c2b03418154d70eb72a6a22f6dc95641fbc6e06b9c2c0"}},{"ruleId":"D2","level":"warning","message":{"text":"ShapeSlab::release_empty_chunks (cognitive 21): ShapeSlab::release_empty_chunks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 4 (9 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/perry-runtime/src/object/shapes_store/slab.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc4e49d1bdb08d48ed40d69109efa81cf6f315da6fc35e815f774a558f6a175"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::fill_extend::js_array_fill_f64_const_extend (cognitive 21): perry_runtime::array::fill_extend::js_array_fill_f64_const_extend has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9, loops 5 (9 pts), boolean chains 3 (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/perry-runtime/src/array/fill_extend.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1121cf7e110bc875ebf94a0e06f22b87c4b1429c4388cb7b2b7b75127bb2eb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::from_concat::js_array_concat_variadic (cognitive 21): perry_runtime::array::from_concat::js_array_concat_variadic has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, loops 2 (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/perry-runtime/src/array/from_concat.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"76129840b065d089cd2e0406dc65cf70f52d6920dc5e7cf60476ffbe216013dd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::from_concat::try_concat_all_dense (cognitive 21): perry_runtime::array::from_concat::try_concat_all_dense has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 3, 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/perry-runtime/src/array/from_concat.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0fd0314e7c9b9596c9b4dfd4e6cfddbcd4ccbbf113b1ac986305dbb97da64f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::iter_object::collection_iter_obj_for_receiver (cognitive 21): perry_runtime::array::iter_object::collection_iter_obj_for_receiver has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 7 (8 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/perry-runtime/src/array/iter_object.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a796bbefa7e4b24ed339a4bc66376df8bb324a628192dbaa4dc4d18f7ee1ac"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::search::js_array_includes_jsvalue (cognitive 21): perry_runtime::array::search::js_array_includes_jsvalue has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (3 pts), match/switch 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/perry-runtime/src/array/search.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"c315c1f385962405268b8ace16832a249a529493c2ce29f2606828f249c189bd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::builtins::console::js_console_error_dynamic (cognitive 21): perry_runtime::builtins::console::js_console_error_dynamic has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (18 pts), match/switch 1 (2 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. This shape REPEATS in the file: one other method here (perry_runtime::builtins::console::js_console_warn_dynamic) 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/perry-runtime/src/builtins/console.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"71045adbe4970de3f226c4556f28214d101d1329a1032e033e2508e822a0672c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::builtins::console::js_console_warn_dynamic (cognitive 21): perry_runtime::builtins::console::js_console_warn_dynamic has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (18 pts), match/switch 1 (2 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. This shape REPEATS in the file: one other method here (perry_runtime::builtins::console::js_console_error_dynamic) 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/perry-runtime/src/builtins/console.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"7831d232673c72991a4d6ad3615f8f06cef872aafec040531814255128fa333c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::closure::dispatch::bound::js_function_bind (cognitive 21): perry_runtime::closure::dispatch::bound::js_function_bind has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 6 (nesting depth added 9). 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/perry-runtime/src/closure/dispatch/bound.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db6635b759bb04cffdd293a73c9a2a0d4a1508a85002f6b8204e0c7692f7f88"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::dyn_eval::expr::eval_new (cognitive 21): perry_runtime::dyn_eval::expr::eval_new has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/dyn_eval/expr.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"8352fb855b85ecbe577442fadf806a4cd6616a53a1e935c6eb3000da09c99b0d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::dyn_eval::interp::invoke_interp_fn_entered (cognitive 21): perry_runtime::dyn_eval::interp::invoke_interp_fn_entered has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 4 (7 pts), match/switch 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/perry-runtime/src/dyn_eval/interp.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"820ab3f96cab4ede9c66b9ac23d01b97a46cad6627731fe39e1e4beef52c7383"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::error_stack_frames::render_frames (cognitive 21): perry_runtime::error_stack_frames::render_frames has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/error_stack_frames.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"f186243cc25fe80c0b9ba44a01057925eafb79ae97bd865d1b9791c4c050867c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::roots::try_mark_conservative_word (cognitive 21): perry_runtime::gc::roots::try_mark_conservative_word has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, match/switch 1 (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/perry-runtime/src/gc/roots.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"9160efe5dc454a9ace6ee8d8ab0a2445c797ff687c6024149ed2067f98e8c148"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::roots::stack_maps::fp_to_sp_offset (cognitive 21): perry_runtime::gc::roots::stack_maps::fp_to_sp_offset has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/gc/roots/stack_maps.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"57189d120e4b5972bcd26e412ca8bf27d07c4ba5fb2b47ec57aef69b62cbc141"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::types::validate_gc_type_info (cognitive 21): perry_runtime::gc::types::validate_gc_type_info has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (20 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/perry-runtime/src/gc/types.rs"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"58543bd55917be3f426e409348f82b9f70792a74df3a838042a39e88c84fc0a5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::duration_format::validate_duration (cognitive 21): perry_runtime::intl::duration_format::validate_duration has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 2, 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/perry-runtime/src/intl/duration_format.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"93be6b0d949b2f03c3f7db6a38c4b3808d91e3526832bc169b5dc8748a23b1c5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::numbering_system::numbering_system_from_locale (cognitive 21): perry_runtime::intl::numbering_system::numbering_system_from_locale has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (8 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/perry-runtime/src/intl/numbering_system.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccffa02f35ac113e4d3dec7bee0290fae9865e772d3c73e433edec6aa18e756"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::replacer::apply_to_json (cognitive 21): perry_runtime::json::replacer::apply_to_json has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (19 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/perry-runtime/src/json/replacer.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b29cf806112341252dd7d294bb7584b12fb9d7837eeebc00cd41e98f7606e07"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::jsx::render_props_attrs (cognitive 21): perry_runtime::jsx::render_props_attrs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 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/perry-runtime/src/jsx.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0b068edd4bdbb81cb58cbe85a4e509b8aea4b21f6cf22d24019545a12bde98"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::map::find_string_key_index (cognitive 21): perry_runtime::map::find_string_key_index has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 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/perry-runtime/src/map.rs"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4b43b87b32fe46990c117fe9d35bfa609d615aaf9ebcb88ef5a7670b14f159"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_stream_constructors::pipeline::js_node_stream_duplex_from_options (cognitive 21): perry_runtime::node_stream_constructors::pipeline::js_node_stream_duplex_from_options has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 10). 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/perry-runtime/src/node_stream_constructors/pipeline.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6db69a421754a8abd1f60809e5a4018a9a30f702b7cc6c68b91d166fd0825e1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::canonical_keys::extend_token (cognitive 21): perry_runtime::object::canonical_keys::extend_token has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (12 pts), loops 2 (4 pts), boolean chains 3, match/switch 2 (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/perry-runtime/src/object/canonical_keys.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a020c9048121ca99e046adcb92d19f4bd4400822997724e49f3fbea8f15e5a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::canonical_keys::publish_canonical (cognitive 21): perry_runtime::object::canonical_keys::publish_canonical has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (4 pts), boolean chains 2, 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/perry-runtime/src/object/canonical_keys.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e92549827e199f8f99cdb88a33e8d991d40149093fe41225fd5477df23f9126"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_constructors::capture_owner_for_template (cognitive 21): perry_runtime::object::class_constructors::capture_owner_for_template has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (20 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/perry-runtime/src/object/class_constructors.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61a5afec87e19896997612f5569433cd9e6b28f24739471a1f051acd25f3cd2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::gc_roots::scan_class_side_table_root_slot (cognitive 21): perry_runtime::object::class_registry::gc_roots::scan_class_side_table_root_slot has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/class_registry/gc_roots.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0c3d89fe9c51cdb9fb4fb37e33495b4f86f023fdf2fb7a6a129d81a3c35ec9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::descriptors::js_object_get_own_property_descriptors (cognitive 21): perry_runtime::object::descriptors::js_object_get_own_property_descriptors has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 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/perry-runtime/src/object/descriptors.rs"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"797155c89d2c5625937e2e5dc1250f5bf97504da6e23e477f9a4d06d5cbcbb60"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::exotic_expando::exotic_set_property (cognitive 21): perry_runtime::object::exotic_expando::exotic_set_property has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (20 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/perry-runtime/src/object/exotic_expando.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"d430ab9676413c4ca02031d29a0b23490e55d10d003aca45e5dbba0b66fe6c36"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::ic_miss::private_guard_fast::js_private_method_call (cognitive 21): perry_runtime::object::field_get_set::ic_miss::private_guard_fast::js_private_method_call has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16 (21 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/perry-runtime/src/object/field_get_set/ic_miss/private_guard_fast.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c519d2058bcf5902f7fc0f742a58e7a293849dccf538206247d475b8748a7bd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::map_set_receiver::map_set_instance_property (cognitive 21): perry_runtime::object::field_get_set::map_set_receiver::map_set_instance_property has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (21 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/perry-runtime/src/object/field_get_set/map_set_receiver.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"671f2f70feafffd294c0e837e0558ef7885fe16889dfc9fd74462f89c4e7446e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::global_this::typed_array::validate_array_buffer_species_constructor (cognitive 21): perry_runtime::object::global_this::typed_array::validate_array_buffer_species_constructor has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 4 (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/perry-runtime/src/object/global_this/typed_array.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0ddd0dad62563f659fefe4e6be32e8dc7d74cd0c36522d5f39dbc7a1357fa9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_desc::store::family_overwrite (cognitive 21): perry_runtime::object::layout_desc::store::family_overwrite has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 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/perry-runtime/src/object/layout_desc/store.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10baf498943bbb3fa7ce3da568f1b12913a45472917afba00e56ae70d25a4d7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_probe::perry_probe_set (cognitive 21): perry_runtime::object::layout_probe::perry_probe_set has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 4, 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/perry-runtime/src/object/layout_probe.rs"},"region":{"startLine":1738}}}],"partialFingerprints":{"codehealthFindingId/v1":"1777084fe6a1eb5e0682b2623de71fac819ff948949f0f763be84ee61218c62d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_probe::computed::perry_probe_get_value::perry_family_run_admits (cognitive 21): perry_runtime::object::layout_probe::computed::perry_probe_get_value::perry_family_run_admits has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 4 (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. This shape REPEATS in the file: one other method here (perry_runtime::object::layout_probe::computed::perry_probe_get_value::chain_admits_family) 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/perry-runtime/src/object/layout_probe/computed.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2df126d18a5ebea3c8ecc0078929e463628ab1513cae54b43aa80d67fbb8f4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_probe_indexed::continued (cognitive 21): perry_runtime::object::layout_probe_indexed::continued has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 1, 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/perry-runtime/src/object/layout_probe_indexed.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"332a18cab74019f93497f67a8de611f5b7ce332f2bdeca09a19536f47093e516"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_probe_site_memo::lookup (cognitive 21): perry_runtime::object::layout_probe_site_memo::lookup has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 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/perry-runtime/src/object/layout_probe_site_memo.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa6b550120067f951ace36ab5fdd37138a1e7dfbce172d7804f760cfb3ffcb5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_call_method::js_native_call_method_nullsafe (cognitive 21): perry_runtime::object::native_call_method::js_native_call_method_nullsafe has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 4 (nesting depth added 9). 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/perry-runtime/src/object/native_call_method.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a71e996e7ab3975c7f041746f52ebcdd6977009c68b0a479bef8c66c86c1f6a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_call_method::common_methods::apply_argument_list (cognitive 21): perry_runtime::object::native_call_method::common_methods::apply_argument_list has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (18 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, 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/perry-runtime/src/object/native_call_method/common_methods.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31f1ccf7c1707fca0e7e23e17c9a849226d578b103dbc363a8e22fb768025ff"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_module::nm_ee_dynamic_super (cognitive 21): perry_runtime::object::native_module::nm_ee_dynamic_super has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 6 (nesting depth added 8). 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/perry-runtime/src/object/native_module.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"f631992467c535d88624483e77945a0aada2b34f674be15ccd93fc89fd957e1d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::node_http_prototypes::build_http_prototype (cognitive 21): perry_runtime::object::node_http_prototypes::build_http_prototype has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 7 (8 pts), match/switch 1 (nesting depth added 7). 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/perry-runtime/src/object/node_http_prototypes.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c6f9c9ee1642107af3f50e79b2141e79a3588700b3e089f465ef323155e436"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::shapes::shape_descriptor_intern_with_special_mode (cognitive 21): perry_runtime::object::shapes::shape_descriptor_intern_with_special_mode has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4, 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/perry-runtime/src/object/shapes.rs"},"region":{"startLine":1938}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f43be7d00c88815b795e70e5eddab2f567ec57dd8c7ed7b5e65ee87483868b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::shapes::shape_descriptor_mint_fresh (cognitive 21): perry_runtime::object::shapes::shape_descriptor_mint_fresh has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, loops 1 (3 pts), 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/perry-runtime/src/object/shapes.rs"},"region":{"startLine":2100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ff90fc71f1cff88d552e520b67ac5196388d71d8b788603c97d06a5cea9f1b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::os_process_stream_write::with_write_bytes (cognitive 21): perry_runtime::os_process_stream_write::with_write_bytes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, match/switch 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/perry-runtime/src/os_process_stream_write.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd124bebc404a4f5fe0ec56b465370cb2f40971cf983764d28b4342f14610d4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::path::split_win32 (cognitive 21): perry_runtime::path::split_win32 has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (7 pts), loops 3 (6 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/perry-runtime/src/path.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7103e5d60b9f8ae6785f377bdd6d7b0901cf1315688233e35a85f8b935608c3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::process::node_module::module_strip_interfaces (cognitive 21): perry_runtime::process::node_module::module_strip_interfaces has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (7 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/perry-runtime/src/process/node_module.rs"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e1c31a75fc932ea642367501fd1c1c8dd4289733c53e2d0f7fa9325f466924"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::regex::perex_display::render (cognitive 21): perry_runtime::regex::perex_display::render has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 pts), 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/perry-runtime/src/regex/perex_display.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc66b84b9e222043ad73f557ec080df175c6b817f9dd18d582b6276072bd3d05"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::concat::js_string_concat (cognitive 21): perry_runtime::string::concat::js_string_concat has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 5, 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/perry-runtime/src/string/concat.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8820ec7f6915c6aba2d3fec5b46d1c3b18c8cd74bc0e9f6226e5743728de25f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::literal_replace::positions (cognitive 21): perry_runtime::string::literal_replace::positions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/string/literal_replace.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe99400a8c9d59c250e7f60ba3e5ead6c1a197ffe95a189868bfbbef915e837"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::split::split_by_delimiter (cognitive 21): perry_runtime::string::split::split_by_delimiter has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3 (5 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/perry-runtime/src/string/split.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"783ff1dc05ff82d31ae28d2408adac770e6a8ba5282f0648b47d3020d2196998"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::text::decode_bytes (cognitive 21): perry_runtime::text::decode_bytes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), match/switch 2 (4 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/perry-runtime/src/text.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c9566210364e1546b0f085761c49b8708f0c1f91566adf85eee9a450e14951"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::typedarray_props::typed_array_get_own_property_descriptor (cognitive 21): perry_runtime::typedarray_props::typed_array_get_own_property_descriptor has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/typedarray_props.rs"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"37bbb09ee55002b0e677256b5823bef79873d1dc513dc830be8fc4146991d83a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::util_parse_env::parse_env (cognitive 21): perry_runtime::util_parse_env::parse_env has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 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/perry-runtime/src/util_parse_env.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03d903c1a82bb7841202c73e8b93ab52a230114b3ba98a0e30dc34b454c3355"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::wpfacts_check::perry_wpfacts_check_field (cognitive 21): perry_runtime::wpfacts_check::perry_wpfacts_check_field has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 6 (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/perry-runtime/src/wpfacts_check.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc9ed8e11194df3df72e18970a4e0f2bfcab7d673f401f638bbdde5c9ad3593"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::sqlite::better::js_sqlite_stmt_columns (cognitive 21): perry_stdlib::sqlite::better::js_sqlite_stmt_columns has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 1 (6 pts), loops 1 (5 pts) (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/perry-stdlib/src/sqlite/better.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"7495f4bd5338bbf565ba46687b5bcac0fca531cdb84fc79e7b547dfd263df6e9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::break_continue::fix_placeholder_state (cognitive 21): perry_transform::generator::break_continue::fix_placeholder_state has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 2 (nesting depth added 13). Most of this is not in the body itself: 6 of the 21 points are its own statements and the rest belongs to one function item inside it that branches (fix_branch). 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/perry-transform/src/generator/break_continue.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b38aedc50048ac4611a2c7784082dba9950b12d85efe1092750a165b9d1c4e1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::private_frame::lower_list::catch_binders (cognitive 21): perry_transform::generator::private_frame::lower_list::catch_binders has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 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. This shape REPEATS in the file: 2 other methods here (perry_transform::generator::private_frame::lower_list, perry_transform::generator::private_frame::lower_list::ids) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/perry-transform/src/generator/private_frame.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7c52a4fbfd478790fc4d09d4593c2edece0b9c0692b473330c139f05830e43"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_android::audio::start (cognitive 21): perry_ui_android::audio::start has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 4 (5 pts), 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/perry-ui-android/src/audio.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb40f73e02121ab233f6420db5ad558428bdb8fa375e8421c720b810da58df1d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_android::widgets::set_width (cognitive 21): perry_ui_android::widgets::set_width has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (21 pts) (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/perry-ui-android/src/widgets/mod.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"219d1ccd896475eb85a17aaf395e7ede72a7efaf7bed61fe908a16dfcc5d4732"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_android::widgets::set_hugging (cognitive 21): perry_ui_android::widgets::set_hugging has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (21 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/perry-ui-android/src/widgets/mod.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5058b538984049ac65af8ac8940c46f4a18bf977f89a0e426483bbbf7a7b4c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_gtk4::widgets::clear_children (cognitive 21): perry_ui_gtk4::widgets::clear_children has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (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/perry-ui-gtk4/src/widgets/mod.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe9f011d316f6879cbb5b990f978cf2be007dc3cbbdfe104636e76f091822d2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_gtk4::widgets::add_child_at (cognitive 21): perry_ui_gtk4::widgets::add_child_at has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-gtk4/src/widgets/mod.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"594b7cdbd0f44f4524b5725cf5e49e5a0d1d4554ab89e1b092164ff3cf06a4dd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_ios::widgets::attributed_text::append (cognitive 21): perry_ui_ios::widgets::attributed_text::append has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16 (20 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/perry-ui-ios/src/widgets/attributed_text.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"688d458c4d4d90954a365c520228489c2c67101e2c7aaa4601554024d8c62009"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_tvos::widgets::attributed_text::append (cognitive 21): perry_ui_tvos::widgets::attributed_text::append has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16 (20 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/perry-ui-tvos/src/widgets/attributed_text.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c53068bcf571461d7eec51bbd193954c88bd40ff23772d7712ebb21b938366a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_visionos::widgets::attributed_text::append (cognitive 21): perry_ui_visionos::widgets::attributed_text::append has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16 (20 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/perry-ui-visionos/src/widgets/attributed_text.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccf74e78eec0bd19a5bdff318856d6316f78b3c1b52801cd12fe039bb9ab155"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::pointer::dispatch_message (cognitive 21): perry_ui_windows::pointer::dispatch_message has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (20 pts), 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/perry-ui-windows/src/pointer.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8f0ad986aee54a17eee3fe7e0f0586a0338760b445f475525219c7b7daa1c8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::widgets::image::fetch_url_blocking (cognitive 21): perry_ui_windows::widgets::image::fetch_url_blocking has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 1, 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/perry-ui-windows/src/widgets/image.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"4944673b574b5ed3288f551feef065d5b9c95041c2a63da6ed927c968c98a4f0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wasi::http::transport::connect (cognitive 21): perry_wasi::http::transport::connect has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 2 (4 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/perry-wasi/src/http/transport.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"8302c02a0af00dacd8a7a09f54ee0f204f1296b8cbf6eb1221e2f1e5ba6ddeff"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator::experimental_import (cognitive 21): Generator::experimental_import has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (16 pts), loops 3 (4 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/perry-wit/src/guest_c/asynchronous/imports.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c51711be45832c88919aa5fcd6c888f11944d198824186ba38bf6aad3053c3e"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::apply_store_effects (cognitive 21): Gen::apply_store_effects has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 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/perry-wpfacts/src/gen/export.rs"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a6e4c33f20bf441a9eb366469b850f00d41010cda9e8289e0ea109537d32b0"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::publish_fn_inst (cognitive 21): Model::publish_fn_inst has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 4 (9 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/perry-wpfacts/src/solve/call_and_construct.rs"},"region":{"startLine":1448}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8441807ae160e0aa873846e50c5583a5e1f123edad927bc7771b29e6e074c2"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::field (cognitive 21): Model::field has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 2 (5 pts), boolean chains 4, 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/perry-wpfacts/src/solve.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"a473b71468f40029f6dcda477c14f55ee5902969a58031f90ce7536c31f7b2be"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::proto_node (cognitive 21): Model::proto_node has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 7 (16 pts), loops 1 (4 pts), if/else 1 (nesting depth added 12). 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/perry-wpfacts/src/solve.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c898bca0566f9fd47924897c734ce8f8416cbc03552b5efda20d03a2ab243a"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::implicit (cognitive 21): Model::implicit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 3 (6 pts), match/switch 2 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/solve.rs"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e273ffcb9f630027a68ef4b482748c4a526731d246fb291c69cd5c75679649"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::dump::dump_text (cognitive 21): perry_wpfacts::dump::dump_text has cognitive complexity 21 (threshold 15). Drivers by points: loops 12 (15 pts), if/else 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/dump.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"603a8e6af619f029134186e6f03a743ebe69ef2fc71634dbb83f2b8f1e368170"}},{"ruleId":"D2","level":"warning","message":{"text":"actions_plan._glob_regex (cognitive 21): actions_plan._glob_regex has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 2, 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":"scripts/actions_plan.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b075d2e1073370085e8a50ea2b4c3cdd2e53c78292129368505ef3faef9cb337"}},{"ruleId":"D2","level":"warning","message":{"text":"check_cross_thread_promise_provenance.analyze_source (cognitive 21): check_cross_thread_promise_provenance.analyze_source has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 5 (10 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":"scripts/check_cross_thread_promise_provenance.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ceda5b340e125a29683b59cd9cce28d7203278a7b097e5392533e31db66b886"}},{"ruleId":"D2","level":"warning","message":{"text":"check_gc_doc_claims.self_test (cognitive 21): check_gc_doc_claims.self_test has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18, boolean chains 2, loops 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":"scripts/check_gc_doc_claims.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"22338cb4ec49371629f562dafe17ff977d396ace38e5614c4ebe87ed54132a5b"}},{"ruleId":"D2","level":"warning","message":{"text":"check_js_body_call_funnel.transmute_targets (cognitive 21): check_js_body_call_funnel.transmute_targets has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check_js_body_call_funnel.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"666a8f27fd35fba26e95f1b32c0e9f2eb113e2bf64064427308d42c169fa0eb8"}},{"ruleId":"D2","level":"warning","message":{"text":"check_npm_publish_freshness.main (cognitive 21): check_npm_publish_freshness.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3, loops 2 (3 pts), error handling 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check_npm_publish_freshness.py"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ccce30a1382041d805f5870ce24388776db4a7019ab6c2aa660b676961cc03c"}},{"ruleId":"D2","level":"warning","message":{"text":"ci_plan.plan (cognitive 21): ci_plan.plan has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, ternaries 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":"scripts/ci_plan.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3ae7f748bebdd3851d4ec4a49cb48c422405d5d9a497b3117e32695cebac8e"}},{"ruleId":"D2","level":"warning","message":{"text":"analyzers.summarize_gc_trace (cognitive 21): analyzers.summarize_gc_trace has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, loops 3 (4 pts), error handling 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":"scripts/compiler_output_harness/analyzers.py"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ed5edacf7f9004693abc703c21a037518368063f5ee44224b6dd87bb3ab75f"}},{"ruleId":"D2","level":"warning","message":{"text":"verification.named_region_contract_results (cognitive 21): verification.named_region_contract_results has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 3, 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":"scripts/compiler_output_harness/verification.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a542b763f556fb2b8b151039605ac995a1b9dac4ac7637d26748aca15a33da"}},{"ruleId":"D2","level":"warning","message":{"text":"verification._text_check_passes (cognitive 21): verification._text_check_passes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 9 (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":"scripts/compiler_output_harness/verification.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"27529c026a05771d84aa682e69db46bb67fed14ce78e52435ef6a4638eb9f08a"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_parse_churn_layout_check.evaluate (cognitive 21): gc_parse_churn_layout_check.evaluate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 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":"scripts/gc_parse_churn_layout_check.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"273872c985672a11901f2095ab501d1571ef463155a940ac657f15be105c9e0c"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check._c_symbol_bodies (cognitive 21): gc_root_dominance_check._c_symbol_bodies has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 4 (10 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"578aba34d3ef67a80fe6463613eb6114a6d7fa6fcdd9994ea0d8090c838a6beb"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.indented_macro_exports (cognitive 21): gc_root_dominance_check.indented_macro_exports has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (9 pts), boolean chains 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4b6a8e33301ca0e23a99a748e3997b772c8be144eb0fb0d678b88799bc07c1"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.load_allowlist (cognitive 21): gc_root_dominance_check.load_allowlist has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, loops 2 (3 pts), error handling 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":2472}}}],"partialFingerprints":{"codehealthFindingId/v1":"446efb99f89124e610d24be13a5795a0998f403f3ef9436f6795a56c08633d9a"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.window_hits_generic (cognitive 21): gc_root_dominance_check.window_hits_generic has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":3303}}}],"partialFingerprints":{"codehealthFindingId/v1":"152d79d0f2b46232a401a64af759cb929a213c61ef34812709abd32fb950bfb4"}},{"ruleId":"D2","level":"warning","message":{"text":"link_absence.text_bounds (cognitive 21): link_absence.text_bounds has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (8 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":"scripts/link_absence.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"473403b4baaf3c9fd4804bf4174ec830d0d2e4134297e687131df55ad185b49a"}},{"ruleId":"D2","level":"warning","message":{"text":"native_abi_evidence_report.release_symbol_summary (cognitive 21): native_abi_evidence_report.release_symbol_summary has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9, boolean chains 7, ternaries 5. 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":"scripts/native_abi_evidence_report.py"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"8131929b141d9cd1c7559f726d245c5fdd02a4a41288be9424556793cde8e3d1"}},{"ruleId":"D2","level":"warning","message":{"text":"perf_objops_lane.gc (cognitive 21): perf_objops_lane.gc has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (6 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":"scripts/perf_objops_lane.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"02031b57b3bcf5f8d11f6041b1b3d28ab0406841756921c32e819d35a28ca309"}},{"ruleId":"D2","level":"warning","message":{"text":"record_function_order.main (cognitive 21): record_function_order.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 3, error handling 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":"scripts/record_function_order.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"3506f424d027d285612b888bd539160058d60c16bf0964733926cb8926bc9f01"}},{"ruleId":"D2","level":"warning","message":{"text":"schemadec_profile.main (cognitive 21): schemadec_profile.main has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 4 (6 pts), loops 3 (4 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":"scripts/schemadec_profile.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b665ed1971bd538ea2dc0f419779d0e3bf615a72748c24d1cb3c46eb0d0ada1"}},{"ruleId":"D2","level":"warning","message":{"text":"string_validator_inventory.check (cognitive 21): string_validator_inventory.check has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 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":"scripts/string_validator_inventory.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a6e7ce257c30c581391cd26b9cd2efceefb2ee955fc8d35402e89d4f3f4c0c"}},{"ruleId":"D2","level":"warning","message":{"text":"tokio_inventory.source_hits (cognitive 21): tokio_inventory.source_hits has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (6 pts), boolean chains 2, error handling 1 (2 pts), 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":"scripts/tokio_inventory.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69b0089493741293153051adb46a451a7a57ee35b3f85a527951e088a0d8a4b"}},{"ruleId":"D2","level":"warning","message":{"text":"unrooted_local_shape.self_test (cognitive 21): unrooted_local_shape.self_test has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 4, boolean chains 3, error handling 1 (2 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":"scripts/unrooted_local_shape.py"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d0093c6cd743fcf6afe21c45b0352f8379f369c643d5a8d2ec6039845e79db"}},{"ruleId":"D2","level":"warning","message":{"text":"wasi_build_runtime.main (cognitive 21): wasi_build_runtime.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (4 pts), boolean chains 2, error handling 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":"scripts/wasi_build_runtime.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edf555c5b0a56e068456f7d47c040a06e2c0bb74c08d8e69ab7a2772cbbe56a"}},{"ruleId":"D2","level":"warning","message":{"text":"wpfacts_corpus.run_sabotage (cognitive 21): wpfacts_corpus.run_sabotage has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 4 (8 pts), boolean chains 1, 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":"scripts/wpfacts_corpus.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b6ad19cb30e2cd07887800351df928d940565a3b92513df5580a6e333a2b0c"}},{"ruleId":"D2","level":"warning","message":{"text":"Solver.load_from (cognitive 21): Solver.load_from has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 8 (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":"scripts/wpfacts_recompute.py"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ef184cb2e2778cdfa365c37d7540e2752158139f3c119d67f7bdddc2c94ffd"}},{"ruleId":"D2","level":"warning","message":{"text":"binding_pins.parseBindings (cognitive 21): binding_pins.parseBindings has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 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":"scripts/binding_pins.mjs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb6ac6516cc1e048963179142b1264df3d282fb8da251772c9b5ae2b4b589b4"}},{"ruleId":"D2","level":"warning","message":{"text":"node_compat_matrix.summarize (cognitive 21): node_compat_matrix.summarize 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":"scripts/node_compat_matrix.mjs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"cadb0455a73ed570d900d3a597424c52c3b3df9765007bc5c5c2538cff05f1ef"}},{"ruleId":"D2","level":"warning","message":{"text":"shared.extractFirstJson (cognitive 21): shared.extractFirstJson has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 1, loops 1, ternaries 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":"scripts/publish/shared.mts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25c6c64acdec3c6fc2f61139b2dccf5be836c3d5e1f1889225f7483f4b598b7"}},{"ruleId":"D2","level":"warning","message":{"text":"buildImports::class_call_method (cognitive 21): buildImports::class_call_method has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 5, 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/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2abc3a44773e4bb7e25c4fb8012d0de99c5455676795d3a5968b3d3b706b209"}},{"ruleId":"D2","level":"warning","message":{"text":"_perry_audio_start_voice (cognitive 21): _perry_audio_start_voice has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8, boolean chains 7, error handling 4 (6 pts) (nesting depth added 2). Of this number, 16 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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4263}}}],"partialFingerprints":{"codehealthFindingId/v1":"af771c5a6c0a72143e298b7d9fe4d893fc4b628f065493bcaa7a4e440304a262"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::cache::info (cognitive 20): perry::commands::cache::info has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (6 pts), match/switch 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/perry/src/commands/cache.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f93253dba0882c383ac70bdf31a7a209f6b45309b558e99995d5b3a5c75efc0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::cjs_link::stmt (cognitive 20): perry::commands::compile::cjs_link::stmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), 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/perry/src/commands/compile/cjs_link.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"69af5112df9bee4ba6b1b5f4aa8743c2b25eb45249b4a0c251d9c9662412e1f9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::extract_exports::extract_named_exports_from_require (cognitive 20): perry::commands::compile::cjs_wrap::extract_exports::extract_named_exports_from_require has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (18 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/perry/src/commands/compile/cjs_wrap/extract_exports.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"658eb4daba0cb503a6fff6af71382c1921d6eaa704f5a62bad6944df3ff12740"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::extract_requires::identifier_is_declared_binding (cognitive 20): perry::commands::compile::cjs_wrap::extract_requires::identifier_is_declared_binding has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, 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/perry/src/commands/compile/cjs_wrap/extract_requires.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f6804f4de767903ab9c0a04eac983bb2b90e691aebc1eceacec631e2c00374"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::link::add_node_api_host_link_args (cognitive 20): perry::commands::compile::link::add_node_api_host_link_args has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 7 (9 pts), boolean chains 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/link/mod.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a741851bc1c1c305498e8fef0f753bc2be715ba86607ed7b08706dee7bae4c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::resolve::resolve_exports_candidates::collect (cognitive 20): perry::commands::compile::resolve::resolve_exports_candidates::collect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 4 (9 pts), boolean chains 1, match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/resolve.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab378756c430b99b39e37d76c686332039ef6e7305e2657776f442610b32f173"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::resolve::tsconfig_paths::strip_jsonc (cognitive 20): perry::commands::compile::resolve::tsconfig_paths::strip_jsonc has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 3 (7 pts), boolean chains 4, 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/perry/src/commands/compile/resolve/tsconfig_paths.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"009a0268a09accb6047bb86b5d997002309f7c8b09b87b41861748a9242326d3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::resolve::tsconfig_paths::strip_trailing_commas (cognitive 20): perry::commands::compile::resolve::tsconfig_paths::strip_trailing_commas has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), 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/perry/src/commands/compile/resolve/tsconfig_paths.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a534f5a48a442e27f329900723e41a8899ae21214b8589f2b4f4ca4649b08c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::size_report::render_markdown (cognitive 20): perry::commands::compile::size_report::render_markdown has cognitive complexity 20 (threshold 15). Drivers by points: loops 8 (14 pts), if/else 6 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/size_report.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"917a95489ef56a4116b2f54a1c80730075f04787f2d15aa9ca2033a6a9536003"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::harmonyos_hap::compile_ets_to_abc (cognitive 20): perry::commands::harmonyos_hap::compile_ets_to_abc has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (16 pts), loops 2, boolean chains 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/harmonyos_hap.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd64f583e65b0342c2ec3f2bd239137f40cbf7aeda562c215a8099334ee61255"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::install::scanner::walk (cognitive 20): perry::commands::install::scanner::walk has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/install/scanner/mod.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"150a85de6295f3eab61661233a9bcbf6c1de8e295cdab12cd62e395cecf44192"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::update_checker::extract_archive (cognitive 20): perry::update_checker::extract_archive has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/update_checker.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"e326d2343a429ca9ddea45a19745d0522aa44665286ffa9e0c6bc95a97f5556c"}},{"ruleId":"D2","level":"warning","message":{"text":"FnReader::call_asm (cognitive 20): FnReader::call_asm has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 4 (5 pts), boolean chains 1, 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/perry-codegen/src/dialect/mod.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf2be94729a96dcd8a6b05739fda0b78e8f07048da6d4a4df8a6cc0fd0ef7f0"}},{"ruleId":"D2","level":"warning","message":{"text":"FnReader::binary_or_cast (cognitive 20): FnReader::binary_or_cast has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 3 (5 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/perry-codegen/src/dialect/mod.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06b46e9233cbda540efb3a84914eb41501332a52b1f99453049cba65b08944e"}},{"ruleId":"D2","level":"warning","message":{"text":"Rewrite::stmt (cognitive 20): Rewrite::stmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), 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/perry-codegen/src/scope_env/pass.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b02472612a4b3ee78abee4398d66b18f9405cc15134b81852e7d9f2f1eb4b9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::boxed_vars::writes_all_precede_captures::find_home (cognitive 20): perry_codegen::boxed_vars::writes_all_precede_captures::find_home has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), 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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e32bc59100efc3b7148f133d2941891eba536836072e36a0473740d6d57e8f8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::boxed_vars::collect_nested_closure_boxed_vars_in_stmt (cognitive 20): perry_codegen::boxed_vars::collect_nested_closure_boxed_vars_in_stmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), 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. This shape REPEATS in the file: 3 other methods here (perry_codegen::boxed_vars::collect_closure_refs_and_writes_in_stmt, perry_codegen::boxed_vars::collect_outer_writes_in_stmt, perry_codegen::boxed_vars::collect_write_ids_in_stmt) 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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f211eb783ac747887f2ef86131c55f9e3e57b35002fcdff2db39acf53121c08"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::boxed_vars::collect_closure_refs_and_writes_in_stmt (cognitive 20): perry_codegen::boxed_vars::collect_closure_refs_and_writes_in_stmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), 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. This shape REPEATS in the file: 3 other methods here (perry_codegen::boxed_vars::collect_nested_closure_boxed_vars_in_stmt, perry_codegen::boxed_vars::collect_outer_writes_in_stmt, perry_codegen::boxed_vars::collect_write_ids_in_stmt) 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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab80eb4792740ce553fddd2c86f651bf7949e5d4d1f533e27b6305260f6b3b1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::boxed_vars::collect_outer_writes_in_stmt (cognitive 20): perry_codegen::boxed_vars::collect_outer_writes_in_stmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), 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. This shape REPEATS in the file: 3 other methods here (perry_codegen::boxed_vars::collect_nested_closure_boxed_vars_in_stmt, perry_codegen::boxed_vars::collect_closure_refs_and_writes_in_stmt, perry_codegen::boxed_vars::collect_write_ids_in_stmt) 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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a14bc3f554c0eea0b75db38a4ca5f2981f01f9c1e58dd13d23379a9a8bfaff"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::boxed_vars::collect_write_ids_in_stmt (cognitive 20): perry_codegen::boxed_vars::collect_write_ids_in_stmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), 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. This shape REPEATS in the file: 3 other methods here (perry_codegen::boxed_vars::collect_nested_closure_boxed_vars_in_stmt, perry_codegen::boxed_vars::collect_closure_refs_and_writes_in_stmt, perry_codegen::boxed_vars::collect_outer_writes_in_stmt) 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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"901fc9eea0881ce7693a7caf315aaaab31753ec055ec829cb673638a191a6bf0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::entry::shims::collect_entry_env_literals (cognitive 20): perry_codegen::codegen::entry::shims::collect_entry_env_literals has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 8). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 3 function items inside it that branch (record, descend_iife, scan). 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/perry-codegen/src/codegen/entry/shims.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"250ebd668b39bbc8052383bcc4a30612ab232c95ee0e36a8f99e51fb8d1e2e66"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::entry_outline::find_cjs_factory_closure (cognitive 20): perry_codegen::codegen::entry_outline::find_cjs_factory_closure has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 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/perry-codegen/src/codegen/entry_outline.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"d503aa92e26df33fc9ae19f98aca888bda774c96737bd3fb4ee07102157cf8ea"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::param_guard::visit_tracking_bits (cognitive 20): perry_codegen::codegen::param_guard::visit_tracking_bits has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 5 (7 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":"crates/perry-codegen/src/codegen/param_guard.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a9a4fa9ee6b9cbaf1e0c0c5db8d0dd68e7e383307ded0da82cf7b107b06168"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::param_guard::guarded_undefined_method_candidate (cognitive 20): perry_codegen::codegen::param_guard::guarded_undefined_method_candidate has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 15, if/else 4, match/switch 1. Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to 3 function items inside it that branch (body_has_loop_guard, is_synthetic_undefined_default, expr_has_guard). 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/perry-codegen/src/codegen/param_guard.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04b3da14873027c32b14a9d1f39686327452e42efc7d0f8626f6bf39b71c75a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::string_pool::image::emit (cognitive 20): perry_codegen::codegen::string_pool::image::emit has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 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/perry-codegen/src/codegen/string_pool/image.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70be8175e003e8fa252803d94bd1fd02a3efe6e4f48dd40b3332e171354b38d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::definite_init::sole_declarator (cognitive 20): perry_codegen::collectors::definite_init::sole_declarator has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (18 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/perry-codegen/src/collectors/definite_init.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2f6c4059c5ba642f392becb3ae04f8725c3a394538c2259faec5c57c614f3f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::hoisted_callback_calls::walk_stmt (cognitive 20): perry_codegen::collectors::hoisted_callback_calls::walk_stmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), 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/perry-codegen/src/collectors/hoisted_callback_calls.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c448e9b14e7061c84a262669b672cf9bdee66aa40746ab0da757d6fc4834b811"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::hoisted_callback_calls::collect_hoisted_callback_calls (cognitive 20): perry_codegen::collectors::hoisted_callback_calls::collect_hoisted_callback_calls has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (6 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/perry-codegen/src/collectors/hoisted_callback_calls.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"baabfbd600319fd796a5b8a1b4a1b3903e2e5b26a6e9895ce75e84f21f2f69ba"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::hot_callees::collect_hot_loop_callees (cognitive 20): perry_codegen::collectors::hot_callees::collect_hot_loop_callees has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (12 pts), if/else 3 (8 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. This shape REPEATS in the file: one other method here (perry_codegen::collectors::hot_callees::collect_closure_alloc_sites) 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/perry-codegen/src/collectors/hot_callees.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf90d01aed3e4c7ebc5c36cbadb084ec3a4863abfe61843ff8a543291e1f38d2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::hot_callees::collect_closure_alloc_sites (cognitive 20): perry_codegen::collectors::hot_callees::collect_closure_alloc_sites has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (12 pts), if/else 3 (8 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. This shape REPEATS in the file: one other method here (perry_codegen::collectors::hot_callees::collect_hot_loop_callees) 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/perry-codegen/src/collectors/hot_callees.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2caddd18c6090cca3365fc63baf78fe0c34ac87fcb9001dda58a9b3b1d24875"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::int_valued_ta_locals::additive_flow_stmt (cognitive 20): perry_codegen::collectors::int_valued_ta_locals::additive_flow_stmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (3 pts), loops 1 (2 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/perry-codegen/src/collectors/int_valued_ta_locals.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"67be65d885573f5eeca02f849ead4c1668bc89889b85b44589632b46fb5ebfaf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_returns::collect_return_shape_functions (cognitive 20): perry_codegen::collectors::ptr_shape_returns::collect_return_shape_functions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, loops 4 (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/perry-codegen/src/collectors/ptr_shape_returns.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5324552152e1f0d0ddfd489bd114d83a818d1e04d0f5dbbd3c193dff8688a3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::sealed_buffers::never_string_locals (cognitive 20): perry_codegen::collectors::sealed_buffers::never_string_locals has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 5 (8 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/perry-codegen/src/collectors/sealed_buffers.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"55931f1c6f247b8c09190d5a975d29e284498be12a4ad0ec18069d5577947098"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::uppercase_strings::check_uses_in_stmt (cognitive 20): perry_codegen::collectors::uppercase_strings::check_uses_in_stmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), 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/perry-codegen/src/collectors/uppercase_strings.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20952208a29e24937849e4d63e9dd25e443e54d6cfb36590b28b99f6ea836a6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::os_uri_dates::lower (cognitive 20): perry_codegen::expr::os_uri_dates::lower has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 2 (3 pts) (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/perry-codegen/src/expr/os_uri_dates.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"895facfc0e95a0ddefd013c03f39758e47257b4841fe9ad8853a5c8e70ba906b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::property_set::emit_proven_class_field_store (cognitive 20): perry_codegen::expr::property_set::emit_proven_class_field_store has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 6, 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/perry-codegen/src/expr/property_set.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82c5b4e61860d7a3cdff0faf2fe60a3cf29a14257b12b5f567ff099253b4984"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::wpfacts_access::lower_guarded_get (cognitive 20): perry_codegen::expr::wpfacts_access::lower_guarded_get has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 3 (7 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 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/perry-codegen/src/expr/wpfacts_access.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ce22ff6800b639616049d59d598d92bb48b255e8ee0db64596a75440b60866"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_families::class_keys (cognitive 20): perry_codegen::layout_families::class_keys has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (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/perry-codegen/src/layout_families.rs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1033a4388f8356182832788083d1c33e5eb64ed6a3fea7a6b6b4c80c110ad74"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::buffer_intrinsic::emit_numeric_load (cognitive 20): perry_codegen::lower_call::buffer_intrinsic::emit_numeric_load has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/buffer_intrinsic.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"0059c94431ab1de6d0296eff041a731f19d8b559a06ef0c5de09461f7adf0120"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::counter_range::classify_for_counter_range (cognitive 20): perry_codegen::stmt::counter_range::classify_for_counter_range has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 3, 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/perry-codegen/src/stmt/counter_range.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a454187dc94ac4c33ce6bc3ec5f3f06469fafc319f4784ab2ab719e172f53fa"}},{"ruleId":"D2","level":"warning","message":{"text":"WasmModuleEmitter::collect_strings_in_stmt (cognitive 20): WasmModuleEmitter::collect_strings_in_stmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), 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/perry-codegen-wasm/src/emit/string_collection.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a755c88ca0c7615c780808246705d23fecbad78744600e6b0090163798776f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_component_host::async_values::reader::generate (cognitive 20): perry_component_host::async_values::reader::generate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19, loops 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/perry-component-host/src/async_values/reader.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e7659e27797f247b19f62ccfdf69ac05f3bbc5a40eee7500348b2d31a4ebfa"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_component_host::driver::run (cognitive 20): perry_component_host::driver::run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 3 (6 pts), boolean chains 1, 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/perry-component-host/src/driver.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f11251b00f2defa07c4320fc67fae9edf924c0b96583f0b7e3f22f80f9e287"}},{"ruleId":"D2","level":"warning","message":{"text":"AppleContainerProtocol::create_args (cognitive 20): AppleContainerProtocol::create_args has cognitive complexity 20 (threshold 15). Drivers by points: loops 8 (11 pts), if/else 9 (nesting depth added 3). 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/perry-container-compose/src/backend/apple.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce64b14748354c5b87750e5a72f0e3d96af75239593de553b3a5cee83843d07"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_container_compose::capabilities::unsupported_feature_names (cognitive 20): perry_container_compose::capabilities::unsupported_feature_names has cognitive complexity 20 (threshold 15). Drivers by points: if/else 20. 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/perry-container-compose/src/capabilities.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"348b56f387eb6b7165d438ef31404f16e4144bdbf7b114a9253d44c594683222"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::client_turnloop::native_client::start_on_socket (cognitive 20): perry_ext_http::client_turnloop::native_client::start_on_socket has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 2 (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/perry-ext-http/src/client_turnloop/native_client.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01a77e7074adceadb577fa12e0d4561f2aaa5e654d4ab3aeac58e1b19c92254"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::client_turnloop::protocol::process (cognitive 20): perry_ext_http::client_turnloop::protocol::process has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 3 (6 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/perry-ext-http/src/client_turnloop/protocol.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bec9f86741bcdb0ed50a71427d8ac931deee3c7520b86fc8fc903d66c3f0734"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::http2_server::pump::process_pending_h2 (cognitive 20): perry_ext_http::server::http2_server::pump::process_pending_h2 has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (3 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/perry-ext-http/src/server/http2_server/pump.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c452f1f32450f8f16b77ed19cb92cd545a9ddd045c8d295ded55318c5f066ec3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_typescript::bun::scan_bun_source (cognitive 20): perry_ext_typescript::bun::scan_bun_source has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 2 (7 pts), loops 2 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-typescript/src/bun.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f087de081ce92c39e9f67bc6bac91a6e2f6e1b7f140252ac3849f6f411bced"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::analysis::substitute_lexical_this_in_stmt (cognitive 20): perry_hir::analysis::substitute_lexical_this_in_stmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), 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/perry-hir/src/analysis.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"833168b7a5f8d5680a2af1aeee2cbf6ae8cc31b26c6ce5bc4acadd200c8e41f4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::builder_fold::value_is_fold_safe (cognitive 20): perry_hir::lower::builder_fold::value_is_fold_safe has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 12, match/switch 4 (8 pts) (nesting depth added 4). 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/perry-hir/src/lower/builder_fold.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c1f2c5715a4bee476def956b2c44c445f3d1f7e71253071e408150002a8f82"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::builder_fold_width_hints::empty_builder_width_hints (cognitive 20): perry_hir::lower::builder_fold_width_hints::empty_builder_width_hints has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 3 (9 pts), 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/perry-hir/src/lower/builder_fold_width_hints.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3615f1c220ea1652ebd812b3997bd5e1fba95c43280f356642c2eb217e8953"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::const_fold_fn::try_const_fold_function_construct_kind (cognitive 20): perry_hir::lower::const_fold_fn::try_const_fold_function_construct_kind has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 4 (5 pts), boolean chains 3, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/const_fold_fn.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b64f3f2d2386a66832a95a295bc39489e2473718063d0b02b648b2511dc996"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::const_fold_fn::param_early_error::fn_ctor_kind_param_early_error (cognitive 20): perry_hir::lower::const_fold_fn::param_early_error::fn_ctor_kind_param_early_error has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 10, match/switch 6 (10 pts) (nesting depth added 4). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 2 function items inside it that branch (expr_has, pat_has). 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/perry-hir/src/lower/const_fold_fn/param_early_error.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e7aed2efa56fef914bda3b0a644abb1ea02d9a91bc424aaf318d2c2d056cc6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_object::lower_accessor_prop (cognitive 20): perry_hir::lower::expr_object::lower_accessor_prop has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 3 (5 pts), boolean chains 3, loops 2 (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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"62481904b4dea29fe4ad625c62c11d2c862c78573d60cf6b3c4b50e775614bd8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::misc::is_generator_call_expr (cognitive 20): perry_hir::lower::misc::is_generator_call_expr has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/misc.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"92882af6d955a1b8d84ae7b1393592d42892f58b3a637188d14654c8f5d8d844"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::module_tdz::rw_stmt (cognitive 20): perry_hir::lower::module_tdz::rw_stmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), 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/perry-hir/src/lower/module_tdz.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"209646a38a916d17f3a2dda1399adf23254061a19bd88e0fce30839a1310732e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::widget_decl::try_parse_family_case (cognitive 20): perry_hir::lower::widget_decl::try_parse_family_case has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 4 (6 pts), loops 1 (2 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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d8f16f7a6321c3ef34d4e7e59f1c008c99e1c069af7f53bba59f15ab45d2d9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::block::collect_top_level_let_ids_stmt (cognitive 20): perry_hir::lower_decl::block::collect_top_level_let_ids_stmt has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 3 (6 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_decl/block.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b58b2698f8880c35260d3bbd93396839c5dd2634f95796f653ac64492b710e5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::private_members::lower_private_method_in_scope (cognitive 20): perry_hir::lower_decl::private_members::lower_private_method_in_scope has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 3 (4 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/perry-hir/src/lower_decl/private_members.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27bde338c531b675245dced9d5085b0b1c9574b7c442739f658b267ec346505"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::static_init::build_interleaved_static_init_stmts_impl (cognitive 20): perry_hir::lower_decl::static_init::build_interleaved_static_init_stmts_impl has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), boolean chains 2, 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/perry-hir/src/lower_decl/static_init.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"693191be4a10bdf02b131cf152627af238bf184a40e3137ace23c8feafcc291a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::monomorph::driver::collect_instantiations_in_stmt (cognitive 20): perry_hir::monomorph::driver::collect_instantiations_in_stmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), 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/perry-hir/src/monomorph/driver.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"4817f780c5870dfb464b58b37a5f77b681884105fdebf525fa8f94e39d837d1c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::monomorph::update_call_sites::update_call_sites_in_stmt (cognitive 20): perry_hir::monomorph::update_call_sites::update_call_sites_in_stmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), 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/perry-hir/src/monomorph/update_call_sites.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c46692633f56f0496e280e87165fd982615a94ff462ce3e7f07d6b644598050"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::tdz_check::for_each_module_stmt_list (cognitive 20): perry_hir::tdz_check::for_each_module_stmt_list has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 6 (10 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/perry-hir/src/tdz_check.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb7a86b88d9ad31561f3336eb98fbda4e070ca02c77a931a561d6879fef51a9"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::plain_object (cognitive 20): Writer::plain_object has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, 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/perry-runtime/src/thread/clone_write.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"bddf8aba7a929f6688ea563e325f4be1e2d5076e44fdc31bec2d787fc36af468"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::flat_clone::js_array_flat_into (cognitive 20): perry_runtime::array::flat_clone::js_array_flat_into has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (19 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/perry-runtime/src/array/flat_clone.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b653184861ce7829d71716753a2fb04fd03d1bfe5c28b79f002a57e86f90802"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::flat_clone::js_array_flat (cognitive 20): perry_runtime::array::flat_clone::js_array_flat has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/array/flat_clone.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"48663289f58b2a0157e23958e4f6bccdfdc10178ce8817b8520fd2aafd74c344"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::indexing_keyed::js_array_set_string_key (cognitive 20): perry_runtime::array::indexing_keyed::js_array_set_string_key has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 3, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/array/indexing_keyed.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1defd966b75be380ef950e35443c1555391c109c9e53cf570076b110a40854"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::indexing_read_cold::plain_index_get (cognitive 20): perry_runtime::array::indexing_read_cold::plain_index_get has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (17 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/perry-runtime/src/array/indexing_read_cold.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d7479c0d66db855a301a087ad3720193e83cdd60c4433f2fdd0aecc6af6588"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::iter_methods::js_array_filter (cognitive 20): perry_runtime::array::iter_methods::js_array_filter has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (3 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/perry-runtime/src/array/iter_methods.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"5399d6337e7aff762434f6b132b321fa6feb2ed8ecdc560c6455ef33e533754c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::builtins::formatting::errors::format_error_subclass_headline (cognitive 20): perry_runtime::builtins::formatting::errors::format_error_subclass_headline has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 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/perry-runtime/src/builtins/formatting/errors.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b10fad4ba41ed02a98aa5b85cb1d33061d5ce932007cafd07e32c6984a41062"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::builtins::globals::js_unescape (cognitive 20): perry_runtime::builtins::globals::js_unescape has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (16 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/perry-runtime/src/builtins/globals.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"35609656bcfe9d533b03393df72b5dc89592cfea9939ce86822b0bfaf3353523"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::bun_compat::cli_utils::wrap_word_paragraph (cognitive 20): perry_runtime::bun_compat::cli_utils::wrap_word_paragraph has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (5 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":"crates/perry-runtime/src/bun_compat/cli_utils.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85c5f481b1b2f7cd23c2eb6456f1d793e84b7c3a52a22cbc801a266d17ffd91"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::child_process::reactor::stdin_drain::cp_stdin_written (cognitive 20): perry_runtime::child_process::reactor::stdin_drain::cp_stdin_written has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 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/perry-runtime/src/child_process/reactor/stdin_drain.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"66bea7742e033ed3f259694b3a9643e24b53e3b64faa5680b2a2954d89fbd8dd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::cluster_sched::worker_recv_loop (cognitive 20): perry_runtime::cluster_sched::worker_recv_loop has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 4 (8 pts), boolean chains 1 (nesting depth added 9). 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/perry-runtime/src/cluster_sched.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ba68b15439ec0a5cffb30c12dd778fe42c24e5cb541b86f4b2edb2713460bf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::component::persistent::imports::drain_replies (cognitive 20): perry_runtime::component::persistent::imports::drain_replies has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (19 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/perry-runtime/src/component/persistent/imports.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f0c940bbc622c35976a0b11a66f92fb684039f71e0af880a75685d622885ab"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::dns_resolver::parse_hosts_file (cognitive 20): perry_runtime::dns_resolver::parse_hosts_file has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (4 pts), match/switch 1 (2 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/perry-runtime/src/dns_resolver.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"5970ef4c9fb2e089fb1abba7d0976f60b9a520b6ba36e476ff8ed2f66dc7efa0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::fs::cp::copy_symlink_with_options_depth (cognitive 20): perry_runtime::fs::cp::copy_symlink_with_options_depth has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 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/perry-runtime/src/fs/cp.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"46bcde1979eb220db0c6a3c7dd48e1aa9fdcfaae10db6b7258d8a1a853b0fedb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::census::take_census (cognitive 20): perry_runtime::gc::census::take_census has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 5, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/gc/census.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"1605ef64d2998b6525557aeeb619612ac193c83eb3d41f7b1437ef7b02e5824b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::copying::remembered_scan::scan_remembered_dirty_slots_copying (cognitive 20): perry_runtime::gc::copying::remembered_scan::scan_remembered_dirty_slots_copying has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7, loops 3 (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/perry-runtime/src/gc/copying/remembered_scan.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"e683d56f6c6b8670483c80ad385ddb942049d56f24111df8c463eaa17288f8ae"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::list_relative_plural::plural_category (cognitive 20): perry_runtime::intl::list_relative_plural::plural_category has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 9, 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/perry-runtime/src/intl/list_relative_plural.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"36858606157c0e242ba71a5f74d8b341f7ac0aabada98dda1ae64b5898017aed"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::parse_inline_object::decode (cognitive 20): perry_runtime::json::parse_inline_object::decode has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/json/parse_inline_object.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"009fd3632d2c798d7d77f9446ac313eb7a770b00fcfeec13b5b4a9a192cd7b80"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::stringify_api::try_stringify_lazy_array (cognitive 20): perry_runtime::json::stringify_api::try_stringify_lazy_array has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, 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/perry-runtime/src/json/stringify_api.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bea18d49c4cae7fa94aaea9a6882072e91573741e97432ac2ac6c07dc69ebd3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::stringify_record_output::emit_repeated_output (cognitive 20): perry_runtime::json::stringify_record_output::emit_repeated_output has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, 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/perry-runtime/src/json/stringify_record_output.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"92da8d82ea4d7a7558ea7a9e0de18eea0aedbb2eb1f45edba3c49cbe229334c3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::map::map_init_iterable (cognitive 20): perry_runtime::map::map_init_iterable has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (5 pts), match/switch 1 (nesting depth added 8). Of this number, 12 points are the body\u0027s own statements and 8 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/perry-runtime/src/map.rs"},"region":{"startLine":2919}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6336902870f7c86909d479ab89a61f7875220a4fdff640f942939ecb012282"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::module_require::file_url_text::path_to_file_url_string (cognitive 20): perry_runtime::module_require::file_url_text::path_to_file_url_string has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (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/perry-runtime/src/module_require/file_url_text.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8a55838b683f66766b3d8c936050bc47df1433287a5c313e4ba19113b3b44f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_api_host::scan_node_api_roots_mut (cognitive 20): perry_runtime::node_api_host::scan_node_api_roots_mut has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 6, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/node_api_host/mod.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"7982e1f9141ff56032aece6cd0496f866fbdfe98dfee640148a3bdc20d5c2f07"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_stream_constructors::builders::init_duplex_in_place (cognitive 20): perry_runtime::node_stream_constructors::builders::init_duplex_in_place has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (19 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/perry-runtime/src/node_stream_constructors/builders.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d74607726ca71b94821cf2c051549c81a2c3d52d38a1281237f097152552da"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_stream_pipe_dests::write_chunk_to_pipe_destinations (cognitive 20): perry_runtime::node_stream_pipe_dests::write_chunk_to_pipe_destinations has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (19 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/perry-runtime/src/node_stream_pipe_dests.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f33cfa271275f5d946d90221375fe3ba5e8cef83a9b7d741f8f0773052f74c3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_stream_pipe_dests::end_pipe_destinations (cognitive 20): perry_runtime::node_stream_pipe_dests::end_pipe_destinations has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 1, 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/perry-runtime/src/node_stream_pipe_dests.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ce71c1e1dd22387116f34dd872cdef233b0b7bb787e706534eb1612b28c38d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_submodules::zlib::js_zlib_stream_option (cognitive 20): perry_runtime::node_submodules::zlib::js_zlib_stream_option has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 5, 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/perry-runtime/src/node_submodules/zlib.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"07610e5c4dfbbeb72efb2dd4bc5196a0c8d15535311690d741df4d73ab0d4a7b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::transition_cache_lookup (cognitive 20): perry_runtime::object::transition_cache_lookup has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 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/perry-runtime/src/object/mod.rs"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b2f3e9eaafd24660d0a047b9e584e0ee5cdb027872b5e7228a5ca97e159704"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::prototype_objects::ensure_function_prototype_object (cognitive 20): perry_runtime::object::class_registry::prototype_objects::ensure_function_prototype_object has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (19 pts), match/switch 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/perry-runtime/src/object/class_registry/prototype_objects.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b574a491d1a312fa8d658b6ce1cf0ed63ce2c23f6f9a329702a82d51e06b50f6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::descriptor_state::plain_data_write_may_intercept (cognitive 20): perry_runtime::object::descriptor_state::plain_data_write_may_intercept has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (19 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/perry-runtime/src/object/descriptor_state.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1d6d81bfaef0e0fb9c8631bed70f5efcf865caa3e57d7a6322c3abdba2e523"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::descriptors::builders::symbol_own_property_descriptor (cognitive 20): perry_runtime::object::descriptors::builders::symbol_own_property_descriptor has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (20 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/perry-runtime/src/object/descriptors/builders.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"470895cab3696de3261fb4fb5f9b5ca6cc5a738f7c34a27acfe3f6e9c0efc8d1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::class_object_props::class_evaluation_prototype_value (cognitive 20): perry_runtime::object::field_get_set::class_object_props::class_evaluation_prototype_value has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 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/perry-runtime/src/object/field_get_set/class_object_props.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0f197c168dc599c3a8328fe812d09cade5fb68ff3500537ac3b35108df26fc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::ic_miss::private_member_access::js_private_brand_check (cognitive 20): perry_runtime::object::field_get_set::ic_miss::private_member_access::js_private_brand_check has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 6, 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/perry-runtime/src/object/field_get_set/ic_miss/private_member_access.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bbe5668976d75ef88a34e528437fd996cdb56164c6611b26c30c18805996968"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_desc::store::family_add_kind (cognitive 20): perry_runtime::object::layout_desc::store::family_add_kind has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (5 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/perry-runtime/src/object/layout_desc/store.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"181273257f7a8e0eab61a852d162f6a9048e8c9f8b913bf60b70cebd46c497b8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_desc::store::family_add (cognitive 20): perry_runtime::object::layout_desc::store::family_add has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 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/perry-runtime/src/object/layout_desc/store.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc31252200b50df6d1b949e72dd8b13fad7d47a3015c8847a0f1bd4315fdb399"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::method_site::read_holder::inspect::shape_answer (cognitive 20): perry_runtime::object::method_site::read_holder::inspect::shape_answer has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 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/perry-runtime/src/object/method_site/read_holder/inspect.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"90cff2f41bef08c40a22c8e85a0155c4f8f22f92b3e46eec902de290801040ce"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_call_method::disposal::object_has_dispose_method (cognitive 20): perry_runtime::object::native_call_method::disposal::object_has_dispose_method has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, 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/perry-runtime/src/object/native_call_method/disposal.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b21686bac977c6a07045f6243e63c1968614572ae86f24a38f875e45e96847"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::object_ops::descriptor_helpers::try_decode_descriptor (cognitive 20): perry_runtime::object::object_ops::descriptor_helpers::try_decode_descriptor has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (2 pts), match/switch 1 (2 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":"crates/perry-runtime/src/object/object_ops/descriptor_helpers.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc221e3edf704c750eec5cdc3e4f93cf0ced9a7026d300dca12e5e2eb152d9d0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::prototype_chain::resolve_inherited_field_from_prototype (cognitive 20): perry_runtime::object::prototype_chain::resolve_inherited_field_from_prototype has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 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/perry-runtime/src/object/prototype_chain.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"e655311a221a271195b0df7d392af8aea7bc3a03ed02a704685c52b98cf8968a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::shapes::publish_object_shape_from_rep (cognitive 20): perry_runtime::object::shapes::publish_object_shape_from_rep has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, match/switch 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/perry-runtime/src/object/shapes.rs"},"region":{"startLine":4155}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad1feb7352dc6f32d9602b9c2665e3ec1a44642c37f69c4b07ddd27c1d50e45"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::shapes_slot_list::install_external_layout_with_constfn (cognitive 20): perry_runtime::object::shapes_slot_list::install_external_layout_with_constfn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, loops 2 (4 pts), 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/perry-runtime/src/object/shapes_slot_list.rs"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"c382e48ff6b6a5d9069d6cc70f5121725ee6f229649c531ead5dc45e1dd34c04"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::spread::copy_slots (cognitive 20): perry_runtime::object::spread::copy_slots has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 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/perry-runtime/src/object/spread.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7fcf1b70ebfd563109a999ce82b0ed7369c7e3b3204f0065599fd99664ae50"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::spread::spread_general (cognitive 20): perry_runtime::object::spread::spread_general has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 2 (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/perry-runtime/src/object/spread.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6d8f8ae62147f4886fe160d598c03b68e6029a51cc16e010d82005659f7579"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::static_shapes::finalize_constfn_static (cognitive 20): perry_runtime::object::static_shapes::finalize_constfn_static has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/static_shapes.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"4879e930e8e9b1b223108ea369bf08d63e82ea0130727a7b61e7adfdd92823c9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::perf_hooks::scan_perf_entries_roots_mut (cognitive 20): perry_runtime::perf_hooks::scan_perf_entries_roots_mut has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 6 (7 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/perry-runtime/src/perf_hooks.rs"},"region":{"startLine":1748}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa6c3b301318bc7a7647affdda662c74fd3d68caba4557c61558e20fd910369"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::promise::combinators::combinator_iterable_to_array (cognitive 20): perry_runtime::promise::combinators::combinator_iterable_to_array has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 4 (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/perry-runtime/src/promise/combinators.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93f4b62aef8140a33a2b2fc96d86e09b9e9d091ccf54b54770e97ca379896f8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::promise::native_async::js_native_async_process_pending (cognitive 20): perry_runtime::promise::native_async::js_native_async_process_pending has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/promise/native_async.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"241e25c771904cb4b63bee59a300b01d79d19531cb320f0cc63ff26f7d3b62df"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::promise::then::js_promise_reject (cognitive 20): perry_runtime::promise::then::js_promise_reject has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (4 pts), boolean chains 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/perry-runtime/src/promise/then.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab08bfff3720b7b4b972c527e0915af2385ab97946ace3bf74511c69a69bb259"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::regex::perex_api::execute_rooted_output (cognitive 20): perry_runtime::regex::perex_api::execute_rooted_output has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 3 (6 pts), boolean chains 1 (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/perry-runtime/src/regex/perex_api.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd27eb676c42418517cff6e7ce210a529bbb33365a9e0c96a45197a17970acf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::regex::perex_runtime::search_owned (cognitive 20): perry_runtime::regex::perex_runtime::search_owned has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 2 (3 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/perry-runtime/src/regex/perex_runtime.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c661383ed29dc3c74481ef7456630cf1647046955a73f79342c0466db8cf37"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::compare::locale_compare_default (cognitive 20): perry_runtime::string::compare::locale_compare_default has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 3 (4 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/perry-runtime/src/string/compare.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafb6a81d2398830fe1fb38895f089f42fe046d3ad30b4763a6ffc972550f31e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::concat::canonicalize_surrogate_pairs (cognitive 20): perry_runtime::string::concat::canonicalize_surrogate_pairs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 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/perry-runtime/src/string/concat.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"578357322b1d3efb29d933e4ce74d0b23fc472e74631c396bd37e4158144fb18"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::concat::concat_byte_parts (cognitive 20): perry_runtime::string::concat::concat_byte_parts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, loops 2 (4 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/perry-runtime/src/string/concat.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"12db42ca3f7672cf0340d26d687250b75855d127e596f5fa53dde3987e57f482"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::split::js_string_split_part_value (cognitive 20): perry_runtime::string::split::js_string_split_part_value has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 3, match/switch 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/perry-runtime/src/string/split.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5a6de97b9a727ab53e03637b02132671fab3dc6fad88f431e9552e3c9e0deb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::split::js_string_split_value (cognitive 20): perry_runtime::string::split::js_string_split_value has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (20 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/perry-runtime/src/string/split.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6c038c07951f377e975e0380cefbb3d402774db03159c83961943a33037f01"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::turnloop_net::write_queue::flush (cognitive 20): perry_runtime::turnloop_net::write_queue::flush has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/turnloop_net/write_queue.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"002611d6bf6e047e69e97ee8f6c4094404b6d8029d92f7e253ff4724a13f9345"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::typedarray_props::typed_array_set_property_by_name (cognitive 20): perry_runtime::typedarray_props::typed_array_set_property_by_name has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 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/perry-runtime/src/typedarray_props.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e3f4dc6ef020b8c6c531898be41f1411cddd91959ad1317595a8c0832b9192"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::utf8_stream_decoder::utf8_check_incomplete (cognitive 20): perry_runtime::utf8_stream_decoder::utf8_check_incomplete has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (19 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/perry-runtime/src/utf8_stream_decoder.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffbed5fcac44d810d840a971a4005929c366fb0e7ede77394fd6e3f5aab0e1ef"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::validators::received::received_property (cognitive 20): perry_runtime::validators::received::received_property has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 1 (4 pts), boolean chains 1 (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/perry-runtime/src/validators/received.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94b2c5d5dab72bc323f828b21da97b69d20ae2d1c79825567cfd078fda114d1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::cheerio::dispatch_cheerio (cognitive 20): perry_stdlib::cheerio::dispatch_cheerio has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 2, match/switch 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/perry-stdlib/src/cheerio.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"51934442efe31a4391ca38d246189af63a76d1883d294859c153f3655b8fce79"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::crypto::ecdh::dispatch_verify (cognitive 20): perry_stdlib::crypto::ecdh::dispatch_verify has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 5 (8 pts), boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/crypto/ecdh.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f8428a2e858c33a4d92818f7e56c94161b4f405d19fd8f65874ffcd858b400"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::crypto::prime::is_prime_biguint (cognitive 20): perry_stdlib::crypto::prime::is_prime_biguint has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 4 (5 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/perry-stdlib/src/crypto/prime.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"348d539ae521673be37866ed799bb248b2e75aa93138873148d2b18ea827cb99"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::events::module_helpers::js_events_native_dispatch (cognitive 20): perry_stdlib::events::module_helpers::js_events_native_dispatch has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2, loops 1 (2 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/perry-stdlib/src/events/module_helpers.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e6667f88b2d9835d90a95b8ebd6e21099753c85fce24dfb5a52d76b59bada2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::multipart_parser::find_delimiter (cognitive 20): perry_stdlib::multipart_parser::find_delimiter has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 2 (3 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":"crates/perry-stdlib/src/multipart_parser.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"20029bde861244eeabbad27af891553baf9eeb6ecfd49872a4b520bb3c2db855"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::sqlite::better::params_from_array (cognitive 20): perry_stdlib::sqlite::better::params_from_array has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (17 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/perry-stdlib/src/sqlite/better.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa6c9ea3f07c10c1a75ca74086647da687b797a33b3c52eda7dffb5d23b9d77"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::sqlite::better::js_sqlite_pragma (cognitive 20): perry_stdlib::sqlite::better::js_sqlite_pragma has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/sqlite/better.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"e617a131fa6d5abb6483df8da92532fe71a29b2de28a144ca31056b9280c76ba"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::streams::js_readable_stream_from_iterable (cognitive 20): perry_stdlib::streams::js_readable_stream_from_iterable has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 1 (2 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/perry-stdlib/src/streams.rs"},"region":{"startLine":1951}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a910a698cb95363cfddb2b4e2077917206e16460f57321349d5b8871007c9e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::worker_threads::scan_worker_roots_mut (cognitive 20): perry_stdlib::worker_threads::scan_worker_roots_mut has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 4 (8 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/worker_threads.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69a3344148a49a21976f35671be4da7eaf35dc9baa61a64326f7006aff72fb0"}},{"ruleId":"D2","level":"warning","message":{"text":"Rewriter::stmt (cognitive 20): Rewriter::stmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), 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. This shape REPEATS in the file: 2 other methods here (perry_transform::crypto_hash_chain::for_each_stmt_expr, perry_transform::crypto_hash_chain::rewrite_refs_stmt) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/perry-transform/src/crypto_hash_chain.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c86c5ee3beac3b8fc0421bf0ce97cc6a0555c14322f3e82b5b70539755b5a8d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::aggregate_scalar::merge_body_ends_with_record_assignment (cognitive 20): perry_transform::aggregate_scalar::merge_body_ends_with_record_assignment has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/aggregate_scalar.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"695150433bc911564c1d746f3a84b06f5698f1c46c23c70596ac5983d6e1532e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::closure_local_inline::process_stmts (cognitive 20): perry_transform::closure_local_inline::process_stmts has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 3 (6 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/closure_local_inline.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"d268f888b8b50980890eb6d93ad3cc47c31d6e3aced43c893b6be2c6e323a49b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::crypto_hash_chain::for_each_stmt_expr (cognitive 20): perry_transform::crypto_hash_chain::for_each_stmt_expr has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), 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. This shape REPEATS in the file: 2 other methods here (Rewriter::stmt, perry_transform::crypto_hash_chain::rewrite_refs_stmt) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/perry-transform/src/crypto_hash_chain.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4399db155c4be1bb8fa00a16a73ec3521c8469f238572140a9fa8e19ce4e47"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::crypto_hash_chain::rewrite_refs_stmt (cognitive 20): perry_transform::crypto_hash_chain::rewrite_refs_stmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), 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. This shape REPEATS in the file: 2 other methods here (perry_transform::crypto_hash_chain::for_each_stmt_expr, Rewriter::stmt) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/perry-transform/src/crypto_hash_chain.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fef6c4053f0eceec693b6de264ec203d1fe2fd4f1a8b63779a85fda5792b3c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::deforest::detect::flag_producer_calls_in_stmt (cognitive 20): perry_transform::deforest::detect::flag_producer_calls_in_stmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), 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/perry-transform/src/deforest/detect.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d851bcf898d4bf08b84a5e4341020249c215a407efcf85dbccadb46044585d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::deforest::scan::scan_stmt_for_closures (cognitive 20): perry_transform::deforest::scan::scan_stmt_for_closures has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), 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. This shape REPEATS in the file: one other method here (perry_transform::deforest::scan::scan_stmt_funcrefs) 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/perry-transform/src/deforest/scan.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6c2ef38e7f90b43620def161e23a24290b3e489e104b21209882cdecf11934"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::deforest::scan::scan_stmt_funcrefs (cognitive 20): perry_transform::deforest::scan::scan_stmt_funcrefs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), 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. This shape REPEATS in the file: one other method here (perry_transform::deforest::scan::scan_stmt_for_closures) 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/perry-transform/src/deforest/scan.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"1241bc660cdf0789654158931ad14c72610b1cf7f6098b5dda1595b0ed10db61"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::break_continue::desugar_labeled_escape_across_nested_loops (cognitive 20): perry_transform::generator::break_continue::desugar_labeled_escape_across_nested_loops has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (4 pts), match/switch 1 (2 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/perry-transform/src/generator/break_continue.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc92bf214f13760be54a14956fb0d8838948a0bded8459cc3d9bb4fae15e017"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::id_scan::compute_max_func_id (cognitive 20): perry_transform::generator::id_scan::compute_max_func_id has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 7 (10 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/perry-transform/src/generator/id_scan.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5cb2f69294d267397c77e7dbea75f07d8a47a64252993c848d7919307eb296"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::analysis::scalar_aggregate_loop_param (cognitive 20): perry_transform::inline::analysis::scalar_aggregate_loop_param has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, match/switch 2 (3 pts), loops 1 (nesting depth added 3). Of this number, 11 points are the body\u0027s own statements and 9 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":"crates/perry-transform/src/inline/analysis.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"212963deba8ac555c14fbc04670fc9892ceed28cc3ec910603c8edba4b8cf05e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::call_inliner::returns_only_anonymous_records::inspect (cognitive 20): perry_transform::inline::call_inliner::returns_only_anonymous_records::inspect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 2, 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/perry-transform/src/inline/call_inliner.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"254c13a8c419837d3b688d98bdec6d9851be5339a56a1ea040661ccf82ede395"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::unroll::escape_analysis::count_local_refs_stmt (cognitive 20): perry_transform::unroll::escape_analysis::count_local_refs_stmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), 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/perry-transform/src/unroll/escape_analysis.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc66378785f043f79eb301bd42791cc0124c6df66aa1b7b8d4680aa295e58c7a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_ios::widgets::padding::set_edge_insets (cognitive 20): perry_ui_ios::widgets::padding::set_edge_insets has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (20 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/perry-ui-ios/src/widgets/padding.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"0345b2c11a42aee76a8c5c2b9a66738a2be03bb896d7a59900942826696f276c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_macos::widgets::set_background_gradient (cognitive 20): perry_ui_macos::widgets::set_background_gradient has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (3 pts) (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/perry-ui-macos/src/widgets/mod.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"962a07f01201a34b80bfc168e78d5af5dc0051a9d8f5a45b5c7521ff8104cf30"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_macos::widgets::padding::set_edge_insets (cognitive 20): perry_ui_macos::widgets::padding::set_edge_insets has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (20 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/perry-ui-macos/src/widgets/padding.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80bedd136ac7b932cd00e8e7e234cbf25000265ef1b77657e4187767c36ac09"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_tvos::widgets::padding::set_edge_insets (cognitive 20): perry_ui_tvos::widgets::padding::set_edge_insets has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (20 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/perry-ui-tvos/src/widgets/padding.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9734c5ab3c37206ec7e5374b9ed9b8a8eb154fb24b86d3ea731196a53a82d0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_visionos::widgets::padding::set_edge_insets (cognitive 20): perry_ui_visionos::widgets::padding::set_edge_insets has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (20 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/perry-ui-visionos/src/widgets/padding.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9a6de1c06880acd1a72a7e59bcfa6758cb1ff1124a9613f888bb7218ce6b6e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::theme::handle_container_message (cognitive 20): perry_ui_windows::theme::handle_container_message has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5 (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/perry-ui-windows/src/theme.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"81897ec1cdb82effebc5d0627f3d18c040032d8c1ffb171744ce5dd4a59116b9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wasi::http::server::wire::request (cognitive 20): perry_wasi::http::server::wire::request has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12, boolean chains 7, 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/perry-wasi/src/http/server/wire.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"0781036fad32ccffa919b5285f60ca2fe23adccb5079b95e42f281e4ce8f9a2f"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::stored_value (cognitive 20): Gen::stored_value has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/gen/import_values.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6d54bad37b605a98bbfc731b04f8d64935ad6a9667fcd4dc9df390baa5b5df"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::call_tok (cognitive 20): Model::call_tok has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 1, 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/perry-wpfacts/src/solve/call_and_construct.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"66cacd80ace6027f24c348e0ea76d0874da7f7b06431b463e98d3690f60390c1"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::instance (cognitive 20): Model::instance has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3 (4 pts), boolean chains 3, match/switch 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/summary.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad326f0c289b9d9f0af10bf85b2633712e7659990f9dfb34a1cd6e08fa033103"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::dump::contract_section (cognitive 20): perry_wpfacts::dump::contract_section has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (7 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/perry-wpfacts/src/dump.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"1384b6b4633246ab2709f0d8299eeaa5c4ac02126ea1703bb18ffe7951a0c53f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::lib::contracts::fn_inst_contract (cognitive 20): perry_wpfacts::lib::contracts::fn_inst_contract has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 5, match/switch 1 (3 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/perry-wpfacts/src/lib/contracts.rs"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a220939b6d51d51552df55a262d6b66d7e4de909b4fb44bdd29f235b25dcd7"}},{"ruleId":"D2","level":"warning","message":{"text":"Observe.stop (cognitive 20): Observe.stop has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 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":"docs/audits/gc-rss-instructions-2026-10-03/current0ed-meta-observer-v17.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e46022bcc1aa72c716f8cf42f0e46f7edcf7226f5ba63aa1ed1242d66e38ab"}},{"ruleId":"D2","level":"warning","message":{"text":"prepare-gc-overlay.prepare (cognitive 20): prepare-gc-overlay.prepare has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 5, 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":"docs/audits/gc-rss-instructions-2026-10-03/prepare-gc-overlay.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd0605ec6f9c364b48ae2970d63bc6fff80652366d9eed5a1358dcc04fa9b98"}},{"ruleId":"D2","level":"warning","message":{"text":"capture_linux_incident.summarize (cognitive 20): capture_linux_incident.summarize has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/capture_linux_incident.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0a3e176f9f8552817124ac39b56ab110c4f552e392ae7052e65c8bb5e37198"}},{"ruleId":"D2","level":"warning","message":{"text":"compiler_output_step_liveness.check_workflow (cognitive 20): compiler_output_step_liveness.check_workflow has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, 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":"scripts/compiler_output_step_liveness.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"1176fd2d55dd000a5655e7a1209f440059ce2abfd5a90291e22f1f4b2ed31068"}},{"ruleId":"D2","level":"warning","message":{"text":"component_reader_acceptance.main (cognitive 20): component_reader_acceptance.main has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 6 (11 pts), loops 6, if/else 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/component_reader_acceptance.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed198522a072f923129aeaee1d10c1414ae2fdcde08714e4fb11c51392ef252"}},{"ruleId":"D2","level":"warning","message":{"text":"copied_minor_fallback_report.main (cognitive 20): copied_minor_fallback_report.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 4 (5 pts), error handling 2 (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":"scripts/copied_minor_fallback_report.py"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcd285757a5b3022c71694f685e2d6810a21c6723ded0dd9ea14190f9090161"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_pin_sites.raw_byte_offenders (cognitive 20): gc_pin_sites.raw_byte_offenders has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 pts), ternaries 1 (4 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":"scripts/gc_pin_sites.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"392a5c3648ffed255b5e25b1b03be2fa625684fdea46688b01974730455310a0"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check._cast_closure (cognitive 20): gc_root_dominance_check._cast_closure has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":4977}}}],"partialFingerprints":{"codehealthFindingId/v1":"a776d876329e997c5dc6e8ba9dd5fef2ec69399b85fc18c2402d534dada854ff"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check._phi_edge_hazard (cognitive 20): gc_root_dominance_check._phi_edge_hazard 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":5380}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab65672a1bdd94aec2fc6569ee8ab605843d442310337e01d07b7849b86556f"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_store_site_inventory.split_top_level_args (cognitive 20): gc_store_site_inventory.split_top_level_args has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 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":"scripts/gc_store_site_inventory.py"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"17de05849deee9998d3a6413f1900c379a3f186b67cedd5bcc76f7290a099946"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_store_site_inventory.check_runtime_claims (cognitive 20): gc_store_site_inventory.check_runtime_claims has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 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":"scripts/gc_store_site_inventory.py"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"102c2bd44c29eba3ee446bbda6da88c236e3e42814c9d7a03832ba96cb9af8ac"}},{"ruleId":"D2","level":"warning","message":{"text":"local_binding_type_audit.scan_text (cognitive 20): local_binding_type_audit.scan_text has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 6, 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":"scripts/local_binding_type_audit.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b74f75247ab8135c3b87183c152cb33307de2f8f76538078b425b2a0c55291d"}},{"ruleId":"D2","level":"warning","message":{"text":"lock_no_downgrade.analyse (cognitive 20): lock_no_downgrade.analyse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 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":"scripts/lock_no_downgrade.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd8a3c9a12e93ea33aa63350afce6405d30a3ef50ab9888f5d97317185b87ed"}},{"ruleId":"D2","level":"warning","message":{"text":"package_bench.cmd_profile (cognitive 20): package_bench.cmd_profile has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (4 pts), boolean chains 2, ternaries 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":"scripts/package_bench.py"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5633cce86c21606b81ee3ed6b8243dd1c0c62b701b42307aaa5e6496117d78"}},{"ruleId":"D2","level":"warning","message":{"text":"package_bench_attr.derive (cognitive 20): package_bench_attr.derive has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 3 (6 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":"scripts/package_bench_attr.py"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea811e7f15ce4f2e6509d621ae14a8a4ba795a6548cb44220aef9f2a7f15090"}},{"ruleId":"D2","level":"warning","message":{"text":"parity_known_failures.validate_entry (cognitive 20): parity_known_failures.validate_entry has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 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":"scripts/parity_known_failures.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b9014827c0edca1db939b4595c610bd0d1aeb98e6b42b543237b3a8db4531c"}},{"ruleId":"D2","level":"warning","message":{"text":"parity_known_failures.audit (cognitive 20): parity_known_failures.audit has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 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":"scripts/parity_known_failures.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2410deb7cd10ef247ec172e635ffd87c5ab4f2d4a8295d07a22fea0b52b7aa"}},{"ruleId":"D2","level":"warning","message":{"text":"perf_objops_lane.compare (cognitive 20): perf_objops_lane.compare has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (8 pts), if/else 4 (6 pts), loops 3 (6 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":"scripts/perf_objops_lane.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"8750822db331844c7d145236512c903813bb89e7a20331cbee18ae927c8792ab"}},{"ruleId":"D2","level":"warning","message":{"text":"string_validator_inventory.inventory (cognitive 20): string_validator_inventory.inventory has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (9 pts), boolean chains 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":"scripts/string_validator_inventory.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"21eb0b4390b56c0a4760e351c0f9e395ba2c60d2cd0ea545196218980e5c6fa6"}},{"ruleId":"D2","level":"warning","message":{"text":"test262_subset.parse_frontmatter (cognitive 20): test262_subset.parse_frontmatter has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (9 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":"scripts/test262_subset.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d64b4cf30b80d3fdff7674e8fbc6badf5279c0eae5699fa064a44a90619450"}},{"ruleId":"D2","level":"warning","message":{"text":"thread_exit_address_globals.exit_hooks (cognitive 20): thread_exit_address_globals.exit_hooks has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 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":"scripts/thread_exit_address_globals.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"301f620a902f69863bd88b2d01fad2d7e3bfd3ea545d3a0190c67b330930b2eb"}},{"ruleId":"D2","level":"warning","message":{"text":"verify_tscwall_gaps.main (cognitive 20): verify_tscwall_gaps.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), boolean chains 2, ternaries 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":"scripts/verify_tscwall_gaps.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3da130c11cc03cb736afb06434f22464cb6032577ab9b2e41e1d4c1255cf165"}},{"ruleId":"D2","level":"warning","message":{"text":"web_runtime.perry_ui_canvas_draw_image (cognitive 20): web_runtime.perry_ui_canvas_draw_image has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 6 (10 pts), if/else 5 (6 pts), boolean chains 4 (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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a57c7dbdb4bbe1c16ae784f72aab3280800ec6a8104f316ff217bab7961055"}},{"ruleId":"D2","level":"warning","message":{"text":"wasm_runtime.perry_ui_canvas_draw_image (cognitive 20): wasm_runtime.perry_ui_canvas_draw_image has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 6 (10 pts), if/else 5 (6 pts), boolean chains 4 (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/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":3554}}}],"partialFingerprints":{"codehealthFindingId/v1":"115d0b3ae443426cae60800dbc49f6c8a810c0d426de317beb2c7a70db43a464"}},{"ruleId":"D2","level":"warning","message":{"text":"external-tools.main (cognitive 20): external-tools.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 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":"scripts/soak/external-tools.mts"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d86fa2182ecfbbe71ce38364c4d7760183c18a53a4557c8356eed2718381f3b"}},{"ruleId":"D2","level":"warning","message":{"text":"node_compat_matrix.resolveNode (cognitive 20): node_compat_matrix.resolveNode has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, ternaries 4 (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":"scripts/node_compat_matrix.mjs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d79f947c701a1296804df84505fbc80880f4e32a0af0242999643048a4f87b"}},{"ruleId":"D2","level":"warning","message":{"text":"objects-cache.cacheArchiveFiles (cognitive 20): objects-cache.cacheArchiveFiles has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), boolean chains 2, error handling 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":"upstream/actions/jdx/mr-boxington-action/src/objects-cache.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f9f51c5c05b3b4eadec0467f794e4612d0496239dfacf36c92a29e0b7e281f"}},{"ruleId":"D2","level":"warning","message":{"text":"callWasmClosure (cognitive 20): callWasmClosure has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 3 (7 pts), boolean chains 4 (nesting depth added 6). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":2616}}}],"partialFingerprints":{"codehealthFindingId/v1":"145df0f81889f21e1e967c2bff6a81d438b910108913735717ace8a0d578ebe9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::apple_info_plist::inject_ios_deeplinks (cognitive 19): perry::commands::compile::apple_info_plist::inject_ios_deeplinks has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (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/perry/src/commands/compile/apple_info_plist.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"decb3b62440e3d6b83254b57d3239502f2e680650c3a8ddeabb296fa94b9edbd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::bootstrap::module_provides_export (cognitive 19): perry::commands::compile::bootstrap::module_provides_export has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (16 pts), 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/perry/src/commands/compile/bootstrap.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe72101c35ec35fe1237b9769620019d8be9bcfc321de3c2527d3ea07c6d2d06"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::build_cache::config_inputs_for (cognitive 19): perry::commands::compile::build_cache::config_inputs_for has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/build_cache.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"2567fe6269258d2d0382383b6fb97fcb29b879f8b547fe22577f7e701d32af8d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::detect::has_top_level_esm (cognitive 19): perry::commands::compile::cjs_wrap::detect::has_top_level_esm has cognitive complexity 19 (threshold 15). Drivers by points: if/else 2 (7 pts), boolean chains 6, loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 8). Of this number, 17 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":"crates/perry/src/commands/compile/cjs_wrap/detect.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67abf2e9cb9a9e5fb3954aaecb6147bae88a8a187046525022685bae7e8a637"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::fallback_diag::facts_for (cognitive 19): perry::commands::compile::fallback_diag::facts_for has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2, 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/perry/src/commands/compile/fallback_diag.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e890d5425be6f1096095eededd6bf29aec20b81cf470d7bfdb0d604c2d71ee27"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::resolve::subpath_imports::resolve_target_string (cognitive 19): perry::commands::compile::resolve::subpath_imports::resolve_target_string has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 3, 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/perry/src/commands/compile/resolve/subpath_imports.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"5716f9a4d1daaafd8054dc75389a1559a102a55381eba7b66fbe6af0c301d0f6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::targets::generate_embedded_js_object (cognitive 19): perry::commands::compile::targets::generate_embedded_js_object has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 6 (7 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/perry/src/commands/compile/targets.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa14e3c52d2f7f57dda90c257f1f5d7a684bfb65e2de9e20ae28da705e6f1f33"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::setup::harmonyos::harmonyos_wizard (cognitive 19): perry::commands::setup::harmonyos::harmonyos_wizard has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 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/perry/src/commands/setup/harmonyos.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba19073b70c6df3047fe4554101ee93e16d72c41b5069eaff9c01cf8b1faa8f4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_cli_support::dotenv::records (cognitive 19): perry_cli_support::dotenv::records has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 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/perry-cli-support/src/dotenv.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ae08fb68ab48b4807484b3975be58a5babdb76f66090ae7e9af331f54d9ee1"}},{"ruleId":"D2","level":"warning","message":{"text":"PrefixContainedParamUse::walk_stmt (cognitive 19): PrefixContainedParamUse::walk_stmt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), 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/perry-codegen/src/collectors/proven_args.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efc3fe87a86fbb71cfb30c3f2023db3f2ebdbe22fd2aeb09a1a9fc2f76d05cf"}},{"ruleId":"D2","level":"warning","message":{"text":"LlModule::prune_private_capabilities (cognitive 19): LlModule::prune_private_capabilities has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (6 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":"crates/perry-codegen/src/module.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3ded7bd1475d3098b8dc3315efe76e13bf30d8c74743b35a03259652372970"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::array_record_stack::bound (cognitive 19): perry_codegen::array_record_stack::bound has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 1 (2 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/perry-codegen/src/array_record_stack.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab85c53c289e7a1201f70f83ff451683bba006dee66d60d28ae5d0e328e1878"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::ctor_arity::synthesized_ctor_param_count (cognitive 19): perry_codegen::codegen::ctor_arity::synthesized_ctor_param_count has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 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/perry-codegen/src/codegen/ctor_arity.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89e079fa24f930566fb8c0849a1eced301400887842ca1f3ffbac4baa7328d0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::typed_abi::typed_string_closure_rejection_reason_with_types (cognitive 19): perry_codegen::codegen::typed_abi::typed_string_closure_rejection_reason_with_types has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 2, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/typed_abi.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf6de0402b90a3858bfd15c631302b8087e8626dd309d3562022e973ed44d63"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::clamp_detect::detect_clamp3 (cognitive 19): perry_codegen::collectors::clamp_detect::detect_clamp3 has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 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/perry-codegen/src/collectors/clamp_detect.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d724ab173dc7b419540619b5b2b952dcc1e7e7d3e3d330225de3d0020adc2e5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::integer_locals::int32_producing_deps (cognitive 19): perry_codegen::collectors::integer_locals::int32_producing_deps has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/integer_locals.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"27189074299ad7a1c498ebe33251d0ffe1d685fc1735a63968c578f02cd98723"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::integer_locals::collect_extra_integer_let_ids (cognitive 19): perry_codegen::collectors::integer_locals::collect_extra_integer_let_ids has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), match/switch 1 (2 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/perry-codegen/src/collectors/integer_locals.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"665de6811a7a5eb2885dd9876596b8c2a66d7efb42256beda4633df664f46231"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::uppercase_strings::find_candidates (cognitive 19): perry_codegen::collectors::uppercase_strings::find_candidates has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), match/switch 1 (2 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/perry-codegen/src/collectors/uppercase_strings.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"845410cb88cead06cf316aac86d48c9773261481087b4cdc2aaba957279e6be4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::uppercase_strings::check_uses_in_stmts (cognitive 19): perry_codegen::collectors::uppercase_strings::check_uses_in_stmts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (17 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/perry-codegen/src/collectors/uppercase_strings.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"595ac45ee76340404d9fe4f4e3ac430768a9233e68430769fcc460d9656c1878"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::dialect::types::basic_type (cognitive 19): perry_codegen::dialect::types::basic_type has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (4 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/dialect/types.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"64105ed6a2f73f2b42568b06b21b35f84b857553db4024e232f5a2ff173fb429"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::array_append::try_lower (cognitive 19): perry_codegen::expr::array_append::try_lower has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, boolean chains 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/perry-codegen/src/expr/array_append.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5477ab5e6a5dc37a9282fc89e39c3a275af8a9a86b6eeb01be4e3840d435d3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::calls::crypto_misc::arm_crypto_prime (cognitive 19): perry_codegen::expr::calls::crypto_misc::arm_crypto_prime has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (15 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/perry-codegen/src/expr/calls/crypto_misc.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdaac413b5198972bb8ea65efe88b99c3e58fd8f369e955a911d191a1592cd3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::i32_fast_path::try_lower_expr_native_i32_structural (cognitive 19): perry_codegen::expr::i32_fast_path::try_lower_expr_native_i32_structural has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 4). 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/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5df61bd7974eb3a7d17f05abee11eac3a2c0c2e24db26812e787a72cd7f2e0a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::objects_arrays_lit::lower (cognitive 19): perry_codegen::expr::objects_arrays_lit::lower has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (4 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/perry-codegen/src/expr/objects_arrays_lit.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6c77c47b5fbed60d9b30284e8e7119eedfee776a7680d58f684f22a99af75c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::private_resume_frame::record_entries::visit (cognitive 19): perry_codegen::expr::private_resume_frame::record_entries::visit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (7 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":"crates/perry-codegen/src/expr/private_resume_frame.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e7de681bb141be4a062f9dfee98d7ae363b257ac0ed6828912c813c2669634"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::native_value::pod::layout_for_inner_type (cognitive 19): perry_codegen::native_value::pod::layout_for_inner_type has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (3 pts), match/switch 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/perry-codegen/src/native_value/pod.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b2c8aeb618b96e484128225e1538d6d55c7d48854c43b71ac90c9e083a60c3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::class_first_loop::resolve_guards_in_stmt (cognitive 19): perry_codegen::stmt::class_first_loop::resolve_guards_in_stmt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 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/perry-codegen/src/stmt/class_first_loop.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"24493c73af5e0bff62528a8f392dec235d323faaae4a67094aad23cb9ae0a7a5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::type_analysis::strings::type_may_declare_collection_field (cognitive 19): perry_codegen::type_analysis::strings::type_may_declare_collection_field has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/type_analysis/strings.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa07221fe445e0bdda5848ff3d055e736e050ed8e31d084f7739023564c402a7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::type_analysis_class_fields::class_field_global_index (cognitive 19): perry_codegen::type_analysis_class_fields::class_field_global_index has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17 (32 pts), loops 6 (11 pts), boolean chains 7 (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. This shape REPEATS in the file: one other method here (perry_codegen::type_analysis_class_fields::class_field_global_index::walk) 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/perry-codegen/src/type_analysis_class_fields.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4073f01b482678e5e4c528eea1ba28a320bd9ac37ada3eb2bb9af4cf70d1dc17"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_arkts::view_builders::scan_module_level_addchild_in_expr (cognitive 19): perry_codegen_arkts::view_builders::scan_module_level_addchild_in_expr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 9). 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/perry-codegen-arkts/src/view_builders.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4485525f42edd22e2898f276632b89c55ba648de7ca5495618d2d4be1333e5"}},{"ruleId":"D2","level":"warning","message":{"text":"FuncEmitCtx::try_emit_expr_math (cognitive 19): FuncEmitCtx::try_emit_expr_math has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (9 pts), match/switch 1 (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/perry-codegen-wasm/src/emit/expr/math.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c73b211262ff157727253b56ecb339f46f71afef5cb97347e54bfb51a769146"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_wasm::emit::locals::resolve_source_module_idx (cognitive 19): perry_codegen_wasm::emit::locals::resolve_source_module_idx 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/perry-codegen-wasm/src/emit/locals.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fbda95c084372539856454654778dff97179758b8c96c8f6481fbd87f98137"}},{"ruleId":"D2","level":"warning","message":{"text":"Incoming::prepare (cognitive 19): Incoming::prepare has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 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/perry-component-host/src/sync_wasi/udp.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"00853b1d83bde5819d6e8f1a7c215f26d5be115c9806b120e3ef9a85715d7149"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::agent::tls_compat::raw_pfx_identity (cognitive 19): perry_ext_http::agent::tls_compat::raw_pfx_identity has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 1, loops 1 (nesting depth added 6). Of this number, 10 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/perry-ext-http/src/agent/tls_compat.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9a04c76d7a47818d265588d13ab0b4d9aaee51302fd2badd0e92c52aed701a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::client_connect_override::dispatch_request_over_socket (cognitive 19): perry_ext_http::client_connect_override::dispatch_request_over_socket has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 1 (3 pts), match/switch 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/perry-ext-http/src/client_connect_override.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87f8a641a74ece0c10b0e09b1bd5cdf729f1dd81ce5f5fb029e5daa0f1ab501"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::request::combined_headers_json (cognitive 19): perry_ext_http::server::request::combined_headers_json has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-http/src/server/request.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"e103dd47f0d29dab7ce802ffa98a46110b3a1897f2dd63d87da433c027ac7d99"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::response_header_values::apply_write_head (cognitive 19): perry_ext_http::server::response_header_values::apply_write_head has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 2 (4 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/perry-ext-http/src/server/response_header_values.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"117dbf4fd5ef97eecfbc99940ca5c548efcd6ec0447c9c8d4c8b3fdd7afa253c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::tls_client::certificate_matches_hostname (cognitive 19): perry_ext_http::tls_client::certificate_matches_hostname has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (7 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-http/src/tls_client.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9aab7cef4e344ec137693e4218451fc13ed9f494923a3f83118ac05c5fccd90"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_net::jsvalue::jsvalue_to_socket_bytes (cognitive 19): perry_ext_net::jsvalue::jsvalue_to_socket_bytes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 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/perry-ext-net/src/jsvalue.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c67bc108bff612aa530ee41dfccde0bec57034313c6d2e008fa0a54292fe110"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner::visit_call_expr (cognitive 19): Scanner::visit_call_expr has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (7 pts), if/else 5 (6 pts), loops 2 (6 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/perry-hir/src/patched_builtins.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"464c3c473570e91477548ae1a64c199b2efc50d1dc57f016c6761d83cbb01a1c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::const_fold_fn::fn_body_has_stray_private_name (cognitive 19): perry_hir::lower::const_fold_fn::fn_body_has_stray_private_name has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (11 pts), boolean chains 8 (nesting depth added 5). None of this is in the body itself: all 19 points belong to 2 function items inside it that branch (expr_has, stmt_has). 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/perry-hir/src/lower/const_fold_fn.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"a109e0700c82fcd6904df45bf2204c6b6225a971a12e170211a8fcc8551e1173"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_member::stdlib_guard::stdlib_namespace_receiver (cognitive 19): perry_hir::lower::expr_member::stdlib_guard::stdlib_namespace_receiver has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3, match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_member/stdlib_guard.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbf633ef5c9e12a541497c279b3f7e511ed3fe7d9c95cb65a18ba68f10629bd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::lower_module_fn::should_enable_react_automatic_jsx (cognitive 19): perry_hir::lower::lower_module_fn::should_enable_react_automatic_jsx has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (8 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/lower_module_fn.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf960aff89025b6e80752fe9d738303de264a91b79a89bdb1c251559b6a12e5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals::record_var (cognitive 19): perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals::record_var has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 10). 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: 3 other methods here (perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals, perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals::walk_stmt, perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals::collect_shadowing_decls) 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/perry-hir/src/lower/pre_scan/weakref_locals.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"46fde31ea17b7139f7c0f5c7ca7ac8b7561429f88d2f5d996049d635a991833c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::helpers::is_inspect_custom_key (cognitive 19): perry_hir::lower_decl::helpers::is_inspect_custom_key has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 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/perry-hir/src/lower_decl/helpers.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ee83eef8bfda429278f826bc9d388ad57cdeac4c06490f504ed9a0a6bb1161"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::static_init::computed_field_key_initializers_with_order (cognitive 19): perry_hir::lower_decl::static_init::computed_field_key_initializers_with_order has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 1 (2 pts), boolean chains 1, 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/perry-hir/src/lower_decl/static_init.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d906157f2969a5b8e5ec37f056aea0a55504a302e7b4684928df6c729b9e475"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::monomorph::constraints::check_constraint (cognitive 19): perry_hir::monomorph::constraints::check_constraint has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (5 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/monomorph/constraints.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea6d75fa8fcf52d08eb006d92034d524275b814e59636dafd0b58605c536908"}},{"ruleId":"D2","level":"warning","message":{"text":"Arena::drop (cognitive 19): Arena::drop has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 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/perry-runtime/src/arena/block.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2c64c8797c22615db2521465459ff2b2867d1ab4b25b220f39bfc3873c1118"}},{"ruleId":"D2","level":"warning","message":{"text":"IncrementalSweepState::step (cognitive 19): IncrementalSweepState::step has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 1 (2 pts), match/switch 1 (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/perry-runtime/src/gc/oldgen.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80cc650af83e68233a29ccafeef1d80f8b4a20ccf5dba99c959d016e9309b40"}},{"ruleId":"D2","level":"warning","message":{"text":"SlotIndex::insert (cognitive 19): SlotIndex::insert has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (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/perry-runtime/src/object/shapes_slot_list.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a8535b7b7f4eda33bf24af4e5efdd3f01b49db7aa68036f3467a3825d8be47"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::value (cognitive 19): Writer::value has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (18 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/perry-runtime/src/thread/clone_write.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"41633023b392ec51dfee0a6dfaa53a98799a9e9d02c98ebd6995d70e49c2a2a3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::arena::reset::old_arena_reclaim_dead_blocks (cognitive 19): perry_runtime::arena::reset::old_arena_reclaim_dead_blocks has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 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/perry-runtime/src/arena/reset.rs"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0e446605e4d26a3aea894a11cacc10fe6f9ebd27b5fb1f1d20376472b60954"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::append::js_array_append_set (cognitive 19): perry_runtime::array::append::js_array_append_set has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 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/perry-runtime/src/array/append.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"055f03914defda2a11377ca2d4f1e40b707f221fbdbba69cd5b97d73e9c0a691"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::concat_reverse::js_array_fill_range (cognitive 19): perry_runtime::array::concat_reverse::js_array_fill_range has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15 (17 pts), loops 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/perry-runtime/src/array/concat_reverse.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ea18fc86d1ac3c3a99e56c41585491ba668310f05eccf525db562b3c609e0e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::generic::object_get_property_chain (cognitive 19): perry_runtime::array::generic::object_get_property_chain has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (perry_runtime::array::generic::object_has_property_chain) 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/perry-runtime/src/array/generic.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad26b23eb8d555f0a645e8158e689bee521e190744a9429c989701090a25886"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::generic::object_has_property_chain (cognitive 19): perry_runtime::array::generic::object_has_property_chain has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (perry_runtime::array::generic::object_get_property_chain) 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/perry-runtime/src/array/generic.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78cf1ef2ad5bcbc09a848b708caeddb935a677b83d60574b4d307f0e7fc7cdd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::indexing_keyed::js_array_get_index_or_string (cognitive 19): perry_runtime::array::indexing_keyed::js_array_get_index_or_string has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 2 (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/perry-runtime/src/array/indexing_keyed.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb45fd8622f97df8d64fda0c2fbebf1303c41ccc5514df125515d79482327db"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::builtins::formatting::deep_equal::js_util_deep_strict_equal_bool (cognitive 19): perry_runtime::builtins::formatting::deep_equal::js_util_deep_strict_equal_bool has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7, match/switch 1 (2 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/perry-runtime/src/builtins/formatting/deep_equal.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"642d2b49c01eb3fc662468fae6c196b8cb9490250c6f93bf6bfe55c4af1bc0d8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::builtins::table::format_table_cell (cognitive 19): perry_runtime::builtins::table::format_table_cell has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15 (18 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/perry-runtime/src/builtins/table.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ca2494480171f1f0fcc260b99eac7e86af405c1c571adb475e69a27da4be6c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::closure::props::object_own_get (cognitive 19): perry_runtime::closure::props::object_own_get has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 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/perry-runtime/src/closure/props.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0f4e610fa3f977c086a14e485980daa2b3f65b1df04e4ad93857626fe55375"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::component::host_payload::event (cognitive 19): perry_runtime::component::host_payload::event has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (8 pts), boolean chains 2, match/switch 1 (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/perry-runtime/src/component/host_payload.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6edb5656b8229c95ff19146323ac92bb21b7d68a9b95d9983de02d922e970ec"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::dgram::ops::create_socket_impl (cognitive 19): perry_runtime::dgram::ops::create_socket_impl has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (18 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/perry-runtime/src/dgram/ops.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd845d66030f62372d76aded65d5b5bfabb961c4297051acc410b23623b22398"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::dns::lookup_addresses (cognitive 19): perry_runtime::dns::lookup_addresses has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, 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/perry-runtime/src/dns.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"d929f10a1b3621b7c79fdb0d202f5c4a77e01c359a3de6dec5ed2488aae0a734"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::dns::resolve_build::build_resolve_value (cognitive 19): perry_runtime::dns::resolve_build::build_resolve_value has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 10 (19 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/dns/resolve_build.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44583fc1ee64188dcda8f3112f2a9c1283a53a137dba23322a1199ed3deb605"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::eh_walker_trace::run_cfi (cognitive 19): perry_runtime::eh_walker_trace::run_cfi has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/eh_walker_trace.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd04ba6153681bc996fa71b6a2e97396d48e2e2ac35049dbafb3c5eb6364bb2e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::fs::stream::stream_on_common (cognitive 19): perry_runtime::fs::stream::stream_on_common has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 6, 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/perry-runtime/src/fs/stream.rs"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"7785db4b5053053720009cc53a689c4a6f1ba52bb6b82aadb12f14c614ffb38b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::unicode_extension_keyword (cognitive 19): perry_runtime::intl::unicode_extension_keyword has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 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/perry-runtime/src/intl.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc213e859c149e76ad7da7df20cd14a0342a7a21c4845949ea9414ecc1547a9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::date_collator::format_ms_with_dtf_obj (cognitive 19): perry_runtime::intl::date_collator::format_ms_with_dtf_obj has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 4 (7 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/perry-runtime/src/intl/date_collator.rs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ea9361ece34767d2902f46ea19d204bf7da5aca8fc2f268640a055951a115d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::list_relative_plural::rtf_parts (cognitive 19): perry_runtime::intl::list_relative_plural::rtf_parts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (18 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/perry-runtime/src/intl/list_relative_plural.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a04674c81a26b0a30136d27c247bad2c0c35ea86476afd5092bd7cc7a83ddd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::parse_api::parse_result_slow (cognitive 19): perry_runtime::json::parse_api::parse_result_slow has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (19 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/perry-runtime/src/json/parse_api.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"4355d8c5cff86dbf3039e7bdbbc71d7842849b17bf1751aec99c089b3bd4bfa0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::stringify_buffer::stringify_buffer_pretty (cognitive 19): perry_runtime::json::stringify_buffer::stringify_buffer_pretty has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 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/perry-runtime/src/json/stringify_buffer.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86b6a49271aa68ef3a8ee5fd2df4da1b8dc1967b1b954fc3689423aa07a46b3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json_tape::materialize_number (cognitive 19): perry_runtime::json_tape::materialize_number has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (5 pts), loops 3 (5 pts) (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/perry-runtime/src/json_tape.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2ee7deb9711529cc6134ed66dcdfaf4664e5b9f7606ba10bb9f0265a3b5288"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::map::js_map_from_array (cognitive 19): perry_runtime::map::js_map_from_array has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 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/perry-runtime/src/map.rs"},"region":{"startLine":2830}}}],"partialFingerprints":{"codehealthFindingId/v1":"3febf7987ad3c6fd106b5143eba1cc0677c788412b65ceb941bdb24f0be5a90b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_api_host::functions::napi_get_cb_info (cognitive 19): perry_runtime::node_api_host::functions::napi_get_cb_info has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 2 (5 pts), boolean chains 1 (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/perry-runtime/src/node_api_host/functions.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ddd9a15c8244c2b4cf67cf4051703d41549dda1398e0c5e177bcf3375e70fbd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_api_host::loader::verify_addon_payload (cognitive 19): perry_runtime::node_api_host::loader::verify_addon_payload has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/node_api_host/loader.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85b1b5b376e19619900a1d9db55bcd18f4a95d01e66b1ded89d7e0c2d14e001"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::arguments::arguments_object_set_field (cognitive 19): perry_runtime::object::arguments::arguments_object_set_field has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (18 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/perry-runtime/src/object/arguments.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c3675fc1610d0579936cefd9e6b44eb715637f0b4ece95096993ad1b0c4f3f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::builtin_method::js_bm_lookup (cognitive 19): perry_runtime::object::builtin_method::js_bm_lookup has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 8, match/switch 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/perry-runtime/src/object/builtin_method.rs"},"region":{"startLine":1913}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5b8cbdb5c8931a5ee4e0d39b52b3c1407a1669d6c900fa1f54f592434d0384"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::canonical_keys::static_seed::from_static_layout (cognitive 19): perry_runtime::object::canonical_keys::static_seed::from_static_layout has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, 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/perry-runtime/src/object/canonical_keys/static_seed.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"164e66efb477283e636a2f510d27d536b96cc09029e436da3c864c269249602a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_constructors::run_class_constructor_on_this_flat (cognitive 19): perry_runtime::object::class_constructors::run_class_constructor_on_this_flat has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 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":"crates/perry-runtime/src/object/class_constructors.rs"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edb8ad680f3fb29c89e302cf0cdd80e49ebee4e87ee4c94e38cbfaf85a39b4f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::decl_accessors::accessor_is_shadowed (cognitive 19): perry_runtime::object::class_registry::decl_accessors::accessor_is_shadowed has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (18 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/perry-runtime/src/object/class_registry/decl_accessors.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"db62324f3b3056aef0626191d244474863462996a50890dce40cb79f868781b3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::define_own_data::definition_admitted (cognitive 19): perry_runtime::object::define_own_data::definition_admitted has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (13 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/perry-runtime/src/object/define_own_data.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f31a7fc0ba9f3ceee9297e93594c19effc0d32987dacf69d8d098b416719a46"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::descriptors::boxed_string_own_property_names (cognitive 19): perry_runtime::object::descriptors::boxed_string_own_property_names has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (5 pts), match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/descriptors.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d043c55c149ae830a92fa55f7852758133c1ccf3a9df74645fe12eb1150ff2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_desc::image_matches (cognitive 19): perry_runtime::object::layout_desc::image_matches has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 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/perry-runtime/src/object/layout_desc.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfc88f8137c25c2201b1781b2d11e8c01b9a6ef8d518ced0180cde55dfa710e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_probe::perry_probe_own_method (cognitive 19): perry_runtime::object::layout_probe::perry_probe_own_method has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 10). 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/perry-runtime/src/object/layout_probe.rs"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c440e180c782dda6aa9707c4adeb4bf7a2ff4708e9f222bd47c7b962137cf0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_probe::diagnostics::diag_explain (cognitive 19): perry_runtime::object::layout_probe::diagnostics::diag_explain has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 2 (6 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/layout_probe/diagnostics.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b70cbd7b24bfa6052f39cb7ab3b21dc9d61a151e718c232249b4c102153c41d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::method_call::js_method_call_slow (cognitive 19): perry_runtime::object::method_call::js_method_call_slow has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 2 (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/perry-runtime/src/object/method_call.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"46fcfebdac588af5b5f86a92dd3cdc92d6ac9d96b98cf65c26c0085ee5e3d5b7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_call_method::object_proto::invoke_receiver_to_string (cognitive 19): perry_runtime::object::native_call_method::object_proto::invoke_receiver_to_string has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 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/perry-runtime/src/object/native_call_method/object_proto.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68ba22c5296566e01d46a667107aa1761b2071857e2e1bdb3131bb8b5bc5cde"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::object_ops::has_own::js_object_is (cognitive 19): perry_runtime::object::object_ops::has_own::js_object_is has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 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/perry-runtime/src/object/object_ops/has_own.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"18dda22d980e0d15d12c5ac8edeeabd62247ec5c4188c8dbc73f6d0830713ac7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::overflow::store_routed (cognitive 19): perry_runtime::object::overflow::store_routed has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 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/perry-runtime/src/object/overflow.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1520b08369c78de2ebd7f31ac218fb739917fb9fe5a57fe4c0bb8c8a6172b23"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::property_ops::set::create_or_update_receiver_property (cognitive 19): perry_runtime::object::property_ops::set::create_or_update_receiver_property has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/property_ops/set.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec03794ce9b788bee9f5db146089f3506ffc4c558fa214f630d609cb032942c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::prototype_chain::chain_ends_in_explicit_null_before (cognitive 19): perry_runtime::object::prototype_chain::chain_ends_in_explicit_null_before has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 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/perry-runtime/src/object/prototype_chain.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0ae4dc067ba708b7b207f08dc15f7e098137d3721a1eac76de372c97c2c526"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::shapes::shape_slot_lookup_verdict (cognitive 19): perry_runtime::object::shapes::shape_slot_lookup_verdict has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, loops 1, 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/perry-runtime/src/object/shapes.rs"},"region":{"startLine":5661}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa67d319dbff44db87557fa2aae6ca5eee4cfdf37e019688f7d126cc38f108e5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::shapes_last_key_rollback::publish_object_shape_last_key_rollback (cognitive 19): perry_runtime::object::shapes_last_key_rollback::publish_object_shape_last_key_rollback has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, match/switch 1 (2 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/perry-runtime/src/object/shapes_last_key_rollback.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"459275e40c7bb64051bf5792817c3212c5d2aa1b443f1b4d7c36fc7b9edea72e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::process::node_module::source_map::source_map_decode (cognitive 19): perry_runtime::process::node_module::source_map::source_map_decode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/process/node_module/source_map.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"61802616843799a019c501fb19c358995ded7f945f68abec2138aa3de09a469a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::format::js_number_to_exponential (cognitive 19): perry_runtime::string::format::js_number_to_exponential has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (19 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/perry-runtime/src/string/format.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a9ee0db15c83b80ffd8a6864ca50697dd453df3105257ad32841ed49fadac1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::tls::validate_secure_context_options (cognitive 19): perry_runtime::tls::validate_secure_context_options has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4 (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/perry-runtime/src/tls.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe66024017982ad0fa98570395775dd655c286386181b589cc2f0be7ed060d4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::turnloop_net::transport::flush (cognitive 19): perry_runtime::turnloop_net::transport::flush has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (5 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":"crates/perry-runtime/src/turnloop_net/transport.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"a650ea89aca80344c2c8758b6f3d4f0b8559da5ae4f57d81574bbdeb7c12d4a2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::update_notify::blob_field (cognitive 19): perry_runtime::update_notify::blob_field has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 2 (9 pts), if/else 3 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/update_notify.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa11532811627a738b51c4309e49875c05b5d51fa2dc5034d10a491250e3002"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::url::parse::normalize_path (cognitive 19): perry_runtime::url::parse::normalize_path 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/perry-runtime/src/url/parse.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f88b174050d48875339b0deeb243a5b377a89ec3b648de7c0813106e55d4fa0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::value::dynamic_arith::to_primitive_default_for_add (cognitive 19): perry_runtime::value::dynamic_arith::to_primitive_default_for_add has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/value/dynamic_arith.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1102f6f7cd51fbabc6d7bcaefee0d25568637e3c074354b2119c870c8fd7f2d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::value::dynamic_arith::dynamic_add_non_plain (cognitive 19): perry_runtime::value::dynamic_arith::dynamic_add_non_plain has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 3 (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/perry-runtime/src/value/dynamic_arith.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00147a73282a2462e181afe3ff3c4232f4ee4f089fdcf031fd2bbaab90595a7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::events::events_on::js_events_on (cognitive 19): perry_stdlib::events::events_on::js_events_on has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 1 (2 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/perry-stdlib/src/events/events_on.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ba744d3eda5d868af7f85286b5b43b4366d3ec442dd304881f39ebf79aa63a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::readline::stdin_off_op (cognitive 19): perry_stdlib::readline::stdin_off_op has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (18 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/perry-stdlib/src/readline/mod.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5236792e05ce50423245b77f1b48a113349566e50da85564f1ad298deb3220"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::readline::pump::js_readline_has_active (cognitive 19): perry_stdlib::readline::pump::js_readline_has_active has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 15, if/else 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/perry-stdlib/src/readline/pump.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"f276e208225e31af7a4274ad788cc00c0af1cea873e1a6c8b771422d9bd20853"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::sqlite::bind::bind_node_sqlite_value (cognitive 19): perry_stdlib::sqlite::bind::bind_node_sqlite_value has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (18 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/perry-stdlib/src/sqlite/bind.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce5bd0393edaa64cc60aefc24c902d09712981ff329e427f11f75bee9271161"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::streams::js_readable_stream_controller_close (cognitive 19): perry_stdlib::streams::js_readable_stream_controller_close has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (18 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/perry-stdlib/src/streams.rs"},"region":{"startLine":2178}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f402b0cf77584d9f900eaff66ab4294228cf387c77012835bc0575c9ea275f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::tls::scan_tls_roots_mut (cognitive 19): perry_stdlib::tls::scan_tls_roots_mut has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 4 (8 pts) (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/perry-stdlib/src/tls.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bb42e7aff3ad8566d132e6ccbdcfe41146cd332ced58f546bdf3be2c83fdc9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::tls::turnloop_server::sink (cognitive 19): perry_stdlib::tls::turnloop_server::sink has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 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/perry-stdlib/src/tls/turnloop_server.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"95cc2bf8b592bc225f60f0397c5b217b67de682904cc85f4d6512268cb988849"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::worker_threads::channel_pump::js_worker_threads_channels_has_pending (cognitive 19): perry_stdlib::worker_threads::channel_pump::js_worker_threads_channels_has_pending has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10, boolean chains 7, loops 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/perry-stdlib/src/worker_threads/channel_pump.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f48f60ee72fa66124fe25cb7ac539e9e5fcb35c70140966f2f022578594d2c9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::linearize::labeled::rewrite_labeled_bc_in_stmts (cognitive 19): perry_transform::generator::linearize::labeled::rewrite_labeled_bc_in_stmts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 pts), match/switch 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/perry-transform/src/generator/linearize/labeled.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b183e88fabce45b78cb8fd7315eddc8c46545afe67908d4bfbecba0d5315c309"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::per_iteration::hoist_forward_cell_inits (cognitive 19): perry_transform::generator::per_iteration::hoist_forward_cell_inits has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (6 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/perry-transform/src/generator/per_iteration.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c3f0b21956b0e981a62ac485a4507ca58e5e3e9814f2e8fc1a83e042375144"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::call_inliner::convert_returns_in_stmts (cognitive 19): perry_transform::inline::call_inliner::convert_returns_in_stmts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (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/perry-transform/src/inline/call_inliner.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b418a32f30ada1557aac3100936b6ff76c2a3313c152f25f777aa04803466cd1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::factory_specialize::specialize_captured_class_factories::resolve_factory_return_class (cognitive 19): perry_transform::inline::factory_specialize::specialize_captured_class_factories::resolve_factory_return_class has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 1, 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. This shape REPEATS in the file: 4 other methods here (perry_transform::inline::factory_specialize::specialize_captured_class_factories, perry_transform::inline::factory_specialize::specialize_captured_class_factories::visit_stmts, perry_transform::inline::factory_specialize::specialize_captured_class_factories::rewrite_call_init, \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/perry-transform/src/inline/factory_specialize.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebb4c89bb2e0f0fa835e6162247836c49a83d9e0d6436bef64fd09acfa61c8f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::substitute::substitute_this_in_stmts (cognitive 19): perry_transform::inline::substitute::substitute_this_in_stmts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 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":"crates/perry-transform/src/inline/substitute.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"7587acc17790fe5f000d82539675e6c09d9ab7db15efd922551fc05109d89834"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::local_occurrences::count_module (cognitive 19): perry_transform::local_occurrences::count_module has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 6 (9 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/perry-transform/src/local_occurrences.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0b00d5d41a069a38b25f246c913ccb48b588890482d1f553b1a8b3c206a124"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_android::widgets::bottom_nav::add_item (cognitive 19): perry_ui_android::widgets::bottom_nav::add_item has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 1 (nesting depth added 10). 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/perry-ui-android/src/widgets/bottom_nav.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"33568a94215483652fecc1006ed2cc9f36795a057d3241534bde7804cb24fbab"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_android::widgets::bottom_nav::set_badge (cognitive 19): perry_ui_android::widgets::bottom_nav::set_badge has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (18 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/perry-ui-android/src/widgets/bottom_nav.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"533350bed7e58d4240176895a38886d205ccb70194e2b563a7541e9f350eaed2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_gtk4::widgets::webview::install_signal_handlers (cognitive 19): perry_ui_gtk4::widgets::webview::install_signal_handlers has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 3, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-gtk4/src/widgets/webview.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b50cda64d58245e7b6616f4a3860d76df31d566f9ad1943145a18a035f64bc1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_ios::websocket::schedule_receive_raw (cognitive 19): perry_ui_ios::websocket::schedule_receive_raw has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 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/perry-ui-ios/src/websocket.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37ecb99c9f15e0bc790ca207b1e475c50f95278f809b4c97027365c41366ed3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_tvos::websocket::schedule_receive_raw (cognitive 19): perry_ui_tvos::websocket::schedule_receive_raw has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 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/perry-ui-tvos/src/websocket.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a24ef41bd9769dd2f79d1caf494d4cfc1b62b4c724e422203246e28a1d7382"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_visionos::websocket::schedule_receive_raw (cognitive 19): perry_ui_visionos::websocket::schedule_receive_raw has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 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/perry-ui-visionos/src/websocket.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf7b47b48ac5c1d565b061ddcbd92c2e9d93248364d1242e955b17748f6b37d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::widgets::button::handle_draw_item (cognitive 19): perry_ui_windows::widgets::button::handle_draw_item has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (18 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/perry-ui-windows/src/widgets/button.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b981510a5ee7c8158417dfc0434de904fb1100d0b42cde994bb9880862c0802"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::widgets::command_palette::refresh_filter (cognitive 19): perry_ui_windows::widgets::command_palette::refresh_filter has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 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/perry-ui-windows/src/widgets/command_palette.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"a865f20f27d4307abdf9dbc1f1e2e718a7f61b50be5f89ea09c4636d3e527449"}},{"ruleId":"D2","level":"warning","message":{"text":"FileOutputStream::blocking_write (cognitive 19): FileOutputStream::blocking_write has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), boolean chains 2, 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/perry-wasi/src/p2/filesystem.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b62b341494bc0228d7e9fe6b61db42e5869749d60050c4e0360f6bd7c1d5505"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::builtins::collections::function_method (cognitive 19): perry_wpfacts::builtins::collections::function_method has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 5 (7 pts), loops 1 (2 pts), boolean chains 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/perry-wpfacts/src/builtins/collections.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6157391658808af615c74b97a010b729187b79291341a146dddf9156de984ca"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::derive::lookup (cognitive 19): perry_wpfacts::derive::lookup has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 2 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/derive.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b99ec958e1db3ce48e7cb24bdd6f35790ea0b59282641de3eb655fbc8b7bd2b"}},{"ruleId":"D2","level":"warning","message":{"text":"check_thread_locals.scan (cognitive 19): check_thread_locals.scan has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (12 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":"scripts/check_thread_locals.py"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d48d4b044115dc5fcb074c45d14a070fe17f9d055f84f33dd0024b52f47f8b"}},{"ruleId":"D2","level":"warning","message":{"text":"component_producer_acceptance.main (cognitive 19): component_producer_acceptance.main has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (11 pts), loops 5, if/else 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/component_producer_acceptance.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ced857c2c5d2c085b3ab7536d172973ffdfedf731f520d8420a957518b322c"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_1090_evidence_report.collect_report (cognitive 19): gc_1090_evidence_report.collect_report has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 2 (4 pts), loops 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":"scripts/gc_1090_evidence_report.py"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01e809a2a297c4a56c6f79a1bf86b0cf9cb001de93e9ca3f73100affee563c1"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.heap_source_kind (cognitive 19): gc_root_dominance_check.heap_source_kind has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gc_root_dominance_check.py"},"region":{"startLine":3105}}}],"partialFingerprints":{"codehealthFindingId/v1":"334e27c0a47bc02554c2145a17acdf40ed0afaa3b6b48f73141d1f08d41cd79a"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check._constant_based (cognitive 19): gc_root_dominance_check._constant_based has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 5 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gc_root_dominance_check.py"},"region":{"startLine":5199}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fec9a81a647f5f619b349e822ff16792f84a4670a01c3a082f210e58bf5c8e9"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_store_site_inventory.extract_call_args (cognitive 19): gc_store_site_inventory.extract_call_args has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), 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":"scripts/gc_store_site_inventory.py"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"4799f66df8e676564fbc45ac6515d923b0461aec97c309c07717e2075a38491c"}},{"ruleId":"D2","level":"warning","message":{"text":"link_absence.compile_witness (cognitive 19): link_absence.compile_witness has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 2 (4 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":"scripts/link_absence.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8c8c5dcb69e715089c4b5928f2b21cd5303a50f54f26e422128f9421ebf3e1"}},{"ruleId":"D2","level":"warning","message":{"text":"lock_no_downgrade.self_test (cognitive 19): lock_no_downgrade.self_test has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3, boolean chains 2, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lock_no_downgrade.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"767c96b8494ac9d22f29592c29465286e112b585cd815902ddf9123426b3fa2e"}},{"ruleId":"D2","level":"warning","message":{"text":"native_export_collisions.bind_repeated (cognitive 19): native_export_collisions.bind_repeated has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (5 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/native_export_collisions.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"504b14f73657cb214f8e2f05373031484bf5606de0b7cf502c61e5a56c54fec7"}},{"ruleId":"D2","level":"warning","message":{"text":"package_bench_attr.iter_samples (cognitive 19): package_bench_attr.iter_samples has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 1 (3 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":"scripts/package_bench_attr.py"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2c7c195e369cff94059ca734dc0a0d8743ef0c9a06c26bfec2259243f7a6ab"}},{"ruleId":"D2","level":"warning","message":{"text":"realm_dump.canonical (cognitive 19): realm_dump.canonical has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (17 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":"scripts/realm_dump.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"946814964ff44839310276688295941c6b1271cf1a821e2e19d6d59548ae2296"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime_abi_check.compare_slot (cognitive 19): runtime_abi_check.compare_slot has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10, 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":"scripts/runtime_abi_check.py"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f454f684e72914eb3cca35b5f5f49a0b6805e71ffdb25193777f7951d080c9"}},{"ruleId":"D2","level":"warning","message":{"text":"thread_exit_address_globals.allocation_lifetime_problems (cognitive 19): thread_exit_address_globals.allocation_lifetime_problems has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/thread_exit_address_globals.py"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb50266efc6fbf5844d68df9fd63c2d785329a7cd59c74d4b4e7f81a1c3964e6"}},{"ruleId":"D2","level":"warning","message":{"text":"windows_pipe_drain_cancel.check (cognitive 19): windows_pipe_drain_cancel.check has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, error handling 1 (2 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":"scripts/windows_pipe_drain_cancel.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4472b1ca93a6e9ec9b09421625419d9f1bc8a7e515c2ee16761746ce171d4e38"}},{"ruleId":"D2","level":"warning","message":{"text":"lib.eventSavePolicy (cognitive 19): lib.eventSavePolicy has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 3 (6 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":"upstream/actions/jdx/mr-boxington-action/src/lib.ts"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fadad31e316073f883151f40405cceb15f87525b7fce816746a2da934d2ac00"}},{"ruleId":"D2","level":"warning","message":{"text":"objects-cache.saveIsolatedObjectsBundle (cognitive 19): objects-cache.saveIsolatedObjectsBundle has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7, ternaries 3 (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":"upstream/actions/jdx/mr-boxington-action/src/objects-cache.ts"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22dfefa6bc849a8c4ac3ef798a735e462d6f63c8a081c3a472515b59fc14b5f"}},{"ruleId":"D2","level":"warning","message":{"text":"Requires::visit_call_expr (cognitive 18): Requires::visit_call_expr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (17 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":"crates/perry/src/commands/compile/cjs_wrap/deferred_requires.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"110070067833028d4395b4e14c165595c6e0fab568276462f85c09fc6dfe5eb9"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner::can_drop_tree (cognitive 18): Scanner::can_drop_tree has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (5 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/perry/src/commands/compile/collect_modules/reexport_prune/scan.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fd5dc6238eb94560fad7726b2f0987bb70d2aed86ecaf32951f14a53136df7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::asset_manifest::write (cognitive 18): perry::commands::compile::asset_manifest::write has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 pts), 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/perry/src/commands/compile/asset_manifest.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"284ad1c460bd6f26e9ad3c6a37efef936377c08bb12af2a17ec56bc91a169b1d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::bootstrap::named_exports::visit_stmt (cognitive 18): perry::commands::compile::bootstrap::named_exports::visit_stmt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), match/switch 1 (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/perry/src/commands/compile/bootstrap/named_exports.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c94833c36396a287bddbdacf557ce77125fc2f8b6512068d1dbf3dae613f22"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::extract_requires::matched_open_head (cognitive 18): perry::commands::compile::cjs_wrap::extract_requires::matched_open_head has cognitive complexity 18 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 2 (5 pts), boolean chains 2, match/switch 1 (2 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/perry/src/commands/compile/cjs_wrap/extract_requires.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e3972077d27e192e81eac7ff9d47499caeca487def0344dab0bd754c7b86e8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::defines::load (cognitive 18): perry::commands::compile::defines::load has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (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/perry/src/commands/compile/defines.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3eac7e55ee15261aefc1eafdbdb29dabd9589afe827c3910ba9eb497a03f82e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::resolve::subpath_imports::resolve_imports_field (cognitive 18): perry::commands::compile::resolve::subpath_imports::resolve_imports_field has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (3 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/perry/src/commands/compile/resolve/subpath_imports.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cde53162a86c74ccf6662e3144781ef149cecef2f43c6adff3972253e5d427a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::resolve::tsconfig_paths::build_merged_config (cognitive 18): perry::commands::compile::resolve::tsconfig_paths::build_merged_config has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (2 pts), 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/perry/src/commands/compile/resolve/tsconfig_paths.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be6be773f5d3456063a306f8e4a39b5d93d1799589ad179ea54b5f8fa55ff8d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::size_report::emit_size_report (cognitive 18): perry::commands::compile::size_report::emit_size_report has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 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/perry/src/commands/compile/size_report.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b68a49badfb02a0632937859788a70c66dc72e5eebfd60ee0fef4ca371745c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::install::runner::install (cognitive 18): perry::commands::install::runner::install has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 4, loops 2 (3 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/perry/src/commands/install/runner.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"371d82874c61f8b2207db0a4b2fe27a3bcb78406203297427f2c0017afbd1ac6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::install::scanner::obfuscation::collect_entry_files (cognitive 18): perry::commands::install::scanner::obfuscation::collect_entry_files has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/install/scanner/obfuscation.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a53ba87140c1a25000b41c533e985ca35e7b6da2809271d1ed81442eeaedaa"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::install::scanner::patterns::collect_entry_files (cognitive 18): perry::commands::install::scanner::patterns::collect_entry_files has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/install/scanner/patterns.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"3363855c4d36c4483bf1f57ec59052cc0ec7a22dc0a36c3288e4ff81810485c4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::install::scanner::typosquat::has_file_with_prefix (cognitive 18): perry::commands::install::scanner::typosquat::has_file_with_prefix has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 2 (3 pts), match/switch 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/perry/src/commands/install/scanner/typosquat.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9d9318d345f2bbbbe75a018c0abf0f98eb17b15e375bd37ee6fa34cb497c39"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::setup::tvos::tvos_wizard (cognitive 18): perry::commands::setup::tvos::tvos_wizard has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (17 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/perry/src/commands/setup/tvos.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd434ec1edacc4e131468fa0dc8c20a24133346491bcf6296c2a43c791862bb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::setup::visionos::visionos_wizard (cognitive 18): perry::commands::setup::visionos::visionos_wizard has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (17 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/perry/src/commands/setup/visionos.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a74f3a60e8c2450391de4cc05165d0a952f6ae9d82194931f946c22a9b70ed"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::setup::watchos::watchos_wizard (cognitive 18): perry::commands::setup::watchos::watchos_wizard has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (17 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/perry/src/commands/setup/watchos.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e9c14545b217ed842539304a442cca400dc881b3c5f4edde7ec8c047c8129f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::verify::display_verify_results (cognitive 18): perry::commands::verify::display_verify_results has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (4 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/perry/src/commands/verify.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"976a2d1af0eaf574cfdf34a8cbf158af6bb663f728b5bd245be31eb22d409a9a"}},{"ruleId":"D2","level":"warning","message":{"text":"Build::export_function (cognitive 18): Build::export_function has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 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/perry-codegen/src/codegen/source_need/flow.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f9eeed9a464d5b9d0085fb5488aa7c048071e265f67caef667509681778968"}},{"ruleId":"D2","level":"warning","message":{"text":"UseWalk::collect_candidates (cognitive 18): UseWalk::collect_candidates has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 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/perry-codegen/src/collectors/ptr_numarray.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc477f3445644232a9c118ebd4b62f6547e4c2a41490d0cf73e6fa1726f69ee9"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::stmt (cognitive 18): Model::stmt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (2 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/perry-codegen/src/collectors/repsel_benefit.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9b2d91b924438fda6031b346a947bcd1c3d22a98c7c320ddb9a6f3e4bd232f"}},{"ruleId":"D2","level":"warning","message":{"text":"LlModule::push_referenced_metadata_ids (cognitive 18): LlModule::push_referenced_metadata_ids has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (6 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/perry-codegen/src/module.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12f19a528dd0e8ea5bd8a164b179941d06c23550755bfd97e50c1121fe4f2e2"}},{"ruleId":"D2","level":"warning","message":{"text":"Session::finish (cognitive 18): Session::finish has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (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/perry-codegen/src/typed_feedback_profile.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e63270acc7e641469552765bc27630bd62e4450648bc7096c9f374f8f07fb9"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleState::new (cognitive 18): ModuleState::new has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/typed_feedback_profile.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"57da3d3f002f8dd1b1750f0a4b685258e001da4b0919d30b7b830c9af1607938"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::boxed_vars::collect_for_init_ids (cognitive 18): perry_codegen::boxed_vars::collect_for_init_ids has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"96015aec1fa82a0d9b1c6b5b11db1132d4dae2974c71c4f49dc3987727374945"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::all_pointer_arrays::walk_stmts (cognitive 18): perry_codegen::collectors::all_pointer_arrays::walk_stmts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (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/perry-codegen/src/collectors/all_pointer_arrays.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1df30c0f979338749d34c9f6ae167b137e60f83fcecaa708a32a3fb2f04ca6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::anon_key_adds::visit_stmt (cognitive 18): perry_codegen::collectors::anon_key_adds::visit_stmt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), match/switch 1 (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/perry-codegen/src/collectors/anon_key_adds.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"a283463e6e6c37e7d6e10339a1f5769f93c987407c84406c5aabe3ccd9ff8c95"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::cjs_scaffolding::for_each_stmt (cognitive 18): perry_codegen::collectors::cjs_scaffolding::for_each_stmt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (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/perry-codegen/src/collectors/cjs_scaffolding.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"682bd39555640aee00516ada01e0a2bbb12a2c4bd74c9d04bf28042f18a06af0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::definite_init::for_each_stmt_expr (cognitive 18): perry_codegen::collectors::definite_init::for_each_stmt_expr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (2 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/perry-codegen/src/collectors/definite_init.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4332dc8c53b5431e116949dfb1df9961d393875895d1b7cc96326f3e502949"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::hoisted_callback_calls::collect_immutable_alias_edges (cognitive 18): perry_codegen::collectors::hoisted_callback_calls::collect_immutable_alias_edges has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (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/perry-codegen/src/collectors/hoisted_callback_calls.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f571095cdb259caab3515fcf41af4694330273f308731c0b64e308b0742b2af"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::mutation::collect_flat_const_row_aliases (cognitive 18): perry_codegen::collectors::mutation::collect_flat_const_row_aliases has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (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/perry-codegen/src/collectors/mutation.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"102f7eaae3b785a7091f004b6e595404a296a8d10e898ab4fdc02889c24fdc93"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::collect_direct_let_ids (cognitive 18): perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::collect_direct_let_ids has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (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. This shape REPEATS in the file: 5 other methods here (perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals, perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::expr_value_type, perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals::collect_expr_writes_in_closure_stmts, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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/perry-codegen/src/collectors/pointer_locals.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e979e0ea9a77b4a0187398bf344b1762218256bd871cc193034aad46ab7e82"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::ptr_numarray::for_each_stmt::go (cognitive 18): perry_codegen::collectors::ptr_numarray::for_each_stmt::go has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (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/perry-codegen/src/collectors/ptr_numarray.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd32ba79e95793fba0efc3c2a92b6e3643983207b2d5e11ddbcbe519ce41d463"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_aliases::collect_alias_edges (cognitive 18): perry_codegen::collectors::ptr_shape_aliases::collect_alias_edges has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (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/perry-codegen/src/collectors/ptr_shape_aliases.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"7790cc479f2bb172895b259ac267c3e41c66e14c93b79205238fa420937db719"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_elements::walk_stmts (cognitive 18): perry_codegen::collectors::ptr_shape_elements::walk_stmts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (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/perry-codegen/src/collectors/ptr_shape_elements.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"e102048743b00bc59bf360e66cc4b6b92750b22878b7ea074a71cd608b32755c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_report::walk_lets (cognitive 18): perry_codegen::collectors::ptr_shape_report::walk_lets has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (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/perry-codegen/src/collectors/ptr_shape_report.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1ceab08eb7644538be6b861c4847473338bc59634b0f3cdf492492523acab8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_returns::walk_stmts (cognitive 18): perry_codegen::collectors::ptr_shape_returns::walk_stmts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (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/perry-codegen/src/collectors/ptr_shape_returns.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"48bfd0618eff166d4adb8664ce643b360e3ff74de996c1a6dfe8605db8ca81fc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::read_before_write::each_stmt (cognitive 18): perry_codegen::collectors::read_before_write::each_stmt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (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/perry-codegen/src/collectors/read_before_write.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"09794f7222eb7c276879d128dfbda45d7510fffed8b8cfd848eb7a2c7d5b4a60"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::scalar_methods::is_simple_scalar_method (cognitive 18): perry_codegen::collectors::scalar_methods::is_simple_scalar_method has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, loops 2, match/switch 1 (2 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/perry-codegen/src/collectors/scalar_methods.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3193b130d2dcef5b4be6f58c90dcaa437be2492602919ab1670d416e6b90abf0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::typed_locals::iife_return_kind (cognitive 18): perry_codegen::collectors::typed_locals::iife_return_kind has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 9). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to one function item inside it that branches (returns). 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/perry-codegen/src/collectors/typed_locals.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9bc75995e46ab4e087500980093b8b2cf6e8ac560de8ae8f10ccd90a3c32a0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::typed_locals::capture_proofs (cognitive 18): perry_codegen::collectors::typed_locals::capture_proofs has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 4 (7 pts), match/switch 1 (3 pts) (nesting depth added 8). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 4 function items inside it that branch (visit_expr, visit_body, visit_expr::reads::r, \u2026). 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/perry-codegen/src/collectors/typed_locals.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7e62092fb63c1b491a34b1f972f8d15966ec592bdeaddd5d7ce4737f553f67"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::buffer_views::downgrade_buffer_alias (cognitive 18): perry_codegen::expr::buffer_views::downgrade_buffer_alias has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 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/perry-codegen/src/expr/buffer_views.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa565a8dd39d2d8552f6a51518eb4b32db8d433aaad6dd986ef95b81723d9d47"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::calls::fs::arm_fs_promises (cognitive 18): perry_codegen::expr::calls::fs::arm_fs_promises has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (17 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/perry-codegen/src/expr/calls/fs.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2708ba6c4daccd3a7d30f978f4b80387aafece80eb2d381df41580ff2914a7e1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::checked_super::plan (cognitive 18): perry_codegen::expr::checked_super::plan has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/checked_super.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c005ab45db5f06448359b835f21e6fa60d8341ba37668f546bfd762e5903b1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::closure::plain_async_step_release_ids::walk (cognitive 18): perry_codegen::expr::closure::plain_async_step_release_ids::walk has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (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/perry-codegen/src/expr/closure.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d800cfab6189206169851d5381084f79029133f8b333d3d1d45e6268158baa"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::element_shape_guard::emit_element_shape_loop_preheader_check (cognitive 18): perry_codegen::expr::element_shape_guard::emit_element_shape_loop_preheader_check has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 7 (10 pts), if/else 6, loops 1 (2 pts) (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/perry-codegen/src/expr/element_shape_guard.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb19f09b4a42b026b40322ab4b5c9514d5053d2cd355e2e6c8c49277adb1ff6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::i32_fast_path::i32_chain_magnitude_bits (cognitive 18): perry_codegen::expr::i32_fast_path::i32_chain_magnitude_bits has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 7, match/switch 2 (3 pts) (nesting depth added 5). 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/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fab56ea199ac441c33b794be90947d32388f7049fe7ac37e454e9dc6f51a0d9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::region_guard::census_stmts (cognitive 18): perry_codegen::expr::region_guard::census_stmts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 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/perry-codegen/src/expr/region_guard.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e4e05b507f9e1f51b63044c6bc0eb9df2453b7e7e489d208d2ee413783bf49"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::function::precise_roots::rewrite_root_access (cognitive 18): perry_codegen::function::precise_roots::rewrite_root_access has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/function/precise_roots.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"60108a76b758a7e7a13e1eebe8047522a1f4e6db6a240272427ac3adf493c0f8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::inprocess::native_homes::erase_overwritten_null_stores (cognitive 18): perry_codegen::inprocess::native_homes::erase_overwritten_null_stores has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/inprocess/native_homes.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc33d187cb44dd899bd224fe495e4abbc957d5f03654ad3a06a9b97db6c63ff1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_desc::create_families::name_computed_class_fields (cognitive 18): perry_codegen::layout_desc::create_families::name_computed_class_fields has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (4 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/perry-codegen/src/layout_desc/create_families.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e2370ea32e1cfc38d547d40aa8f06e5303f1d3d067ea16bf212c43882cc700"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_families::visit_stmt (cognitive 18): perry_codegen::layout_families::visit_stmt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (2 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/perry-codegen/src/layout_families.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"6715a6c4b0812bfa52bce82b1270c23f2d36a211115822dbd427fe649711d4d6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::func_ref::guarded_property_type (cognitive 18): perry_codegen::lower_call::func_ref::guarded_property_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 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/perry-codegen/src/lower_call/func_ref.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e621aeaa568a6a98acbff4cd403778fc67d27268256104efcf33bf9577a5c79"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::new_helpers::emit_native_instance_base_init (cognitive 18): perry_codegen::lower_call::new_helpers::emit_native_instance_base_init has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 1 (3 pts), match/switch 2 (3 pts) (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/perry-codegen/src/lower_call/new_helpers.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"5240336f0cba665e5780b21c41cb2e9669617ea66d00fc3e3f7f55c13048eed6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::options::fetch::lower_response_init (cognitive 18): perry_codegen::lower_call::options::fetch::lower_response_init has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 2 (6 pts), loops 2 (4 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/perry-codegen/src/lower_call/options/fetch.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"93dc2b6ca5a56e9ad70cbc3b83908a8dff72c23998dc70b7b33fc835d6fed89b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::scope_env::analysis::for_each_stmt_shallow (cognitive 18): perry_codegen::scope_env::analysis::for_each_stmt_shallow has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (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/perry-codegen/src/scope_env/analysis.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfd2c43a0798e04e438b46cd953fca4fe20414721ae01cf35934a817a02a895"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::loops::admit_integer_update_accumulators (cognitive 18): perry_codegen::stmt::loops::admit_integer_update_accumulators has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1f2703207d214569aa007c411b4b6e863262101420e6689e648de5ad6198b7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::loops::emit_packed_numeric_accumulator_admission (cognitive 18): perry_codegen::stmt::loops::emit_packed_numeric_accumulator_admission has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 4 (6 pts), boolean chains 2, match/switch 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdbc26712ce15896b94f1b3d0f994e1ca9dbfeff5d7b9b7713aabf5ea9cbda84"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::loops::lower_for (cognitive 18): perry_codegen::stmt::loops::lower_for has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15 (18 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":6940}}}],"partialFingerprints":{"codehealthFindingId/v1":"f568fb1f221a2e4f4887492ed230e22607fcbed8ddd7d551deae4a8f2799f948"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::typed_shape::class_chain_layout_declarable_at_allocation (cognitive 18): perry_codegen::typed_shape::class_chain_layout_declarable_at_allocation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/typed_shape.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7febb608fec0f94f8e116eaf6c3797441c67bba067e34e76421e2e73b8b96a7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_arkts::inline::remap_let_ids_in_stmt (cognitive 18): perry_codegen_arkts::inline::remap_let_ids_in_stmt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (17 pts), 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/perry-codegen-arkts/src/inline.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce7c2068a1b99e7ab470bbc7e178952cd2490f87454952be41c3e260dbf3efc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_arkts::view_builders::scan_closure_body_for_view_builder_calls_in_expr (cognitive 18): perry_codegen_arkts::view_builders::scan_closure_body_for_view_builder_calls_in_expr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 9). 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/perry-codegen-arkts/src/view_builders.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e3b6d9a590660125e43a7f59cc3ee263b9389c12d1683a3d7f4875f6bbee13"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_glance::emit::emit_node (cognitive 18): perry_codegen_glance::emit::emit_node has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-glance/src/emit.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ad974ed565c0682a03709be2d4e4f4350f62308656f799e96de1b6d97d324a"}},{"ruleId":"D2","level":"warning","message":{"text":"DockerProtocol::create_args (cognitive 18): DockerProtocol::create_args has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, loops 7 (9 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/perry-container-compose/src/backend/docker.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"230ede8da22d9a2b0e4fbc6081420402c8364ceb01ffc86e3fc27d14597f98c8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_container_compose::compose::resolve_startup_order (cognitive 18): perry_container_compose::compose::resolve_startup_order has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 5 (8 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/perry-container-compose/src/compose.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"259a90afe6e9f044e8d4779b37059b18d0e9bee88fab75c287eb3d581fafa9c8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::agent::append_https_agent_name_fields (cognitive 18): perry_ext_http::agent::append_https_agent_name_fields has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (2 pts), 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/perry-ext-http/src/agent.rs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aef22f28d646ccff3db7ebe3037d68bd66b8af55bddd75e29dabcd1c7f0bb67"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::pending_dispatch::js_http_process_pending (cognitive 18): perry_ext_http::pending_dispatch::js_http_process_pending 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/perry-ext-http/src/pending_dispatch.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"882257953a2f29343db39ac3a1d4c6b7e530b72009cda20398d313e609c906c6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::scan_http_server_roots (cognitive 18): perry_ext_http::server::scan_http_server_roots has cognitive complexity 18 (threshold 15). Drivers by points: loops 8 (10 pts), if/else 7 (8 pts) (nesting depth added 3). Of this number, 12 points are the body\u0027s own statements and 6 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/perry-ext-http/src/server/mod.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"35da5a3eab2d03ebaf3c33418f9ce4d9fb28cc1b09adeebe58d87ef2d3b8b788"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::handle_dispatch::response_socket_value (cognitive 18): perry_ext_http::server::handle_dispatch::response_socket_value has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (18 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/perry-ext-http/src/server/handle_dispatch.rs"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"f854ca1ceb991f5dfdfbaeaf1b09e4b7605ace4aa27876cff5aa8a63d8a2bf5f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::http2_server::listen_http2_server (cognitive 18): perry_ext_http::server::http2_server::listen_http2_server has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-http/src/server/http2_server.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"78395f41bfaf37d99f70658d8ffc27b9c149d8eb34a0e0faeb4ae38f0df1ec98"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::https_server::process_pending_https (cognitive 18): perry_ext_http::server::https_server::process_pending_https has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 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/perry-ext-http/src/server/https_server.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1df852137f511f9effc40ffcd5dcfa1427546b28ba936ab200ce25529aaff8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::request::js_node_http_im_add_header_line (cognitive 18): perry_ext_http::server::request::js_node_http_im_add_header_line has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 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/perry-ext-http/src/server/request.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd04b4c799d9d5265de5821e2076405c6a3cd630348a2c4c152071a3d5d3707"}},{"ruleId":"D2","level":"warning","message":{"text":"Payload::step (cognitive 18): Payload::step has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 2 (3 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/perry-ext-zlib/src/stream/driver.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20f880137100d8f10093ffae4902b667a36238a3018d275c3c76b09b8e2ddad"}},{"ruleId":"D2","level":"warning","message":{"text":"Cfg::new (cognitive 18): Cfg::new has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4, 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/perry-gc-effects/src/instructions.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef228495a4f322df7e0eff649002b33b346afffada787f6b0b38f06273540233"}},{"ruleId":"D2","level":"warning","message":{"text":"Sidecar::parse (cognitive 18): Sidecar::parse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 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/perry-gc-effects/src/sidecar.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"9003f44b52d40afe4ef8e29ee2876e2df32e5ed44de1ea2334e56c817371bc62"}},{"ruleId":"D2","level":"warning","message":{"text":"HirTypeEnv::collect_stmt_declarations (cognitive 18): HirTypeEnv::collect_stmt_declarations has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (2 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/perry-hir/src/analysis/value_types.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aed709c3ddf49dce8cf4d81585c3fa62fe4b1afacfd6d33ab4aa8a832f32e97"}},{"ruleId":"D2","level":"warning","message":{"text":"Pruner::stmt (cognitive 18): Pruner::stmt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (2 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/perry-hir/src/lower/class_capture_scope.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab242c50f754cec945373b24b59f315a21c8c24fcd8a149f0cac95ff66f5c78"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::analysis::replace_this_in_stmt (cognitive 18): perry_hir::analysis::replace_this_in_stmt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (2 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/perry-hir/src/analysis.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"36be7f2afeec7bed7f45294cb545c4e006ab6b72e50c8f271b8bed96b3f0d952"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::enums::fix_imported_enums_in_expr (cognitive 18): perry_hir::enums::fix_imported_enums_in_expr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (6 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/enums.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6db95834771cd198e1bee00900775f84df266f5a6dc46dd573ddb9dd3322f9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::js_transform::imports::transform_stmt (cognitive 18): perry_hir::js_transform::imports::transform_stmt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (2 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/perry-hir/src/js_transform/imports.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcdda35b8099c5b9edc2790097503d8cc11ff4f870a5881e19ac76499921693"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::builder_fold::process_module_items (cognitive 18): perry_hir::lower::builder_fold::process_module_items has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 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/perry-hir/src/lower/builder_fold.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0c7e1e90c930e9b5b1cca6b8e0489e9007ce48a5c5fd53c36d6be812adf17a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::builder_fold_width_hints::hint_walk_class (cognitive 18): perry_hir::lower::builder_fold_width_hints::hint_walk_class has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), 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/perry-hir/src/lower/builder_fold_width_hints.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b6f0ed3c2041345e72aa480d188482210b6224a7449dae0778f9f9f828908c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::const_fold_fn::resolve_fn_ctor_arg (cognitive 18): perry_hir::lower::const_fold_fn::resolve_fn_ctor_arg has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (5 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/perry-hir/src/lower/const_fold_fn.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec3bc5a12d029fe3aeaa933ca1d3c273a61e27697e1126beed00669f46a1785"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::enum_image::enum_iife (cognitive 18): perry_hir::lower::enum_image::enum_iife has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, 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/perry-hir/src/lower/enum_image.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57d24f898a0ff3691c60bc44f2da3acdf542801464dff0b1e837bea0babe16e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::os::static_encoding_decision (cognitive 18): perry_hir::lower::expr_call::os::static_encoding_decision has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/os.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d8c2f4a08af0da53289bcce9b445d5c85df6ebee267ed3ac0fdd42b3652a99"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::prescans::run_call_prescans (cognitive 18): perry_hir::lower::expr_call::prescans::run_call_prescans has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (17 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/perry-hir/src/lower/expr_call/prescans.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"678d5c331fe6ee40f5e9b2b4203d46dc74da987e6939d7b7bc2a1c9ae9b3f3a1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::fn_ctor_env::wrapper_const_string (cognitive 18): perry_hir::lower::fn_ctor_env::wrapper_const_string has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 4 (6 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/perry-hir/src/lower/fn_ctor_env.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fcbee3c66c06836dd4e69350ab0938c29c904fdce92def27fc341d0fc0f4da6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::fn_ctor_env::scan_assign_target_writes (cognitive 18): perry_hir::lower::fn_ctor_env::scan_assign_target_writes has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (9 pts), loops 2 (6 pts), if/else 1 (3 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/fn_ctor_env.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4041a86cc6ac50b1f6ec24ca6c175f14e564860a5b82ba4669448139cebe7aa"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::global_eval_hoist::collect_nested_fn_decl_names_inner (cognitive 18): perry_hir::lower::global_eval_hoist::collect_nested_fn_decl_names_inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (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/perry-hir/src/lower/global_eval_hoist.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6a41efef7d449e834829c7bfb18e94d3e985bc224b751db18b779bbe30dcff"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::misc::is_ast_string_expr (cognitive 18): perry_hir::lower::misc::is_ast_string_expr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/misc.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e2d0d9b5aaa58ca3ce8949c65a132e6e125797ff4bfa37de544ab0312992b6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::block::lower_block_fn_decls (cognitive 18): perry_hir::lower_decl::block::lower_block_fn_decls has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), 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/perry-hir/src/lower_decl/block.rs"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebbf961965d6ffbc519e68d62f985fa3a92cbc2443b80d2d5cd5278d5aa3fda"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::body_stmt::gen_capture_scan::forward_referenced_nested_generators (cognitive 18): perry_hir::lower_decl::body_stmt::gen_capture_scan::forward_referenced_nested_generators has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (4 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/perry-hir/src/lower_decl/body_stmt/gen_capture_scan.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b055ad38472cfc723cb9c15d8bf571b07a123367b1c7b745e8c5b0ce214fc7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::interface_decl::lower_interface_decl (cognitive 18): perry_hir::lower_decl::interface_decl::lower_interface_decl has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 6 (7 pts), loops 2 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_decl/interface_decl.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"573aef100e415fd92b575514ae7def7dfdd54d2ac264c3f92fa6f41ac8f9da4d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_types::collect_return_types (cognitive 18): perry_hir::lower_types::collect_return_types has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 2 (5 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/perry-hir/src/lower_types.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b5f00156448effbb6d166881f72fb2a39b2dce64c5c050c79b4017474daad8"}},{"ruleId":"D2","level":"warning","message":{"text":"Decoder::step (cognitive 18): Decoder::step has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-http-client/src/ws/frame.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c9441cfa97d62fc97f12d81c96b3f25ee6ab8b3ef037e9d8789c27857da239"}},{"ruleId":"D2","level":"warning","message":{"text":"IpcStream::raw_io (cognitive 18): IpcStream::raw_io has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (18 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/perry-runtime/src/child_process/ipc_transport.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbe47a315230a30bcc2df3e7e4a6d2ee3a2e179c5483273c315de953cd56db0"}},{"ruleId":"D2","level":"warning","message":{"text":"WalkerImage::lsda_for (cognitive 18): WalkerImage::lsda_for has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 3, 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/perry-runtime/src/eh_walker.rs"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a98ee2f04aeb79adef56bc9f16364352ca383b9ac62488c6b2fd86e880a437f"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockPersistCycleState::step (cognitive 18): BlockPersistCycleState::step has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), 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/perry-runtime/src/gc/cycle.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f78139e2388cd55c0f51b707c72e101d6ae9dfbcd93f4c5156ebb51f078ec04"}},{"ruleId":"D2","level":"warning","message":{"text":"CanonicalTable::retire_dead (cognitive 18): CanonicalTable::retire_dead has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (5 pts), boolean chains 4 (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/perry-runtime/src/object/canonical_keys.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cff84987752974ac76948772cd3dd19eb24bd80d80b21492b4a9759211fc76"}},{"ruleId":"D2","level":"warning","message":{"text":"Histogram::percentile_entries (cognitive 18): Histogram::percentile_entries has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 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/perry-runtime/src/perf_histogram.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"92919793ddfbd4fbae4ab229749f831a121284d8afafc1d2e0fa101f024be599"}},{"ruleId":"D2","level":"warning","message":{"text":"WeakStorage::probe (cognitive 18): WeakStorage::probe 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/perry-runtime/src/weakref/storage.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3a5bf828c500a52a83aee50f44b9250129e90cb62334a100bd4218561d63f9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::fill_extend::js_array_fill_f64_iota_extend (cognitive 18): perry_runtime::array::fill_extend::js_array_fill_f64_iota_extend has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, loops 4 (7 pts), 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/perry-runtime/src/array/fill_extend.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"2992c251251c0f30a5c5f9702896bc7a58717f858449f61eb567076219ab3f88"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::immutable::js_array_copy_within (cognitive 18): perry_runtime::array::immutable::js_array_copy_within has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (16 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/perry-runtime/src/array/immutable.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5871131e3e8ae9a68274bee7216c8be77179d588c4ebefafcafb9e1b2946f7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::indexing::array_strict_index_write_guard_resolved (cognitive 18): perry_runtime::array::indexing::array_strict_index_write_guard_resolved has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 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/perry-runtime/src/array/indexing.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab2dbdccb40e78aa117fe4c9717bc9b6869280745dfa94b6aae94e1a11b71db"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::iter_object::route_iter_obj_receiver (cognitive 18): perry_runtime::array::iter_object::route_iter_obj_receiver has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/array/iter_object.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2925fab7ff1f4b0bbdc99cce86b685edb17aa2cf40a65f9f54cf146fc494e0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::buffer::access::js_buffer_set_from_value (cognitive 18): perry_runtime::buffer::access::js_buffer_set_from_value has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 1 (2 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/perry-runtime/src/buffer/access.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1c47bab15aab851f83b7f0b66769d803cc59ed32efc8ace7a475f119ce44bd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::builtins::numbers::js_string_coerce (cognitive 18): perry_runtime::builtins::numbers::js_string_coerce has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15 (18 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/perry-runtime/src/builtins/numbers.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71182edb02dd3b90094b3c721870a8cf97ac2275ac0ed10f7fc55ebb0b9a6f2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::bun_compat::cli_utils::compact_flow_yaml (cognitive 18): perry_runtime::bun_compat::cli_utils::compact_flow_yaml has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 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/perry-runtime/src/bun_compat/cli_utils.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbb7e90d23fc87fe9b36da903364a5fb493b18b5b3333a9a92f53425d514326"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::child_process::options::cp_apply_options (cognitive 18): perry_runtime::child_process::options::cp_apply_options has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 1 (4 pts), loops 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/perry-runtime/src/child_process/options.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a40bb7654d2e8b2287646a7968dd967f57ee65e0432a1133a1b09f1f7aefd4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::child_process::validate::cp_validate_stdio_entry (cognitive 18): perry_runtime::child_process::validate::cp_validate_stdio_entry has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/child_process/validate.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3679addcd78e00e845d35a805c5d165e8cd72ad76478a847566088c8f10f2f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::closure::registry::dispatch_rest_bundled (cognitive 18): perry_runtime::closure::registry::dispatch_rest_bundled has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15 (17 pts), 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/perry-runtime/src/closure/registry.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff47388543a0f04fb4ade9bded5f05bdf75c319cde0df41efb62ee88e79dd98"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::closure::shape::refresh_closure_shape (cognitive 18): perry_runtime::closure::shape::refresh_closure_shape has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/closure/shape.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02a1a403260f62a47eef346fe860fd96846fd97d12a5e3cadf1ec39a2544cc3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::cluster_sched::drain_advanced_frames (cognitive 18): perry_runtime::cluster_sched::drain_advanced_frames has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (17 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/perry-runtime/src/cluster_sched.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"a051c2111157aa710b61a36ade4907edef77b590b63c6358d826e82c27122b78"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::component::asynchronous::imports::drain (cognitive 18): perry_runtime::component::asynchronous::imports::drain has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 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/perry-runtime/src/component/asynchronous/imports.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a77615f2ae1f1e518220f71ff6e9ad14b3a789c1163f85ef512250942a9450"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::component::cleanup::returned::gather (cognitive 18): perry_runtime::component::cleanup::returned::gather has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (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/perry-runtime/src/component/cleanup.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5c8b81f3a0d3add098b9799da0284d193ee44b928e3ef672c9efa98a2936af"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::eh::perry_eh_personality (cognitive 18): perry_runtime::eh::perry_eh_personality has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 3 (5 pts), boolean chains 2 (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/perry-runtime/src/eh.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fda0316039ca0dc4f3c5c1561a064ead786fc4e131ef2436170e096b99114f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::eh_walker_trace::parse_cie (cognitive 18): perry_runtime::eh_walker_trace::parse_cie has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/eh_walker_trace.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2d0a15116371c22d9214099fcd5764648b291fe7868b88b052b752e365b842"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::eh_windows::try_fast_transport (cognitive 18): perry_runtime::eh_windows::try_fast_transport has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 1 (4 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/perry-runtime/src/eh_windows.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b4b5d6f8fbfd2ad987af4bb946a2da5efb378bc1d613fba5641bda06ba146d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::embedded::read_dir (cognitive 18): perry_runtime::embedded::read_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), 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/perry-runtime/src/embedded.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4edca1a52456fca3ef872ceeffee640637556865c3b608a445c0343570c154"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::event_pump::js_wait_for_event (cognitive 18): perry_runtime::event_pump::js_wait_for_event has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/event_pump.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"92db971e0db12cc8fe22ce010a2fa371dc4c7531e2c492f54b2ba3b52b085d8d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::fs::dir_glob_watch::glob::parse_glob_chars (cognitive 18): perry_runtime::fs::dir_glob_watch::glob::parse_glob_chars has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/fs/dir_glob_watch/glob.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c44520c04d4a0258b39dc49551fcaa129628a3a3a0bf899058689411dc76da"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::fs::dirent::options_field_value (cognitive 18): perry_runtime::fs::dirent::options_field_value has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). 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/perry-runtime/src/fs/dirent.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"351452c01e22d4e6d42b4d649829bdd35453ea4b758f0d99b5833c0f9127bbd3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::fs::stream::scan_fs_stream_roots_mut (cognitive 18): perry_runtime::fs::stream::scan_fs_stream_roots_mut has cognitive complexity 18 (threshold 15). Drivers by points: loops 8 (16 pts), if/else 1 (2 pts) (nesting depth added 9). 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/perry-runtime/src/fs/stream.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68d0f7a5972db79ac0b27c923004567ce91e7139fd9c6a9a3f9eed3b2ab4a7f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::policy::gc_bump_malloc_trigger_inner (cognitive 18): perry_runtime::gc::policy::gc_bump_malloc_trigger_inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (18 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/perry-runtime/src/gc/policy.rs"},"region":{"startLine":1809}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a99975d6428f94cd5a88a215c3d239a3f28db59874c739ecbe5f21cdf5800bf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::policy::gc_budgeted_start_or_step (cognitive 18): perry_runtime::gc::policy::gc_budgeted_start_or_step has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, loops 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/perry-runtime/src/gc/policy.rs"},"region":{"startLine":4834}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b027061e107d7f7dc848ccb7f2ae17002455f7aef22b525f235ef3fcb680305"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::roots::stack_maps_sections::loaded_stack_map_sections::collect (cognitive 18): perry_runtime::gc::roots::stack_maps_sections::loaded_stack_map_sections::collect has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 4, 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/perry-runtime/src/gc/roots/stack_maps_sections.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"796a505e8e49e6e896bc86ee2ec550ba82d01ea163d67c311cb688f590e32e18"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::split_numeric_parts (cognitive 18): perry_runtime::intl::split_numeric_parts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/intl.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4922c9bf2ccefdcb87e1fd87916c53b608b7b82b2542949d407aca7b3eb72e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::locale::full_string (cognitive 18): perry_runtime::intl::locale::full_string has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (5 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/perry-runtime/src/intl/locale.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6817da8e18531932461766bc941718aad64f96644e9165b12b068c91d5c4b25"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::scan_parse_roots_mut (cognitive 18): perry_runtime::json::scan_parse_roots_mut has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 7 (9 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/perry-runtime/src/json/mod.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3602f1079418290e213f004caa34f2edf2b5e73700baa93e8dde4f59087b8c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::replacer::property_list::stringify_array_with_array_replacer (cognitive 18): perry_runtime::json::replacer::property_list::stringify_array_with_array_replacer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3 (6 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/perry-runtime/src/json/replacer/property_list.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ef477c31306fe553d5a395c36f8ce7b0c1fbcf74dd0e7f67271477b4cfac58"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json_tape::cached_read::lazy_get (cognitive 18): perry_runtime::json_tape::cached_read::lazy_get has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 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/perry-runtime/src/json_tape/cached_read.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b680430b031f038885663753274b79b0125dd2ff0b9e9ab8097ff68a97fd054"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::jsx::dispatch (cognitive 18): perry_runtime::jsx::dispatch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, match/switch 1 (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/perry-runtime/src/jsx.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee98ef66116168682d0477484c67dfcea1d7ccc5f779ce529eb084fb83512497"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::map::jsvalue_eq (cognitive 18): perry_runtime::map::jsvalue_eq has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 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/perry-runtime/src/map.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"773d1117c20b7becf1cde83dc0c391ce306b8700aef19e70d1f361ec2952c926"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::module_require::import_meta_resolve::file_or_directory (cognitive 18): perry_runtime::module_require::import_meta_resolve::file_or_directory has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), 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/perry-runtime/src/module_require/import_meta_resolve.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d843429e10be100f64b61e1f89f17414dccec77eae3107ac9a3e006fdea1ca0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::net_validate::js_net_normalize_args (cognitive 18): perry_runtime::net_validate::js_net_normalize_args has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (14 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/perry-runtime/src/net_validate.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9098e9f95fd17cc6ae414617540a9dbcf1ec5d15b034d56304c3bd89bc4a811"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_stream::async_iterator::ns_readable_iterator_next (cognitive 18): perry_runtime::node_stream::async_iterator::ns_readable_iterator_next has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 1 (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/perry-runtime/src/node_stream/async_iterator.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"36110d0820bbdb939621a02db0daf57baa1484889eb48ec3dad5081e630c0e5a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_stream_readwrite::emit_readable_end_once (cognitive 18): perry_runtime::node_stream_readwrite::emit_readable_end_once has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 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/perry-runtime/src/node_stream_readwrite.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d6d878fe188970bd3ff52755e29911e30cc2a09fa31a5a133f796683399aac"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::alloc::js_object_clone_with_extra (cognitive 18): perry_runtime::object::alloc::js_object_clone_with_extra has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 4 (6 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/perry-runtime/src/object/alloc.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b7fd801fa9d52e330eb32bd0ea8649ad51cf2eaa7f6fa798ecc59d5514da41"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::arguments::js_arguments_forward_apply (cognitive 18): perry_runtime::object::arguments::js_arguments_forward_apply has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (18 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/perry-runtime/src/object/arguments.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdb7d4b61d1c46344243019468af8f17cf8b52ce0ccd02eb033a9350ccdf4ec"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::assign::object_assign_enumerated_source (cognitive 18): perry_runtime::object::assign::object_assign_enumerated_source 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/perry-runtime/src/object/assign.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"314c5b043303ebe652d4d70923a6d806fea5033652abbbedd3a44d0f039e12e3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::declarations::name_computed_member_by_key (cognitive 18): perry_runtime::object::class_registry::declarations::name_computed_member_by_key has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/class_registry/declarations.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"4404834ffea2b275b2b8bf383898dcea9e9c0caddd138a40048910ff92c5918e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::parent_static::static_accessor_call::class_static_accessor_setter_apply_bytes (cognitive 18): perry_runtime::object::class_registry::parent_static::static_accessor_call::class_static_accessor_setter_apply_bytes 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/perry-runtime/src/object/class_registry/parent_static/static_accessor_call.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"5911f79ea96c679825a882b646aaca983b6320410cd8d9af27e993eb2f9a2cff"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::accessors::array_prototype_property_value (cognitive 18): perry_runtime::object::field_get_set::accessors::array_prototype_property_value has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (18 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/perry-runtime/src/object/field_get_set/accessors.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"beeb3f6da818a7ca02ed007b944d2cf9d11ce76deab57483d81403a9fa521f75"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::get_slow::js_object_get_field_slow (cognitive 18): perry_runtime::object::field_get_set::get_slow::js_object_get_field_slow 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/perry-runtime/src/object/field_get_set/get_slow.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a100337d20e8f02d41a7069d0aaf116e16dbffe3d093d886be91b54161f98b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_set_by_name::fast_paths::try_readd_stable_tombstone_sso_no_grow (cognitive 18): perry_runtime::object::field_set_by_name::fast_paths::try_readd_stable_tombstone_sso_no_grow has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, 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/perry-runtime/src/object/field_set_by_name/fast_paths.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5735b1c93abcdd03be284e3098ec3fc30620b7a66784e67c980d3c0bc7ed223"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::instanceof::ordinary_has_instance_prototype_walk_rooted (cognitive 18): perry_runtime::object::instanceof::ordinary_has_instance_prototype_walk_rooted has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 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/perry-runtime/src/object/instanceof.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"8355ea792bbe8801518ce0e48b81b212746532bebc2be36233056e7f0525b73c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_probe::own_entry (cognitive 18): perry_runtime::object::layout_probe::own_entry has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 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/perry-runtime/src/object/layout_probe.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"158c1d46000e0ad8b36f2e67bc305cd230576553d1bc7adfa54dde4d1c0919a5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_probe::computed::perry_probe_get_value::chain_admits_family (cognitive 18): perry_runtime::object::layout_probe::computed::perry_probe_get_value::chain_admits_family has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 1 (2 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. This shape REPEATS in the file: one other method here (perry_runtime::object::layout_probe::computed::perry_probe_get_value::perry_family_run_admits) 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/perry-runtime/src/object/layout_probe/computed.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4995bd4c6eef3bb80433130f111c88a1cc5ad61b934df7a3f42b65da3e4d23"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_probe::inherited::inherited_walk_at (cognitive 18): perry_runtime::object::layout_probe::inherited::inherited_walk_at has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (6 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/perry-runtime/src/object/layout_probe/inherited.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"b150523c5dba2877611771eb9b706d4fe34ca668f99930c72962ab8bb4ebcc79"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_instance_layout::derived_layout (cognitive 18): perry_runtime::object::native_instance_layout::derived_layout has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 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/perry-runtime/src/object/native_instance_layout.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ca28014869c275fd4cef7a542785f0d8718e1fadcbce30542e62f3473124e3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::object_ops_frozen::js_object_is_sealed (cognitive 18): perry_runtime::object::object_ops_frozen::js_object_is_sealed has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (16 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/perry-runtime/src/object/object_ops_frozen.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"350e05dfafeda433aff3c7e3da2bb1f23fae111a253ddfb2bba274ff18e54f45"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::property_ops::metadata::metadata_keys_for (cognitive 18): perry_runtime::object::property_ops::metadata::metadata_keys_for has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 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/perry-runtime/src/object/property_ops/metadata.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f34d6969e5c2598223f36a57ae38a9024032b2f21348fb2f27841b5600e87c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::typed_array_define::typed_array_define_own_property (cognitive 18): perry_runtime::object::typed_array_define::typed_array_define_own_property has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 1 (3 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/perry-runtime/src/object/typed_array_define.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb73261380dd4cc2512720401f6723f6d54b119863c4f0912eb8acaa2d534a8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::os::signal::win_process_kill (cognitive 18): perry_runtime::os::signal::win_process_kill has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 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/perry-runtime/src/os/signal.rs"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d8a24fc58a01c504f9d736a84e77504bf884d3fc25125f2def8a447823424e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::os_network::collect_network_interfaces (cognitive 18): perry_runtime::os_network::collect_network_interfaces has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (3 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/perry-runtime/src/os_network.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2711ffc6aeba9240980721b4984cc6090c7aaedf66da4c6c0555d3cbc5427a5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::os_network::collect_windows_adapters (cognitive 18): perry_runtime::os_network::collect_windows_adapters has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (3 pts), match/switch 1 (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/perry-runtime/src/os_network.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"db223bf5e639234426048495f86583e888da27b921046e945d21fc7f0bebfae2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::os_process_streams::scan_process_stream_singleton_roots_mut (cognitive 18): perry_runtime::os_process_streams::scan_process_stream_singleton_roots_mut has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 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/perry-runtime/src/os_process_streams.rs"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"629aa7faad3fe3ebf2014b432d4c93c9c54c76f1af134b6dbe103aaa68026162"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::process::permission::process_permission_flag_values (cognitive 18): perry_runtime::process::permission::process_permission_flag_values has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (nesting depth added 10). 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/perry-runtime/src/process/permission.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39a10c897bc48d150a5d27b44a9ab86121c2d06f1a04b648d28315e261cb448"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::promise::then::finally_wrapper_common (cognitive 18): perry_runtime::promise::then::finally_wrapper_common has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/promise/then.rs"},"region":{"startLine":1709}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ab1a9a90d5157060841ea3c246f5f95fb5c96b87e960bcb28b2392fb45dbc5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::regex::match_all::string (cognitive 18): perry_runtime::regex::match_all::string has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (18 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/perry-runtime/src/regex/match_all.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"0621219f1f295e975ef223a2f8542a2ae00d213b3eea143e18420ed422d757ac"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::set::jsvalue_eq (cognitive 18): perry_runtime::set::jsvalue_eq has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 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/perry-runtime/src/set.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"861350244c16b4e3183717e8fd5b864c38d119dca0b01df995b3f26104931cec"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::append::js_string_append (cognitive 18): perry_runtime::string::append::js_string_append has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (15 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/perry-runtime/src/string/append.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c35e68dafa7d5b08d74eee744fa5856d1606ed041cec1f440b5c20cd0875ea"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::format::spec_to_fixed (cognitive 18): perry_runtime::string::format::spec_to_fixed has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 5 (7 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/perry-runtime/src/string/format.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bdb889d2ba05c2b1f962cc137fd0f4067d0f2d9a1182d682f966543043c1f2c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::slice_ops::js_string_to_upper_case_index_of (cognitive 18): perry_runtime::string::slice_ops::js_string_to_upper_case_index_of has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 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/perry-runtime/src/string/slice_ops.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f31fd679ae92393818c4f2c53135f8d89a99c29295db1dc02406706951c4b10"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::tui::ffi::js_perry_tui_table (cognitive 18): perry_runtime::tui::ffi::js_perry_tui_table has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (7 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/perry-runtime/src/tui/ffi.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c4f57f7e65851e06a5802c9777db8754a0407ae5abe2a0df600a493a251b93"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::tui::hooks::release_tui_hook_slots_in_freed_ranges (cognitive 18): perry_runtime::tui::hooks::release_tui_hook_slots_in_freed_ranges has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), 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/perry-runtime/src/tui/hooks.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99dda81378890e91652dd03cd06d3c84adf4579b62c1cc5df50d57e82b1217e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::typedarray::construct::js_typed_array_new_from_array (cognitive 18): perry_runtime::typedarray::construct::js_typed_array_new_from_array has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, loops 2 (4 pts), boolean chains 3, match/switch 1 (2 pts) (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/perry-runtime/src/typedarray/construct.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe22251eb192b823e0a059a258b1d68b7722f428486da835335e29bcae0527fa"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::url::parse::is_valid_url_authority (cognitive 18): perry_runtime::url::parse::is_valid_url_authority has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 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/perry-runtime/src/url/parse.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d0949289f6144c5337ff2624cb0d7162a7d4dcb32156493f40bebef030d46f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::util_promisify::outer_thunk (cognitive 18): perry_runtime::util_promisify::outer_thunk has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), loops 2 (3 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. This shape REPEATS in the file: one other method here (perry_runtime::util_promisify::gkp_outer_thunk) 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/perry-runtime/src/util_promisify.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"3340179163e93ab41a1b40d2deb2e0fe97dbe2c877d65275a60e1003cb1bd40f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::util_promisify::gkp_outer_thunk (cognitive 18): perry_runtime::util_promisify::gkp_outer_thunk has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), loops 2 (3 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. This shape REPEATS in the file: one other method here (perry_runtime::util_promisify::outer_thunk) 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/perry-runtime/src/util_promisify.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2c065dca72ab13b2ca88d20250187e0e33cc0076458c91b4257d00d4ad49fb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::validators::received::received_native_prototype_shape (cognitive 18): perry_runtime::validators::received::received_native_prototype_shape has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (2 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/perry-runtime/src/validators/received.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b667e8474bee2f69bb1d4daa92b8673d6ed3b8a37a8ba41ca988a6f6461d146"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::weakref::js_weakmap_init_iterable (cognitive 18): perry_runtime::weakref::js_weakmap_init_iterable has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (5 pts), match/switch 1 (nesting depth added 8). Of this number, 12 points are the body\u0027s own statements and 6 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/perry-runtime/src/weakref.rs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"7054ca80de7f9929d838d1bb1f8e2eb8cf661f777adc4e6d4f8cf1a104f4a84c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::ethers::keccak256::keccak_f (cognitive 18): perry_stdlib::ethers::keccak256::keccak_f has cognitive complexity 18 (threshold 15). Drivers by points: loops 8 (18 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/perry-stdlib/src/ethers.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"7248d3d33c109acbb6975429ef9c3af87e99afba668418e8869abf944b3d696c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::fetch_blob::append_blob_parts (cognitive 18): perry_stdlib::fetch_blob::append_blob_parts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 1 (5 pts), boolean chains 2 (nesting depth added 10). 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/perry-stdlib/src/fetch_blob.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9009aea054bea557aff3b3cb13769fb352b3b3ebdd4361ff84686b2a714247b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::readline::scan_readline_roots_mut (cognitive 18): perry_stdlib::readline::scan_readline_roots_mut has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 4 (6 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/perry-stdlib/src/readline/mod.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53bbe5c6c65004be14ffe6cd7337be0a3aae941d5ae72532d902cfb0480d397"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::turnloop_client::drain_pending (cognitive 18): perry_stdlib::turnloop_client::drain_pending has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/turnloop_client/mod.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a51752983c199a08867d91a3e66d3f0184a12cf49b9ccf9065fb5fb58fd1392"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::turnloop_client::exchange::resume (cognitive 18): perry_stdlib::turnloop_client::exchange::resume has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 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/perry-stdlib/src/turnloop_client/exchange.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"3051d694df8ca874db2fadda014dfb9a170b8cb4bdddb2ce00c69f148d652326"}},{"ruleId":"D2","level":"warning","message":{"text":"TlsSession::pump (cognitive 18): TlsSession::pump has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (5 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-tls-session/src/session.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db3042bf64ebc5dd5bdc81d1637f8d9b73afeeb0646da125d6637e7f2cc4a92"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::aggregate_scalar::merge_nested_breaks_follow_assignment (cognitive 18): perry_transform::aggregate_scalar::merge_nested_breaks_follow_assignment has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/aggregate_scalar.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e16573989eaeba9776ca3ec30b6a1a766a43ec513bdeaa554158f2305fdb8b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::async_generator_return::await_returned_operands (cognitive 18): perry_transform::async_generator_return::await_returned_operands has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (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/perry-transform/src/async_generator_return.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3344d1312d5b62c00f451da16e29d7e1fe3be52613c2b3e8fff60782c62b9893"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::crypto_hash_chain::allowed_refs (cognitive 18): perry_transform::crypto_hash_chain::allowed_refs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/crypto_hash_chain.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7d9b3f1d03e8fa3d9af158fdd4f628320808e7616a7610e78640d54ec6855a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::break_continue::collect_vars_recursive (cognitive 18): perry_transform::generator::break_continue::collect_vars_recursive has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (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/perry-transform/src/generator/break_continue.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"104445c64ea43ca1cbc917dceb292f5d6d14a0fe5ee30f0f07e2e6c14c8d093c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::break_continue::prefix_loop_continues (cognitive 18): perry_transform::generator::break_continue::prefix_loop_continues has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (7 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/perry-transform/src/generator/break_continue.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf70a8c07d35a7055b8b49b8abfe96bbb02a9ac21f09e2126ea0c6b565e9eb8c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::lower::wrap_iter_result_returns_in_async_step_done (cognitive 18): perry_transform::generator::lower::wrap_iter_result_returns_in_async_step_done has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (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/perry-transform/src/generator/lower.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8e6dde9c9d9fc534fdd4e8e2557bde1c724f6902c09763de6c63d514c3eae5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::lower::abrupt::build_abrupt_routing (cognitive 18): perry_transform::generator::lower::abrupt::build_abrupt_routing has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/generator/lower/abrupt.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"778b813f6ab312b01419111051ab7ddced0cc6154cdde7545bfdfc76c61d6a62"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::lower::fixed_state::collect_box_prealloc_ids (cognitive 18): perry_transform::generator::lower::fixed_state::collect_box_prealloc_ids has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (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/perry-transform/src/generator/lower/fixed_state.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2d33255d5f06ec06cf94ab9cba80d696ea6f9cf64322b8de71dcf708dd8c7f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::exact_receivers::collect_module_prototype_facts::visit_stmt (cognitive 18): perry_transform::inline::exact_receivers::collect_module_prototype_facts::visit_stmt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (2 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. This shape REPEATS in the file: one other method here (perry_transform::inline::exact_receivers::collect_module_prototype_facts) 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/perry-transform/src/inline/exact_receivers.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6c2ae5c0ccffba7c7f0ce56739642c97747566bdf792a36031e59402bb601e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::exact_receivers::collect_module_prototype_facts (cognitive 18): perry_transform::inline::exact_receivers::collect_module_prototype_facts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 8 (12 pts), match/switch 3, 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. This shape REPEATS in the file: one other method here (perry_transform::inline::exact_receivers::collect_module_prototype_facts::visit_stmt) 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/perry-transform/src/inline/exact_receivers.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60b3238f3b7a11e54ace9fdf6334f71f7401858d5c2b8858ebcaf927d829ccc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::extern_imports::extern_func_ref_names (cognitive 18): perry_transform::inline::extern_imports::extern_func_ref_names has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 5 (8 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/perry-transform/src/inline/extern_imports.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceabbf9b1952f7d7dd01fb867558397405b5ecc01bc6efcc4ae125ace9b48677"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::extern_imports::visit_stmt (cognitive 18): perry_transform::inline::extern_imports::visit_stmt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (2 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/perry-transform/src/inline/extern_imports.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0f8a1535987e3313c07cae5e68d711b87344fb51ae6663e3ba7d0ec204b9be"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::regex_projection::block (cognitive 18): perry_transform::regex_projection::block has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/regex_projection.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04524060b8ef2158836a67baa84f9b1f16fc28c425f173c8d8780ddd431ed4c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_android::widgets::attributed_text::append (cognitive 18): perry_ui_android::widgets::attributed_text::append has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 2, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-android/src/widgets/attributed_text.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2616e8a65a46bdd70e00556fe118d876e6514c3f23eb2b82d5022bc03b2edd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_android::ws::io_thread (cognitive 18): perry_ui_android::ws::io_thread has cognitive complexity 18 (threshold 15). Drivers by points: loops 3 (6 pts), match/switch 2 (6 pts), if/else 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/perry-ui-android/src/ws.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f734b024e6514905a0b18c61f19ad4913dc8c126dd420fe3f3fc01978c638de"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_gtk4::media_playback::poll_tick (cognitive 18): perry_ui_gtk4::media_playback::poll_tick has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-gtk4/src/media_playback.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e5906addec1d5881c235ce24c0e207c8de06227b3a63230a34015e5d21da6f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_gtk4::widgets::command_palette::refresh_filter (cognitive 18): perry_ui_gtk4::widgets::command_palette::refresh_filter has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (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/perry-ui-gtk4/src/widgets/command_palette.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"297a299220311ceaef8f91d83559134ba539c09387c6f41db83eae41b7ebed90"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_ios::media_playback::poll_tick (cognitive 18): perry_ui_ios::media_playback::poll_tick has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-ios/src/media_playback.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c17df44e4c06fc0cf5479552983edb14edf5e60c315b2a94fa644f6e03c161"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_macos::drag_drop::start_drag (cognitive 18): perry_ui_macos::drag_drop::start_drag has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (18 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/perry-ui-macos/src/drag_drop.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e65ac04549557f0baf32aa3e58d4add8591c6b949384ade2961e3055b4d7c3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_macos::media_playback::poll_tick (cognitive 18): perry_ui_macos::media_playback::poll_tick has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-macos/src/media_playback.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65371d75730fc157b7b290681edc3291a0e1537a06564519e4593b5a1e0f962"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_macos::widgets::collect_subtree_handles (cognitive 18): perry_ui_macos::widgets::collect_subtree_handles has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-macos/src/widgets/mod.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"743e0710b486437fefc4c4e143244cd41a67052a182173a3f457279035e86b0f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_tvos::media_playback::poll_tick (cognitive 18): perry_ui_tvos::media_playback::poll_tick has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-tvos/src/media_playback.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd257c7d80ea2a21c464c348273e1d1646480d3b962e32172ea5417812b91cf5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_visionos::media_playback::poll_tick (cognitive 18): perry_ui_visionos::media_playback::poll_tick has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-visionos/src/media_playback.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"50cb04a68b2569f5191accd9c04c1ce7aa6c1399c8e617129ab1058c0a12e21c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_watchos::media_playback::poll_tick (cognitive 18): perry_ui_watchos::media_playback::poll_tick has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-watchos/src/media_playback.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad407b0b6f3a7e781f82024f08dc9692ad6e83bcf1821357dfb1a2ae4b9cc41"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::published_receivers (cognitive 18): Gen::published_receivers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (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/perry-wpfacts/src/gen/class_values.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef51777b7e80a04e6a0b71480c9d522a66a5cf33e579b5a04d6ff72377150aa"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::published_args (cognitive 18): Gen::published_args has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (3 pts), match/switch 1 (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/perry-wpfacts/src/gen/class_values.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3f03044432173404d21a10b657e87520fe40bf62c35d9f86d88c11ebb0f5c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::ret_through_key (cognitive 18): Gen::ret_through_key has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (11 pts), loops 3 (6 pts), if/else 1 (nesting depth added 10). 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/perry-wpfacts/src/gen/import_values.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf80994e71bd36a2cfe478dbfa3b5b931a14663cde9fe3b632d35554ed2308f"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::dump_meta (cognitive 18): Model::dump_meta has cognitive complexity 18 (threshold 15). Drivers by points: loops 9, match/switch 3 (6 pts), if/else 3 (nesting depth added 3). 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/perry-wpfacts/src/model/operations.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85e4f2fe95a7fc670429e25f6ab7f188154dc4c30bb2fc77a523d06fe4789a3"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::escape_inner (cognitive 18): Model::escape_inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (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/perry-wpfacts/src/solve/call_and_construct.rs"},"region":{"startLine":1529}}}],"partialFingerprints":{"codehealthFindingId/v1":"338eca11b97aa38d13523e09c9211a0f27c8d3c016d65655f69d0b920a028163"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::rooted::collect_lets (cognitive 18): perry_wpfacts::rooted::collect_lets has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (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/perry-wpfacts/src/rooted.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e674d02c5462a35a93319d32486d7ca21ff8f91c4fb88da01e77048a799b9db"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_ethers::keccak256::keccak_f (cognitive 18): perry_ext_ethers::keccak256::keccak_f has cognitive complexity 18 (threshold 15). Drivers by points: loops 8 (18 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/perry-ext-ethers/src/lib.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1657b8f7d2cd7aa573cdc3833e18af377aeb117537b84d8edb5617d3556ff4b"}},{"ruleId":"D2","level":"warning","message":{"text":"check_npm_publish_freshness.evaluate_package (cognitive 18): check_npm_publish_freshness.evaluate_package has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, error handling 2 (3 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":"scripts/check_npm_publish_freshness.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b14fb079e47e5e2afe09cd4073fbb867c9cb2cc455df8ab85ec816045768d9"}},{"ruleId":"D2","level":"warning","message":{"text":"repsel_census.render_consumption_report (cognitive 18): repsel_census.render_consumption_report has cognitive complexity 18 (threshold 15). Drivers by points: loops 7 (10 pts), if/else 4 (6 pts), ternaries 1 (2 pts) (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/compiler_output_harness/repsel_census.py"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"db44eeda44d4a9ba4a831172f837c389583ee64e3166be0975793799bd4fc94f"}},{"ruleId":"D2","level":"warning","message":{"text":"component_async_guest_resources_acceptance.main (cognitive 18): component_async_guest_resources_acceptance.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4, boolean chains 2, error handling 1 (2 pts), ternaries 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":"scripts/component_async_guest_resources_acceptance.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c058958c96614bf67b7ab9c34184289c32a4fd1b7afa5ab09da2fd560185399"}},{"ruleId":"D2","level":"warning","message":{"text":"constfn_executable_gates.isolated_refusal_routes (cognitive 18): constfn_executable_gates.isolated_refusal_routes has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (9 pts), boolean chains 4, if/else 3 (4 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":"scripts/constfn_executable_gates.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a114e3c9bd357c5181f6de3abaf632aee4b4c6a0faf9e09142e3aa7a5a6736"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.heap_value_origins (cognitive 18): gc_root_dominance_check.heap_value_origins has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":3685}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f01cc85787f975baec5a47cdd8ccd7d8a3fd0de66a694e724eccd536335789"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_runtime_root_holders.function_bodies (cognitive 18): gc_runtime_root_holders.function_bodies 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":"scripts/gc_runtime_root_holders.py"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"8034143e56eef2b6ed0961ab1b9308023edf6a7f013a8dd83ac6d1dd2a7ba29c"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_runtime_root_holders.type_can_hold_js_value (cognitive 18): gc_runtime_root_holders.type_can_hold_js_value has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 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":"scripts/gc_runtime_root_holders.py"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06cbb9f14c112e5c636c1e3e97570dfbc2e51da20ad30206291ff6a266f43ad"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_store_site_inventory.helper_reaches_ground (cognitive 18): gc_store_site_inventory.helper_reaches_ground has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (11 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":"scripts/gc_store_site_inventory.py"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"134d1283b2d8877b4ec21bf955d42f01bdce375d7593e1fbe122643f413d0c6a"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_store_site_inventory.main (cognitive 18): gc_store_site_inventory.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 4 (7 pts), boolean chains 1, ternaries 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":"scripts/gc_store_site_inventory.py"},"region":{"startLine":1929}}}],"partialFingerprints":{"codehealthFindingId/v1":"41af3d7381cf99aac2d057cb6dda4c626076d2fb886197a74f325989e575c336"}},{"ruleId":"D2","level":"warning","message":{"text":"gen_parity_gaps.parse_inventory (cognitive 18): gen_parity_gaps.parse_inventory 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":"scripts/gen_parity_gaps.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a469347f4960e12c8e52d0eabcf662591c9e4ae4ed9a05fcbbc1d06b923e2e"}},{"ruleId":"D2","level":"warning","message":{"text":"native_handle_ledger.self_test (cognitive 18): native_handle_ledger.self_test has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2, loops 2 (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":"scripts/native_handle_ledger.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddff4d37a7e663392b2bd4c681d17097effb3f8dac0a851e14222d1aff1e5dc"}},{"ruleId":"D2","level":"warning","message":{"text":"native_handle_ledger.main (cognitive 18): native_handle_ledger.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2 (6 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":"scripts/native_handle_ledger.py"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20ef474fd264dcdcb0fd7318d10fa731ae3d64020fedd41b5270c4118727bfd"}},{"ruleId":"D2","level":"warning","message":{"text":"node_core_subset.merge_reports (cognitive 18): node_core_subset.merge_reports has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 3 (5 pts), boolean chains 3, error handling 1 (2 pts), ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/node_core_subset.py"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c589596634772495de02cdbd617f62fb1c37d8010d9bd1ea56956377118cd1"}},{"ruleId":"D2","level":"warning","message":{"text":"package_bench_attr.rank_buckets (cognitive 18): package_bench_attr.rank_buckets has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 3 (5 pts), loops 4, boolean chains 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":"scripts/package_bench_attr.py"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b82c15d9be632c26fa699871a9a47ff0a840b63712f7ac53388ba5fe020e52f"}},{"ruleId":"D2","level":"warning","message":{"text":"perf_missread_lane.compare (cognitive 18): perf_missread_lane.compare has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (9 pts), loops 3 (6 pts), if/else 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":"scripts/perf_missread_lane.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3a688ee9434aefc779af23fdf2f122ab4d3ccea9f278b30dc3d116baca191a"}},{"ruleId":"D2","level":"warning","message":{"text":"perf_tscwall_lane.compile_set (cognitive 18): perf_tscwall_lane.compile_set has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (8 pts), if/else 2 (6 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":"scripts/perf_tscwall_lane.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff3342e8af4aa743fabbde54846c39bbe4c59b134ef010e548690056fcedddf"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime_abi_check.split_top (cognitive 18): runtime_abi_check.split_top 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":"scripts/runtime_abi_check.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd48faa62e03b515ea2e7beaf1f8cfe8896d0243539f254e5fbc7434c7caddc4"}},{"ruleId":"D2","level":"warning","message":{"text":"sso_unbox_inventory.collect_inventory (cognitive 18): sso_unbox_inventory.collect_inventory has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (13 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":"scripts/sso_unbox_inventory.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8266065d45301afb606be2e3c1c4d3feb8706b23ccd0b381a45c794dedf229"}},{"ruleId":"D2","level":"warning","message":{"text":"tokio_inventory.check (cognitive 18): tokio_inventory.check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (6 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":"scripts/tokio_inventory.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae03d1ebbc7bfb228ddaf6f266d79d3d6748172ad1059ef6b92507ece622412"}},{"ruleId":"D2","level":"warning","message":{"text":"server_ab.finish_sample (cognitive 18): server_ab.finish_sample has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 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":"scripts/turnloop/server_ab.py"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"881d7f17480934e572f4c75ea81b65b11fdec325e9671293bffd2ee93909b329"}},{"ruleId":"D2","level":"warning","message":{"text":"server_ab.main (cognitive 18): server_ab.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, 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":"scripts/turnloop/server_ab.py"},"region":{"startLine":1795}}}],"partialFingerprints":{"codehealthFindingId/v1":"af76daa6d77cbc4395e37acd99f636f12879e7a26d9fb0928330f9be471cbb2e"}},{"ruleId":"D2","level":"warning","message":{"text":"wasi_image_selftest.main (cognitive 18): wasi_image_selftest.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, 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":"scripts/wasi_image_selftest.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b15a2107c0eaf6abe8618a550e8ef0dfa897a27a64529fee3434baab7b0aaae"}},{"ruleId":"D2","level":"warning","message":{"text":"web_runtime.hone_editor_set_viewport (cognitive 18): web_runtime.hone_editor_set_viewport has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":2575}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e841ae6d864dccbfa93f3f5a3d6ce274eea5e384cb5de15351ffded05de5851"}},{"ruleId":"D2","level":"warning","message":{"text":"index.serve (cognitive 18): index.serve has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (7 pts), if/else 4 (5 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 6). None of this is in the body itself: all 18 points belong to 3 function literals inside it that branch (lines 57, 96, 83). 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":"packages/hono-perry-server/src/index.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1547183e7f9774fa23e98c4f7e4ce980afb85b0f4e6163ed1135b276e300d37d"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline.verifyPublishedProofs (cognitive 18): pipeline.verifyPublishedProofs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, error handling 1 (2 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":"scripts/publish/pipeline.mts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83462a1f48e41989846fa68beba027f19d3529a9442cc2ad5c80e5b5b13a913"}},{"ruleId":"D2","level":"warning","message":{"text":"BuildCacheProbe::probe (cognitive 17): BuildCacheProbe::probe has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, 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/perry/src/commands/compile/build_cache.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"0daa510b0ef9644469a8c31979216ee61b1391f3b6b4ffb652951263c9c8536d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::bootstrap::apply_i18n_pass (cognitive 17): perry::commands::compile::bootstrap::apply_i18n_pass has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 3 (5 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/bootstrap.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b222e81df06bf3e3ac33d1eceed7d1030f3da962d56e4de83c61655693791b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::build_cache::args_key (cognitive 17): perry::commands::compile::build_cache::args_key has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 2, loops 1 (2 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/build_cache.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf22dad30bc21bfba968239048eb742405a304c51ac38fa7fae1b17ee438941d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::embed::resolve_bunfs_literal_assets (cognitive 17): perry::commands::compile::embed::resolve_bunfs_literal_assets has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), boolean chains 1, 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/perry/src/commands/compile/embed.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"214b36fd1fa12c6be8d8abb47581dce56c1240aee9753b8fd1fa7333d68c4f3a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::library_search::lib_name_variants (cognitive 17): perry::commands::compile::library_search::lib_name_variants has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, 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/perry/src/commands/compile/library_search.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d563a2abcaf8bd01836cf96589f69c84ffbc663bbd8e995a5e87e53e58c389"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::resolve::subpath_imports::resolve_target (cognitive 17): perry::commands::compile::resolve::subpath_imports::resolve_target has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (7 pts), match/switch 3 (6 pts), loops 2 (4 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/perry/src/commands/compile/resolve/subpath_imports.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd0c3b16efea142d4d2a964e67507e7c45791b27372f189d999637636f4eef4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::strip_dedup::rebuild_archive (cognitive 17): perry::commands::compile::strip_dedup::rebuild_archive 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/perry/src/commands/compile/strip_dedup.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5c13de6944d2524205f4b522ae8b41ae855b9c5faae018fe4b5380d8b8c9c6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::targets::find_watchos_swift_runtime (cognitive 17): perry::commands::compile::targets::find_watchos_swift_runtime has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (17 pts) (nesting depth added 9). 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: one other method here (perry::commands::compile::targets::find_visionos_swift_runtime) 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/perry/src/commands/compile/targets.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed91e5d92df8b56eaaf89900f4b57d64e8b83d36cf7052a238d751393f1be439"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::targets::find_visionos_swift_runtime (cognitive 17): perry::commands::compile::targets::find_visionos_swift_runtime has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (17 pts) (nesting depth added 9). 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: one other method here (perry::commands::compile::targets::find_watchos_swift_runtime) 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/perry/src/commands/compile/targets.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"655c1148c9303c5edf50a77daafa257ff35ffa48c7d55f791d1eb97b3efdbf54"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::tiny_program::build_eligibility (cognitive 17): perry::commands::compile::tiny_program::build_eligibility has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (7 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/perry/src/commands/compile/tiny_program/mod.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59057d1ce51f472aa09d41dd08845915877f5998b4c030691e88ed617aea8dc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::update_policy::run_teardown_action (cognitive 17): perry::update_policy::run_teardown_action has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 2 (3 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/perry/src/update_policy.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d0e4667dd88c2f72f9d6f1058dbfe9bcdff3daae755be18b846db22f749b95"}},{"ruleId":"D2","level":"warning","message":{"text":"BirthShape::content_hash (cognitive 17): BirthShape::content_hash has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 5, boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/static_shape_ids.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e10cd475bf36079bba23dfd16f0003aa1d94009e8d4e0cb326e02377af5e454"}},{"ruleId":"D2","level":"warning","message":{"text":"Parents::parent (cognitive 17): Parents::parent has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (6 pts), boolean chains 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/perry-codegen/src/layout_families/parents.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"56faec66ef139fcc201ad9fe069e3eef05e15f99641a2271fe8709ee8687b9c9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::entry_outline::analyze_stmts_outlining (cognitive 17): perry_codegen::codegen::entry_outline::analyze_stmts_outlining has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (7 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/perry-codegen/src/codegen/entry_outline.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f28c33ce5fba42519ef8beea51d12865e95a0e49150d56ea7ac08d7d88b6ad"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::realm_image::emit_layout_key_list (cognitive 17): perry_codegen::codegen::realm_image::emit_layout_key_list has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/realm_image.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"250f93597589cdea5d8ebdf40782ed3c3095557254658175ed88befae4c09ce0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::static_private_class::private_final (cognitive 17): perry_codegen::codegen::static_private_class::private_final has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/static_private_class.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6bc15262e300dbbd90c4d0a1cd281c82f1c7e5c47b99c5188cd04b6a3d5dc2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::typed_abi::typed_i32_closure_rejection_reason_with_types (cognitive 17): perry_codegen::codegen::typed_abi::typed_i32_closure_rejection_reason_with_types has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, loops 2 (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/perry-codegen/src/codegen/typed_abi.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"03988cc72e208187bce0cbf4e64d403292f5d9b9a3c20bd461ac3b685a5560d7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::typed_locals::int32_writer_range (cognitive 17): perry_codegen::collectors::typed_locals::int32_writer_range has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, match/switch 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/typed_locals.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3d2e65ba03e594811da8639019000da6f1ec08a6b66e08aa554081bfe47f23"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::literal_descriptor::lower_enum_image (cognitive 17): perry_codegen::expr::literal_descriptor::lower_enum_image has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 3, boolean chains 1, match/switch 1 (nesting depth added 2). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/literal_descriptor.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"e942e84c8f5fb5ab559e984128285471d3b7aca01301b357c724b36e4f0991e9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::proxy_reflect::put_value_static_property_fast_path (cognitive 17): perry_codegen::expr::proxy_reflect::put_value_static_property_fast_path has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, 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/perry-codegen/src/expr/proxy_reflect.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7399409b6dab40899828291cdb7003d988423bb358af9e7b887a1c61d6bafe"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::v8_interop::try_static_class_name (cognitive 17): perry_codegen::expr::v8_interop::try_static_class_name has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (3 pts), boolean chains 1 (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/perry-codegen/src/expr/v8_interop.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"6000d0854214dae49ac20204e0eb0e8e292e671ec8edf97d2b1a1ab13a079da8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::write_barrier::lower_stream_super_init (cognitive 17): perry_codegen::expr::write_barrier::lower_stream_super_init has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (8 pts), loops 3 (5 pts), if/else 4 (nesting depth added 5). 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/perry-codegen/src/expr/write_barrier.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb425a14d609ac0a1233accca6e5068b687db1f4c75c5c7b4fd4716cd0ad05f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::function::precise_roots::retype_landing_pads_for_statepoints (cognitive 17): perry_codegen::function::precise_roots::retype_landing_pads_for_statepoints has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (4 pts), boolean chains 3, 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/perry-codegen/src/function/precise_roots.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"26071c59d688246501f0a53a85a979ddb967b0a3ccb45874a1c9f66ccc0ab59f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_desc::array_families::birth_layouts (cognitive 17): perry_codegen::layout_desc::array_families::birth_layouts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 6 (8 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/perry-codegen/src/layout_desc/array_families.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b82b4fb79ed2b21e369423a058854137ce0a1e106879e703ab6079d3339a75"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_families::class_bindings (cognitive 17): perry_codegen::layout_families::class_bindings has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), match/switch 2 (3 pts) (nesting depth added 8). Of this number, 14 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":"crates/perry-codegen/src/layout_families.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"1598964975b03c60301bd12a52c73ec27fafd3ad76b7aac65159798681f93283"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::linker::compile_units_to_object (cognitive 17): perry_codegen::linker::compile_units_to_object has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 3 (6 pts), match/switch 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/linker.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9f6db45fc00c33717eab7c4f312e67f5bb43d8c023dd6fae27bccf0b3cb207"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_array_method::emit_array_method_on_values (cognitive 17): perry_codegen::lower_array_method::emit_array_method_on_values has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 2 (3 pts), loops 1 (3 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_array_method.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f95ca98181dd8859654198d4f0a25eecbf386d97b7ee6b92ca238c4c323067"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::new_ctor_args::inline_constructor_param_values_with_class (cognitive 17): perry_codegen::lower_call::new_ctor_args::inline_constructor_param_values_with_class has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 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/perry-codegen/src/lower_call/new_ctor_args.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2159dc92f10983e6453a4a87c0f7a400cc035335657e9295938131aab94452"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::property_get::lower_method_call_chain (cognitive 17): perry_codegen::lower_call::property_get::lower_method_call_chain has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, boolean chains 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/perry-codegen/src/lower_call/property_get.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"4854871092043fb75d5a0df9070a23c99c3d79b6d62a23d53c7d439cc48d2a38"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::property_get::map_set::try_lower_collection_foreach (cognitive 17): perry_codegen::lower_call::property_get::map_set::try_lower_collection_foreach has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 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/perry-codegen/src/lower_call/property_get/map_set.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad318f4aeb7cc544216f8fbe910c101b512f101ebf945ab6d7b4b975699f94fb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::module::linkage::external_decl_for_global (cognitive 17): perry_codegen::module::linkage::external_decl_for_global has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 2 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 5). 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/perry-codegen/src/module/linkage.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4fcc809cf0392e7f210e880baa7160088bb55b464ba2db91148c248d7da0fa0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::native_value::pod::direct_pod_init_fields (cognitive 17): perry_codegen::native_value::pod::direct_pod_init_fields has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/native_value/pod.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae74e76bc8d579baf596426cd48baf87ac36a278d118965d461b0df8d9ee9b4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::scope_env::pass::rewrite_module (cognitive 17): perry_codegen::scope_env::pass::rewrite_module has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 5 (7 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/perry-codegen/src/scope_env/pass.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"7694a143303847c1ff5033229fea7585412f4b22c18e213aa64cb5987cb796ae"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::indexed_owner_loop::static_interval (cognitive 17): perry_codegen::stmt::indexed_owner_loop::static_interval has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/indexed_owner_loop.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e423bb8b8a9f408e14f24a52235a996803a7616a708b337fc4fa8b298d07720"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::wasm32::abi_adapt::adapt_with (cognitive 17): perry_codegen::wasm32::abi_adapt::adapt_with has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/wasm32/abi_adapt.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7fb0d31803aa1ec50f037d5d5655414d9b4276c5371d217c0971b7cac91bfa"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_arkts::widgets::scroll::emit_scrollview (cognitive 17): perry_codegen_arkts::widgets::scroll::emit_scrollview has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 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/perry-codegen-arkts/src/widgets/scroll.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0818ee104f3ddafa0ffa6bad747b3c4abac4637d7c608f56ce29e186452ba568"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_arkts::widgets::tree::build_tree_node (cognitive 17): perry_codegen_arkts::widgets::tree::build_tree_node has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 10). 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/perry-codegen-arkts/src/widgets/tree.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"64134a62ee791a00f51985a769bedef31ac69e6c0023ae8b41e1e1a814adde32"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_container_compose::cli::run (cognitive 17): perry_container_compose::cli::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (7 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-container-compose/src/cli.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9639251ae93ec5ce06530bbf5f9de505a9eec008d9f317e6425ff241573909"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::agent::admit_request_inner (cognitive 17): perry_ext_http::agent::admit_request_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (15 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/perry-ext-http/src/agent.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34595db059f19250bb4fd4e5a19c1cf233097cd4e9fc64a10b830a790bebc88"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::dispatch_ext::http_server_method_dispatch_ext (cognitive 17): perry_ext_http::server::dispatch_ext::http_server_method_dispatch_ext has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7, 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. This shape REPEATS in the file: one other method here (perry_ext_http::server::dispatch_ext::http_server_property_dispatch_ext) 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/perry-ext-http/src/server/dispatch_ext.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"71acabb663b9e71f508cc3ff5828ae35cbecb4c9dd13f30aa1d57a71ef98b16b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::dispatch_ext::http_server_property_dispatch_ext (cognitive 17): perry_ext_http::server::dispatch_ext::http_server_property_dispatch_ext has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7, 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. This shape REPEATS in the file: one other method here (perry_ext_http::server::dispatch_ext::http_server_method_dispatch_ext) 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/perry-ext-http/src/server/dispatch_ext.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff15dcae02c72dd89bdeafeda435dafa116049a0b0b680ddaf47b6abc4d5baa"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::turnloop_h2::conn::on_connect (cognitive 17): perry_ext_http::server::turnloop_h2::conn::on_connect has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1, 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/perry-ext-http/src/server/turnloop_h2/conn.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"09eaf628e649f73af650c7ae6ff7d9305f30276847c0bb09ffb9bc71653dc74f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_net::classes::js_net_socket_address_parse (cognitive 17): perry_ext_net::classes::js_net_socket_address_parse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 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/perry-ext-net/src/classes.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"b103836cd033eff2bc553b80667d4864abe349a14e6798d3f6ffc0c1946a3ded"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_net::payload_io::wrote (cognitive 17): perry_ext_net::payload_io::wrote has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 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/perry-ext-net/src/payload_io.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"5218126ccb1ba5c8204bfa0ebaa71f8386c538196bf0da21d34ab27476eda569"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_ws::js_ws_on (cognitive 17): perry_ext_ws::js_ws_on has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, 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/perry-ext-ws/src/lib.rs"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"850f8b770bfe538272ff9697befd73d316daf7b0b785570ed00f88e9bd871df7"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::pop_block_scope (cognitive 17): LoweringContext::pop_block_scope has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 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/perry-hir/src/lower/context.rs"},"region":{"startLine":1811}}}],"partialFingerprints":{"codehealthFindingId/v1":"55731569e59f71efb4389be27852c0e84239f85c23e316d096d03bf390c5a493"}},{"ruleId":"D2","level":"warning","message":{"text":"Scan::visit_member_expr (cognitive 17): Scan::visit_member_expr has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, 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/perry-hir/src/lower/pre_scan/function_ctor_reach.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c28bb35f586c447c65351f09c6220db12133fac19dbde262df696789afdf75d"}},{"ruleId":"D2","level":"warning","message":{"text":"CensusScanner::visit_call_expr (cognitive 17): CensusScanner::visit_call_expr has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 5 (8 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/perry-hir/src/proto_census.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8c767bf12e2e53f191600a488059a2a1e353f4d569f297fe35ce00d47d4442"}},{"ruleId":"D2","level":"warning","message":{"text":"RequireAliases::visit_var_decl (cognitive 17): RequireAliases::visit_var_decl has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (13 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 10). 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/perry-hir/src/realm_reach.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5005ebdf35db934f72377d712e15f087bfd855c010d1ce4fbffe5d298b6322d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::analysis::substitute_lexical_this_in_expr (cognitive 17): perry_hir::analysis::substitute_lexical_this_in_expr has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/analysis.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e38822edee969b787733438b27cb61c91f46cc29967b0c5dff88d431f90b538"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::egress::url_matches_allowlist (cognitive 17): perry_hir::egress::url_matches_allowlist has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (16 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/perry-hir/src/egress.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9fc465b626a1910349a9979369a3e689186832d99ecfdb512ea29500759228"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::js_transform::local_natives::build_class_field_natives (cognitive 17): perry_hir::js_transform::local_natives::build_class_field_natives 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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ccdcee6e7c46c4ce0138fb41666bb21160c3d0984d9da54ce2602157294f44"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::const_fold_fn::try_eval_function_member_call_fold (cognitive 17): perry_hir::lower::const_fold_fn::try_eval_function_member_call_fold has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, loops 2 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/const_fold_fn.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05f6b46d257fba9ed8c64a7f393079d3e53fa0643b839ad8b9eb1880717ae07"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::intrinsics::apply_call::try_arraylike_receiver_method (cognitive 17): perry_hir::lower::expr_call::intrinsics::apply_call::try_arraylike_receiver_method has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), match/switch 3 (6 pts), loops 2 (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/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a2947f8d408dfea7be0906390ea433ba614cf4504a38e433ca3b803b909dea"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_call::intrinsics::require::try_import_meta_require (cognitive 17): perry_hir::lower::expr_call::intrinsics::require::try_import_meta_require has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, match/switch 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/perry-hir/src/lower/expr_call/intrinsics/require.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e04c37f347ca04934cdab44960d895dcb4fa187cd68b08acc0b0238f385592f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::fn_ctor_env::build_fn_ctor_env::collect_fn_decl_kinds (cognitive 17): perry_hir::lower::fn_ctor_env::build_fn_ctor_env::collect_fn_decl_kinds has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 2 (6 pts), boolean chains 1, 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. This shape REPEATS in the file: one other method here (perry_hir::lower::fn_ctor_env::build_fn_ctor_env) 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/perry-hir/src/lower/fn_ctor_env.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"b635650db6d99afbe8756a0472de1dd76f8bd129609ef25216c918fc3320229b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::pre_scan::pre_scan_mixin_functions::try_record_fn (cognitive 17): perry_hir::lower::pre_scan::pre_scan_mixin_functions::try_record_fn has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 7 (9 pts), if/else 5 (6 pts), boolean chains 1, loops 1 (nesting depth added 3). 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/perry-hir/src/lower/pre_scan.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddb40914265fabb2a3a0b5cce7804f16700039a1c79949ca7c6c11d598b66e4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::type_widening::visit_expr (cognitive 17): perry_hir::lower::type_widening::visit_expr has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/type_widening.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f64c7bfde47b8a98c2c2f92c5f2189eccefc20a501bca3f8568c5d209b1681e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::monomorph::defaults::fill_defaults_in_stmt (cognitive 17): perry_hir::monomorph::defaults::fill_defaults_in_stmt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1 (2 pts), 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/perry-hir/src/monomorph/defaults.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25f02a13e5ccdd39674fc854b77c8ad86727fa67b03418afcdb4f424f322ed2"}},{"ruleId":"D2","level":"warning","message":{"text":"WebSocket::connect (cognitive 17): WebSocket::connect has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 3 (5 pts), loops 2 (3 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/perry-http-client/src/ws/mod.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2b754ec054addab95f4b942a3cd4bf7e8c1868ae4dc77a995dc71df02ad4ba"}},{"ruleId":"D2","level":"warning","message":{"text":"ValidPointerSetBuilder::step_arena_walk (cognitive 17): ValidPointerSetBuilder::step_arena_walk has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (16 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/perry-runtime/src/gc/trace.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"906a754074d9f6fb89df1c3d76a3344c808fd1e9ebdc43e70d2aa1d0dd24e4a8"}},{"ruleId":"D2","level":"warning","message":{"text":"Metadata::scan (cognitive 17): Metadata::scan has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 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/perry-runtime/src/regex/perex_literal_bytes.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"530ae409b3fa05d5fc5d579f84fd4879b98b862e803fc8d5622187b8ecda9650"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::descriptor_array (cognitive 17): Writer::descriptor_array has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 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/perry-runtime/src/thread/clone_write.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fec24ee561bde66b0d0b38dab078028c61016e0e638e01db7638777acfd30e9"}},{"ruleId":"D2","level":"warning","message":{"text":"Api::dictionary_trust (cognitive 17): Api::dictionary_trust has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3 (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/perry-runtime/src/tls/roots/macos.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a032d85841ffe1c1df05b23a715ddb73362a27376c8e23b892b75ebed6fe3bb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::arena::old_sweep_quarantine::sweep_fault_handler (cognitive 17): perry_runtime::arena::old_sweep_quarantine::sweep_fault_handler has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (5 pts), 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/perry-runtime/src/arena/old_sweep_quarantine.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"257447a19e81a993bab4ef7a1a5f7cc19b992cd81dc2b28eddb92558790d2db7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::arena::reset::reclaim_dead_survivor_arena_blocks (cognitive 17): perry_runtime::arena::reset::reclaim_dead_survivor_arena_blocks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 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/perry-runtime/src/arena/reset.rs"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"74229a559c2726f5f39e5e4b28a80425f7ed703950dc5f5dcd49e4e2c5f8dee6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::concat_reverse::js_array_reverse_value (cognitive 17): perry_runtime::array::concat_reverse::js_array_reverse_value has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/array/concat_reverse.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"942b006d3b6ad7085a5ec5f03e2e601019595498fa12cff27ba75c8816453610"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::from_concat::js_array_from_value (cognitive 17): perry_runtime::array::from_concat::js_array_from_value has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3 (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/perry-runtime/src/array/from_concat.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5388587f42d138b5824fa5d2b60059f599d6c88ae623e12adaf4fde35a5079"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::from_concat::dense_concat_array_source (cognitive 17): perry_runtime::array::from_concat::dense_concat_array_source has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, loops 1 (2 pts) (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/perry-runtime/src/array/from_concat.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c60b800fadf8bd6eaa75186bcd6c5b6303ff8935e6c7ffa4a67be83ccaec0d0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::generic::proto_chain_contains_real_array (cognitive 17): perry_runtime::array::generic::proto_chain_contains_real_array has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 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/perry-runtime/src/array/generic.rs"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"acab0ec5d887b1f5f1001b03429706019cbbd1b17fb407204ad4f9f8b1393930"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::indexing_keyed::js_array_set_index_or_string (cognitive 17): perry_runtime::array::indexing_keyed::js_array_set_index_or_string has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (15 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/perry-runtime/src/array/indexing_keyed.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"18309a9b13d2eff93efa9eeb78ea53303b4a3d54c1f0974639cdbf39d410baa0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::iter_methods::js_array_forEach (cognitive 17): perry_runtime::array::iter_methods::js_array_forEach has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (3 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/perry-runtime/src/array/iter_methods.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf007f64e0701230ee9fe5eeccb974298d5eec94eb71d7da165239b119908c2b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::iterator::js_async_iterator_to_array (cognitive 17): perry_runtime::array::iterator::js_async_iterator_to_array has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 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/perry-runtime/src/array/iterator.rs"},"region":{"startLine":1647}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a835b3de96ce5ae96e61c5535d9c439b8801abfd4b92c6d818355dea1abba74"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::async_hooks::set_hook_enabled (cognitive 17): perry_runtime::async_hooks::set_hook_enabled has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (17 pts) (nesting depth added 10). 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/perry-runtime/src/async_hooks.rs"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"485a9e07aba302553ffbf367af2faca9c9423f535632530a0746ab1dd52d3386"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::buffer::from::js_buffer_fill_value_range (cognitive 17): perry_runtime::buffer::from::js_buffer_fill_value_range has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, boolean chains 2, loops 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/perry-runtime/src/buffer/from.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08448a009307c127341bc272b1285ae07e23742bc3662670b85d2b1c1afe70e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::bun_compat::wyhash::wyhash (cognitive 17): perry_runtime::bun_compat::wyhash::wyhash has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 6 (8 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/bun_compat/wyhash.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ffd66ff789e2afc116c730d1679de8b1b08bfa93b1f8fded35c5e4e2eba785"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::closure::dispatch::value_call::js_closure_call_apply_with_spread (cognitive 17): perry_runtime::closure::dispatch::value_call::js_closure_call_apply_with_spread has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 2 (4 pts), boolean chains 2 (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/perry-runtime/src/closure/dispatch/value_call.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"22eb1275dbdc9f318e2894fad3bdc62840106e4e71562aba9e7e6d0026a8c54e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::component::context::snapshot_filtered (cognitive 17): perry_runtime::component::context::snapshot_filtered 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/perry-runtime/src/component/context.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"a962ad2b8e09f4d830ab19f49a084fb867004599123eedf209cb9a0de41796c4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::dgram::ops::bind_impl (cognitive 17): perry_runtime::dgram::ops::bind_impl has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 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/perry-runtime/src/dgram/ops.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"603c8f19562e3ad3338a7f934243158e57a9e2ffd01952a1168a975bde250d6b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::dgram::ops::membership_impl (cognitive 17): perry_runtime::dgram::ops::membership_impl has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (15 pts), 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/perry-runtime/src/dgram/ops.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"883af82f896d732f288ef36135c1792e5b2677b9798da26e8cb9fafd6173b1af"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::dyn_eval::expr::eval_object_lit (cognitive 17): perry_runtime::dyn_eval::expr::eval_object_lit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (7 pts), match/switch 2 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/dyn_eval/expr.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d3e440a9b9546d3f9c7ca02590d251c8eb2ffbb787ce1e88ef86049ef01cd8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::eh_walker::find_handler (cognitive 17): perry_runtime::eh_walker::find_handler has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (4 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/perry-runtime/src/eh_walker.rs"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"9548063e5f30ac78427c2343daa52a786ebd3931327156a323ed9c51bded80f6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::eh_walker_trace::gimli_row (cognitive 17): perry_runtime::eh_walker_trace::gimli_row has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 6 (9 pts), if/else 5 (7 pts), boolean chains 1 (nesting depth added 5). 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/perry-runtime/src/eh_walker_trace.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"439458eb3bfb90fc93773cabe457431fe1250a6dfce9ec2dd8b0c35c5cbef5f8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::event_target::js_event_target_dispatch_event (cognitive 17): perry_runtime::event_target::js_event_target_dispatch_event has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (3 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/perry-runtime/src/event_target.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"834d38644191640ed144e4ccc5c361969532a1f5f26ea91a614f4a15f67ae040"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::fs::dir_glob_watch::watch::scan_fs_watcher_roots_mut (cognitive 17): perry_runtime::fs::dir_glob_watch::watch::scan_fs_watcher_roots_mut has cognitive complexity 17 (threshold 15). Drivers by points: loops 8 (15 pts), if/else 1 (2 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/fs/dir_glob_watch/watch.rs"},"region":{"startLine":1904}}}],"partialFingerprints":{"codehealthFindingId/v1":"5672127835a90bbe418a4e1ec344a073650ebd1ad871912a39a5c0138ff70c62"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::barrier::relocate_old_object_dirty_pages (cognitive 17): perry_runtime::gc::barrier::relocate_old_object_dirty_pages has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (3 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/perry-runtime/src/gc/barrier/mod.rs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"057298d0ca2bd05bfaa1213035a5897f594e6ce929a1e8c84b67f99281b28821"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::layout::layout_note_slot_transition (cognitive 17): perry_runtime::gc::layout::layout_note_slot_transition has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5 (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/perry-runtime/src/gc/layout.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b209b29c987e36c90478761dfaaea90ccdf4c5c94fc21e4833ee066cab10bf4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::policy::gc_safepoint_moving_minor (cognitive 17): perry_runtime::gc::policy::gc_safepoint_moving_minor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, match/switch 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/perry-runtime/src/gc/policy.rs"},"region":{"startLine":3871}}}],"partialFingerprints":{"codehealthFindingId/v1":"daba288c415287017e69aa3d56ce4be3aee2355efbbc5b765a33598fda502586"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::root_words::mark_precise_root_in_scope (cognitive 17): perry_runtime::gc::root_words::mark_precise_root_in_scope has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 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/perry-runtime/src/gc/root_words.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04acd37c712b5beb1a7c7accdc26ab36f67312b7ec8b90830511f99dd55ee7e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::roots::visit_shadow_stack_root_slots (cognitive 17): perry_runtime::gc::roots::visit_shadow_stack_root_slots 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/perry-runtime/src/gc/roots.rs"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3777ee4651718754781dc7fc29c69f893ee0cc2fc53cccb502cdc996eb7d2b7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::segmenter::segmenter_containing_thunk (cognitive 17): perry_runtime::intl::segmenter::segmenter_containing_thunk 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/perry-runtime/src/intl/segmenter.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ea92e97d9e2308ac154cae380cd0c6ed6216cc973f4b342a82e45e2f692805"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_stream::proto_methods::build_stream_prototype (cognitive 17): perry_runtime::node_stream::proto_methods::build_stream_prototype has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 2 (3 pts), match/switch 2 (nesting depth added 7). 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/perry-runtime/src/node_stream/proto_methods.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae7c5a5e4172bb90b4a8a64d1a54e5a66a729e9520d71f93ce5a53d6575fe3a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_submodules::scan_node_submodule_singleton_roots_mut (cognitive 17): perry_runtime::node_submodules::scan_node_submodule_singleton_roots_mut has cognitive complexity 17 (threshold 15). Drivers by points: loops 8 (10 pts), if/else 5 (7 pts) (nesting depth added 4). 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/perry-runtime/src/node_submodules/mod.rs"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ab696d5dd3c9838cba8da85e41852c062693d87604b29c95d9ff31739fdd27"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::alloc_basic::object_alloc_with_parent_impl (cognitive 17): perry_runtime::object::alloc_basic::object_alloc_with_parent_impl has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/alloc_basic.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b233ffb52efe0ed4cfb603bc2d5deb6b9720100baf4a94ee33a2018ba8fbd8f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::assert::constructor_name_matches_builtin_error (cognitive 17): perry_runtime::object::assert::constructor_name_matches_builtin_error has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3 (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/perry-runtime/src/object/assert.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67bcff1784b61c76d0adb2ae558caeb484f88c079b4a70de8e9ef3c6a04baf0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::canonical_keys::probe_matching_node (cognitive 17): perry_runtime::object::canonical_keys::probe_matching_node has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (14 pts), boolean chains 2, loops 1 (nesting depth added 10). 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/perry-runtime/src/object/canonical_keys.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4be6a88412ea2bc4b796e074c34dc65acf95a9b16edcea71b32f8a590bb3a2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::decl_prototype_birth::static_parent_matches (cognitive 17): perry_runtime::object::class_registry::decl_prototype_birth::static_parent_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, 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/perry-runtime/src/object/class_registry/decl_prototype_birth.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f22b11301ab3c7a6fb43deab5077696a18e0fd7cc3ef318fd230f41bfc30fe"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::dispatch::call_vtable_method_value (cognitive 17): perry_runtime::object::class_registry::dispatch::call_vtable_method_value has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 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/perry-runtime/src/object/class_registry/dispatch.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8be1132dbc884902529cd39c154c259ecac9c2d180b17578fcb7940a082d2d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::parent_static::nm_static_buffer_proto_chain (cognitive 17): perry_runtime::object::class_registry::parent_static::nm_static_buffer_proto_chain 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/perry-runtime/src/object/class_registry/parent_static.rs"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"049ec6c8abdf2d8d774e8a9deafa66c5ac55e2729e3914fc43355cd34eaee6e1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::parent_static::class_method_slot_owner (cognitive 17): perry_runtime::object::class_registry::parent_static::class_method_slot_owner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/class_registry/parent_static.rs"},"region":{"startLine":1748}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26e26a192b09c9772c7c3696bc5e1ed96f70c48e4f51bdb95d03941ac825e7e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::parent_static::symbol_members::class_symbol_setter_apply (cognitive 17): perry_runtime::object::class_registry::parent_static::symbol_members::class_symbol_setter_apply has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (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/perry-runtime/src/object/class_registry/parent_static/symbol_members.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dc3ed1339a200a5879f44cba2749f5f5ab61b76d058e8211226e3dfd702277"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::class_registry::prototype_objects::evaluated_parent_instance_field (cognitive 17): perry_runtime::object::class_registry::prototype_objects::evaluated_parent_instance_field has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (2 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/perry-runtime/src/object/class_registry/prototype_objects.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"249e9385cc069726597c015db2329fc876f8c833de846b0027fd86e0d7d89357"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::delete_rest::js_object_delete_dynamic (cognitive 17): perry_runtime::object::delete_rest::js_object_delete_dynamic has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (17 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/perry-runtime/src/object/delete_rest.rs"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a2ba55dfda746fd0eb7f382a063e9ffef70ea8d21ee28971f174aedf94e942"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::delete_rest::js_object_rest (cognitive 17): perry_runtime::object::delete_rest::js_object_rest has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2, match/switch 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/perry-runtime/src/object/delete_rest.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd02b94bf80e1530d968d2d5878ca70d0815235f0bee8164a56fbe4a708256e0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::descriptor_state::integrity::mark_all_keys (cognitive 17): perry_runtime::object::descriptor_state::integrity::mark_all_keys has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, match/switch 1 (2 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/perry-runtime/src/object/descriptor_state/integrity.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2c0fd2312fe9bdd78ff79a2660c7dde3ef4a1245c817534cee9b9993e7149d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::enumeration::closure_dynamic_enumerable_props (cognitive 17): perry_runtime::object::field_get_set::enumeration::closure_dynamic_enumerable_props has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), 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/perry-runtime/src/object/field_get_set/enumeration.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b241e16e1bdeab40bc21bf7f2234f6d4d6114a1b76726dfe19abf4be764780"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::ic_miss::class_field_chain::try_define (cognitive 17): perry_runtime::object::field_get_set::ic_miss::class_field_chain::try_define has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 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/perry-runtime/src/object/field_get_set/ic_miss/class_field_chain.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec502207bceb33d59822b82fa91ec3bdfe7e559caebed70ef6270e5064fd7f3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::global_this::array_error::function_apply_args (cognitive 17): perry_runtime::object::global_this::array_error::function_apply_args has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, 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/perry-runtime/src/object/global_this/array_error.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"2013ad3a1bb34f488752192e0df04e4048a9a6e71fd506d7f0a5b15a3453e81c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::global_this::generator_state::resume_fixed_step (cognitive 17): perry_runtime::object::global_this::generator_state::resume_fixed_step has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, 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/perry-runtime/src/object/global_this/generator_state.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be9be881aa976c35c81b22ae36d3bf00a36b625752e5a7b8e1f7724de6866fe"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::global_this_webassembly::wasm_memory_grow_on (cognitive 17): perry_runtime::object::global_this_webassembly::wasm_memory_grow_on 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":"crates/perry-runtime/src/object/global_this_webassembly.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"8762dc7641a9339e2fd76d6eb4119d3cc3f0b5fa5277a1000a674c75eefc159f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_module::js_native_module_bind_method (cognitive 17): perry_runtime::object::native_module::js_native_module_bind_method has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/native_module.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e04e3a0d41ac23a428b52b1f6fbec64a3387f51d8be53c703d7089939cbb79"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::node_http_prototypes::message_init (cognitive 17): perry_runtime::object::node_http_prototypes::message_init 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/perry-runtime/src/object/node_http_prototypes.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a94a2ef37bca6761a14095c9683f43609c07cd3f56a9dd2ff5610225fc4603d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::object_ops::keys_array::define_append_transition_eligible (cognitive 17): perry_runtime::object::object_ops::keys_array::define_append_transition_eligible has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 3, 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/perry-runtime/src/object/object_ops/keys_array.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"da44bab1166cb1cb361dad2ec11f340221d2eaa581bda0d8b0bc1f5023c3e888"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::object_ops_frozen::js_object_prevent_extensions (cognitive 17): perry_runtime::object::object_ops_frozen::js_object_prevent_extensions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 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/perry-runtime/src/object/object_ops_frozen.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"c566606df48f83ac3c096e2edac67a889eb67f2881c8081c590882e7dedf1491"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::own_override::js_receiver_may_own_named_method (cognitive 17): perry_runtime::object::own_override::js_receiver_may_own_named_method has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 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/perry-runtime/src/object/own_override.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd47a569a0908dd48729d03db748ddd5af8f1a8291b2dbcffe6a4ec743d848d0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::proto_validity::ensure_meta_for_mark (cognitive 17): perry_runtime::object::proto_validity::ensure_meta_for_mark has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3 (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/perry-runtime/src/object/proto_validity.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"959ace63b5e47825498b8af6bdeb6516417f90be9162c64daa3a51890220c586"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::shape_store::chain_blocks (cognitive 17): perry_runtime::object::shape_store::chain_blocks 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/perry-runtime/src/object/shape_store.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"95aafc36a0cfab89a46e67c1ee8ead41e18f76a575377ab27d3ca6819044726f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::shapes_last_key_rollback::note_last_key_parent (cognitive 17): perry_runtime::object::shapes_last_key_rollback::note_last_key_parent has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, loops 1 (2 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/perry-runtime/src/object/shapes_last_key_rollback.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0ebed9b78dd42d514c3ac8ca6805cbb50095bb2e4d78bf6e68e92bbcb5aa84"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::process::attributes::parse_umask_mask (cognitive 17): perry_runtime::process::attributes::parse_umask_mask has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, 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/perry-runtime/src/process/attributes.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78f0c9ba3e11057381589f28668c0cf7c72b69935867a9bf930b379be5db5c2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::readline_helpers::split_keypress_chunks (cognitive 17): perry_runtime::readline_helpers::split_keypress_chunks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (4 pts), boolean chains 2, 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/perry-runtime/src/readline_helpers.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4a1d172858e9d12d5d3d58208de1256c014f0b7a4077f35be3772e041dee3e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::set::js_set_clear (cognitive 17): perry_runtime::set::js_set_clear has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 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/perry-runtime/src/set.rs"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"591766ad56dee38ffd334a3064c6c27eda6d5931cef425444d1ee8adfb55b202"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::set::set_init_iterable (cognitive 17): perry_runtime::set::set_init_iterable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (5 pts), 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/perry-runtime/src/set.rs"},"region":{"startLine":1793}}}],"partialFingerprints":{"codehealthFindingId/v1":"4804cf50687ac9c4fd109a90e394a392b75fece585282f8a499f9741f435386b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::split::js_string_to_upper_case_split_part_utf16_length (cognitive 17): perry_runtime::string::split::js_string_to_upper_case_split_part_utf16_length has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), 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/perry-runtime/src/string/split.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9028e9847ff202abd70b7bbc61538fd54453cf31a04267b03b7d3271826d79"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::symbol::get::class_iterator_prototype_override (cognitive 17): perry_runtime::symbol::get::class_iterator_prototype_override has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), match/switch 1 (2 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/perry-runtime/src/symbol/get.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"003d41395edced89d3682949ec6771a0acab3e2ff96b26d72a50f2bad0ea21de"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::symbol::get::web_stream_symbol_property (cognitive 17): perry_runtime::symbol::get::web_stream_symbol_property has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), 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/perry-runtime/src/symbol/get.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4ad210b31dff9c017ab2fe8d9af0b1284d781a18d51a0df7d13607c8248ba9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::symbol::iterator::js_to_primitive (cognitive 17): perry_runtime::symbol::iterator::js_to_primitive has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (16 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/symbol/iterator.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"12510199b5f7388d88aeb0b93a593bb3653418844ff612a3ae310c7551fd56ab"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::symbol::iterator::get_iterator_from_method (cognitive 17): perry_runtime::symbol::iterator::get_iterator_from_method has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (17 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/perry-runtime/src/symbol/iterator.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a4c6ad480bb8098bf80e1373d74ee9dde6bb91364bae6293a0329af136288c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::typedarray::format::format_typed_value (cognitive 17): perry_runtime::typedarray::format::format_typed_value has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 5). 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/perry-runtime/src/typedarray/format.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f75fe16aae40b22e66764f0130b0f8e5995a8dbd6a4890161b9a48b04b9887"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::url::search_params::url_search_params_dynamic_call (cognitive 17): perry_runtime::url::search_params::url_search_params_dynamic_call has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/url/search_params.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec68b60942591492b38e56713de34bfb6c4a7e91567decb7f8215d0ec395774"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::value::dynamic_arith::js_number_mod (cognitive 17): perry_runtime::value::dynamic_arith::js_number_mod has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 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":"crates/perry-runtime/src/value/dynamic_arith.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df923b7c52dea9f5201b70b148e6bd2ca2422ee4083c3998b30ede225377a87"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::value::to_string_radix::radix_arg_to_number (cognitive 17): perry_runtime::value::to_string_radix::radix_arg_to_number has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14 (17 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/perry-runtime/src/value/to_string_radix.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8abb3fcf21171140904e6eec790668d518a21fa3f33c45502246d627a65f89f5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::wasi::validate_options (cognitive 17): perry_runtime::wasi::validate_options has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 5, loops 1 (2 pts), 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/perry-runtime/src/wasi.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0292dad0fe67929b768004daf4e7f97e469aeb55962278d3aee07028d2c602"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::webassembly::call_captured_wasm_export (cognitive 17): perry_runtime::webassembly::call_captured_wasm_export has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 2, boolean chains 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/perry-runtime/src/webassembly.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6b2ab6765150c5303e15598b817fbb9e1050e4b8a380de94b3b9d205c45097"}},{"ruleId":"D2","level":"warning","message":{"text":"Value::encode (cognitive 17): Value::encode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (5 pts), match/switch 2 (3 pts) (nesting depth added 8). None of this is in the body itself: all 17 points belong to 2 function items inside it that branch (write, quoted). 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/perry-runtime-manifest/src/realm_json.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8628ba3e4163a4c46f1953ae27f3d08f24cb6072af45018a3c1e56a6f6b3fa4f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::crypto::kdf::read_scrypt_options (cognitive 17): perry_stdlib::crypto::kdf::read_scrypt_options has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, boolean chains 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/perry-stdlib/src/crypto/kdf.rs"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b8ea37b4c14dd29ebd6583b766f6308e38895ec17ddb98b136acd65bb4703a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::querystring::js_querystring_parse (cognitive 17): perry_stdlib::querystring::js_querystring_parse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 1 (3 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/perry-stdlib/src/querystring.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"33eaa360efb4ebc5c145677b4116933c23dd70087b79c6a1be8d5b9879b3cce9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::querystring::append_stringify_value (cognitive 17): perry_stdlib::querystring::append_stringify_value has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 1 (4 pts), match/switch 1 (nesting depth added 10). 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/perry-stdlib/src/querystring.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f570dc44e751e7e6ad6b820b14b361b18b3067dd531b9a525246e73ddbbb842"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::readline::stdin_remove_all_op (cognitive 17): perry_stdlib::readline::stdin_remove_all_op has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 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/perry-stdlib/src/readline/mod.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f2f24686ccea7511df519063b6db8f38b11de9227fa4f5decb19a8e5ee6689"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::streams::native::advance_body (cognitive 17): perry_stdlib::streams::native::advance_body has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 1 (3 pts), boolean chains 1, 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/perry-stdlib/src/streams/native.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c033c3b9f2b014d0424cc50c00d6828b719b24d74fdd79a56c319bcfecf194"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::streams::transform::transform_write (cognitive 17): perry_stdlib::streams::transform::transform_write has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 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/perry-stdlib/src/streams/transform.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1173a5ec5b3c85b551075da1f5f46d1705a73a0d7c0c2cfd6f8ce9de533f44"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::string_decoder::write_utf16le (cognitive 17): perry_stdlib::string_decoder::write_utf16le has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 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/perry-stdlib/src/string_decoder.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ab3fb581cc10198653d4830f919ec6d7465fa8880871d050073db71c1440bf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::tls::socket_api::js_tls_socket_set_key_cert (cognitive 17): perry_stdlib::tls::socket_api::js_tls_socket_set_key_cert has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 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/perry-stdlib/src/tls/socket_api.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc0ac0bf4cbd5650ee2240d0c14a89328c55ab4fcbb9e0fd2e78a95ebaf756d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::webcrypto::hmac::argon2_derive (cognitive 17): perry_stdlib::webcrypto::hmac::argon2_derive has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, match/switch 6, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/webcrypto/hmac.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf97e90af5c276b3d8ea9fe81c6f6c6bd3d03995efa5e2476dd3944d9f95902"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::worker_threads::clone::transfer_buffers (cognitive 17): perry_stdlib::worker_threads::clone::transfer_buffers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, 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/perry-stdlib/src/worker_threads/clone.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b04c15763c251de48837ff703fec94735462f284d3b412eafaca25b98d434b3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::crypto_hash_chain::for_each_let (cognitive 17): perry_transform::crypto_hash_chain::for_each_let has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (7 pts), match/switch 1 (nesting depth added 6). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to 3 function items inside it that branch (stmt, stmts, closures_in). 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/perry-transform/src/crypto_hash_chain.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"2053fe8c9d82a1b5b327280af85008c7a690b517274b08cabff10d579f28ab87"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::crypto_hash_chain::cjs_crypto_aliases (cognitive 17): perry_transform::crypto_hash_chain::cjs_crypto_aliases 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/perry-transform/src/crypto_hash_chain.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f46130c9864f5fffa4940a36ec93d2b75729e79346656267d3b2ad0e0d2f58f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::deforest::call_sites::scan_fuse_sites (cognitive 17): perry_transform::deforest::call_sites::scan_fuse_sites 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/perry-transform/src/deforest/call_sites.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94a915d42897fd97b2d780d5bed993e60f7c7493ea1b2d65e12901441b150f9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::hoist_yields::hoist_yields_in_stmt (cognitive 17): perry_transform::generator::hoist_yields::hoist_yields_in_stmt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (4 pts), loops 1 (2 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/perry-transform/src/generator/hoist_yields.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"994892496a8a9a641880c2f4a95498ec4314971f7d4a0875b75b93336fa5f3fe"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::lower::abrupt::build_yield_star_throw_routes (cognitive 17): perry_transform::generator::lower::abrupt::build_yield_star_throw_routes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2, 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/perry-transform/src/generator/lower/abrupt.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c242fdc2d229f7842c5fdf9426ab8aebda720722fd22a02b890dc57baa1c734"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::lower::resume::prepend_executing_clear_before_returns (cognitive 17): perry_transform::generator::lower::resume::prepend_executing_clear_before_returns 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/perry-transform/src/generator/lower/resume.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"5172bc35773a5640add1068a8fb9f98a279bdbf43980d0f850d7a9b6f8b6369e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::rewrite_returns::prepend_done_before_returns (cognitive 17): perry_transform::generator::rewrite_returns::prepend_done_before_returns 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/perry-transform/src/generator/rewrite_returns.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb3689931b53f369cd01fafdb4755f9df496b01d5d825afae659d76438e5e22"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::prop_cse::cse_stmts (cognitive 17): perry_transform::prop_cse::cse_stmts has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 4 (7 pts), boolean chains 1 (nesting depth added 7). 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/perry-transform/src/prop_cse.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf96cdb6f3a8a17d98984d8f1a686581285a72d88c8b7e79d23e73c469d2362d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::prop_cse::rewrite_run (cognitive 17): perry_transform::prop_cse::rewrite_run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (5 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/perry-transform/src/prop_cse.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"343b8fad39c25272679edcd033bde1acf89a9c0af4192110e51ce974185329bd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_android::widgets::set_corner_radius (cognitive 17): perry_ui_android::widgets::set_corner_radius has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (17 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/perry-ui-android/src/widgets/mod.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0bdc5febb1b96d18660cd4212535d1cccc99f104e8313a6f4f7131c8baf2bf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_android::widgets::image_gallery::add_image (cognitive 17): perry_ui_android::widgets::image_gallery::add_image has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1, 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/perry-ui-android/src/widgets/image_gallery.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"605efa1b5a792ee3abbe10e32d5c7938917266f7cc7d8d4c1579139e3740b8c9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_gtk4::camera::sample_color (cognitive 17): perry_ui_gtk4::camera::sample_color has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (14 pts), boolean chains 2, loops 1 (nesting depth added 10). 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/perry-ui-gtk4/src/camera.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58b65f1d00c7206378996b89c4b83d86a62bb61a3d88197cb394f9be1a691cd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_ios::media_playback::set_now_playing (cognitive 17): perry_ui_ios::media_playback::set_now_playing has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 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/perry-ui-ios/src/media_playback.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d2212a155d190f732868a0d903022f2c1177c4742f4df1420a9fff38abad72"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_macos::widgets::button::set_image (cognitive 17): perry_ui_macos::widgets::button::set_image has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 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/perry-ui-macos/src/widgets/button.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a53f262f19118c6d52a00ef385faac6b8653d54fda7da4ad94f12179fab47f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_watchos::audio::start (cognitive 17): perry_ui_watchos::audio::start has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, match/switch 2 (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/perry-ui-watchos/src/audio.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a403504f50b2487f2a12f4e80286b5763b3a4d83d5e417352e3636365bdd47dc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows_winui::app::app_run (cognitive 17): perry_ui_windows_winui::app::app_run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-windows-winui/src/app.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf12efdd7354241d051887bc856e0ad6a7a21c36827f9a854f1bbc25534c82c"}},{"ruleId":"D2","level":"warning","message":{"text":"Frames::poll_next (cognitive 17): Frames::poll_next has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (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/perry-wasi/src/p3/http/body/outgoing.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"939f382e97e97fd31f29231c8f42791b5dd1060508fea983eb5fa545600ff44b"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator::experimental_export (cognitive 17): Generator::experimental_export has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2, 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/perry-wit/src/guest_c/asynchronous.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"8620fec6cc032043305b2e5690d6b733bc4988d07269076b0c238800b1e5c1df"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::note_const_inits (cognitive 17): Gen::note_const_inits has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 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/perry-wpfacts/src/gen/define_keys.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"3638600cff0972058715ae1c1f4c7e3c7717af832d3edfd1ca5301650ae72d00"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::mark_hard (cognitive 17): Model::mark_hard has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (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/perry-wpfacts/src/solve/call_and_construct.rs"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"19eec4b1679f943d4bc0a6ba41dca3dc7d31c7d35768329b28d1304cf32d9e8e"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::edge_impl (cognitive 17): Model::edge_impl has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/solve/copy.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"40806a814f76f93402c09a6699ff9b1d57b0deaec8f2099223137529011cc716"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::accessor_installed (cognitive 17): Model::accessor_installed has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (6 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/perry-wpfacts/src/solve/lookup.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4f3ca7f837f8a6574280caa4784dd11493790722cddbdd70b76fe9fa704e79"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::lib::contracts::nested_layouts (cognitive 17): perry_wpfacts::lib::contracts::nested_layouts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 1 (4 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/lib/contracts.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"14306880fdd484f3103545bed0216bcc20962a4c93fa0f0363d942986d73ba37"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_updater::core::perry_updater_verify_signature_v2 (cognitive 17): perry_updater::core::perry_updater_verify_signature_v2 has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 8 (9 pts), if/else 5 (6 pts), boolean chains 1, loops 1 (nesting depth added 2). 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/perry-updater/src/core.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74fc1b77ab64ee18f438fe4e0102dfb113805efdfd238f63b4e7bac30f83213"}},{"ruleId":"D2","level":"warning","message":{"text":"currentc170-peak-mappings-v28.maps (cognitive 17): currentc170-peak-mappings-v28.maps has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 2 (5 pts), boolean chains 3, 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":"docs/audits/gc-rss-instructions-2026-10-03/currentc170-peak-mappings-v28.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35ddb105ddeb7308257492a215a30f639cd3739b5293425b575476ed1a0ddfa"}},{"ruleId":"D2","level":"warning","message":{"text":"currentc170-peak-mappings-v28r1.maps (cognitive 17): currentc170-peak-mappings-v28r1.maps has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 2 (5 pts), boolean chains 3, 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":"docs/audits/gc-rss-instructions-2026-10-03/currentc170-peak-mappings-v28r1.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d261776cafeb84908e00031fe6d6e2ff0bb00062e6bd03c9ac3567dffe78ff"}},{"ruleId":"D2","level":"warning","message":{"text":"currentc170-peak-mappings-v28r2.maps (cognitive 17): currentc170-peak-mappings-v28r2.maps has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 2 (5 pts), boolean chains 3, 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":"docs/audits/gc-rss-instructions-2026-10-03/currentc170-peak-mappings-v28r2.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f42f51fa46a80100236246778bee7ed251b099a630a61a4ac791a4d6025fe0b"}},{"ruleId":"D2","level":"warning","message":{"text":"buffer_b1_validate.compile_arm (cognitive 17): buffer_b1_validate.compile_arm has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 3 (5 pts), error handling 1 (2 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":"scripts/buffer_b1_validate.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0b53fec6dbc68bf87b21acff0da2c90221bab2b459813fcc53a2c0df430733"}},{"ruleId":"D2","level":"warning","message":{"text":"buffer_b4_validate.compile_arm (cognitive 17): buffer_b4_validate.compile_arm has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 3 (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":"scripts/buffer_b4_validate.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89baca5b7958ba7be8a0dfcdd2b36fce21a08cc58abf27a05b749114e62719b"}},{"ruleId":"D2","level":"warning","message":{"text":"buffer_b4_validate.full_collections (cognitive 17): buffer_b4_validate.full_collections has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 2 (4 pts), ternaries 4, 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":"scripts/buffer_b4_validate.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4562b11a80897124844b2379e4e550592621e5aacedb04c952d9a65140eae69"}},{"ruleId":"D2","level":"warning","message":{"text":"check_gc_env_knobs.self_test (cognitive 17): check_gc_env_knobs.self_test has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14 (15 pts), loops 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check_gc_env_knobs.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"554195d69dd182e5b18094d921342a95ed8abf30607106ce1d4cf69526801f4c"}},{"ruleId":"D2","level":"warning","message":{"text":"check_gc_header_constants.check (cognitive 17): check_gc_header_constants.check has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (5 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":"scripts/check_gc_header_constants.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfad86f877dfd2d125e300992606146821a15c619c8eda55adacd315cbe025c7"}},{"ruleId":"D2","level":"warning","message":{"text":"check_mbx_policy.check (cognitive 17): check_mbx_policy.check has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 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":"scripts/check_mbx_policy.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"998d742e17daa4764e9bbad83074fa9a2c033a08132e6c864594beb461a8ab4c"}},{"ruleId":"D2","level":"warning","message":{"text":"check_readpath3_gaps.main (cognitive 17): check_readpath3_gaps.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 4 (6 pts), ternaries 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check_readpath3_gaps.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7219827b0fcc4ee1be79c349b6fde24376c87f76f732266d9446818b80b4588c"}},{"ruleId":"D2","level":"warning","message":{"text":"check_thread_locals._cfg_value (cognitive 17): check_thread_locals._cfg_value has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 5 (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":"scripts/check_thread_locals.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"98fec5557304867efecd0357c986537f56061c6bfc574b631619fe62cb21ccbb"}},{"ruleId":"D2","level":"warning","message":{"text":"check_thread_locals.cfg_attributes (cognitive 17): check_thread_locals.cfg_attributes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 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":"scripts/check_thread_locals.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"21255a1168b4da68c953f9c41c32007c3a146bfbbf9161c6c4bf401836cacf61"}},{"ruleId":"D2","level":"warning","message":{"text":"analyzers.parse_vectorization_remarks (cognitive 17): analyzers.parse_vectorization_remarks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/compiler_output_harness/analyzers.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1e84359c78b39bd3fb291e8b3911714e5a11d844dbaac19d7c8a7718401105"}},{"ruleId":"D2","level":"warning","message":{"text":"capture.capture_suite (cognitive 17): capture.capture_suite has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (7 pts), if/else 4, boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/compiler_output_harness/capture.py"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"643ab7d4238807d2e43949dace1eaab65e5bddbfa15db575e4657a07eef12b9e"}},{"ruleId":"D2","level":"warning","message":{"text":"repsel_knob_isolation.check_isolation (cognitive 17): repsel_knob_isolation.check_isolation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (4 pts), ternaries 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":"scripts/compiler_output_harness/repsel_knob_isolation.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f704334ec61c8ae7252c18f529e735b3d0db333bc72d3666ba01c5fe3ebafd"}},{"ruleId":"D2","level":"warning","message":{"text":"component_http_acceptance.main (cognitive 17): component_http_acceptance.main has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (8 pts), ternaries 4 (7 pts), if/else 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":"scripts/component_http_acceptance.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"9862ff6fe9447437405bb6a6ce72779209b6e980b4371699626bddf21ac11754"}},{"ruleId":"D2","level":"warning","message":{"text":"Echo.do_POST (cognitive 17): Echo.do_POST has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (6 pts), error handling 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":"scripts/component_http_guest_acceptance.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd18769fe54f3ab6e2d685cb35c37cf5f3dc33ac6dbf43379a0cb86a61b8340"}},{"ruleId":"D2","level":"warning","message":{"text":"gap_snapshot.merge (cognitive 17): gap_snapshot.merge has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (3 pts), ternaries 1 (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":"scripts/gap_snapshot.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"234ff6dcc67676301e231d1eb905de83532bffa373dfabafdb2f3fda921cd34a"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_1090_evidence_report.gc_store_inventory_summary (cognitive 17): gc_1090_evidence_report.gc_store_inventory_summary has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (8 pts), if/else 5 (6 pts), boolean chains 2, 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":"scripts/gc_1090_evidence_report.py"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"288537bc2601f14063ea5d2f4bf476da5292d66a06bce63806dc6f640c579a03"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check.nm_exported_symbols (cognitive 17): gc_root_dominance_check.nm_exported_symbols has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (5 pts), ternaries 2 (5 pts), error handling 1 (3 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0d1d6282fd40423b5d145c73b0a6502dfdc86d639f47135094df0d96fbbf5b"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_snapshot_contracts.snapshot_contract_self_test (cognitive 17): gc_snapshot_contracts.snapshot_contract_self_test has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 4 (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":"scripts/gc_snapshot_contracts.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b556ddc6c921bcabba47cba67046f0b6e7b2ea99a3e64c027f9a14a2e0bbf83"}},{"ruleId":"D2","level":"warning","message":{"text":"node_suite_run.discover (cognitive 17): node_suite_run.discover has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/node_suite_run.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ff8cfa47943d9c8c219ad1adb54a4206afcdce9a6175024abff5c63c082dcd"}},{"ruleId":"D2","level":"warning","message":{"text":"perf_frontier_report.render_markdown (cognitive 17): perf_frontier_report.render_markdown has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 4 (6 pts), loops 2 (3 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":"scripts/perf_frontier_report.py"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"48671d7fd3c55b7f5a50d78052bd552dd38db63687dfaef6f278f54dba054ee2"}},{"ruleId":"D2","level":"warning","message":{"text":"raw_handle_debt.compare_across_base (cognitive 17): raw_handle_debt.compare_across_base has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, loops 2, 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":"scripts/raw_handle_debt.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb5011081b1112a5d3c41349ba1969b995ca2c8308588bee8762daf88136cab"}},{"ruleId":"D2","level":"warning","message":{"text":"realm_manifest_coverage.check (cognitive 17): realm_manifest_coverage.check has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (4 pts), ternaries 1 (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":"scripts/realm_manifest_coverage.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8959ae6e211debe3cbf8cbe29c00a2d11f9bbd9831bf6cebffd61679738f11"}},{"ruleId":"D2","level":"warning","message":{"text":"registry_lifetime_check.allowlist_problems (cognitive 17): registry_lifetime_check.allowlist_problems has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 3, ternaries 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":"scripts/registry_lifetime_check.py"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70ab8f647baddc714cce582c06d8695f0e71b2126729cf4813dbbdd2947ea3c"}},{"ruleId":"D2","level":"warning","message":{"text":"registry_lifetime_check.report (cognitive 17): registry_lifetime_check.report has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (6 pts), if/else 5, boolean chains 3, loops 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":"scripts/registry_lifetime_check.py"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad5d25b827c69c5042a1b425614ec303a68fab69dd9e3e4575f27b43ac57300"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime_abi_check.main (cognitive 17): runtime_abi_check.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 2 (4 pts), ternaries 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":"scripts/runtime_abi_check.py"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d24750cfe5a5c75d929f0c1e9d8772f740af555734e4caff92d70eeb7be270"}},{"ruleId":"D2","level":"warning","message":{"text":"shape_descriptor_census.callsite_multiset (cognitive 17): shape_descriptor_census.callsite_multiset has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (6 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":"scripts/shape_descriptor_census.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"6198599a56c2a989f2c6880611f5347f02f069198b82a1ddbde90bc918447d57"}},{"ruleId":"D2","level":"warning","message":{"text":"PerfStat.resolve (cognitive 17): PerfStat.resolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (17 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":"scripts/turnloop/server_ab.py"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"7347c7fff08e921fd6777a3dfd6f89a581df584f58cd7476e3504d4d08d75677"}},{"ruleId":"D2","level":"warning","message":{"text":"typed-feedback-profile.make_profile (cognitive 17): typed-feedback-profile.make_profile has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (4 pts), boolean chains 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":"scripts/typed-feedback-profile.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9cc7a9d91ff69be5f86eb1c3c1901534376643f2a456d4c89b752c42953671"}},{"ruleId":"D2","level":"warning","message":{"text":"wasi_release.main (cognitive 17): wasi_release.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4 (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":"scripts/wasi_release.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f5e6e6b80d4b7e71e82896143fb8433910651f37aecd344856a7d52efeb9bc"}},{"ruleId":"D2","level":"warning","message":{"text":"wpfacts_oracle.load_static (cognitive 17): wpfacts_oracle.load_static has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wpfacts_oracle.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"690c5bdbca81591b754c081dba4c2afd3644504f4886dadc38f3c55e47d33e29"}},{"ruleId":"D2","level":"warning","message":{"text":"web_runtime._perry_media_wire_session (cognitive 17): web_runtime._perry_media_wire_session has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 7, error handling 1. Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 3450, 3458, 3446, \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":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":3433}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccbb7179674de51fa2354a999cbad4d154296936283acb2bbb8e009d3938980"}},{"ruleId":"D2","level":"warning","message":{"text":"wasm_runtime._perry_media_wire_session (cognitive 17): wasm_runtime._perry_media_wire_session has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 7, error handling 1. Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 3961, 3969, 3957, \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":3944}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3195962342ffb885d1ac1c79344e0e1b0ef0de37f94b1318e05bd9a7bdc228"}},{"ruleId":"D2","level":"warning","message":{"text":"wasm_runtime.perry_audio_set_volume (cognitive 17): wasm_runtime.perry_audio_set_volume has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 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/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4506}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce4d6a2f96f9471a41c6b70a1f752feb45fcf382127459bff44009ea0b1ab5c"}},{"ruleId":"D2","level":"warning","message":{"text":"node_compat_matrix.baselineValidationError (cognitive 17): node_compat_matrix.baselineValidationError has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/node_compat_matrix.mjs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"895e707c9e8402f10cdaeb3d657ccb6f1d3c3a27dda9c0231e87229a4a29f8fb"}},{"ruleId":"D2","level":"warning","message":{"text":"nightly.main (cognitive 17): nightly.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 6, error handling 1 (2 pts), loops 1 (nesting depth added 2). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal 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":"scripts/publish/nightly.mts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba45ef037dc6177b427fd7f0a99ec99832d74f856056ff9f6e986463b5f867b"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline.dispatchPublishWorkflow (cognitive 17): pipeline.dispatchPublishWorkflow has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 4, ternaries 3, error handling 1 (2 pts), loops 1 (nesting depth added 2). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal 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":"scripts/publish/pipeline.mts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2b46e74d91a91720f31c186e917b949ede89a29bfdb19b2e0945559bb47318"}},{"ruleId":"D2","level":"warning","message":{"text":"scan.scanTarball (cognitive 17): scan.scanTarball has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, boolean chains 4, ternaries 2 (3 pts), error handling 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/scan.mts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3567bc742e892e5e866c784cdbac96ef960888a71b3498b73f8cae2900f4306"}},{"ruleId":"D2","level":"warning","message":{"text":"objects-cache.validateObjectsCachePaths (cognitive 17): objects-cache.validateObjectsCachePaths has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, ternaries 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":"upstream/actions/jdx/mr-boxington-action/src/objects-cache.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e751ea4b5d49f49276f361ba2f56ce1c7f535b7bc307a8b13d6b056293a00e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::cjs_wrap::hoist_classes::class_body_references_any (cognitive 16): perry::commands::compile::cjs_wrap::hoist_classes::class_body_references_any has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 3, 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/perry/src/commands/compile/cjs_wrap/hoist_classes.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff36ed79ff5b72572394df2c482e3df996884b99904ff6e200e456bddf10f0ab"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::collect_modules::import_helpers::collect_js_module_imports (cognitive 16): perry::commands::compile::collect_modules::import_helpers::collect_js_module_imports has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 5, 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/perry/src/commands/compile/collect_modules/import_helpers.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9174117f7f0f144aeeab053f1f896805e277051e4d8858a4d379de44e4d5943"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::collect_modules::static_require_transform::collect_create_require_aliases (cognitive 16): perry::commands::compile::collect_modules::static_require_transform::collect_create_require_aliases has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 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/perry/src/commands/compile/collect_modules/static_require_transform.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9526287d3f9b7b059741a07429881bc892a088a10338a9d118c556cf54aa8c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::collect_modules::worker::resolve_candidates (cognitive 16): perry::commands::compile::collect_modules::worker::resolve_candidates has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 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/perry/src/commands/compile/collect_modules/worker.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa73cc3d5650dd71449d24d847290bc049b49b6dfd7c650c04a4b789778b84f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::helpers::print_deferred_eval_notice (cognitive 16): perry::commands::compile::helpers::print_deferred_eval_notice has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, 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/perry/src/commands/compile/helpers.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0eb181b15a8da72b2888f0f00e0edb7a0bec1159d6633c63b665255acf060b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::library_search::find_harmonyos_sdk (cognitive 16): perry::commands::compile::library_search::find_harmonyos_sdk has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (3 pts) (nesting depth added 5). Of this number, 8 points are the body\u0027s own statements and 8 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/perry/src/commands/compile/library_search.rs"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"583b35cb4fb62663ffd967fce01b4963254d8b8fbd38d08fb7697eb6132e397e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::reachability::follow_export_binding (cognitive 16): perry::commands::compile::reachability::follow_export_binding has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2, 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/perry/src/commands/compile/reachability.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d49698f439628833034ee44563ad8ee18d77dba7e9708186ebd22a4a82ed94"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::resolve::package_dir_for_resolved_path (cognitive 16): perry::commands::compile::resolve::package_dir_for_resolved_path has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 1 (nesting depth added 10). 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/perry/src/commands/compile/resolve.rs"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee01c6f4f13b144a5adb9df6037b8d5db1c619809fd6ed2768218a52987aadb1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::compile::resolve::native_library::parse_native_pod_fields (cognitive 16): perry::commands::compile::resolve::native_library::parse_native_pod_fields has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 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/perry/src/commands/compile/resolve/native_library.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d44de80e328feb707bb29dd31a6cf2f03ac71b4a541d3791978b08247ad23e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::native::validate::run (cognitive 16): perry::commands::native::validate::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 2 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/native/validate.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c5fd2eb10c5b9a5297e83bf32bbadca0491238a9b848a9053e7d2d44734a76"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::commands::run::metadata::find_development_provisioning_profile (cognitive 16): perry::commands::run::metadata::find_development_provisioning_profile 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/perry/src/commands/run/metadata.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"267affa79b02c1687ec6ff378947feb8cf4c7e7272e17cb0cebe1fa072c24d7e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry::compat_reports::flush (cognitive 16): perry::compat_reports::flush has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/compat_reports.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"329eb75399276ec9bd42d378a72e45f5e3cdceab4db9f6660c3beec67d96c312"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_audio_miniaudio::drain_pending_callbacks (cognitive 16): perry_audio_miniaudio::drain_pending_callbacks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2, 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/perry-audio-miniaudio/src/lib.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7354c70f4ce1c271aab743f4df816a7494aeacd9fd5b2661dac6a6ae978eceb"}},{"ruleId":"D2","level":"warning","message":{"text":"Build::import_function (cognitive 16): Build::import_function has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/source_need/flow.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f908d7d4fd8faa8c86467b9f72512287fcc8edadec154b54c0dc6e3d7435b1"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayWalk::walk_terminal_array_iteration_guard (cognitive 16): ArrayWalk::walk_terminal_array_iteration_guard has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/ptr_shape_elements.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a8bb12c73d2ff94b89d9fb43e051be58fa795ab66de6db398538a8ebdcdeb6"}},{"ruleId":"D2","level":"warning","message":{"text":"ThisFlowAnalysis::ctor_chain_safe (cognitive 16): ThisFlowAnalysis::ctor_chain_safe has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), 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/perry-codegen/src/collectors/ptr_shape_this_flow.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cf0038982095c628e0b52c00dc80615d5bd164f6b17f26636cf133c78d82ca"}},{"ruleId":"D2","level":"warning","message":{"text":"Rewrite::list (cognitive 16): Rewrite::list has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/scope_env/pass.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"db68ec121acaa86fce4099e99211f5cb9ad13bbbe6e7224fc14eab3c1561aac5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::entry_outline::find_cjs_factory_closure_mut (cognitive 16): perry_codegen::codegen::entry_outline::find_cjs_factory_closure_mut has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/entry_outline.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c9e0fa0c3ffa92022a626e140b8e8eba09343926aa6622523dc23de9fe5d32"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::split_regions::live_across (cognitive 16): perry_codegen::codegen::split_regions::live_across has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 5 (6 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/perry-codegen/src/codegen/split_regions.rs"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"74212f10cb2c371ec42162187ffcb725c6ad9552909f414960e344e0687d19e7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::split_regions::split_closures_in::in_stmt (cognitive 16): perry_codegen::codegen::split_regions::split_closures_in::in_stmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), 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/perry-codegen/src/codegen/split_regions.rs"},"region":{"startLine":1729}}}],"partialFingerprints":{"codehealthFindingId/v1":"195bcbcee9eaf79c76ffbf9a6d3da69eb8a0282434b212c6280add60a5b513d6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::typed_abi::typed_f64_closure_rejection_reason_with_types (cognitive 16): perry_codegen::codegen::typed_abi::typed_f64_closure_rejection_reason_with_types has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 2, loops 2 (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. This shape REPEATS in the file: one other method here (perry_codegen::codegen::typed_abi::typed_i1_closure_rejection_reason_with_types) 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/perry-codegen/src/codegen/typed_abi.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47fe87044f71484add705c175994b4b3e199b55960d3517552d452ad850d176"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::codegen::typed_abi::typed_i1_closure_rejection_reason_with_types (cognitive 16): perry_codegen::codegen::typed_abi::typed_i1_closure_rejection_reason_with_types has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 2, loops 2 (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. This shape REPEATS in the file: one other method here (perry_codegen::codegen::typed_abi::typed_f64_closure_rejection_reason_with_types) 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/perry-codegen/src/codegen/typed_abi.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"75471840b8fa12b88b6b889d775e2c98894e5e546abd07ba2d978f6f526f71ed"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::definite_init::confined (cognitive 16): perry_codegen::collectors::definite_init::confined has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 1 (3 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/perry-codegen/src/collectors/definite_init.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff31f0223bc23b5afe9c2aafcd731d8af2bcfa75d87f60115ec601fa26a8a44b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::escape_arrays::collect_used_array_indices_in_expr (cognitive 16): perry_codegen::collectors::escape_arrays::collect_used_array_indices_in_expr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (16 pts) (nesting depth added 10). 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/perry-codegen/src/collectors/escape_arrays.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0e39bbb033ca58e70e6c481d6d512a996f15760c772fd5aab7ccdf051dd936"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::hir_facts::array_kind_from_initializer (cognitive 16): perry_codegen::collectors::hir_facts::array_kind_from_initializer has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 2 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 5). 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/perry-codegen/src/collectors/hir_facts.rs"},"region":{"startLine":2049}}}],"partialFingerprints":{"codehealthFindingId/v1":"25633ccad035a1bec5d420836a37c9a00235a427dbe14b3bff79126e30003e83"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::hot_callees::walk_stmt (cognitive 16): perry_codegen::collectors::hot_callees::walk_stmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), 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/perry-codegen/src/collectors/hot_callees.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9dc04cc21bd5f597cba62bd104ce62ff0849ca1c330d9464936d902b2e94dde"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::integer_locals::collect_integer_locals_with_seeds (cognitive 16): perry_codegen::collectors::integer_locals::collect_integer_locals_with_seeds has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (6 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/perry-codegen/src/collectors/integer_locals.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e31cb1006769fe1f97b51d30735352d9e87aa3d67fbba2a1f131d9b8f18104"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_report::admission_cause (cognitive 16): perry_codegen::collectors::ptr_shape_report::admission_cause has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, 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/perry-codegen/src/collectors/ptr_shape_report.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd740ee58f297d7e2201b53048975f85d8358b3d12cad8ae779f209377118856"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_returns::for_each_module_closure (cognitive 16): perry_codegen::collectors::ptr_shape_returns::for_each_module_closure has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 5 (8 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/perry-codegen/src/collectors/ptr_shape_returns.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"406fd0f73ef17ac82234280055d8286b0add70afc19803bac0488a37c6f5f8ed"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::ptr_shape_this_flow::chain_this_flow_verdict (cognitive 16): perry_codegen::collectors::ptr_shape_this_flow::chain_this_flow_verdict has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 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/perry-codegen/src/collectors/ptr_shape_this_flow.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"55218fa1ea8b1d6fa430b22bbdb7dd4e2fe2343dc602cd8765dad5d3b1104c78"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::scalar_method_dispatch::for_each_expr_in_stmt (cognitive 16): perry_codegen::collectors::scalar_method_dispatch::for_each_expr_in_stmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), 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/perry-codegen/src/collectors/scalar_method_dispatch.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc7012be09fe8e128633635c8a92714a31c095c9a74a0d630386e43967ede06"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::collectors::suffix_strings::mask_stmt (cognitive 16): perry_codegen::collectors::suffix_strings::mask_stmt has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 4 (6 pts), match/switch 1 (nesting depth added 7). 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/perry-codegen/src/collectors/suffix_strings.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b0fc1482350dfefdfac62f3cb46990711105c2f427e30c82fa13ae2f48739a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::element_shape_loop_fact_for_property_get (cognitive 16): perry_codegen::expr::element_shape_loop_fact_for_property_get has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, 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/perry-codegen/src/expr/mod.rs"},"region":{"startLine":2553}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96860cb74237706ca446ed04c06efa32f64029f59278a6fc50f03df3aa50fd1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::literal_descriptor::try_lower (cognitive 16): perry_codegen::expr::literal_descriptor::try_lower has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 3, loops 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/perry-codegen/src/expr/literal_descriptor.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c59a7737465ceddbdc2a68ea4a518ae60fcccacfe96dda81b855c5afc0ed730"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::expr::ta_element_read::prepare_loop_accesses (cognitive 16): perry_codegen::expr::ta_element_read::prepare_loop_accesses has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 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/perry-codegen/src/expr/ta_element_read.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a795867993e1467c5b0cfeb789782f13db00692f19cb17a32f40b53ed53cf2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::gc_map::encode_stream (cognitive 16): perry_codegen::gc_map::encode_stream has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (7 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/perry-codegen/src/gc_map.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b06c573c96e6b366628ae7fc6f0cc7b9bfb224f740a9f2b404052cd3ba85d3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::layout_desc::create_families::literal (cognitive 16): perry_codegen::layout_desc::create_families::literal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), loops 3 (6 pts), match/switch 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/perry-codegen/src/layout_desc/create_families.rs"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"99615b18978416ad6e3b5644993dce033813acc0941f96dcc931212a091d41d7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::lower_call::inline_birth_invariant::sabotage_controls (cognitive 16): perry_codegen::lower_call::inline_birth_invariant::sabotage_controls has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (4 pts), boolean chains 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/perry-codegen/src/lower_call/inline_birth_invariant.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ebda8758fe5cc32f8048e958cf88d38614e32173df15a268b498f8a1564659"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::if_stmt::try_const_fold_condition (cognitive 16): perry_codegen::stmt::if_stmt::try_const_fold_condition has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 4 (7 pts), boolean chains 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/perry-codegen/src/stmt/if_stmt.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca306d58548b093d67e61a86ec5441009039d388f202cb016fbd906907b127dc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::loops::match_numeric_range_add_loop (cognitive 16): perry_codegen::stmt::loops::match_numeric_range_add_loop has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (7 pts), boolean chains 5, if/else 4 (nesting depth added 1). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"e159f9b39be4b04ce0f8d49f4726c5d76972d6e6be2e3c243791df7569254d59"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::loops::packed_f64_range_loop_compound_alias_fold_all (cognitive 16): perry_codegen::stmt::loops::packed_f64_range_loop_compound_alias_fold_all has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (5 pts), match/switch 3 (5 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 5). Of this number, 12 points are the body\u0027s own statements and 4 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":"crates/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":2236}}}],"partialFingerprints":{"codehealthFindingId/v1":"252c5fd2332f301790a73db569803e541a4a483afcd5a6e73140a4a3db6e254d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::loops::i32_counter::prepare (cognitive 16): perry_codegen::stmt::loops::i32_counter::prepare has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 7. 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/perry-codegen/src/stmt/loops/i32_counter.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6458ca9c1789f43f2f2fd68d2608a4a8891fd68ffa4e1181bb84b8adb117c2f3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::region_loop::lower_loop (cognitive 16): perry_codegen::stmt::region_loop::lower_loop has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/region_loop/mod.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c1c2c89d7109558123fc23f5e4a28b389d36a190137e1bdab1109042a8d67b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::region_loop::bare::try_lower_fact_add_tree (cognitive 16): perry_codegen::stmt::region_loop::bare::try_lower_fact_add_tree has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), loops 2 (nesting depth added 2). Of this number, 13 points are the body\u0027s own statements and 3 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, 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/perry-codegen/src/stmt/region_loop/bare.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"47656ca0f03834796ec5c9902e503214c569a993e30f731f58c99a089a045554"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::region_loop::plan::accesses::e_walk (cognitive 16): perry_codegen::stmt::region_loop::plan::accesses::e_walk has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), 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/perry-codegen/src/stmt/region_loop/plan.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7253475ae929ae8a8fb3ce33c873b7d535bc0939b25f8ba67e322897fabbde7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::stable_packed_typed_array::collect_stmt_uses (cognitive 16): perry_codegen::stmt::stable_packed_typed_array::collect_stmt_uses has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), 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/perry-codegen/src/stmt/stable_packed_typed_array.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a302480a3b16f19fbad834b0964859772b40ef9569780e12860a1ce1cdee837f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::stmt::versioned_indexed_loop::lower (cognitive 16): perry_codegen::stmt::versioned_indexed_loop::lower has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/versioned_indexed_loop.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c478b3806af30eb664131f42cd1649c24e7a51267bbdc5ee44f784bd2628d3a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen::type_analysis::pod::collect_pod_numeric_field_read_locals (cognitive 16): perry_codegen::type_analysis::pod::collect_pod_numeric_field_read_locals has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 2 (4 pts), boolean chains 1, 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/perry-codegen/src/type_analysis/pod.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf3142185fc0186cb208c827ec438ff12108c3386f1c9e6b708ac236f089735"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_arkts::view_builders::collect_view_builders (cognitive 16): perry_codegen_arkts::view_builders::collect_view_builders has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4, 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/perry-codegen-arkts/src/view_builders.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d6c4f78f094f4e3eb86c6cbf12fe329b603c202b71ec78c43ebeb8192c7fc6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_codegen_arkts::view_builders::rewrite_view_builder_calls_in_expr (cognitive 16): perry_codegen_arkts::view_builders::rewrite_view_builder_calls_in_expr has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 3 (5 pts), match/switch 1 (nesting depth added 7). 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/perry-codegen-arkts/src/view_builders.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e74107870cf901bacafe8afe7aef411b9525f21eb2d65bee098e2d8eb6d0fec"}},{"ruleId":"D2","level":"warning","message":{"text":"Host::handle_http_async_with_retirement (cognitive 16): Host::handle_http_async_with_retirement has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), match/switch 4 (5 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/perry-component-host/src/http/p3.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c4912538572e4ec1f38c91ceaf95bd76ccb9b62fbf161f43ee0d229575b408"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_component_io::embedding::submit (cognitive 16): perry_component_io::embedding::submit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (nesting depth added 5). 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/perry-component-io/src/embedding.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"107995452a14b3b8e850a5bf25a0b36bad2a7550ca44cc3c9fb63ee9c4a4eb7c"}},{"ruleId":"D2","level":"warning","message":{"text":"ComposeSpec::merge (cognitive 16): ComposeSpec::merge has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 6 (nesting depth added 4). 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/perry-container-compose/src/types.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e567cbcd67735f681d3d1d30eaef2c4b66084474f93aadda016cb7b98fddae6"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkloadGraphEngine::ps (cognitive 16): WorkloadGraphEngine::ps 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/perry-container-compose/src/workload.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"5813138431cd7c3bfbcf48e7edd34e2967ba5202279679018fdc8309316efe1b"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminalEmitter::emit (cognitive 16): TerminalEmitter::emit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 1 (3 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/perry-diagnostics/src/emitter.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c54ff4ab41a9910862f6ee0187112d59dcec24cf1a6a16fdc38f142fcd64be6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_cheerio::js_cheerio_selection_has_class (cognitive 16): perry_ext_cheerio::js_cheerio_selection_has_class has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 10). 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/perry-ext-cheerio/src/lib.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"843d1d3ac40bd343d22e80c2bfe393038c35b674f5cdb7ee4c8849e8ed718548"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_cheerio::js_cheerio_selection_is (cognitive 16): perry_ext_cheerio::js_cheerio_selection_is has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 1 (4 pts), match/switch 1 (nesting depth added 10). 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/perry-ext-cheerio/src/lib.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bf89e529ecf57dc3341e8c6c769288ca462a9b611f82a77b7984d9582a05e3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::client_request_end_impl (cognitive 16): perry_ext_http::client_request_end_impl 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/perry-ext-http/src/lib.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ee0b52606c8c7794fc38d2b8eeb06e825fd0397af16aa9df069171c62447f7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::client_overload::merge_url_and_options (cognitive 16): perry_ext_http::client_overload::merge_url_and_options has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 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/perry-ext-http/src/client_overload.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf697910814fd54a81166ed419400e007b8f4f48b95727119c482f907c1ecc57"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::client_turnloop::wire::serialize_head (cognitive 16): perry_ext_http::client_turnloop::wire::serialize_head has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, loops 2 (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/perry-ext-http/src/client_turnloop/wire.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"409d06b99e92e0841ab071c3aff5324dc140b49fd3d3a5fd651b2f189ee9448a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::server::turnloop_h2::native_server::sink (cognitive 16): perry_ext_http::server::turnloop_h2::native_server::sink has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 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/perry-ext-http/src/server/turnloop_h2/native_server.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffeee2f5f17e2596c943f276cee14bc0697fac4c54565d921384605ee0065435"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_http::tls_client::live_pfx_entries (cognitive 16): perry_ext_http::tls_client::live_pfx_entries has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 4). Of this number, 12 points are the body\u0027s own statements and 4 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":"crates/perry-ext-http/src/tls_client.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a77617a91fd06a4035ca673d24ae0fb0e3aec430b260bd636396cccd640bba"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_net::bun_tcp::event (cognitive 16): perry_ext_net::bun_tcp::event has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3 (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/perry-ext-net/src/bun_tcp.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"294125c369dfd5c59249238ff1822b0b568cee70e17328da5594ff1fd0ff7c7a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_net::classes::block_list_check_boxed (cognitive 16): perry_ext_net::classes::block_list_check_boxed has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (16 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/perry-ext-net/src/classes.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e644d509d4d77f807e62af18b1e89e37835bbb720f0e00703a4587171cb5fa"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_net::classes::js_net_block_list_from_json (cognitive 16): perry_ext_net::classes::js_net_block_list_from_json has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 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/perry-ext-net/src/classes.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb59c7fea6f0a01c3561567c9fae4e31ce2448655866bcb8725e69c4e41b1787"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_net::payload_server::close (cognitive 16): perry_ext_net::payload_server::close 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/perry-ext-net/src/payload_server.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"03fe55c74ee26d91d367b95a12abf4e9a13a41f134f943a93b0374e9112b9434"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_net::payload_socket::cache_before_release (cognitive 16): perry_ext_net::payload_socket::cache_before_release has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-net/src/payload_socket.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c332eb2b1c22ada0fd29ef245739f61c41e14ffee27706e9485e5f61f931237"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_pdf::serde_json_lite::parse_string (cognitive 16): perry_ext_pdf::serde_json_lite::parse_string has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (10 pts), loops 2 (5 pts), if/else 1 (nesting depth added 10). 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/perry-ext-pdf/src/lib.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a723c4926d5970d3baf051c8ee08bde0642c4a8b65b4877ef3b0abd59465e3d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ext_sharp::js_sharp_trim (cognitive 16): perry_ext_sharp::js_sharp_trim has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (5 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/perry-ext-sharp/src/lib.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"7055f5904abf4406821c33ffeafc715c06f791ff56f582592d9bdaecb634a54c"}},{"ruleId":"D2","level":"warning","message":{"text":"Scan::visit_call_expr (cognitive 16): Scan::visit_call_expr has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 3 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/dynamic_code.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e0736397e59fe06eee74f905c4d62ebab9e9539b3256c8ad6b7f0d24607f5e"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkerPaths::call (cognitive 16): WorkerPaths::call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 3, boolean chains 2, 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/perry-hir/src/dynamic_import/worker_paths.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"9672eff432922326c8c1e8bc5e4113e35e917b45fc984f82d0fffec4634f2a8d"}},{"ruleId":"D2","level":"warning","message":{"text":"Scan::member (cognitive 16): Scan::member has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/realm_reach.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1c2a15c5f3aeb834c0366462991f2b9c6015d50a4216276dce32bbae02d464"}},{"ruleId":"D2","level":"warning","message":{"text":"SolidJsx::child (cognitive 16): SolidJsx::child has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (3 pts), boolean chains 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/perry-hir/src/solid_jsx.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c8fba973b12d517c68e2c844d964f2775f0c1b2d406ef27954df16b11e5bbf"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::analysis::numeric_order::numeric_order_with (cognitive 16): perry_hir::analysis::numeric_order::numeric_order_with has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 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/perry-hir/src/analysis/numeric_order.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2b8ceffe0800f3444a150a0a634d52cdac97f1ec0ef19cb0c9439c512fa54a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::destructuring::helpers::ast_expr_contains_function_expr (cognitive 16): perry_hir::destructuring::helpers::ast_expr_contains_function_expr has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (10 pts), boolean chains 6 (nesting depth added 5). 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/perry-hir/src/destructuring/helpers.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee11580aa13d9c2c0b2896c799d63de51b46c6f0ccacdb0ba3d0b5cafe49dd6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::dynamic_import::resolve_registry_value_union (cognitive 16): perry_hir::dynamic_import::resolve_registry_value_union has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/dynamic_import.rs"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80a08ec15e647cd6b6bf5099b0e8a5265837b498feae18f21cc35524c862045"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::dynamic_import::resolve_static_path_args (cognitive 16): perry_hir::dynamic_import::resolve_static_path_args has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 4 (7 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/perry-hir/src/dynamic_import.rs"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ee848a113c20f5f69cea347417a8d633a04101c21ef200361d4ce999f87dd7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::closure_analysis::widen_mutable_captures_stmt (cognitive 16): perry_hir::lower::closure_analysis::widen_mutable_captures_stmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), 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/perry-hir/src/lower/closure_analysis.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"feee9bed399967accce0867d838c451f22db1de7700dc509a104896695f13ba8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::eval_super_scan::scan_pat (cognitive 16): perry_hir::lower::eval_super_scan::scan_pat has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 2 (4 pts), match/switch 2 (4 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/perry-hir/src/lower/eval_super_scan.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82cc89235b8cf0780b9d8373e444a5a0ad04ec7083a68f080e6331cb93793f1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::expr_function::insert_class_capture_refresh_inside_expressions::visit_stmt (cognitive 16): perry_hir::lower::expr_function::insert_class_capture_refresh_inside_expressions::visit_stmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), 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/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d08e610434be98992959a28920c32a2e6919eaa35e6ba4eae3b36cc115d2b05"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::misc::infer_dynamic_extends_names (cognitive 16): perry_hir::lower::misc::infer_dynamic_extends_names has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/misc.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ff759c37351285b6d25eb3ed761e16ac11cd7ad2af1aa482d712317d36edad"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::shared_mutable_capture::retype_lets_in_stmt (cognitive 16): perry_hir::lower::shared_mutable_capture::retype_lets_in_stmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), 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/perry-hir/src/lower/shared_mutable_capture.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9de9895e6a009a90545facfef109145d787a679765ecc0675b50d0af274a280"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower::stmt::class_expression_declarator::lower_class_expression_declarator (cognitive 16): perry_hir::lower::stmt::class_expression_declarator::lower_class_expression_declarator has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (5 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/stmt/class_expression_declarator.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e6dc9e3774884994b9983ba9a60b329f7e05d52c52913b471d7c356b06f771"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::block::register_block_forward_lexicals (cognitive 16): perry_hir::lower_decl::block::register_block_forward_lexicals has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 2 (6 pts), match/switch 1 (2 pts) (nesting depth added 9). 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/perry-hir/src/lower_decl/block.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da9b4df56a7b02c7f4b5c9de18a61a36ad471dadd56fa36169ee1ec472b3265"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_decl::class_members::lower_setter_method_in_scope (cognitive 16): perry_hir::lower_decl::class_members::lower_setter_method_in_scope has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, 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/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"22eb825d9d6d77d1f9457325cc9d85ca3bef2c82b24af984fd09f1d334a1763f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_hir::lower_patterns::unescape_template (cognitive 16): perry_hir::lower_patterns::unescape_template has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (3 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/perry-hir/src/lower_patterns.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9507df9a0db28cce1054c59fe84ab13827987777d2900a7f4c503901469374fc"}},{"ruleId":"D2","level":"warning","message":{"text":"PageMap::remove_pages (cognitive 16): PageMap::remove_pages has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 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/perry-runtime/src/arena/page_meta/storage.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d98f761817b9d2df020f6b2a2accf408284fd3b2f77a11283e415ff6a62ddc"}},{"ruleId":"D2","level":"warning","message":{"text":"ArenaObjectCursor::next_budgeted (cognitive 16): ArenaObjectCursor::next_budgeted has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 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/perry-runtime/src/arena/walk.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b87c875ab1e8e19249da4b0e0cb97ebeaf2c0a818ef4e783a5f4f01286039cb"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldReprCensus::summary (cognitive 16): FieldReprCensus::summary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 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/perry-runtime/src/gc/census_field_repr.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c0c3cb12c5603c4afafacfd6231bec28e31fce74803bf7aae37258d3fed52b"}},{"ruleId":"D2","level":"warning","message":{"text":"CopyingNurseryCollector::drain (cognitive 16): CopyingNurseryCollector::drain 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":"crates/perry-runtime/src/gc/copying.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f94f8eced6f7548513469286d028d38c1367dc0398ebe2af03a090aa1ae001"}},{"ruleId":"D2","level":"warning","message":{"text":"GcCycleState::atomic_finalize_minor_prelude (cognitive 16): GcCycleState::atomic_finalize_minor_prelude has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 1 (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/perry-runtime/src/gc/cycle.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"256ae3f8f99e8f4795b1be266703dd0ccb31676327fd93b2d57b2b5fc329a7d8"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageList::new (cognitive 16): ImageList::new has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 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/perry-runtime/src/object/image_keys.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"71911addbb89403cf97f90af17611c0f56bf38f4d39897a5200464560dafa781"}},{"ruleId":"D2","level":"warning","message":{"text":"SlotCandidates::next (cognitive 16): SlotCandidates::next has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/shapes_slot_list.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"244dbe5acbcc75e7ccde92ba272ceb44c2ef33b1fc16fdb2b9b2e49ff3190188"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::arena::allocators::arena_alloc_gc_slow (cognitive 16): perry_runtime::arena::allocators::arena_alloc_gc_slow has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/arena/allocators.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43e312514740a602ba57495fecd23188d86d4575a3de9e2e9ed3db6a60cfaba"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::arena::walk::arena_walk_objects_addr_sorted (cognitive 16): perry_runtime::arena::walk::arena_walk_objects_addr_sorted has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (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/perry-runtime/src/arena/walk.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0d0f99932af6a765c0b0f78b29064c01cc37ef290609b82484c83998bb554d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::header_gc_slots::rebuild_array_layout (cognitive 16): perry_runtime::array::header_gc_slots::rebuild_array_layout has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3 (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/perry-runtime/src/array/header_gc_slots.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b3b9a32384a040bf3beefea753f036ea358ab87b5e579c224293fad1a9f762"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::is_array::js_array_is_array (cognitive 16): perry_runtime::array::is_array::js_array_is_array has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, 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/perry-runtime/src/array/is_array.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef28310f9d631705109eade0355dfd503a2a16cace7b8f982b2e20e424076c7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::iter_methods::js_array_some (cognitive 16): perry_runtime::array::iter_methods::js_array_some has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 1 (3 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. This shape REPEATS in the file: one other method here (perry_runtime::array::iter_methods::js_array_every) 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/perry-runtime/src/array/iter_methods.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33de5684eb0ba03d663746750d477afcc34d94ed5a9d95f9e2d0721f8094165"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::iter_methods::js_array_every (cognitive 16): perry_runtime::array::iter_methods::js_array_every has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 1 (3 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. This shape REPEATS in the file: one other method here (perry_runtime::array::iter_methods::js_array_some) 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/perry-runtime/src/array/iter_methods.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"5767c3c17c0607a91ddbafb67a537e009b4153f1b71d88f2cec55c1a2abc4734"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::iterator::js_iterator_to_array_impl (cognitive 16): perry_runtime::array::iterator::js_iterator_to_array_impl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 1, 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/perry-runtime/src/array/iterator.rs"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c83a056b80aaa14e4a1332cad65727cce24ee32f417899b09cadcfd61e86032"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::numeric_range::js_array_fill_range_strided_tagged (cognitive 16): perry_runtime::array::numeric_range::js_array_fill_range_strided_tagged has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 3, loops 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/perry-runtime/src/array/numeric_range.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72a668d4e3b9450282ac7ba517f8874873f5f6c41aab3e858bfd32d05c89f64"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::search::numeric_raw_f64_search (cognitive 16): perry_runtime::array::search::numeric_raw_f64_search has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/array/search.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b341fb7bdb4367437c55acfaec4b93200d9b865a7daedac4b26a86d2444a01b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::array::species::resolve_species (cognitive 16): perry_runtime::array::species::resolve_species has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 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/perry-runtime/src/array/species.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a219f5beaf67e47b0d79cf9be797d2f5937077cb5f4e32db439fca1d1db0004"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::atomics::js_atomics_wait_async (cognitive 16): perry_runtime::atomics::js_atomics_wait_async has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, 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/perry-runtime/src/atomics.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa9cd9861684e00a89f5d4e8a32c754e42450f24e1885469e5d4f95cfbe5056"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::buffer::bytes::copy_typed_range_inner (cognitive 16): perry_runtime::buffer::bytes::copy_typed_range_inner has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (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/perry-runtime/src/buffer/bytes.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"318743fab847517f1cd9ead51c5f504646a88d07bd1f7ba2628709c893e3c3c4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::buffer::cmp::buffer_search_needle_with_encoding (cognitive 16): perry_runtime::buffer::cmp::buffer_search_needle_with_encoding 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. This shape REPEATS in the file: one other method here (perry_runtime::buffer::cmp::js_buffer_index_of_enc) 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/perry-runtime/src/buffer/cmp.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45389c5afec68e428aa13f0e659e3a75f3a56578f521b6b96f18c46d76d3fc0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::buffer::cmp::js_buffer_index_of_enc (cognitive 16): perry_runtime::buffer::cmp::js_buffer_index_of_enc 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. This shape REPEATS in the file: one other method here (perry_runtime::buffer::cmp::buffer_search_needle_with_encoding) 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/perry-runtime/src/buffer/cmp.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"605815b7fa254a6c8db1c1d5e513233e2a0d6382f6ec2a685d0c4773ef88e653"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::buffer::iter::dispatch_buffer_iterator_method_inner (cognitive 16): perry_runtime::buffer::iter::dispatch_buffer_iterator_method_inner has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (3 pts) (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/perry-runtime/src/buffer/iter.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd3cb600512da1b105a0c6b89c875a0a977d35017cd99973ff8009e54335349"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::buffer::store::store_alloc (cognitive 16): perry_runtime::buffer::store::store_alloc has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 4 (8 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/perry-runtime/src/buffer/store.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"30183215a7669872f3efaa3e874816c18344c31e106e909443e5f1ae58ea2406"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::buffer::transcode::js_buffer_transcode (cognitive 16): perry_runtime::buffer::transcode::js_buffer_transcode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (4 pts), boolean chains 1, 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/perry-runtime/src/buffer/transcode.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff5be71d5b19f331494b66dcf0462d5e951b0659e9f4dd29090c89b5796959d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::builtins::console::try_console_instance_method_dispatch (cognitive 16): perry_runtime::builtins::console::try_console_instance_method_dispatch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, match/switch 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/perry-runtime/src/builtins/console.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5aefa972ccadb6cbffd858d09d81f011aa96b601202f9d2691a5688ba48e016"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::builtins::number_locale::js_number_to_locale_string (cognitive 16): perry_runtime::builtins::number_locale::js_number_to_locale_string has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, 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/perry-runtime/src/builtins/number_locale.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad6b952d0a1e9d356a3f0756ef7070a81ab66a6a01cafc8327823b712932919"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::bun_ffi::callback::node_register_callback_value (cognitive 16): perry_runtime::bun_ffi::callback::node_register_callback_value has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 3, loops 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/perry-runtime/src/bun_ffi/callback.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa63935b99c9db2487abb63757f8bc5757c53352f665f23e6303a150cd80345"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::bun_ffi::dlopen::parse_bun_definition (cognitive 16): perry_runtime::bun_ffi::dlopen::parse_bun_definition has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, loops 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/perry-runtime/src/bun_ffi/dlopen.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab74334aabb0d7d0796957d71905f4b3374a6a47e5b1d67eadb5d1988f52aec7"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::bun_ffi::memory::pointer_address (cognitive 16): perry_runtime::bun_ffi::memory::pointer_address 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/perry-runtime/src/bun_ffi/memory.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c09d91f9bfe37e8cf833be6d2c01a55bd3f4ce848d1fb6a367564b1e743c1de"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::calendar::timestamp_to_components (cognitive 16): perry_runtime::calendar::timestamp_to_components has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 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/perry-runtime/src/calendar.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fada784489b8ce3dbf59cafffa19fdd15586e35de078a43811077e21b9b192d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::child_process::emitter::cp_method_remove_all_listeners (cognitive 16): perry_runtime::child_process::emitter::cp_method_remove_all_listeners has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 1 (3 pts) (nesting depth added 10). 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/perry-runtime/src/child_process/emitter.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"f967c8bfa0dd838b88ae44d19b11c87ea7bd5702af0aef152ea3f29a956c7f7f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::child_process::reactor::integration::cp_reactor_scan_roots_mut (cognitive 16): perry_runtime::child_process::reactor::integration::cp_reactor_scan_roots_mut has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (6 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/perry-runtime/src/child_process/reactor/integration.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6ec0125433d0d141d327d9b42bbd75becd8a5d63b97e63eacbca7ab11c1a3e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::closure::entry_bundle::js_closure_entry_bundle (cognitive 16): perry_runtime::closure::entry_bundle::js_closure_entry_bundle has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), loops 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/perry-runtime/src/closure/entry_bundle.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8dfb2d7c0b381b043de0bf7cce8908587667443be35d83753b4a382ae1d0fb6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::component::asynchronous::pump (cognitive 16): perry_runtime::component::asynchronous::pump has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/component/asynchronous.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9381dddcce7c5a832e03128802b1f55c4c3c51ca29cf5074d231fcc3811d8e6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::component::http::pump::pump (cognitive 16): perry_runtime::component::http::pump::pump has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/component/http/pump.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"907b962a37760e2f8166e5009c6ed23af9516edd639b00cdc644e6021f357442"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::event_pump::agent_loop::dispatch_staged (cognitive 16): perry_runtime::event_pump::agent_loop::dispatch_staged has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 1, 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/perry-runtime/src/event_pump/agent_loop.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efead7089b53883731ed3923e1a2372fedf78578db81aa4d588d9bc7b9edaf9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::fs::filehandle::writer_write_common (cognitive 16): perry_runtime::fs::filehandle::writer_write_common has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 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/perry-runtime/src/fs/filehandle.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3726e7d45f998521bc9872d405b461fba8c509e19d02f5b8122aaf48d1d6638"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::fs::stream::utf8_stream::utf8_open_path_result (cognitive 16): perry_runtime::fs::stream::utf8_stream::utf8_open_path_result has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), 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/perry-runtime/src/fs/stream/utf8_stream.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8109372f3c36c2fa7998a1b5ff75237471978cb105785b9d029ac9fc6f5684"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::layout::layout_note_slot_aware (cognitive 16): perry_runtime::gc::layout::layout_note_slot_aware has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 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/perry-runtime/src/gc/layout.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"7041d44b1739252a48e83a06487e77c3662fdb4067e7cefb086bdeb2223331b5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::roots::stack_maps_decode::walk_headers (cognitive 16): perry_runtime::gc::roots::stack_maps_decode::walk_headers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 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/perry-runtime/src/gc/roots/stack_maps_decode.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c39e72cf16668177bd59d78e38e056f20f8016319308632ad9369b46ffb5ef"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::gc::roots::stack_maps_sections::read_elf_section_table (cognitive 16): perry_runtime::gc::roots::stack_maps_sections::read_elf_section_table has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 2, match/switch 1. Of this number, 15 points are the body\u0027s own statements and 1 belongs 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/perry-runtime/src/gc/roots/stack_maps_sections.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f81890270ea9943c1f6275bc961c5b666bbd4e36d0aee6f88fe3ad63b285656"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::i18n::detect_apple_locale (cognitive 16): perry_runtime::i18n::detect_apple_locale has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1 (nesting depth added 6). Of this number, 11 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":"crates/perry-runtime/src/i18n.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef45e3a61470d65f35029bb48c10d17e6d85732e60c2e0e755bcb2b1552e6c4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::canonical_locale (cognitive 16): perry_runtime::intl::canonical_locale has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 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/perry-runtime/src/intl.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b85f48aee6f1ddb839c73dfb97a6a2099fafe18f1bac7620a2a7ea4a903f7b1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::display_names::valid_language_id (cognitive 16): perry_runtime::intl::display_names::valid_language_id 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":"crates/perry-runtime/src/intl/display_names.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"3553c32fc985462bc9861804a8b2bf89bfd6286b3f4585d4a72b2ce7f4e6eaed"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::intl::number_format::push_sign (cognitive 16): perry_runtime::intl::number_format::push_sign 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/perry-runtime/src/intl/number_format.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2586a9a9f07bd0ec2b66c29b76aecd08262c4f03503dfd4439aef92beac468"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::parser_depth_string::dense (cognitive 16): perry_runtime::json::parser_depth_string::dense has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 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/perry-runtime/src/json/parser_depth_string.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d5a717af073846a962179427fb13b1e2d8476e8c951d68d7efe2d117b83765"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::stringify_api::json_number_token (cognitive 16): perry_runtime::json::stringify_api::json_number_token has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (6 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/perry-runtime/src/json/stringify_api.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"404ccfa01f7a1cbbe8260ffbb29e04458f27c06efe5c9d66587ee53d79f0cab5"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json::stringify_api::normalize_lazy_json_numbers (cognitive 16): perry_runtime::json::stringify_api::normalize_lazy_json_numbers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 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/perry-runtime/src/json/stringify_api.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb67c665e2780e9ff7f512e1889a42b611a7f55d5f364ce8c830296dcfb401c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json_tape::materialize_string_value (cognitive 16): perry_runtime::json_tape::materialize_string_value has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, 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/perry-runtime/src/json_tape.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ef1f8c48dce29f387f4b30f15ef6488e2fe32a8e623ed9527823b5fd591234"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json_tape::reparse_materialize (cognitive 16): perry_runtime::json_tape::reparse_materialize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/json_tape.rs"},"region":{"startLine":1698}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1984da8175c7f624b927e27680550beaac41a3f6df7de79c19c4a1aa031697"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::json_tape::scan::skip_number (cognitive 16): perry_runtime::json_tape::scan::skip_number has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 6, 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/perry-runtime/src/json_tape/scan.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5817ed9c46a48d997121f8fd552f712134154faadc8738e42eb07093d60498"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_api_host::properties::prepare_descriptors (cognitive 16): perry_runtime::node_api_host::properties::prepare_descriptors has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 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/perry-runtime/src/node_api_host/properties.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"3450e629d18518b976cfcba6229ddca1a3e55196d528943ce29a80f4ac53195e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_repl::run_repl_line (cognitive 16): perry_runtime::node_repl::run_repl_line has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 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/perry-runtime/src/node_repl.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5adc5dbd7a735e1000148d3e2ae660c1e48aa8c64b41cce0a44f23c7e2d289e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_stream::async_iterator::ns_readable_iterator_return (cognitive 16): perry_runtime::node_stream::async_iterator::ns_readable_iterator_return has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4 (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/perry-runtime/src/node_stream/async_iterator.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06157a564507f4645f316ba4ce6287bba707a136d781452a0a0de4299414bc6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_stream_readwrite::normalize_readable_from_input (cognitive 16): perry_runtime::node_stream_readwrite::normalize_readable_from_input has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 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":"crates/perry-runtime/src/node_stream_readwrite.rs"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2bafde67373f9d96946dfe96736f6c72113be2cddb49c3f76844d4ac70ee05"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::node_vm::source_text::parse_source (cognitive 16): perry_runtime::node_vm::source_text::parse_source 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/perry-runtime/src/node_vm/source_text.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c6fa5a4713fa1444417755f37eb2ea7046daf70ed226912dd41f6ffb81e0be"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::arguments::arguments_object_alloc_rooted (cognitive 16): perry_runtime::object::arguments::arguments_object_alloc_rooted has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/arguments.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5710b6eb758a993b5e003683517c668d596af7c6e92eccddaea68b304d2019b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::assign::positional_prototype_shape_keys (cognitive 16): perry_runtime::object::assign::positional_prototype_shape_keys 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/perry-runtime/src/object/assign.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a9360cdd75cb4b3b32d4a5456d155ff7f5e4df6e84b572f4c2c1523fa982a0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::canonical_keys::append_at_tip (cognitive 16): perry_runtime::object::canonical_keys::append_at_tip has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 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/perry-runtime/src/object/canonical_keys.rs"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"64dff406a2d4d6786756786f6ee6e8a17d22d744ce470d24a14a47d31dd143be"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::define_own_data::define_own_data_from_shape (cognitive 16): perry_runtime::object::define_own_data::define_own_data_from_shape has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/define_own_data.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"017d34c4a9e88e49538e0764f3a7b22e6ec5cafb57b6012c8f2c02c474d4dcd9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::field_get_set::accessors::own_property_slot (cognitive 16): perry_runtime::object::field_get_set::accessors::own_property_slot has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, match/switch 1 (2 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/perry-runtime/src/object/field_get_set/accessors.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b3c323ba0fdc45abe97354714f9bed0f9282ca9a7ad24c5f2c3a052bc1bba3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::function_family_birth::allocate_layout (cognitive 16): perry_runtime::object::function_family_birth::allocate_layout 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/perry-runtime/src/object/function_family_birth.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3f859bfb9e24e7f78a09ed08d387e5285826ffad3a8e5feb05313e38b554ed"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::iterator_prototypes::call_overridden_iterator_next (cognitive 16): perry_runtime::object::iterator_prototypes::call_overridden_iterator_next has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 3 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/iterator_prototypes.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"01605eedd2c0f3b9e91326846097357a25eb88d2753973a7f101a30c5fee1c2d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_probe::diagnostics::diag_walk (cognitive 16): perry_runtime::object::layout_probe::diagnostics::diag_walk has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (5 pts), boolean chains 1, 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/perry-runtime/src/object/layout_probe/diagnostics.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8d5cbfdec2f3d530d1c348be2386db755bc17bddb05d456cf434314509b27e"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::layout_probe::verify::chain (cognitive 16): perry_runtime::object::layout_probe::verify::chain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/layout_probe/verify.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"905459f7b43628a48c822fe0cccb21ce48ac128a0a721670bc6095602ab507e0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_call_method::gc_pointer_and_type_from_value (cognitive 16): perry_runtime::object::native_call_method::gc_pointer_and_type_from_value has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 3, 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/perry-runtime/src/object/native_call_method.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e2ad601e8ce94c0bb81f50784826a633a99756d7cb8b185a9b9a39d9caf092"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_call_method::class_holder::class_instance_inherited_read (cognitive 16): perry_runtime::object::native_call_method::class_holder::class_instance_inherited_read has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, match/switch 3 (4 pts) (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/native_call_method/class_holder.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"5684dcda9e965161a1361f6a2d1347350bf516c453b7a7a11d9abacd35f33847"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_module::web_locks::worker_threads_locks_request (cognitive 16): perry_runtime::object::native_module::web_locks::worker_threads_locks_request has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, match/switch 3 (4 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/native_module/web_locks.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa91940a241dac62c15a8a5e6970a4a82309f57cf5c5d1a197431528490a0e1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::native_module_dispatch::dispatch_q_u::nm_dispatch_timers (cognitive 16): perry_runtime::object::native_module_dispatch::dispatch_q_u::nm_dispatch_timers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (nesting depth added 6). 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/perry-runtime/src/object/native_module_dispatch/dispatch_q_u.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"22afd67c3f4b47934a61144dc8aa9646192a804268d30c22c5704318ddebed91"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::object_ops::descriptor_helpers::define_property_force_store_value (cognitive 16): perry_runtime::object::object_ops::descriptor_helpers::define_property_force_store_value has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/object_ops/descriptor_helpers.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cf468f33b88a5f7a1817e41acaeed8a1cd33ecb58a8d2b28d9446fbc78d896"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::shape_store::try_store_with_refresh (cognitive 16): perry_runtime::object::shape_store::try_store_with_refresh has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 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/perry-runtime/src/object/shape_store.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8dc4c52fb866524c0938239ab46cbf7b069b8711afcb633137b98e4fbf2b77"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::shapes::learn_object_constfn_lanes (cognitive 16): perry_runtime::object::shapes::learn_object_constfn_lanes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 3, loops 2, match/switch 1 (2 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/perry-runtime/src/object/shapes.rs"},"region":{"startLine":4430}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a4ff13532d17c070d666d4622e479547d2def92ba5d5b847c2d80f1e81cd89"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::object::shapes_worker_seed::worker_shape_seed (cognitive 16): perry_runtime::object::shapes_worker_seed::worker_shape_seed has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 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/perry-runtime/src/object/shapes_worker_seed.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54fc50e30df881718c69edd7144ea7ffef0a4aacd14cc236a2f2c6a71fd3345"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::ohos_napi::invoke_callback1 (cognitive 16): perry_runtime::ohos_napi::invoke_callback1 has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, match/switch 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/perry-runtime/src/ohos_napi.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d47dd722e271a78211fb125bb8822b6e902438b76fb8e3174a9126d868a5ec2"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::process::node_module::module_strip_type_annotations (cognitive 16): perry_runtime::process::node_module::module_strip_type_annotations has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/process/node_module.rs"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"558b1b5088bd6a8a7f8581f0b793c4d2edbc2e7a6e56974afc79710dbaff69cd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::process::node_module::module_invalid_option_received (cognitive 16): perry_runtime::process::node_module::module_invalid_option_received has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/process/node_module.rs"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e1171764f12a0e5a74fca0b8dc4b79a48f54b295b207f9c369e165598d605c"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::promise::then::js_promise_then (cognitive 16): perry_runtime::promise::then::js_promise_then has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (4 pts), boolean chains 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/perry-runtime/src/promise/then.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c1b21bbd0a6a34d76b9fce267c0540e45d164309b9f6ba2d1073d3b1947854"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::promise::then::js_promise_attach_handlers (cognitive 16): perry_runtime::promise::then::js_promise_attach_handlers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/promise/then.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b62bafa43ce768e9737d996590cb96794a26c12ee2de51a4c9dc630e2558ba"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::promise::then_probe::prove_no_then (cognitive 16): perry_runtime::promise::then_probe::prove_no_then has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, boolean chains 1, 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/perry-runtime/src/promise/then_probe.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"5047dd61cd5737ea11ede661b750e05a88f3ae0a3da2230e8c2544fb5fa8f4cc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::regex::perex_dispatch::to_primitive (cognitive 16): perry_runtime::regex::perex_dispatch::to_primitive has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 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/perry-runtime/src/regex/perex_dispatch.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cd6f51de91b067a1b18dfc81aa74310f5b84b8bf7d219c09ecf2c5b8f5d2d8"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::regex::perex_lead::class (cognitive 16): perry_runtime::regex::perex_lead::class has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/regex/perex_lead.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adc1a7fe6b7a1e462a8fe1843d6ac9515c660376895fd6aa3f4b4370954abcd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::regex::perex_literal_bytes::split (cognitive 16): perry_runtime::regex::perex_literal_bytes::split has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/regex/perex_literal_bytes.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a6e8bffb0775526f8f3634a1c9428db203bfb91b77d06b8ffa3cd55f00bbf1"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::regex::perex_strings::copy_units (cognitive 16): perry_runtime::regex::perex_strings::copy_units has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), loops 3 (4 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/regex/perex_strings.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2cc265f3ace12f518854ec180747993edda81397e16056d75cfd4055b1c389b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::string::literal_replace::to_primitive (cognitive 16): perry_runtime::string::literal_replace::to_primitive has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 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/perry-runtime/src/string/literal_replace.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a7620e6a689d0c66752617e200599a309c3ba8e6f7b52dfc572322853513fa"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::typed_feedback::classify_array (cognitive 16): perry_runtime::typed_feedback::classify_array has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, match/switch 4 (6 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/typed_feedback.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfbf57f9dc77019fc2150d8ae7bc59ff89efc94a4c9cdbfb4c1d90385e8498f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::typedarray::slice_ops::js_typed_array_subarray (cognitive 16): perry_runtime::typedarray::slice_ops::js_typed_array_subarray has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, 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/perry-runtime/src/typedarray/slice_ops.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59719812e8dfd40150f9c84eb0b0e910290b1d2b7c88a74e05c84e8c059cba3"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::typedarray_props::typed_array_index_get_dynamic (cognitive 16): perry_runtime::typedarray_props::typed_array_index_get_dynamic has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 2 (3 pts), boolean chains 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/perry-runtime/src/typedarray_props.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"413bf72ebec8da3f43a01f5e862d1c243c166db28bfbf0a743f9b0624526c0d0"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::url::node_compat::decode_file_url_pathname_bytes_win32 (cognitive 16): perry_runtime::url::node_compat::decode_file_url_pathname_bytes_win32 has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 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/perry-runtime/src/url/node_compat.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f0904f3de76e1a170f11f3f51fe724ad74442327ca7a25067a39c9a17064dc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::url::node_compat::js_url_format (cognitive 16): perry_runtime::url::node_compat::js_url_format has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (16 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/perry-runtime/src/url/node_compat.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1107990b4456d2a90f23ac986266bf574693dce0f2cf80dcbfad72160e48989"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::value::to_string_primitive::call_method_for_primitive (cognitive 16): perry_runtime::value::to_string_primitive::call_method_for_primitive has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 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/perry-runtime/src/value/to_string_primitive.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a7ec1461760e0cd29d941364ca0bf2afc20af9e09eaa8c53da3d60d8687b3f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_runtime::weakref::sliced::advance_registry (cognitive 16): perry_runtime::weakref::sliced::advance_registry has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 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/perry-runtime/src/weakref/sliced.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde391b99859a0d6f12c0e9df64c559b2702d62bf2b2a2f8d209c4625f14e30a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::cheerio::js_cheerio_selection_has_class (cognitive 16): perry_stdlib::cheerio::js_cheerio_selection_has_class has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 10). 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/perry-stdlib/src/cheerio.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"db02660b76bd91265f798b2a2f5e1beb6045161858f71565119976369ce3918d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::cheerio::js_cheerio_selection_is (cognitive 16): perry_stdlib::cheerio::js_cheerio_selection_is has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 1 (4 pts), match/switch 1 (nesting depth added 10). 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/perry-stdlib/src/cheerio.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4abbf0a0a77da05e93cb159a76b42b70c980fe952a5e4ed79f07bd9e23625a6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::common::dispatch::init::js_stdlib_init_dispatch::async_hooks_native_construct (cognitive 16): perry_stdlib::common::dispatch::init::js_stdlib_init_dispatch::async_hooks_native_construct has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 4). 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/perry-stdlib/src/common/dispatch/init.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8720a4eaf9e1c2ad4871459cffa3e880af5fa557ef88bb3dd6d8f75b6808d92"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::crypto::cipher::create_cipher_handle (cognitive 16): perry_stdlib::crypto::cipher::create_cipher_handle 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/perry-stdlib/src/crypto/cipher.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8eb0d7bf4ced7c9bd9a6a44d3684628c57603a09c9b9431c4c6ed71e79762f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::crypto::sign::js_crypto_generate_key_pair_sync_ec_p256 (cognitive 16): perry_stdlib::crypto::sign::js_crypto_generate_key_pair_sync_ec_p256 has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/crypto/sign.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ddc1319a70904604827feab188ae1343a314274515bc8277ced9e19e2ef3f55"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::fetch::dispatch::js_response_body_init_ptr (cognitive 16): perry_stdlib::fetch::dispatch::js_response_body_init_ptr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 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/perry-stdlib/src/fetch/dispatch.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cfc6780bf0652c4ccff1b60b2d25b40852083c54107302536bff9a22d08f44"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::fetch::native_properties::set_native_property_bag (cognitive 16): perry_stdlib::fetch::native_properties::set_native_property_bag has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (16 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/perry-stdlib/src/fetch/native_properties.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"395e33a360724eebd3db7b4dc0ab745857e99bd20ae59c7050883c9409fe0b59"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::querystring::querystring_scalar_to_string (cognitive 16): perry_stdlib::querystring::querystring_scalar_to_string has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/querystring.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b5bf77cc0bcfc6f002aa9b481c985f278b16d893494d31c586c9b308f642dd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::readline::js_readline_stdin_remove_listener (cognitive 16): perry_stdlib::readline::js_readline_stdin_remove_listener has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 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/perry-stdlib/src/readline/mod.rs"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9c07983e0e6807f51f40aea545cd98f2a8c874cacd1911bede554e13e13bf6"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::sqlite::options::parse_node_sqlite_options (cognitive 16): perry_stdlib::sqlite::options::parse_node_sqlite_options has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, 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/perry-stdlib/src/sqlite/options.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"79dea5138c81283616f9aa3f664d141e0a5edb5b973493add12d713a23966a52"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::streams::transform::native_text_decoder_drain (cognitive 16): perry_stdlib::streams::transform::native_text_decoder_drain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 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/perry-stdlib/src/streams/transform.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fb3c9ab2f07bcef6163eac7b6de53696b5362c6246d5e5f6b3e7d1e8e2841f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::streams::writable::js_writable_stream_abort_inner (cognitive 16): perry_stdlib::streams::writable::js_writable_stream_abort_inner has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 2 (3 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/perry-stdlib/src/streams/writable.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f8fe4a0a03a4bb7c1a19d4dd1c07e9f86127b5104cdedaa5bc3548a75603cd"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::tls::js_tls_client_preflight (cognitive 16): perry_stdlib::tls::js_tls_client_preflight has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4 (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/perry-stdlib/src/tls.rs"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"73313765cd3e690cf63d3a970bfbabab264e94e190920351aeefa01806ac5cae"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::turnloop_smtp::on_data (cognitive 16): perry_stdlib::turnloop_smtp::on_data has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, match/switch 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/perry-stdlib/src/turnloop_smtp/mod.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"b396d02648d07cdd2b5483924bfc7abb971a77ee5e3e0ccf6a425a6f53399ca4"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::webcrypto::hmac::kdf_derive_bytes (cognitive 16): perry_stdlib::webcrypto::hmac::kdf_derive_bytes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/webcrypto/hmac.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aaf799dddb84a996a343f64c47bc4b381feb014d5126bbb05bafa8dd94a3398"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::webcrypto::kdf::js_webcrypto_derive_bits (cognitive 16): perry_stdlib::webcrypto::kdf::js_webcrypto_derive_bits has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 4, boolean chains 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/perry-stdlib/src/webcrypto/kdf.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"17da3233111a570a6fc45d6442992bd957e22b12f98c19db830ea12521ed118b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_stdlib::worker_threads::worker_pump::dispatch_worker_event (cognitive 16): perry_stdlib::worker_threads::worker_pump::dispatch_worker_event has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 2, boolean chains 1, 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/perry-stdlib/src/worker_threads/worker_pump.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f517513db0d347e89e3daff957c49f5d7ef0e4e0210289f63d9ea00701310d"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::async_to_generator::rewrite_async_closures_in_stmt (cognitive 16): perry_transform::async_to_generator::rewrite_async_closures_in_stmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), 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. This shape REPEATS in the file: one other method here (perry_transform::async_to_generator::scan_stmt_for_async_closures) 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/perry-transform/src/async_to_generator.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63193daa39f4bd865a7ec4a6b5bc7433a5bc30f9d0e830362081a1d842840af"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::async_to_generator::scan_stmt_for_async_closures (cognitive 16): perry_transform::async_to_generator::scan_stmt_for_async_closures has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), 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. This shape REPEATS in the file: one other method here (perry_transform::async_to_generator::rewrite_async_closures_in_stmt) 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/perry-transform/src/async_to_generator.rs"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7fc47664c137e2dab8504ae44be9d737aeb5c1136ae3e558e73ed2a3e20bde9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::generator::id_scan::scan_stmt_for_max_func (cognitive 16): perry_transform::generator::id_scan::scan_stmt_for_max_func has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), 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/perry-transform/src/generator/id_scan.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b2c991a2f98148e12ae27f8441af94f151f593b86ebae2751b23c4a193167a"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::i18n::collect_keys_from_stmt (cognitive 16): perry_transform::i18n::collect_keys_from_stmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), 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. This shape REPEATS in the file: one other method here (perry_transform::i18n::replace_in_stmt) 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/perry-transform/src/i18n.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b78c6b5a921a9b82f52916b89c548e4da74f739a288bfd4385607cf4737d478"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::i18n::replace_in_stmt (cognitive 16): perry_transform::i18n::replace_in_stmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), 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. This shape REPEATS in the file: one other method here (perry_transform::i18n::collect_keys_from_stmt) 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/perry-transform/src/i18n.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a157d586fb1ce1aa1d4a926735829664108969f917e2d6c0da494d44bbdc0bc"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::analysis::body_calls_func (cognitive 16): perry_transform::inline::analysis::body_calls_func has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 2 (5 pts), match/switch 2 (nesting depth added 3). None of this is in the body itself: all 16 points belong to 2 function items inside it that branch (check_expr, check_stmt). 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/perry-transform/src/inline/analysis.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ebccd221097bd339a20012cbda89aca988554b05bec8e40415622464ccac4f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::analysis::method_lookup_is_unshadowed (cognitive 16): perry_transform::inline::analysis::method_lookup_is_unshadowed has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, 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/perry-transform/src/inline/analysis.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"780bd138effde3f9d2554db2a2d4b063f3982e6cd16c644d17a14d92648797ee"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::inline::analysis::class_chain_property_sets (cognitive 16): perry_transform::inline::analysis::class_chain_property_sets has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 3 (7 pts), boolean chains 1 (nesting depth added 7). 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/perry-transform/src/inline/analysis.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ccaf9bbfeaac6d91ca5c021c0538889a970c0f62957d87f980df3538dd2f69"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::local_occurrences::count_expr (cognitive 16): perry_transform::local_occurrences::count_expr has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (5 pts), match/switch 1 (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/perry-transform/src/local_occurrences.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9864aea4f357a202f19fc8983eaf995c0fa7c365546d07a2ccd4512ef6e439"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_transform::state_desugar::rewrite_stmt (cognitive 16): perry_transform::state_desugar::rewrite_stmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), 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/perry-transform/src/state_desugar.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d690e1bf77ec00b4abd9edee02175f13576db7d3f3b9e25533442042bc71d55"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_android::screenshot::perry_ui_screenshot_capture (cognitive 16): perry_ui_android::screenshot::perry_ui_screenshot_capture has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 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/perry-ui-android/src/screenshot.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"89dfdf2ea9bc102cbb7337f9c040ab8859101c7fe4e6c360b6a8e41bdd89c220"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_android::widgets::set_height (cognitive 16): perry_ui_android::widgets::set_height has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (16 pts) (nesting depth added 10). 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/perry-ui-android/src/widgets/mod.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee8b2f427f69a00d887928b05cfdffe9658c299344c880bd58e00a806095209"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_macos::widgets::attributed_text::append (cognitive 16): perry_ui_macos::widgets::attributed_text::append has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14 (16 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/perry-ui-macos/src/widgets/attributed_text.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"852068052c4d90c7e1d45946b8a091ddcf78f787049c4c2a9681dd93c3c41a76"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::app::dispatch_ui_message (cognitive 16): perry_ui_windows::app::dispatch_ui_message has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6 (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/perry-ui-windows/src/app.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a70cd8a70c86380706b2597345f2ad7b2b528d4d664ac9f09f006b2c4eb346"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::crash_handler::handler (cognitive 16): perry_ui_windows::crash_handler::handler has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-windows/src/lib.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6256ec96b228f7da455dccf54079860004a8d5706e8c6912eb99743effc2dd60"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::layout::measure_text_height (cognitive 16): perry_ui_windows::layout::measure_text_height has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (16 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/perry-ui-windows/src/layout.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c32ad5568354b604be481f2b1e6c4167635f7c1025d951e054747607fc1dcc9"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::tray::handle_callback_message (cognitive 16): perry_ui_windows::tray::handle_callback_message has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 1, loops 1, 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/perry-ui-windows/src/tray.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc8839387bb76e08fe0e5137029e6a961415f9f3dfce7da316c96c64d6ff9bb"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::widgets::border_subclass_proc (cognitive 16): perry_ui_windows::widgets::border_subclass_proc has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 1 (nesting depth added 10). 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/perry-ui-windows/src/widgets/mod.rs"},"region":{"startLine":1766}}}],"partialFingerprints":{"codehealthFindingId/v1":"af974e10700fdff6b1cfaf984186cbca8dff0d6b12fb4efece2f90c64cc08127"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_ui_windows::widgets::table::layout_widget_cells (cognitive 16): perry_ui_windows::widgets::table::layout_widget_cells has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 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/perry-ui-windows/src/widgets/table.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fc736a900ac1e97ff84c3b4d957dd83d77b8abafecbf2c3d064e8e34b5397c"}},{"ruleId":"D2","level":"warning","message":{"text":"Directory::poll_produce (cognitive 16): Directory::poll_produce has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wasi/src/p3/filesystem/directory.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cac12dda9ecf24f29bbabdf6e6db3a915c65ce4dc96ed9a620cf728d44ebe59"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wasi::http::server::wire::response (cognitive 16): perry_wasi::http::server::wire::response has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (4 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/perry-wasi/src/http/server/wire.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8fee255d5af5aebc0f53a0714f46f4aeeb68216d12b2dd5c7b8e4ddfd3385b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wasm_host::finish_instance_call (cognitive 16): perry_wasm_host::finish_instance_call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wasm-host/src/lib.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a9a8f47ccf3c3612e6ee9424f753d8beb1c937dada9f77eeaca8ca3c487d6f"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wasm_host::externals::perry_wasm_host_func_call (cognitive 16): perry_wasm_host::externals::perry_wasm_host_func_call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), boolean chains 5, match/switch 2 (3 pts), loops 2 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wasm-host/src/externals.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc09f84be0bca44b44ac1c03b6a977624083b2d57f5673641fa548a0eae57370"}},{"ruleId":"D2","level":"warning","message":{"text":"Emitter::discard_owned (cognitive 16): Emitter::discard_owned has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (6 pts), 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/perry-wit/src/guest_c/values/discard.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"308162b8cacfaf9f1bee0ce2b96557db1d5228305071b183a76138e34b89595c"}},{"ruleId":"D2","level":"warning","message":{"text":"Gen::note_define_keys (cognitive 16): Gen::note_define_keys has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (8 pts), match/switch 2 (5 pts), if/else 1 (3 pts) (nesting depth added 9). 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/perry-wpfacts/src/gen/define_keys.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"208a5fddf7f85a02fcc6d2a30d87574d2c69b106c5765c9ed665a035bd9fa5bb"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::replay_shared (cognitive 16): Model::replay_shared has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 3 (5 pts), loops 1 (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/perry-wpfacts/src/solve/shared.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3161a63aaaabe3c75e9e501a5ace42be0cdc2c78238813634b3a1dd72c2f943a"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::settle_parent_values (cognitive 16): Model::settle_parent_values has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (7 pts), if/else 3 (6 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/solve.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"369b495ad13c5c2b930c54a66b0e71cc0a59e4969818a36aa4a7829721b26d8b"}},{"ruleId":"D2","level":"warning","message":{"text":"perry_wpfacts::dump::module_digests (cognitive 16): perry_wpfacts::dump::module_digests has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 5 (6 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/perry-wpfacts/src/dump.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf064e09d9ab620c0cca59c7a123663a4f4ce8cef8192b11d07e08484ee5ba5"}},{"ruleId":"D2","level":"warning","message":{"text":"PerryBridge.onImagePickerResult (cognitive 16): PerryBridge.onImagePickerResult has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (3 pts), boolean chains 2, error handling 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1587f7054135bf4d090d9a3a381892be9a39362d7b99742e3bcff215df4a52"}},{"ruleId":"D2","level":"warning","message":{"text":"check_gc_doc_claims.path_problems (cognitive 16): check_gc_doc_claims.path_problems has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (4 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":"scripts/check_gc_doc_claims.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d975ff7811295d74f92e9f7d4e6e97bdfd3fa04f71ab87df27e6f15e2e01f1"}},{"ruleId":"D2","level":"warning","message":{"text":"analyzers.named_hot_regions (cognitive 16): analyzers.named_hot_regions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/compiler_output_harness/analyzers.py"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3338c846d6887ca2a512386feece1a172262f9200a798c5c33079b5646cb29f"}},{"ruleId":"D2","level":"warning","message":{"text":"repsel_census.load_baseline (cognitive 16): repsel_census.load_baseline has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 1, 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":"scripts/compiler_output_harness/repsel_census.py"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b18b0f7b5fc8f0fd313d02b2cbaaa980e626c9938eac3a4c04d7e267298827"}},{"ruleId":"D2","level":"warning","message":{"text":"gate_failure_watch.handle_event (cognitive 16): gate_failure_watch.handle_event has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, ternaries 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":"scripts/gate_failure_watch.py"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"340fc3988767692bad2634ddc6a8de49c73877cd1ac0aa96671409f1c8a64d4e"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_root_dominance_check._scan_unrooted (cognitive 16): gc_root_dominance_check._scan_unrooted has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 1 (5 pts), boolean chains 1 (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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":6713}}}],"partialFingerprints":{"codehealthFindingId/v1":"f590b09fc2942b57cf392443305f9945f6fda7201280e1ce92bbfbf4d1decae8"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_runtime_root_holders.declarations_in_tls (cognitive 16): gc_runtime_root_holders.declarations_in_tls has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (5 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":"scripts/gc_runtime_root_holders.py"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1adf9b86afa48d19aa722d5d8802ea237815f6338417921ab1af11e73f74bc"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_runtime_root_holders.ffi_holder_is_candidate (cognitive 16): gc_runtime_root_holders.ffi_holder_is_candidate 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":"scripts/gc_runtime_root_holders.py"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"276f717390695673f170ca77d0fd7981e0c1c2dd7714e4f0d774d25a21d985a6"}},{"ruleId":"D2","level":"warning","message":{"text":"gc_store_site_inventory.rust_function_spans (cognitive 16): gc_store_site_inventory.rust_function_spans 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":"scripts/gc_store_site_inventory.py"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef35c63357bb545d36c8f7d6b36ea8b27f1695301feefa0683a05c423824521"}},{"ruleId":"D2","level":"warning","message":{"text":"global_sink_isolation.referenced_idents (cognitive 16): global_sink_isolation.referenced_idents has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (14 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":"scripts/global_sink_isolation.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4d1bd2417c94d318c1adf7234585690cff0b523fc4082fd568fc6ca561da41"}},{"ruleId":"D2","level":"warning","message":{"text":"link_absence.witness_options (cognitive 16): link_absence.witness_options has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, ternaries 6, if/else 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":"scripts/link_absence.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"57527992f9480f16ee396f852b5d212de1fe04a6014754193e6aba5127e44808"}},{"ruleId":"D2","level":"warning","message":{"text":"link_absence.why_live (cognitive 16): link_absence.why_live has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 1 (2 pts), boolean chains 1, ternaries 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":"scripts/link_absence.py"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2e5e3223c479b9a2934275f52bf3d8ba5ca85d92ed965b8748acd2983b9e6f"}},{"ruleId":"D2","level":"warning","message":{"text":"perf_missread_lane.compile_arm (cognitive 16): perf_missread_lane.compile_arm has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 3 (4 pts), error handling 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":"scripts/perf_missread_lane.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8e6c9199e61ecf5662380422c22969d3b7e6a61bb56855317bb8efff8c8486"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime_size_budget.main (cognitive 16): runtime_size_budget.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 4 (6 pts), ternaries 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":"scripts/runtime_size_budget.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"97607e6ce6023a593279c7bae280a6e8e0b7e67e632cda9dcc227ca75638dfa1"}},{"ruleId":"D2","level":"warning","message":{"text":"wasm_runtime.perry_ui_stack_set_alignment (cognitive 16): wasm_runtime.perry_ui_stack_set_alignment has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (15 pts), if/else 1 (nesting depth added 10). 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/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":3072}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7fb35587f742f57f309616c3ebe9f04103c137fb9e7b30722c668db8d84cdd"}},{"ruleId":"D2","level":"warning","message":{"text":"soak.parseExcludeEntries (cognitive 16): soak.parseExcludeEntries has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 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":"scripts/soak/soak.mts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"285610f3debf9bef7eb7f08dbc0d9f48ae3214ef84b28e802093d549cbcce388"}},{"ruleId":"D2","level":"warning","message":{"text":"soak.runSoak (cognitive 16): soak.runSoak has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (3 pts), boolean chains 2, ternaries 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":"scripts/soak/soak.mts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc5db72deb6fa28a01403394bee724e21f794176ce17c18626533dc0b410469"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::run_pipeline::run_with_parse_cache: FunctionTooLong \u2014 perry::commands::compile::run_pipeline::run_with_parse_cache runs 4429 significant 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 4329 over it, 44.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/perry/src/commands/compile/run_pipeline.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebbc1259fb87c8261dd1a306523ff9a8492326bdca45fde13d14d440a1e548b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Gen.expr_rest: MethodTooLong \u2014 expr_rest runs 1574 significant 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 1474 over it, 15.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/perry-wpfacts/src/gen_rest.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f89c82a84a3d962bbd25f4a00056f4bea80c2661d1450ffae9110fedb94ad29"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::walker::expr_mut::walk_expr_children_mut: FunctionTooLong \u2014 perry_hir::walker::expr_mut::walk_expr_children_mut runs 1560 significant 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 1460 over it, 15.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/perry-hir/src/walker/expr_mut.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"487906e7b8e0f9ef1bdde1f1124a46e38a03ad48c077658fafc01f479b935620"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::walker::expr_ref::walk_expr_children: FunctionTooLong \u2014 perry_hir::walker::expr_ref::walk_expr_children runs 1560 significant 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 1460 over it, 15.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/perry-hir/src/walker/expr_ref.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"855090bb2020b6377068617e87964f3febc80bc14fbfd44986a44fde36005e74"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower_decl::body_stmt::lower_body_stmt_impl: FunctionTooLong \u2014 perry_hir::lower_decl::body_stmt::lower_body_stmt_impl runs 1534 significant 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 1434 over it, 15.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/perry-hir/src/lower_decl/body_stmt.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"be952acc2d593731791967a3eee9729e9249b57301a73f86cc1f603df1faf249"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::publish::run_async: FunctionTooLong \u2014 perry::commands::publish::run_async runs 1349 significant 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 1249 over it, 13.49\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/perry/src/commands/publish/mod.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf085608f52f780268bb91d4a37127f58a9322d4e07ff23d945ce1915b961eb5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsEmitter.emit_expr_continued: MethodTooLong \u2014 emit_expr_continued runs 1314 significant 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 1214 over it, 13.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/perry-codegen-js/src/emit/exprs_more.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ffea25502a9d22fff2bdc0c5387b1d872c8938ca5ddf3d4d886eaa84549860"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::runtime_decls::strings::declare_phase_b_strings: FunctionTooLong \u2014 perry_codegen::runtime_decls::strings::declare_phase_b_strings runs 1254 significant 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 1154 over it, 12.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/runtime_decls/strings.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c33363e06cc822b104d9d0bf65830005e09cbc0f56bd0c2b10d76e2e0a0fbea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stmt/loops.rs: FileTooLong \u2014 6269 significant 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 138 free functions. The bar is 500 significant lines; this is 5769 over it, 12.54\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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"805daf242f8301596ba8df12d34ee5362d0b8554e029ca50209da2f6a4b408df"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::collect_modules::collect_module_one: FunctionTooLong \u2014 perry::commands::compile::collect_modules::collect_module_one runs 1189 significant 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 1089 over it, 11.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/collect_modules.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1aaebc4adbee75da8f2a19f9ee2e7fc4173bd23c7571218be869ef99d176ae2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WasmModuleEmitter.compile: MethodTooLong \u2014 compile runs 1179 significant 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 1079 over it, 11.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/perry-codegen-wasm/src/emit/compile.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"834fc8df956468b382bf2927320dc7cd7825f8f1819fa866f75a3260d6d6648b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::property_get::dynamic_dispatch::try_lower_instance_method_call: FunctionTooLong \u2014 perry_codegen::lower_call::property_get::dynamic_dispatch::try_lower_instance_method_call runs 1128 significant 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 1028 over it, 11.28\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/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"7610bcd7ca7021bb2bde754e52e3511cc0a295cb68800d9727b4c8401ccb8d64"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::this_super_call::lower_impl: FunctionTooLong \u2014 perry_codegen::expr::this_super_call::lower_impl runs 1078 significant 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 978 over it, 10.78\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/perry-codegen/src/expr/this_super_call.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"f650e973eaabbeb2788ec2e33415173201bc869932bb3b668e2fcd2457675a07"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::module_decl::lower_module_decl: FunctionTooLong \u2014 perry_hir::lower::module_decl::lower_module_decl runs 1014 significant 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 914 over it, 10.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/perry-hir/src/lower/module_decl.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f0e19efe6514d9d45484b18bc850c3c31e3e9a3132354578d1cee4266cdcfc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::runtime_decls::strings_part2::declare_phase_b_strings_part2: FunctionTooLong \u2014 perry_codegen::runtime_decls::strings_part2::declare_phase_b_strings_part2 runs 995 significant 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 895 over it, 9.95\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/perry-codegen/src/runtime_decls/strings_part2.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd743e0ced04cd44e8346b6c6679dc0953d700fdce819153a2828509ca2bfa7a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compile/run_pipeline.rs: FileTooLong \u2014 4805 significant 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 4305 over it, 9.61\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/perry/src/commands/compile/run_pipeline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fce508d44c3c32f1d3e867f056243962be8e88aec73afe15cabe741731e41a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: wasm_runtime.buildImports: FunctionTooLong \u2014 buildImports runs 947 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 847 over it, 9.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9532a1f2c28845ffb0aeba843f1a8bb129409a8069195caea3310253629618b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::field_get_set::get_field_by_name_tail::get_field_by_name_object_tail: FunctionTooLong \u2014 perry_runtime::object::field_get_set::get_field_by_name_tail::get_field_by_name_object_tail runs 932 significant 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 832 over it, 9.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/perry-runtime/src/object/field_get_set/get_field_by_name_tail.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cb585fbcec5aa13ef953473f29be609b17ffbafe39bf6b83e12f6f562ad569"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: FnCtx: TooManyFields \u2014 279 stored fields beside 33 methods. The bar is 30 stored fields; this is 249 over it, 9.30\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/perry-codegen/src/expr/mod.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f5f64611fe030958446a200fd6747c1cba9013edc5ff4205fefbccdba2d8ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_call::module_static::try_module_static_methods: FunctionTooLong \u2014 perry_hir::lower::expr_call::module_static::try_module_static_methods runs 919 significant 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 819 over it, 9.19\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/perry-hir/src/lower/expr_call/module_static.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5910a8dc36fe665e53bedf88b362eb7223680791491bf612ca426e1d211029"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsEmitter.emit_expr: MethodTooLong \u2014 emit_expr runs 898 significant 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 798 over it, 8.98\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/perry-codegen-js/src/emit/exprs.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b9ff690b8b097ab74d17adc4d8514c73e63612af81debe488dc9968dd81336"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::let_stmt::lower_let: FunctionTooLong \u2014 perry_codegen::stmt::let_stmt::lower_let runs 895 significant 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 795 over it, 8.95\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/perry-codegen/src/stmt/let_stmt.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dead2e2a343a489ee0f1ee55f9ffc3dd1db7cb961b311aa4061db7edb51b97b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Gen.expr_inner: MethodTooLong \u2014 expr_inner runs 889 significant 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 789 over it, 8.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/gen_expr.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7113900344a99765db935dd976b37d30e9260c57a834a6c3070c8ebec42452a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::property_get::lower: FunctionTooLong \u2014 perry_codegen::expr::property_get::lower runs 884 significant 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 784 over it, 8.84\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/perry-codegen/src/expr/property_get.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6708a5209d41edd7fc692502a53b59dfb46c56ff509b8720854acd9ccfc2cb7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Model: TooManyMethods \u2014 265 methods, declared across 10 files: model/operations.rs (64), src/solve.rs (53), src/summary.rs (46), solve/call_and_construct.rs (34), \u002B6 more file(s). The bar is 30 methods; this is 235 over it, 8.83\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/model.rs"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb9b282a13f8b89f283474c65f85c3eac004c5d44e73d7650d415bb81253010"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_wpfacts::compute_in: FunctionTooLong \u2014 perry_wpfacts::compute_in runs 878 significant 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 778 over it, 8.78\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/perry-wpfacts/src/lib.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e817d6f5a5156beb55e33ece2593c7da4e19858951a1174e3c524c9b453309e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Model: TooManyFields \u2014 263 stored fields beside 265 methods. The bar is 30 stored fields; this is 233 over it, 8.77\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/perry-wpfacts/src/model.rs"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b51914c7f750929a0192591aa3b05a59da7bb687ffa99bf517bdb65506e1a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::method_override::emit_guarded_direct_method_call: FunctionTooLong \u2014 perry_codegen::lower_call::method_override::emit_guarded_direct_method_call runs 867 significant 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 767 over it, 8.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/perry-codegen/src/lower_call/method_override.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"019608c7ba402e78c2d4017bb5f78ba181454d64cbbda5585da44a9a16b86e22"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::options::fetch::lower_fetch_native_method: FunctionTooLong \u2014 perry_codegen::lower_call::options::fetch::lower_fetch_native_method runs 856 significant 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 756 over it, 8.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/options/fetch.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b329dfcf2913b514b6b0c601433890e0e3fadbb8f24274cc1832178db531ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::bigint_set::lower: FunctionTooLong \u2014 perry_codegen::expr::bigint_set::lower runs 854 significant 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 754 over it, 8.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/bigint_set.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"b319eaaba4619fc89b0c726be8e53456ccd2caaab4b68b454db0c7fc24f0beaa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_member::lower_member_inner: FunctionTooLong \u2014 perry_hir::lower::expr_member::lower_member_inner runs 853 significant 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 753 over it, 8.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/perry-hir/src/lower/expr_member.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac160c09e0c439b40afab1cc004713df24de72efd6dedcfe88a5d95c6a8dd24a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::monomorph::substitute_expr::substitute_expr: FunctionTooLong \u2014 perry_hir::monomorph::substitute_expr::substitute_expr runs 836 significant 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 736 over it, 8.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/perry-hir/src/monomorph/substitute_expr.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7acdec18cd9dc59587dc8103a8c9803aedbb1656d90e8a47f5cd0eb659ce198"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::new::lower_new_impl_inner: FunctionTooLong \u2014 perry_codegen::lower_call::new::lower_new_impl_inner runs 834 significant 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 734 over it, 8.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/perry-codegen/src/lower_call/new.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e07cac5f16dcc276e186bfbe154f8fd660ba1c8849da534e664dce708a2e1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::generator::linearize::linearize_body: FunctionTooLong \u2014 perry_transform::generator::linearize::linearize_body runs 818 significant 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 718 over it, 8.18\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/perry-transform/src/generator/linearize.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd7a42395f6dc086508ebc0ba45658cb8c2a32b305818a5e54f0711abf232e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::builtin::lower_builtin_new: FunctionTooLong \u2014 perry_codegen::lower_call::builtin::lower_builtin_new runs 816 significant 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 716 over it, 8.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/builtin.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d8e98ba37549cb92f87bf57287d621d79d8eef3df0fd511407f8fb08155d3c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::index_set::lower: FunctionTooLong \u2014 perry_codegen::expr::index_set::lower runs 807 significant 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 707 over it, 8.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/perry-codegen/src/expr/index_set.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"e684d254210f02ec5643b6bc618f027258a47250f7a7e383203e8d0e08290e0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/gc_root_dominance_check.py: FileTooLong \u2014 4021 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3521 over it, 8.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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad390dd7aa89f0c71438547733c35804d7539aae970cacbf3f7b98e63e0445f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::generator::lower::transform_generator_function_with_extra_captures: FunctionTooLong \u2014 perry_transform::generator::lower::transform_generator_function_with_extra_captures runs 778 significant 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 678 over it, 7.78\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/perry-transform/src/generator/lower.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"466e4c2b7645e10d4d06e710f4ff02315c982a6816aec87b8dbdf2f737eba07a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::inline::factory_specialize::specialize_captured_class_factories: FunctionTooLong \u2014 perry_transform::inline::factory_specialize::specialize_captured_class_factories runs 772 significant 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 672 over it, 7.72\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/perry-transform/src/inline/factory_specialize.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b74794824f21fd3c550ff095f025e0406a1ee5d82e05b4ab9f0d19edcdcf796"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::instance_misc1::lower: FunctionTooLong \u2014 perry_codegen::expr::instance_misc1::lower runs 770 significant 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 670 over it, 7.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/perry-codegen/src/expr/instance_misc1.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"1534cfc1a23a3c199ec92d025516d0e970d6995faaccf39f225becdd663c189a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::misc_methods::lower: FunctionTooLong \u2014 perry_codegen::expr::misc_methods::lower runs 770 significant 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 670 over it, 7.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/perry-codegen/src/expr/misc_methods.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df30c37e07bee0584440b1917e3869b2a6a9c941e166d346aa6b211023fa82f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::stmt::lower_stmt_inner: FunctionTooLong \u2014 perry_hir::lower::stmt::lower_stmt_inner runs 765 significant 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 665 over it, 7.65\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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"542e25aec8752ffc1168cd8f72a14a1e2d76d5ba1af7a4336179b96633abaaf2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::object::builtin_proto_entries: TooManyFunctions \u2014 227 free functions. The bar is 30 free functions; this is 197 over it, 7.57\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/perry-runtime/src/object/builtin_proto_entries.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de802a27cfaf8575cef09986d9cb5f79daff7c7cf0ca6b1330da8a3ffe35f22"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::stmt_loops::lower_stmt_for_of_inner: FunctionTooLong \u2014 perry_hir::lower::stmt_loops::lower_stmt_for_of_inner runs 748 significant 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 648 over it, 7.48\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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aba058eace9dc49211645b349cab26438368618a016ea4a67a2f213848d78c2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FuncEmitCtx.try_emit_expr_native_method: MethodTooLong \u2014 try_emit_expr_native_method runs 744 significant 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 644 over it, 7.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/perry-codegen-wasm/src/emit/expr/native_method.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e2e4a152c6203cca938530b3b61e394e926452ad3536af25781be7deef92b3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Model.apply_inner: MethodTooLong \u2014 apply_inner runs 738 significant 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 638 over it, 7.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/perry-wpfacts/src/solve/apply.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"05bcc896bc539174a96e88b88c21d59616b9a48524de5f6300a8023521efbc70"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::analysis::value_types::infer_expr_type: FunctionTooLong \u2014 perry_hir::analysis::value_types::infer_expr_type runs 736 significant 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 636 over it, 7.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/perry-hir/src/analysis/value_types.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7ef327db33097ac91c4161da0302454d3e0cc47a2104856494d3a1010952c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/wasm_runtime.js: FileTooLong \u2014 3600 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 3100 over it, 7.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/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa8e82cc1dfac25b13d51a69b51903491cbef4f1d2eaad2f5fe33aecefafc3a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Gen: TooManyMethods \u2014 215 methods, declared across 19 files: gen/export.rs (36), src/gen.rs (28), src/gen_expr.rs (28), gen/import_values.rs (19), \u002B15 more file(s). The bar is 30 methods; this is 185 over it, 7.17\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/gen.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ad181dfa4b6f29735030fec7b910027f44a840b2895bc6fc1e89f7baec1df1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: RuntimeImports: TooManyFields \u2014 212 stored fields. The bar is 30 stored fields; this is 182 over it, 7.07\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/emit/runtime_imports.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd25f13ade17dcaa0b7e1717787ade5fa60a324884f11266deee2afb5ec03b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::logical_collections::lower: FunctionTooLong \u2014 perry_codegen::expr::logical_collections::lower runs 700 significant 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 600 over it, 7.00\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/perry-codegen/src/expr/logical_collections.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b341c530b74b17c16b57b8d223e54c2b0a1d856a7ecf305192da4e60916328d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/shapes.rs: FileTooLong \u2014 3480 significant 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 182 free functions. The bar is 500 significant lines; this is 2980 over it, 6.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/perry-runtime/src/object/shapes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52fd5d6e105f9657bc34a6e1743e6e9ff99cdc75118b6a5d0fc34201a5238ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::host_config::apply_pkg_and_toml_config: FunctionTooLong \u2014 perry::commands::compile::host_config::apply_pkg_and_toml_config runs 662 significant 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 562 over it, 6.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/perry/src/commands/compile/host_config.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"2778393892d33341a9b0520e9479e6b9713fac8a1e13055bb5dbb64743ee02c5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: LoweringContext: TooManyFields \u2014 198 stored fields beside 134 methods. The bar is 30 stored fields; this is 168 over it, 6.60\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/perry-hir/src/lower/lowering_context.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"c104e5d8ab45747dd681c0d3fed3c3a260c0adccb8ecc21e9ed53ee69d716466"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::arrays_finds::lower: FunctionTooLong \u2014 perry_codegen::expr::arrays_finds::lower runs 658 significant 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 558 over it, 6.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/perry-codegen/src/expr/arrays_finds.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"247186e0506544537fd9169c986582b0bcff8f57453f80ae5ab5cce040a5be01"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::dispatch::lower_expr_inner: FunctionTooLong \u2014 perry_codegen::expr::dispatch::lower_expr_inner runs 656 significant 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 556 over it, 6.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/dispatch.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e233ae3dd892ab71603dda58cb05bfc2b8977d4a6aed26c2e263e6af1d4774"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Expr.hash: MethodTooLong \u2014 hash runs 656 significant 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 556 over it, 6.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/stable_hash/expr.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3ba0637da8e6641254d373bcfd34c9792a9ef7d1a790fd6d773b13022d940d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::escape_check::check_escapes_in_expr: FunctionTooLong \u2014 perry_codegen::collectors::escape_check::check_escapes_in_expr runs 648 significant 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 548 over it, 6.48\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/perry-codegen/src/collectors/escape_check.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9dc79cbf3dbc6513149ee2ba148e9705cad7a2025446b50b73d5e072dc800b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::link::platform_cmd::select_linker_command: FunctionTooLong \u2014 perry::commands::compile::link::platform_cmd::select_linker_command runs 642 significant 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 542 over it, 6.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/perry/src/commands/compile/link/platform_cmd.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ba3b24ed3a3f7ccc1f457d29ea2bc3374f02fdfcfd2e08246066b614171ae8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_object::lower_object: FunctionTooLong \u2014 perry_hir::lower::expr_object::lower_object runs 633 significant 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 533 over it, 6.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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30c0840749faba2efd751f99c1116dd304ba05e9bfc0db424859a662a379eb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::math_simple::lower: FunctionTooLong \u2014 perry_codegen::expr::math_simple::lower runs 618 significant 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 518 over it, 6.18\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/perry-codegen/src/expr/math_simple.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"e466d8c2005a994a2b758f84c441ccdf3cf0cf685dd2d525f19b9625db9c3c08"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_call::globals::try_global_builtins: FunctionTooLong \u2014 perry_hir::lower::expr_call::globals::try_global_builtins runs 616 significant 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 516 over it, 6.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c0ef9d5fe654b5198b70ed05c92d06e495d8d4850117336a35102abf253f7d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_string_method::lower_string_method_dispatch: FunctionTooLong \u2014 perry_codegen::lower_string_method::lower_string_method_dispatch runs 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) in one body. The bar is 100 significant lines; this is 509 over it, 6.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/perry-codegen/src/lower_string_method.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"75751bb34ecd07f783c61a13f403dbbe087f9d52808513f6dbbfaa91cdb54527"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals: FunctionTooLong \u2014 perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals runs 607 significant 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 507 over it, 6.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/perry-codegen/src/collectors/pointer_locals.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ff6233815e4bcef11b1477eab22267db14296a061697335c69f629d00fe25d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::refs::refs_expr: FunctionTooLong \u2014 perry_codegen::collectors::refs::refs_expr runs 607 significant 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 507 over it, 6.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/perry-codegen/src/collectors/refs.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f418d70cb23922c12ed62ad95ea8e6c6eb99a248e0edbef55ef88a58bce0467"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/web_runtime.js: FileTooLong \u2014 2999 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 2499 over it, 6.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac61c07f64c49aa594f9515753c2b792e152eb703211d8103ad8ff6bb8c064f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::setup::ios::ios_wizard: FunctionTooLong \u2014 perry::commands::setup::ios::ios_wizard runs 596 significant 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 496 over it, 5.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/perry/src/commands/setup/ios.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c7cbe88e6c611c229341f7c07055b2265e374ab0031690c921f25deb734308"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_stdlib::webcrypto::keys::js_webcrypto_generate_key: FunctionTooLong \u2014 perry_stdlib::webcrypto::keys::js_webcrypto_generate_key runs 594 significant 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 494 over it, 5.94\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/perry-stdlib/src/webcrypto/keys.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"724908af8e7cc202b91c0eb657a22c46f4c7c70efdb3f6fe713c54a3ea082cc7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::object_ops::define_property::apply_property_descriptor: FunctionTooLong \u2014 perry_runtime::object::object_ops::define_property::apply_property_descriptor runs 590 significant 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 490 over it, 5.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/perry-runtime/src/object/object_ops/define_property.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"586d96053ab2f176292d51c07407f6b07e3971324310df3f08824d2c46082dc1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::global_this::proto_methods::populate_builtin_prototype_methods: FunctionTooLong \u2014 perry_runtime::object::global_this::proto_methods::populate_builtin_prototype_methods runs 580 significant 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 480 over it, 5.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/perry-runtime/src/object/global_this/proto_methods.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6d5b21f0f6f672b31d991052acad25c847e3501657e331c0d1e10eba44d342"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::early_branches::try_lower_closure_typed_local_call: FunctionTooLong \u2014 perry_codegen::lower_call::early_branches::try_lower_closure_typed_local_call runs 579 significant 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 479 over it, 5.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/perry-codegen/src/lower_call/early_branches.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"b675ebf19796b12c7c58433dc8fa813af3696487a13bfaf1cf7a9df6b38a48d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::field_set_by_name::tail::set_field_by_name_object_tail: FunctionTooLong \u2014 perry_runtime::object::field_set_by_name::tail::set_field_by_name_object_tail runs 579 significant 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 479 over it, 5.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/perry-runtime/src/object/field_set_by_name/tail.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2c5d5538bec5d8e6d180975ec953ff417c0dc67fbafbe240b8609797f1723d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::field_get_set::get_field_by_name::get_field_by_name_past_data_probe: FunctionTooLong \u2014 perry_runtime::object::field_get_set::get_field_by_name::get_field_by_name_past_data_probe runs 568 significant 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 468 over it, 5.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/field_get_set/get_field_by_name.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"de11fe7f7b0b993f00d82c04b585d38540f792f735702f78292a6cea4078ce11"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::object_cache::compute_object_cache_key_with_env: FunctionTooLong \u2014 perry::commands::compile::object_cache::compute_object_cache_key_with_env runs 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) in one body. The bar is 100 significant lines; this is 466 over it, 5.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/perry/src/commands/compile/object_cache.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"682ad95d3f04ff628c394a74fb06fe90134f257845021f3b2ecc96d2b01e8b0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::escape_news::collect_used_new_fields_in_expr: FunctionTooLong \u2014 perry_codegen::collectors::escape_news::collect_used_new_fields_in_expr runs 555 significant 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 455 over it, 5.55\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/perry-codegen/src/collectors/escape_news.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a561d11f8e1308024433bf401f6c4792b51d24fed083a33b7609788651e8508"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_call::local_array_methods::try_local_array_methods: FunctionTooLong \u2014 perry_hir::lower::expr_call::local_array_methods::try_local_array_methods runs 555 significant 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 455 over it, 5.55\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/perry-hir/src/lower/expr_call/local_array_methods.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"615d18601dfb44b46f3fc78ea09dd549a45662becc0fd8f7f25d5a167b77796e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::intl::number_format_digits::numbering_system_digits: FunctionTooLong \u2014 perry_runtime::intl::number_format_digits::numbering_system_digits runs 554 significant 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 454 over it, 5.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/intl/number_format_digits.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca3fe67f7f031462896a0af5c460909a7eb48f56b23cf8ba4fa20307e156d52"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::native_call_method::handle_methods::dispatch_handle: FunctionTooLong \u2014 perry_runtime::object::native_call_method::handle_methods::dispatch_handle 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/perry-runtime/src/object/native_call_method/handle_methods.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca87ca030499281fafdbbed695b1d1d35f753b9f5b4caa5f98e355805346e5aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::buffer_dispatch::dispatch_buffer_method: FunctionTooLong \u2014 perry_runtime::object::buffer_dispatch::dispatch_buffer_method runs 535 significant 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 435 over it, 5.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/buffer_dispatch.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"7454aa239b995431a1d24c40585175f1e2164ce3011a8cd9fee71e3aaad4cc18"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::lower_module_fn::lower_module_full_with_platform_globals: FunctionTooLong \u2014 perry_hir::lower::lower_module_fn::lower_module_full_with_platform_globals runs 528 significant 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 428 over it, 5.28\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/perry-hir/src/lower/lower_module_fn.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"38402b2daaafd6c01a978d613238e4daff337e92d9c39d3c2677649befa0b057"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_call::array_only_methods::try_array_only_methods: FunctionTooLong \u2014 perry_hir::lower::expr_call::array_only_methods::try_array_only_methods runs 525 significant 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 425 over it, 5.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/perry-hir/src/lower/expr_call/array_only_methods.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"79282c74097b06c4a13fc0666fee325754e1bbb85d21d835b5ce73da67eb5380"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::bundle_ios::build_ios_app_bundle: FunctionTooLong \u2014 perry::commands::compile::bundle_ios::build_ios_app_bundle runs 516 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 416 over it, 5.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/bundle_ios.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba39e94073d0feca4ad0e03554ba7512a615081dbd8bc8418e2605bb15951284"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::js_transform::imports::transform_expr: FunctionTooLong \u2014 perry_hir::js_transform::imports::transform_expr runs 507 significant 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 407 over it, 5.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/perry-hir/src/js_transform/imports.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ad488ccb105ef61dec38b54727d060919acf79893a05811f42c6ae5d45dc71"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::extern_func::try_lower_extern_func_call: FunctionTooLong \u2014 perry_codegen::lower_call::extern_func::try_lower_extern_func_call runs 502 significant 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 402 over it, 5.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/perry-codegen/src/lower_call/extern_func.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b909cdf91b563933d5f6a380dc6feec7923b1150665dbf9fd6f7218f4ad11c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::global_this::populate::populate_global_this_builtins_inner: FunctionTooLong \u2014 perry_runtime::object::global_this::populate::populate_global_this_builtins_inner runs 500 significant 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 400 over it, 5.00\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/perry-runtime/src/object/global_this/populate.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"acaa6642b280bd7774d2adb7c84fbac20f0b05a28d6eb04443122c51ddb8d7ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::index_get::lower: FunctionTooLong \u2014 perry_codegen::expr::index_get::lower runs 490 significant 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 390 over it, 4.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/perry-codegen/src/expr/index_get.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"b924f1f04d1e175bfbade586310de68c90b85e8d80918d513cb0ba303c885103"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::collect_modules::feature_detect::detect_optional_feature_usage: FunctionTooLong \u2014 perry::commands::compile::collect_modules::feature_detect::detect_optional_feature_usage runs 488 significant 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 388 over it, 4.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/collect_modules/feature_detect.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"057db573260f5fc6c832706216f7f4286f7d950fd65fb6b8ba1636973a2fbff8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_array_method::lower_array_method: FunctionTooLong \u2014 perry_codegen::lower_array_method::lower_array_method runs 487 significant 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 387 over it, 4.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/perry-codegen/src/lower_array_method.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"3099254461970bdd30f02ce6f2e0c5fb036dfbad190e05821c1abf539a175989"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::runtime_decls::objects::declare_phase_b_objects: FunctionTooLong \u2014 perry_codegen::runtime_decls::objects::declare_phase_b_objects runs 487 significant 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 387 over it, 4.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/perry-codegen/src/runtime_decls/objects.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff01d5b98d7d91792e76b468184ebf1207edce4ec1f23473035c7428fa7d45b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::static_field_meta::lower: FunctionTooLong \u2014 perry_codegen::expr::static_field_meta::lower runs 484 significant 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 384 over it, 4.84\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/perry-codegen/src/expr/static_field_meta.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"99106d1cdd010f64d2f25a300e4e0233344eb2d4603e701726348025863b4203"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::descriptors::own_property: FunctionTooLong \u2014 perry_runtime::object::descriptors::own_property runs 484 significant 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 384 over it, 4.84\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/perry-runtime/src/object/descriptors.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b96cbec93814907b474364c6dbc909c98a4df8bbdc6c218ffad23ab03bb751"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::gc::copying::run_copied_minor_attempt: FunctionTooLong \u2014 perry_runtime::gc::copying::run_copied_minor_attempt runs 482 significant 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 382 over it, 4.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/gc/copying.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b27234621619e5116a8a332db3f38583e2613189a9d2e76fb022cfb50c579bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_wpfacts::units::driver::run: FunctionTooLong \u2014 perry_wpfacts::units::driver::run runs 480 significant 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 380 over it, 4.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/perry-wpfacts/src/units/driver.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89f9730056cf9558b007f6087ba1422528983ba9f30b167939cb805c4e2a1fa"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CompilationContext: TooManyFields \u2014 143 stored fields beside 1 method. The bar is 30 stored fields; this is 113 over it, 4.77\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/perry/src/commands/compile/types.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8bd193dc41eaa40a44f4200023ea8376e1e994677bf70a21dd259b716bcd4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::native_module::constants::get_native_module_constant: FunctionTooLong \u2014 perry_runtime::object::native_module::constants::get_native_module_constant 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/perry-runtime/src/object/native_module/constants.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57ba3ad0a8295a5c81145d17391637710c8fc55b59f8a34b2152d3f67c1a724"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::literals_vars::lower: FunctionTooLong \u2014 perry_codegen::expr::literals_vars::lower runs 472 significant 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 372 over it, 4.72\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/perry-codegen/src/expr/literals_vars.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1f0001dbe8f577fc58706cfaa1ee8825bca25110747a138bb757842e8930f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::index_get::inline_dyn_typed_array::lower_inline_dyn_typed_array_get_with_byte_view_param: FunctionTooLong \u2014 perry_codegen::expr::index_get::inline_dyn_typed_array::lower_inline_dyn_typed_array_get_with_byte_view_param runs 471 significant 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 371 over it, 4.71\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/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d1956d993252c2eb3589fda1ea1eded17c71baad1da48aa238b60dd533f558"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WasmModuleEmitter.collect_strings_in_expr: MethodTooLong \u2014 collect_strings_in_expr runs 467 significant 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 367 over it, 4.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/perry-codegen-wasm/src/emit/string_collection.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e12bdecdd013860dafa793873094543e8ed87c054681bc2f50060c48db0526c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::string_regex_proc::lower: FunctionTooLong \u2014 perry_codegen::expr::string_regex_proc::lower runs 467 significant 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 367 over it, 4.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/perry-codegen/src/expr/string_regex_proc.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a083fc42ea505804a1cad09ad3f7ce1bb1b4d84edde6cf95db02b89e516509"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::intl::make_instance_this: FunctionTooLong \u2014 perry_runtime::intl::make_instance_this runs 455 significant 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 355 over it, 4.55\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/perry-runtime/src/intl.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"940bad669febd2bde5ea31be64f0fe333cd0bf2fef4667f51332cc6ea28984c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::func_ref::try_lower_func_ref_call: FunctionTooLong \u2014 perry_codegen::lower_call::func_ref::try_lower_func_ref_call runs 453 significant 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 353 over it, 4.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/perry-codegen/src/lower_call/func_ref.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"086caadb797371e72f0bde92f025612c9a8751996c6da5f0d0fa5b6f235cc741"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/mod.rs: FileTooLong \u2014 2259 significant 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 1759 over it, 4.52\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/perry-codegen/src/expr/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcef4f1d18efb59de7937d00ca98690567aa39f7504fff1f69afa5cf7698700"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_member::member_tail::lower_member_tail: FunctionTooLong \u2014 perry_hir::lower::expr_member::member_tail::lower_member_tail runs 450 significant 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 350 over it, 4.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_member/member_tail.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4afe8e30945ce3b4a13850f0d960c79959cec95ce159acb5b894ce8bb2baf8c0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FuncEmitCtx.try_emit_expr_classes: MethodTooLong \u2014 try_emit_expr_classes runs 448 significant 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 348 over it, 4.48\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/perry-codegen-wasm/src/emit/expr/classes.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce20c77dbb448a92f07872532ae0556291abf4e1a698bffa03063702c48e3248"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LoweringContext: TooManyMethods \u2014 134 methods, declared across 5 files: lower/context.rs (116), context/construct.rs (8), lower/jump_targets.rs (5), lower/context_new.rs (3), \u002B1 more file(s). The bar is 30 methods; this is 104 over it, 4.47\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/lowering_context.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd374879932c8a23a3220d0e27935ae22943f41ebf3224e174ab81368caa279"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::calls::lower: FunctionTooLong \u2014 perry_codegen::expr::calls::lower runs 438 significant 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 338 over it, 4.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/perry-codegen/src/expr/calls.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"843e24cad1e533b4f351e81962c3e7c56a9b9cd17785c26d9aef9c7a5b69aaf6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::promise::microtasks::pump_protected: FunctionTooLong \u2014 perry_runtime::promise::microtasks::pump_protected runs 438 significant 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 338 over it, 4.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/perry-runtime/src/promise/microtasks.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"02814209a9c1fb47159b1cd372566127ded3d919e08f4133a64482c8a0171944"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::instanceof::static_dispatch::native_instanceof: FunctionTooLong \u2014 perry_runtime::object::instanceof::static_dispatch::native_instanceof runs 435 significant 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 335 over it, 4.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/instanceof/static_dispatch.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a14675896e591fb3e79b4d8c074528f9ef7fba7fb77d8c0f9eb1b77ed2f81db"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower_decl::class_decl::from_ast::lower_class_from_ast: FunctionTooLong \u2014 perry_hir::lower_decl::class_decl::from_ast::lower_class_from_ast runs 433 significant 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 333 over it, 4.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/perry-hir/src/lower_decl/class_decl/from_ast.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eaa26a91456302eb74647b4ea22fad03f9769d77b5c9903205184bffabd96fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::loops::lower_object_array_write_versioned_for: FunctionTooLong \u2014 perry_codegen::stmt::loops::lower_object_array_write_versioned_for runs 423 significant 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 323 over it, 4.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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":5094}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c93d2f504b853b743eff6721e76df0dba00631376e707ea2854c94789fb720"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::i32_locals::collect_localset_ids_in_expr_filtered: FunctionTooLong \u2014 perry_codegen::collectors::i32_locals::collect_localset_ids_in_expr_filtered runs 421 significant 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 321 over it, 4.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/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aaecd442e5a532426c732d01ca96ea156a11ccb7c289c96a9e4bb63d9325681"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower_decl::class_captures::synthesize_class_captures: FunctionTooLong \u2014 perry_hir::lower_decl::class_captures::synthesize_class_captures runs 419 significant 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 319 over it, 4.19\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/perry-hir/src/lower_decl/class_captures.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ceabdafba7cfce8931f7f3bf9cdeab5340722dd162c08916dee16419b849a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::global_this::math_temporal::install_temporal_namespace: FunctionTooLong \u2014 perry_runtime::object::global_this::math_temporal::install_temporal_namespace runs 412 significant 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 312 over it, 4.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/perry-runtime/src/object/global_this/math_temporal.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ce708d78e39556114b1445206479c01ec798baf002beaec3b1a8c1cd876256"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FuncEmitCtx.try_emit_expr_arrays: MethodTooLong \u2014 try_emit_expr_arrays runs 409 significant 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 309 over it, 4.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/perry-codegen-wasm/src/emit/expr/arrays.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9795d964007c2aa895b5d6f175d851d6c48d1bdcd207e23dea0f451e48d04b04"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_function::lower_fn_expr_anon: FunctionTooLong \u2014 perry_hir::lower::expr_function::lower_fn_expr_anon runs 404 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 304 over it, 4.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba5d402d8d3b9456dfdbe07d39a0f12083b98563443557a6817e4a293dc4752"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::inline::call_inliner::inline_calls_in_stmts: FunctionTooLong \u2014 perry_transform::inline::call_inliner::inline_calls_in_stmts runs 393 significant 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 293 over it, 3.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":"crates/perry-transform/src/inline/call_inliner.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fd95851df08a70b9e9961dffc560e1bead16a63ddbeef1c87d408d19e77dbd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::index::lower_index_set_fast: FunctionTooLong \u2014 perry_codegen::expr::index::lower_index_set_fast runs 389 significant 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 289 over it, 3.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/index.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabf76e1346575d42b3ad51a02cdb8d4b5fd024c2c7ed95fb25a01683980a2ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::folded_builtin_override::folded_call: FunctionTooLong \u2014 perry_codegen::expr::folded_builtin_override::folded_call runs 388 significant 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 288 over it, 3.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/folded_builtin_override.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c6b1b37ae1481503f31ae089a54e5ac600e89ceb9afd636478c6dc82e60734"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::compare::lower: FunctionTooLong \u2014 perry_codegen::expr::compare::lower runs 386 significant 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 286 over it, 3.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/perry-codegen/src/expr/compare.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b2a929bc319d4b225d99859c16dd24323e5c467adca4cbb73c9d9c7dd9a032"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::array_push::lower_inner: FunctionTooLong \u2014 perry_codegen::expr::array_push::lower_inner runs 385 significant 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 285 over it, 3.85\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/perry-codegen/src/expr/array_push.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be0f5cf63b9e54ba7fd3fc8da51788181bf43e407bb29e61580aa5fe8d2e656"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_ios::ffi::widgets_advanced: TooManyFunctions \u2014 115 free functions. The bar is 30 free functions; this is 85 over it, 3.83\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/perry-ui-ios/src/ffi/widgets_advanced.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4935dfc1b6cd392ae73f6abc757a619b1da657f8862b64f106cc83984668a72"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::native_call_method::primitive_methods::dispatch_primitive: FunctionTooLong \u2014 perry_runtime::object::native_call_method::primitive_methods::dispatch_primitive runs 383 significant 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 283 over it, 3.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/native_call_method/primitive_methods.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d923a9ca8492b1b184db0826e62c347480d9d10919603aaaf7646f31f26201"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/typed_feedback.rs: FileTooLong \u2014 1909 significant 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 90 free functions. The bar is 500 significant lines; this is 1409 over it, 3.82\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/perry-runtime/src/typed_feedback.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73cd46e0315ed103c0ed43c81dee52eeebc19d5339b4322b2b7d98ccd5f0edb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_geisterhand::server::run_server: FunctionTooLong \u2014 perry_ui_geisterhand::server::run_server runs 379 significant 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 279 over it, 3.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/perry-ui-geisterhand/src/server.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"12170002d37bc88abd7d201fbed3be28a71a89421b34af5ed1384230bfb51b85"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::static_method::lower: FunctionTooLong \u2014 perry_codegen::expr::static_method::lower runs 376 significant 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 276 over it, 3.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/static_method.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"290674c9fa2db635f7bc9826c8415f9b2eea5a9f25a446a4e9185d2cb222f182"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::url_main::lower: FunctionTooLong \u2014 perry_codegen::expr::url_main::lower runs 376 significant 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 276 over it, 3.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/url_main.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d727fadf433f786b5ec4f0bce4e8cfdb3ca57058c7354581a6a0659d17d4f103"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_stdlib::crypto::cipher::cipher_step: FunctionTooLong \u2014 perry_stdlib::crypto::cipher::cipher_step runs 373 significant 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 273 over it, 3.73\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/perry-stdlib/src/crypto/cipher.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a44ade3299ca56922847424635de7d4cfe493357f4d6ffb5bd7874b9a67d99"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/streams.rs: FileTooLong \u2014 1864 significant 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 138 free functions. The bar is 500 significant lines; this is 1364 over it, 3.73\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/perry-stdlib/src/streams.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1130be56c56b0f61d346f38ab474de8c2e36a362d3c9895f0d2f7b7679516d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_new::member::lower_new_member_native: FunctionTooLong \u2014 perry_hir::lower::expr_new::member::lower_new_member_native runs 372 significant 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 272 over it, 3.72\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/perry-hir/src/lower/expr_new/member.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0d22ac9ac86c30965af510730bfac002bd93aa3f1e652f5766e6612c613a27"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::symbol::get::js_object_get_symbol_property_with_receiver: FunctionTooLong \u2014 perry_runtime::symbol::get::js_object_get_symbol_property_with_receiver runs 372 significant 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 272 over it, 3.72\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/perry-runtime/src/symbol/get.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0e58ad6103fc7e7ce514c9b0d58a83c8c1ed6a224ec6ed900fa0dfd655aedf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::runtime_decls::stdlib_ffi::language_core::declare_core: FunctionTooLong \u2014 perry_codegen::runtime_decls::stdlib_ffi::language_core::declare_core runs 369 significant 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 269 over it, 3.69\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/perry-codegen/src/runtime_decls/stdlib_ffi/language_core.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3278c2d35d368c9599bfa39d3dc93cf94a03091088effb6e2b382f02059de9e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gc/policy.rs: FileTooLong \u2014 1819 significant 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 148 free functions. The bar is 500 significant lines; this is 1319 over it, 3.64\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/perry-runtime/src/gc/policy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36843baf8fadda758fd040c21723dea964a6b334c08f571004ee9f671676443c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::delete_rest::js_object_delete_field: FunctionTooLong \u2014 perry_runtime::object::delete_rest::js_object_delete_field runs 362 significant 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 262 over it, 3.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/perry-runtime/src/object/delete_rest.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a0796b06533b5d366e667d6f00cc4297e8862342ad2f62804ab0c2c103463f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::native_call_method::string_methods::dispatch_string: FunctionTooLong \u2014 perry_runtime::object::native_call_method::string_methods::dispatch_string runs 362 significant 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 262 over it, 3.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/perry-runtime/src/object/native_call_method/string_methods.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4370a1f8608e932b0c28d8fc4e39b18c1c4577a5ea231be58d3413a198f09bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::field_get_set::has_property::object_has_property_generic: FunctionTooLong \u2014 perry_runtime::object::field_get_set::has_property::object_has_property_generic runs 360 significant 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 260 over it, 3.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/perry-runtime/src/object/field_get_set/has_property.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"288927badef92591c0677304887af49a562a3f4440dcffacc7c7a00f403134f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::class_registry::construct::builtin::construct: FunctionTooLong \u2014 perry_runtime::object::class_registry::construct::builtin::construct runs 358 significant 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 258 over it, 3.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/perry-runtime/src/object/class_registry/construct/builtin.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3171eb12ae01ad2b59b873ca9732359d6347a580b77b262ef149e5ff2ecf95"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LlBlock: TooManyMethods \u2014 107 methods, declared across 2 files: src/block.rs (102), src/array_storage.rs (5). The bar is 30 methods; this is 77 over it, 3.57\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/block.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05e824abc0cc0239016b527834810bff5751e8e96dab6f027109d54944be2c9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Expr: ClassTooLong \u2014 1421 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 2 methods, 2 blocks, lines 57-2956. The bar is 400 significant lines; this is 1021 over it, 3.55\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/perry-hir/src/ir/expr.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08d8768dfca647434dd91e2e270595330f76f13af51271e088f56c676536037"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::loops::lower_packed_f64_range_versioned_for: FunctionTooLong \u2014 perry_codegen::stmt::loops::lower_packed_f64_range_versioned_for runs 353 significant 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 253 over it, 3.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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":3700}}}],"partialFingerprints":{"codehealthFindingId/v1":"93597db6d3f3b4bf198a6d06078cf37a288ab841ca2a24716d557355873246ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::loops::lower_for_after_init_impl: FunctionTooLong \u2014 perry_codegen::stmt::loops::lower_for_after_init_impl runs 353 significant 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 253 over it, 3.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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":7176}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d425388e7a87820c36934421f9c3d30883b573f6fe589cf4ee2a0f23afe92b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::object_ops::prototype::get_prototype_of_resolved: FunctionTooLong \u2014 perry_runtime::object::object_ops::prototype::get_prototype_of_resolved runs 352 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 252 over it, 3.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/object_ops/prototype.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"89419ae902f440d7fea31554b007b551061458fb0f01eb30f164767c5a3e2b03"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::inline::call_inliner::inline_calls_in_expr: FunctionTooLong \u2014 perry_transform::inline::call_inliner::inline_calls_in_expr runs 352 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 252 over it, 3.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/inline/call_inliner.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"f680eb065f1b0d37535669b3d06ce22bb03f288807dafc253705a7ec418b5ddf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FuncEmitCtx.try_emit_expr_objects: MethodTooLong \u2014 try_emit_expr_objects runs 348 significant 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 248 over it, 3.48\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/perry-codegen-wasm/src/emit/expr/objects.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a0375798d41562ea608e7ff9ddda4b6ee5c419e4b0cc36def35524dcea7a19"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::ptr_shape::collect_shape_proven_ptr_locals_impl: FunctionTooLong \u2014 perry_codegen::collectors::ptr_shape::collect_shape_proven_ptr_locals_impl runs 347 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 247 over it, 3.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/ptr_shape.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"44721c8864ff93a4f8d8c9fef940653ee16c6240bde80ae151c8598f173aa1f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::os_uri_dates::lower: FunctionTooLong \u2014 perry_codegen::expr::os_uri_dates::lower runs 347 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 247 over it, 3.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/os_uri_dates.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c9321741f84b609905d41ac12b810a64fff7cd39b7a30637c8ae3521c3bcce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::property_get::generic_dispatch::lower_property_site_tail: FunctionTooLong \u2014 perry_codegen::expr::property_get::generic_dispatch::lower_property_site_tail runs 347 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 247 over it, 3.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/property_get/generic_dispatch.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"941ddcf5e31f07aca28c45f4a49b82271ee24c42a915cace07ff0b9ffaffece3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::lower_expr_value: FunctionTooLong \u2014 perry_codegen::expr::lower_expr_value 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/perry-codegen/src/expr/mod.rs"},"region":{"startLine":4392}}}],"partialFingerprints":{"codehealthFindingId/v1":"a492495f91eeb844962ca776e4d5f9ec0864b39f28265b9f98d55ff77388e5d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::proxy_reflect::lower: FunctionTooLong \u2014 perry_codegen::expr::proxy_reflect::lower 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/perry-codegen/src/expr/proxy_reflect.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ec6ff0bbc163818d97e5d5420c35876a0e9134be4efb5dcad304222a79f7ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::field_set_by_name::js_object_set_field_by_name: FunctionTooLong \u2014 perry_runtime::object::field_set_by_name::js_object_set_field_by_name runs 343 significant 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 243 over it, 3.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/field_set_by_name.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ed9de3b464441255dbb6d18fefcdbd3ef39d7b8bda2172d94e52bfe1d6cc26"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::property_get::helpers::lower_raw_f64_class_field_get_for_number_context: FunctionTooLong \u2014 perry_codegen::expr::property_get::helpers::lower_raw_f64_class_field_get_for_number_context runs 341 significant 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 241 over it, 3.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/perry-codegen/src/expr/property_get/helpers.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"02df6adf4be54e587f7c2f5618be9f0c14e436def454a40d964008559f5633ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::native_module::module_keys::native_module_enumerable_keys: FunctionTooLong \u2014 perry_runtime::object::native_module::module_keys::native_module_enumerable_keys runs 340 significant 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 240 over it, 3.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/perry-runtime/src/object/native_module/module_keys.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ff1a8655da1e670824eb96d62b7a9365fc4517134c884c306d375356586c52"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FuncEmitCtx.try_emit_expr_literals_vars: MethodTooLong \u2014 try_emit_expr_literals_vars runs 338 significant 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 238 over it, 3.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/perry-codegen-wasm/src/emit/expr/literals_vars.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8f4cfb64cf572f4e32d49c231021e996ff1419f0ff9adb553bdfc8a3ecef24"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::call_spread::lower: FunctionTooLong \u2014 perry_codegen::expr::call_spread::lower runs 338 significant 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 238 over it, 3.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/perry-codegen/src/expr/call_spread.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72e8b13078466f4b3b0f7d8b7e2644b26781bb0ad42f46ff1230aba76a3e644"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::destructuring::var_decl::native_fetch::register_native_fetch_and_streams: FunctionTooLong \u2014 perry_hir::destructuring::var_decl::native_fetch::register_native_fetch_and_streams runs 337 significant 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 237 over it, 3.37\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/perry-hir/src/destructuring/var_decl/native_fetch.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"082bed0d14e00e6bedeae467afbf75b71abab8a1acc39b42a2abc009dee76e03"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::lower_expr::arm_unary::lower_unary_expr: FunctionTooLong \u2014 perry_hir::lower::lower_expr::arm_unary::lower_unary_expr runs 335 significant 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 235 over it, 3.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/lower_expr/arm_unary.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f95e1b98cc879570f111069f18e3ef9c4ddbed8a0a02247e86e8e24f203be76"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::new_dynamic::lower: FunctionTooLong \u2014 perry_codegen::expr::new_dynamic::lower runs 334 significant 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 234 over it, 3.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/perry-codegen/src/expr/new_dynamic.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c8dfe8ec92678e671497784f43850d2a31fc65cf03c98671df7a5eb0d6cf82"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PerryBridge: TooManyMethods \u2014 100 methods. The bar is 30 methods; this is 70 over it, 3.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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e1dde853dee3f14fbfc61eaea1ebf08ad7ba2ac9828c6ed34d5db098154503"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/gen_rest.rs: FileTooLong \u2014 1658 significant 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 99% of them inside a single declaration: Gen (23-1982). The bar is 500 significant lines; this is 1158 over it, 3.32\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/perry-wpfacts/src/gen_rest.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"660a269ad99a78e145e74abffe341d5f2a994c6b479193588e45cbf325f1aa79"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower_decl/body_stmt.rs: FileTooLong \u2014 1643 significant 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 1143 over it, 3.29\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/perry-hir/src/lower_decl/body_stmt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9811305d3279d3238d4a91ef130bb2383ab2cd9c8438571987aec2a22aa0c2d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/map.rs: FileTooLong \u2014 1630 significant 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 100 free functions. The bar is 500 significant lines; this is 1130 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/perry-runtime/src/map.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1bac990a87ccac8b2e488eb8a668be0827756509ef7e0096eac2368e502512"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::monomorph::update_call_sites::update_call_sites_in_expr: FunctionTooLong \u2014 perry_hir::monomorph::update_call_sites::update_call_sites_in_expr runs 323 significant 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 223 over it, 3.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/perry-hir/src/monomorph/update_call_sites.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"595acdf35ae5ef693edfea573c42fee58c6f68bdabb9976f5e6471f04900d51e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::region_loop::lower_split: FunctionTooLong \u2014 perry_codegen::stmt::region_loop::lower_split runs 322 significant 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 222 over it, 3.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":"crates/perry-codegen/src/stmt/region_loop/mod.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f8256b464bd0daf997823a52057e5213dae14321836ffe34a3f4c508540144"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::property_set::lower: FunctionTooLong \u2014 perry_codegen::expr::property_set::lower runs 320 significant 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 220 over it, 3.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/perry-codegen/src/expr/property_set.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"395ab22d66480a17df11880f2f1e15d30e077a08130317f6b10da14bcad906df"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::run::remote::remote_build_and_launch: FunctionTooLong \u2014 perry::commands::run::remote::remote_build_and_launch runs 319 significant 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 219 over it, 3.19\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/perry/src/commands/run/remote.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"fabc0a201b0aa5458772b6abccc461411ef7b9f692a7f9e2cbb5dfadd6023361"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::new_alloc::emit_instance_alloc_inner: FunctionTooLong \u2014 perry_codegen::lower_call::new_alloc::emit_instance_alloc_inner runs 315 significant 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 215 over it, 3.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/perry-codegen/src/lower_call/new_alloc.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb0263d64fe4945ed9d03013054cae3a49434f76259d242d0d833939c404196"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::layout_desc::emit_module_layouts: FunctionTooLong \u2014 perry_codegen::layout_desc::emit_module_layouts runs 314 significant 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 214 over it, 3.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/perry-codegen/src/layout_desc.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"689978de2850eeba9d9183ea60c8037d9ad1885ff86292bd7128b7ba359bba41"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::monomorph::driver::collect_instantiations_in_expr: FunctionTooLong \u2014 perry_hir::monomorph::driver::collect_instantiations_in_expr runs 314 significant 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 214 over it, 3.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/perry-hir/src/monomorph/driver.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33c8f39091393fff2332a9a8056b8ea347f6ae6eef5f6d8dbaa3e09c7eada2d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::instanceof::dynamic_dispatch::js_instanceof_dynamic: FunctionTooLong \u2014 perry_runtime::object::instanceof::dynamic_dispatch::js_instanceof_dynamic runs 314 significant 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 214 over it, 3.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/perry-runtime/src/object/instanceof/dynamic_dispatch.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47a10bdf638471618a7c6a6d2c58045ea15b48ca657254168db3f176d101c50"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: walker/expr_mut.rs: FileTooLong \u2014 1561 significant 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 1061 over it, 3.12\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/perry-hir/src/walker/expr_mut.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb8a96cb20f06a989ad5f79c525cfbcf9925bcaa65dbd7b9e72115a5712a463"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: walker/expr_ref.rs: FileTooLong \u2014 1561 significant 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 1061 over it, 3.12\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/perry-hir/src/walker/expr_ref.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d1868e7f9d70f8369dfc183d634db485553cfbe7ee74a6bba6cf4f255878d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: inline/call_inliner.rs: FileTooLong \u2014 1557 significant 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 1057 over it, 3.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/perry-transform/src/inline/call_inliner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e63e92220e723e62307070501a6c60eb88350f7bcdb672be013f602116801d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::member_update::lower: FunctionTooLong \u2014 perry_codegen::expr::member_update::lower runs 311 significant 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 211 over it, 3.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/perry-codegen/src/expr/member_update.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8978dd773c2c1c5de05b3984663c0b51081454ce6c9fc72b326bf5ae74dc7cb0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::native::lower_native_method_call: FunctionTooLong \u2014 perry_codegen::lower_call::native::lower_native_method_call runs 311 significant 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 211 over it, 3.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/perry-codegen/src/lower_call/native/mod.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f549f810b0eae9c29c18124625369a0201177d2881700ca05be9e62aa6a900"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::hir_facts::collect_type_facts: FunctionTooLong \u2014 perry_codegen::collectors::hir_facts::collect_type_facts runs 308 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 208 over it, 3.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/hir_facts.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c84e5a73fef9e8aa22b0eac9213dde48b288dee1541d10a8496c698881ce006"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Gen.stand_in_fn_of: MethodTooLong \u2014 stand_in_fn_of runs 308 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 208 over it, 3.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/gen/import_values.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e1bb0bbe2b4ca2fd244850958ef948d65f957b6c92ae4a65498b7b65baf7fe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FuncEmitCtx.try_emit_expr_buffers: MethodTooLong \u2014 try_emit_expr_buffers runs 306 significant 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 206 over it, 3.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/perry-codegen-wasm/src/emit/expr/buffers.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f767c97791a5b72127ec082e6cd662c559e7c20ff8d3418551d3153faa290f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_call::lower_call_inner: FunctionTooLong \u2014 perry_hir::lower::expr_call::lower_call_inner runs 303 significant 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 203 over it, 3.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/mod.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"06bfb4eb4de18725367ed8ab6e232e6a16c26692c35228c72bcd744cc0dd7fef"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FuncEmitCtx.try_emit_expr_net_fetch_crypto: MethodTooLong \u2014 try_emit_expr_net_fetch_crypto 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/perry-codegen-wasm/src/emit/expr/net_fetch_crypto.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ae5ed8b1a496402f6b7775324dc111d6c74d0078ca1d6403ff1e18c79525b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::runtime_decls::stdlib_ffi::net_http::declare_net_http: FunctionTooLong \u2014 perry_codegen::runtime_decls::stdlib_ffi::net_http::declare_net_http runs 301 significant 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 201 over it, 3.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/perry-codegen/src/runtime_decls/stdlib_ffi/net_http.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4615cce0619f5bc10f879cd55ce2e1274b12ebd6764915ecd6d696a31c3c2bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::loops::match_object_array_write_loop: FunctionTooLong \u2014 perry_codegen::stmt::loops::match_object_array_write_loop runs 301 significant 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 201 over it, 3.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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":4574}}}],"partialFingerprints":{"codehealthFindingId/v1":"277fe8a166d644d39851b6baf0501d79aed8fdc4eadfa6fd34fab9792c336069"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::global_this::fetch_globals::js_fetch_or_value_super: FunctionTooLong \u2014 perry_runtime::object::global_this::fetch_globals::js_fetch_or_value_super runs 301 significant 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 201 over it, 3.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/perry-runtime/src/object/global_this/fetch_globals.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2c953508cee949e8b2790ffb286719164c5925ad350528754e7ca25a135b9a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ComposeEngine.up: MethodTooLong \u2014 up runs 299 significant 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 199 over it, 2.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/perry-container-compose/src/compose.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fdb77904c27ff4e9b81619ba1d33e9ea104789df36ea9c7b78d773baf26f71"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/gc_store_site_inventory.py: FileTooLong \u2014 1482 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 982 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":"scripts/gc_store_site_inventory.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4067bdf243f817b357714f8d28a4bd0dd2785e32fbd9cf2cd006319d78ac8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::global_this::install_static::install_builtin_constructor_statics: FunctionTooLong \u2014 perry_runtime::object::global_this::install_static::install_builtin_constructor_statics 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/perry-runtime/src/object/global_this/install_static.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a047624582b1b916cd4f1d2562d55769f10a3dea29d99784b8c91277968708"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::lowering_report::aggregate_record: FunctionTooLong \u2014 perry::commands::compile::lowering_report::aggregate_record 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/perry/src/commands/compile/lowering_report.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ab51853f62ff5643271ace5ea1883dff74a8f9477d6b918333d6e129a96656"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ir/expr.rs: FileTooLong \u2014 1473 significant 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 96% of them inside a single declaration: Expr (2 blocks, 57-2956). The bar is 500 significant lines; this is 973 over it, 2.95\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/perry-hir/src/ir/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc6dc704181bfaccaf76c7ee7986963abf7c8626e46d1dea9ebe18fe4a5fefb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::extern_func::lower_manifest_param: FunctionTooLong \u2014 perry_codegen::lower_call::extern_func::lower_manifest_param runs 294 significant 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 194 over it, 2.94\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/perry-codegen/src/lower_call/extern_func.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffcf95dc46c02a80f462bb7c96bad73a62b81e8b2f4e9f4b892ebe9ad49f7790"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_assign::lower_assignment_target: FunctionTooLong \u2014 perry_hir::lower::expr_assign::lower_assignment_target runs 293 significant 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 193 over it, 2.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":"crates/perry-hir/src/lower/expr_assign.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05aaa8bf01957d138bc896d702450b9c09ed64eb268ccb27dc245e17d2ed3d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/runtime_layouts.rs: FileTooLong \u2014 1461 significant 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 961 over it, 2.92\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/perry-runtime/src/object/runtime_layouts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c3df873a94b9276a664f97bd19399459ba8d55a46f6cf93c73775cb5fa0efd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Gen: TooManyFields \u2014 87 stored fields beside 215 methods. The bar is 30 stored fields; this is 57 over it, 2.90\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/perry-wpfacts/src/gen.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86a63a9438b6c9ac567556efea91c6e685d47668d30c5d36f84cec8053d5208"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower_types::infer_type_from_expr_inner: FunctionTooLong \u2014 perry_hir::lower_types::infer_type_from_expr_inner runs 290 significant 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 190 over it, 2.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/perry-hir/src/lower_types.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"de85c26662d52f8f2aad44588fc8aa31d3e0c371cbcb050d78d759b63f228be7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::check::run: FunctionTooLong \u2014 perry::commands::check::run runs 290 significant 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 190 over it, 2.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/perry/src/commands/check.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"685bb8140658a9afde6061692796f2c311169c51a97b01dfef2c371a34e9b730"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::destructuring::pattern_binding::lower_pattern_binding_into: FunctionTooLong \u2014 perry_hir::destructuring::pattern_binding::lower_pattern_binding_into 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/perry-hir/src/destructuring/pattern_binding.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"95dadbf39ca05b140abbc30db7eeb70b6d6f4cf3981247952343f71163ee79d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_stdlib::webcrypto::jwk::js_webcrypto_import_key: FunctionTooLong \u2014 perry_stdlib::webcrypto::jwk::js_webcrypto_import_key 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/perry-stdlib/src/webcrypto/jwk.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b103ee8491b0fccba17539c4cbc9688b0b35fe04e3c70565576d43269224c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collectors/hir_facts.rs: FileTooLong \u2014 1429 significant 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 929 over it, 2.86\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/perry-codegen/src/collectors/hir_facts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30a48198f5ab3ef8fac2d67d0de2e6e41f479a12a1a06295c2815bd2988e618"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: publish/mod.rs: FileTooLong \u2014 1422 significant 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 922 over it, 2.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/perry/src/commands/publish/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20511de17e88091e570fbf40be117a4c059448b1da9c4b6a1b3399f7c4eb62c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_android::widgets::canvas::repaint: FunctionTooLong \u2014 perry_ui_android::widgets::canvas::repaint runs 283 significant 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 183 over it, 2.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-android/src/widgets/canvas.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a5f182301ff6b68a478e76802891146d8961aeecfb5dd7ffb3de7a5c1b8db0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ext_http::server::handle_dispatch::js_ext_http_server_dispatch_method: FunctionTooLong \u2014 perry_ext_http::server::handle_dispatch::js_ext_http_server_dispatch_method runs 282 significant 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 182 over it, 2.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-http/src/server/handle_dispatch.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"296b256ee9505a4accc9a42e9ce4fd253d5bb8c2c783a7a7731f990419a1f82f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::element_shape_loop::lower_element_shape_versioned_for: FunctionTooLong \u2014 perry_codegen::stmt::element_shape_loop::lower_element_shape_versioned_for runs 281 significant 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 181 over it, 2.81\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/perry-codegen/src/stmt/element_shape_loop.rs"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fad4d96ae073564a985bbfdd3ae2f40ea7c39dbc847019e29e5370d432a5475"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_gc_effects::graph::classify: FunctionTooLong \u2014 perry_gc_effects::graph::classify runs 280 significant 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 180 over it, 2.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/perry-gc-effects/src/graph.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"43be87953057d2c408efaf45d07d901588b0d5d6ca6f192add56181fd8eda5d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dir_glob_watch/watch.rs: FileTooLong \u2014 1398 significant 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 91 free functions. The bar is 500 significant lines; this is 898 over it, 2.80\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/perry-runtime/src/fs/dir_glob_watch/watch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8a3a8919745188c748bd47c24d05df511749a002795645893a16008a05cbd5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/builtin_method.rs: FileTooLong \u2014 1396 significant 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 119 free functions. The bar is 500 significant lines; this is 896 over it, 2.79\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/perry-runtime/src/object/builtin_method.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"072546119e8d69de1d855802b95a88bc2275d609d59dafd31a8cd3bfa8266992"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::calls::fs::arm_fs: FunctionTooLong \u2014 perry_codegen::expr::calls::fs::arm_fs runs 279 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 179 over it, 2.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/calls/fs.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"7880461fb076a83fef7bcdd4fff2dddab8e085e038e520da0a11ff23698664b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::indexed_owner_loop::lower: FunctionTooLong \u2014 perry_codegen::stmt::indexed_owner_loop::lower runs 279 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 179 over it, 2.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/indexed_owner_loop.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b558c10f8414cd8cbbc66c749bccdd913bcf308b3e0b4db1469f469a3bd014"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::array_object_ops::define_array_property: FunctionTooLong \u2014 perry_runtime::object::array_object_ops::define_array_property runs 278 significant 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 178 over it, 2.78\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/perry-runtime/src/object/array_object_ops.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3875f0fb5c3b7c097b85ed1e0c9884a4b6583dd4aa14c5235aba4745cad1d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::optimized_libs::features::auto_optimized_cross_features: FunctionTooLong \u2014 perry::commands::compile::optimized_libs::features::auto_optimized_cross_features runs 277 significant 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 177 over it, 2.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/perry/src/commands/compile/optimized_libs/features.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"095b44adec8392fd2fa0e99d5d1cecf77d30af4680afdb84e8954712f4800720"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_macos::lib_ffi::advanced_widgets: TooManyFunctions \u2014 83 free functions. The bar is 30 free functions; this is 53 over it, 2.77\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/perry-ui-macos/src/lib_ffi/advanced_widgets.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5698f447ae98642bba4431c7782457dcf877a2f926daa43704db7962b02114"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/wpfacts_recompute.py: FileTooLong \u2014 1367 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 867 over it, 2.73\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":"scripts/wpfacts_recompute.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edcebb3f0622bc7e0a7692a90fd43f9e0f77c1d0db37900e1053e39cbce443e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analysis/value_types.rs: FileTooLong \u2014 1360 significant 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 860 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/perry-hir/src/analysis/value_types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"297d71e5b53d4c8463278ead43dfaeff54efe117ae4c12dd39869f1e5abdeab1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FuncEmitCtx.emit_method_call: MethodTooLong \u2014 emit_method_call runs 272 significant 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 172 over it, 2.72\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/perry-codegen-wasm/src/emit/method_call.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"427fee4688e122de1d486dc78c3b61647a3c7fcf3fd2500413cd054d73bc1f8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::destructuring::var_decl::lower_var_decl_with_destructuring: FunctionTooLong \u2014 perry_hir::destructuring::var_decl::lower_var_decl_with_destructuring runs 272 significant 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 172 over it, 2.72\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/perry-hir/src/destructuring/var_decl.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa35e5bf4c7ae45b55c4065f309c5b1202344d2563e760668c2fa62be3213bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::lower_expr::arm_optchain::lower_opt_chain_expr: FunctionTooLong \u2014 perry_hir::lower::lower_expr::arm_optchain::lower_opt_chain_expr runs 271 significant 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 171 over it, 2.71\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/perry-hir/src/lower/lower_expr/arm_optchain.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf1db6fade4df790257eda88615eca7b5bf60a481cd16eed0d4fbc19c0d7e2d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::finally_inline::process_stmts: FunctionTooLong \u2014 perry_transform::finally_inline::process_stmts runs 271 significant 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 171 over it, 2.71\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/perry-transform/src/finally_inline.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f47c289d655e9016b5c1a948a2f6cccf4aa8f1ec9725861f0b014f2bd627abf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::strip_dedup::strip_duplicate_objects_from_lib_with_evidence: FunctionTooLong \u2014 perry::commands::compile::strip_dedup::strip_duplicate_objects_from_lib_with_evidence runs 271 significant 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 171 over it, 2.71\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/perry/src/commands/compile/strip_dedup.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af224955ca3b14a70e139dca8b07dbf970488664abc4b9668f9388b98c62f12"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1352 significant 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 381 free functions. The bar is 500 significant lines; this is 852 over it, 2.70\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/perry-ui-watchos/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64f133b4dc2ed4d5f679d0de5e5aa6a136827a442f01d3be995bbf985173042"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_macos::lib_ffi::window_misc: TooManyFunctions \u2014 81 free functions. The bar is 30 free functions; this is 51 over it, 2.70\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/perry-ui-macos/src/lib_ffi/window_misc.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2e431bef8af48aef933b0069bfa46eb020e9acae6fe87dd373a4835e862afa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_wpfacts::builtins::ns_method: FunctionTooLong \u2014 perry_wpfacts::builtins::ns_method 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/perry-wpfacts/src/builtins.rs"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"2045e964636349f5052900b9a2de6c1c948f45318debf9f84b7ce1179aa589f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::index_get::guarded_array::lower_guarded_array_index_get_with_index: FunctionTooLong \u2014 perry_codegen::expr::index_get::guarded_array::lower_guarded_array_index_get_with_index runs 269 significant 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 169 over it, 2.69\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/perry-codegen/src/expr/index_get/guarded_array.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3f56aa564d49547d710362640fcd35093ce818c09a4ab791f813124521c3fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/node_inspector.rs: FileTooLong \u2014 1343 significant 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 109 free functions. The bar is 500 significant lines; this is 843 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/perry-runtime/src/node_inspector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14234a5d759401e61c15372ae35558ff16f74458aa42c3e21530a58d6443ef76"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::descriptors::js_object_get_own_property_names_shape: FunctionTooLong \u2014 perry_runtime::object::descriptors::js_object_get_own_property_names_shape runs 268 significant 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 168 over it, 2.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/descriptors.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"13905b72583491444c399f308a4504fb2ed9ac44848064c621df848112eb2d67"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::setup::macos::macos_wizard: FunctionTooLong \u2014 perry::commands::setup::macos::macos_wizard runs 268 significant 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 168 over it, 2.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/setup/macos.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d399759fbe0ede292d32d2eb42d2d93eaaa11241f8d3f608685b7bba1f5b45"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::dns::ffi: TooManyFunctions \u2014 80 free functions. The bar is 30 free functions; this is 50 over it, 2.67\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/perry-runtime/src/dns/ffi.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"54282133dfb7b907424d46bcb2c00dd2b388d993762896efe9382f7632df1738"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/native_call_method.rs: FileTooLong \u2014 1333 significant 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 833 over it, 2.67\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/perry-runtime/src/object/native_call_method.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b87856679338d4a8cc74a124b9a93b2f16ecd36766ec003aaef1c370a0b906"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower_call/method_override.rs: FileTooLong \u2014 1332 significant 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 832 over it, 2.66\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/perry-codegen/src/lower_call/method_override.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4833113920f26fa49eeeddb0af699b37ddd50710127262ff5270021dad46dee7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/mod.rs: FileTooLong \u2014 1331 significant 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 73 free functions. The bar is 500 significant lines; this is 831 over it, 2.66\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/perry-ui-windows/src/widgets/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2754bcbb321967480c5688b9ff9bfe24783f36251cca0c40408a0569739e7a53"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::field_init::apply_field_initializers_recursive: FunctionTooLong \u2014 perry_codegen::lower_call::field_init::apply_field_initializers_recursive runs 266 significant 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 166 over it, 2.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/perry-codegen/src/lower_call/field_init.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96fb2f3c734d0cd70fdbeff2f41dfd76da16d0110d9841f55c0d2f26e0f9861"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: emit/exprs_more.rs: FileTooLong \u2014 1325 significant 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 100% of them inside a single declaration: JsEmitter (4-1696). The bar is 500 significant lines; this is 825 over it, 2.65\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/perry-codegen-js/src/emit/exprs_more.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a4478aa2847979eed9dc6b9959d4b497a82776b4c5e36a3d1ff91163b8b5af"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stmt/stable_packed_loop.rs: FileTooLong \u2014 1325 significant 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 825 over it, 2.65\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/perry-codegen/src/stmt/stable_packed_loop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d047ee4f1195876143af2c6eb46f6e6065fe490d5028f35a9bc879132f859cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::builtins::table::js_console_table_with_properties: FunctionTooLong \u2014 perry_runtime::builtins::table::js_console_table_with_properties runs 264 significant 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 164 over it, 2.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/builtins/table.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d0638e4a8534d3683ce73997abad04a2cce47b8ef6423ec823356447ab1c40"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Gen.stand_in_class: MethodTooLong \u2014 stand_in_class runs 264 significant 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 164 over it, 2.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/gen/class_values.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed27b21aece7e5bea5ad6084bf717381432d5cef42ca2d61651f8bc4a8caf75"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ext_net::payload_prototype: TooManyFunctions \u2014 79 free functions. The bar is 30 free functions; this is 49 over it, 2.63\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/perry-ext-net/src/payload_prototype.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4364f83f8494a58cc432b65c02a1af3f9bfe228d1c8bb536108df5e6c66e2a9b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compile/collect_modules.rs: FileTooLong \u2014 1310 significant 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 810 over it, 2.62\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/perry/src/commands/compile/collect_modules.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"344982a89274bf2662926e799b5eb9fa72cb7d889ea4b1c248dcb0d49c3dd4c9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_macos::lib_ffi::core_widgets: TooManyFunctions \u2014 78 free functions. The bar is 30 free functions; this is 48 over it, 2.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/perry-ui-macos/src/lib_ffi/core_widgets.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d794eeca3555c567d2bcefe38399b252414063fdcb7b6ad67d8591cdeafdf551"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FuncEmitCtx.try_emit_expr_url_process_path: MethodTooLong \u2014 try_emit_expr_url_process_path runs 260 significant 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 160 over it, 2.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/perry-codegen-wasm/src/emit/expr/url_process_path.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71072724ecaca56dc115c87c05cf46ca206fa36c098c3156a4dde2415d7efa0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/node_stream_event_emitter.rs: FileTooLong \u2014 1299 significant 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 95 free functions. The bar is 500 significant lines; this is 799 over it, 2.60\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/perry-runtime/src/node_stream_event_emitter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81aa99cec354abdbf39015577509af447c4e8d83b82affe53e0255ef2ed5bb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::native_call_method::typed_array::dispatch_typed_array_method: FunctionTooLong \u2014 perry_runtime::object::native_call_method::typed_array::dispatch_typed_array_method runs 259 significant 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 159 over it, 2.59\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/perry-runtime/src/object/native_call_method/typed_array.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"016640f9e8fcbd32dc0d6257230f0405928f8573559f7cfb401c5fcb42f23ffb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_wpfacts::decl_units::views: FunctionTooLong \u2014 perry_wpfacts::decl_units::views runs 259 significant 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 159 over it, 2.59\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/perry-wpfacts/src/decl_units.rs"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"9520775584235f7e6d46cb8a7bc83873e65140ed7d1da6250111653a516420a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: layout_desc/create_families.rs: FileTooLong \u2014 1293 significant 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 793 over it, 2.59\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/perry-codegen/src/layout_desc/create_families.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfffa1bf480ece3659442c6a6ee5910a08e10d3f10bb2df077bbb90ecd6da17a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/i32_fast_path.rs: FileTooLong \u2014 1289 significant 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 62 free functions. The bar is 500 significant lines; this is 789 over it, 2.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/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b11270c9cf20afd789e241e3e8e716d5aa31d915ce9da99d4f814cacd5ca84"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/builtins.rs: FileTooLong \u2014 1288 significant 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 788 over it, 2.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/perry-wpfacts/src/builtins.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d13a5a9970c97772a1d46b48958f5a5e8571fd93884731889afab469c1ef2cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fs/filehandle.rs: FileTooLong \u2014 1286 significant 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 101 free functions. The bar is 500 significant lines; this is 786 over it, 2.57\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/perry-runtime/src/fs/filehandle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f45547b60ac87e62d5428c2c592ca2e4ecb4526abe56ca02dcf5f1fa7685ad"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_tvos::ffi::advanced_widgets: TooManyFunctions \u2014 77 free functions. The bar is 30 free functions; this is 47 over it, 2.57\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/perry-ui-tvos/src/ffi/advanced_widgets.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ace09b2d2e4fb3b64f9ed8a29040e01e7af21f161c7004dca28e930caa0423"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_visionos::ffi_widgets_extra: TooManyFunctions \u2014 77 free functions. The bar is 30 free functions; this is 47 over it, 2.57\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/perry-ui-visionos/src/ffi_widgets_extra.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"32873ca766da0f5889e52f0fe037ca4c3439fe61940fd48fa3d0b5aa1e222516"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/intl.rs: FileTooLong \u2014 1282 significant 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 52 free functions. The bar is 500 significant lines; this is 782 over it, 2.56\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/perry-runtime/src/intl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd22654ad644dd070be2ad869672c68aac93b43ab111ef0fad9c16e8c42d1a0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FuncEmitCtx.try_emit_expr_date_error: MethodTooLong \u2014 try_emit_expr_date_error runs 256 significant 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 156 over it, 2.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/emit/expr/date_error.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"90aef16c5a1a51b17c16b5f127497ae58f857e83ea2e40844eba4522e330806e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::assign::object_assign_one: FunctionTooLong \u2014 perry_runtime::object::assign::object_assign_one runs 256 significant 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 156 over it, 2.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/assign.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fd5fee150f4c064cadf1a99a3b720a9cc08105420011079d163ad9f6252e2f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Gen: ClassTooLong \u2014 1020 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 215 methods, 2 blocks, lines 93-1616. The bar is 400 significant lines; this is 620 over it, 2.55\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/perry-wpfacts/src/gen.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"9885b24cde2884e09c367dfa59446a2c07c378412daa44e5f3c232ac0a416f65"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resolve/native_library.rs: FileTooLong \u2014 1274 significant 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 774 over it, 2.55\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/perry/src/commands/compile/resolve/native_library.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b0ae29432eeb8b978428b2c430f49868278c61b3bbd57af08011bb12bed2b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_call::url_date_instance::try_url_date_weakref_instance: FunctionTooLong \u2014 perry_hir::lower::expr_call::url_date_instance::try_url_date_weakref_instance runs 254 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 154 over it, 2.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/url_date_instance.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"840c066d14a26f081a827dc393a74f59f3a84ff36dfcaaefb8bafcbe67a06acc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::intl::date_collator::format_parts_with_dtf_obj: FunctionTooLong \u2014 perry_runtime::intl::date_collator::format_parts_with_dtf_obj runs 254 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 154 over it, 2.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/intl/date_collator.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"60eac6949e0a8e47a2f7a31b509b84dabb61d791389396b38aea0e0f93bd3e1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower/stmt_loops.rs: FileTooLong \u2014 1269 significant 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 769 over it, 2.54\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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2c168ce5758cdb1b099da2f1616483db0a99d55a29547e5d5c778b1cbedcc9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/payload_socket.rs: FileTooLong \u2014 1267 significant 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 767 over it, 2.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/perry-ext-net/src/payload_socket.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07f4bada38663a9340ad0a3636e0b485ba206c8fbad43b78169497e2e6d0965"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fs/stream.rs: FileTooLong \u2014 1267 significant 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 84 free functions. The bar is 500 significant lines; this is 767 over it, 2.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/perry-runtime/src/fs/stream.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3954fdfeca84ff2fd78840d9ce30513686a09ca5f21ddb225c9d1f393addbfde"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analysis/fn_infer.rs: FileTooLong \u2014 1265 significant 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 765 over it, 2.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/perry-hir/src/analysis/fn_infer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac95904e99c9dbb7eabe9eff29bad3a41d6816777bfe3bcd8ed7eb9522738ff0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::console_promise::try_lower_console_call: FunctionTooLong \u2014 perry_codegen::lower_call::console_promise::try_lower_console_call runs 253 significant 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 153 over it, 2.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/perry-codegen/src/lower_call/console_promise.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b92488b7ea3b965c903086eb90cbcacce1b46347212d243ee0edbb0e893d876"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::root_reload::apply_to_function: FunctionTooLong \u2014 perry_codegen::root_reload::apply_to_function runs 253 significant 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 153 over it, 2.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/perry-codegen/src/root_reload.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f606b924ec03bf907878963d4a5d1eeb46117776d726009329fdaedb6307b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::stable_packed_loop::try_lower_index_get: FunctionTooLong \u2014 perry_codegen::stmt::stable_packed_loop::try_lower_index_get runs 253 significant 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 153 over it, 2.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/perry-codegen/src/stmt/stable_packed_loop.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6c79484c3978a6547f9e43eff01609f5dec9c42fe0eadb332287dc4c07d793"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/solve.rs: FileTooLong \u2014 1262 significant 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 99% of them inside a single declaration: Model (27-1890). The bar is 500 significant lines; this is 762 over it, 2.52\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/perry-wpfacts/src/solve.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cf7053d873392838485a679169b111e7882f8f86c3faa390618d9f8fa83dd8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Host.new_prepared: MethodTooLong \u2014 new_prepared runs 252 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 152 over it, 2.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-component-host/src/lib.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be27a5964ccfa9d3a9ce5d1f03fa26116080bb69194b4a2e859786002e67e0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::json::stringify_object::stringify_object_walk: FunctionTooLong \u2014 perry_runtime::json::stringify_object::stringify_object_walk runs 252 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 152 over it, 2.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/json/stringify_object.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce01267ffb7663a088174336f75b7b41c096daeba01424dd327753aff87fcb6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node_submodules/mod.rs: FileTooLong \u2014 1259 significant 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 57 free functions. The bar is 500 significant lines; this is 759 over it, 2.52\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/perry-runtime/src/node_submodules/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c613343fd866ee8f6f2b2c582cd3e3e4c74ba025c98251c881d01e2b5989ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gc/cycle.rs: FileTooLong \u2014 1258 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 65% of them inside a single declaration: GcCycleState (3 blocks, 614-1937). The bar is 500 significant lines; this is 758 over it, 2.52\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/perry-runtime/src/gc/cycle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"475cf0ade3a26b2477935337a980e9f5419d983e86473e09f813d0c56ac64bcd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/aggregate_scalar.rs: FileTooLong \u2014 1257 significant 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 757 over it, 2.51\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/perry-transform/src/aggregate_scalar.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6f0a670082f5b88a83e864d20752cb6897e8792f20c650cc37f0a40f92f3ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime_decls/strings.rs: FileTooLong \u2014 1255 significant 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 755 over it, 2.51\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/perry-codegen/src/runtime_decls/strings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8e26eab64c1541ba9acb5c795b0b83b2f7745fa7c9dc4ec4b7e8fa04ce687a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::element_shape_loop::match_element_shape_versioned_loop: FunctionTooLong \u2014 perry_codegen::stmt::element_shape_loop::match_element_shape_versioned_loop runs 251 significant 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 151 over it, 2.51\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/perry-codegen/src/stmt/element_shape_loop.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a35d5c71c15c14aead0b13986223f5cfe85adb8ed92024c351d49e8f86cbeb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/node_stream.rs: FileTooLong \u2014 1254 significant 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 124 free functions. The bar is 500 significant lines; this is 754 over it, 2.51\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/perry-runtime/src/node_stream.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"990e1211761b2a7144690f6da677a9f0bb2f1d7757ab037eaf4cfb72b9794638"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stream/utf8_stream.rs: FileTooLong \u2014 1253 significant 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 99 free functions. The bar is 500 significant lines; this is 753 over it, 2.51\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/perry-runtime/src/fs/stream/utf8_stream.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef016c19cf54089d7f7b986148289c0afb9bfcc0ba7ee588e2dbf18a15accf63"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: intl/date_collator.rs: FileTooLong \u2014 1253 significant 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 753 over it, 2.51\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/perry-runtime/src/intl/date_collator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"554e30807075a4c45b1fc585348c75900eee1c1036b8b337357a3e58bb89a601"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/set.rs: FileTooLong \u2014 1251 significant 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 751 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/perry-runtime/src/set.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d656509755cd7370956bb12acaae5f21f9f3d6a8b0ce03c3b8f99ebebb3e6f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::property_get::static_dispatch::try_lower_static_dispatch: FunctionTooLong \u2014 perry_codegen::lower_call::property_get::static_dispatch::try_lower_static_dispatch runs 250 significant 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 150 over it, 2.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/property_get/static_dispatch.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff92a4d0d3de8df8051015303a88199a589b2fb2a8c4a6fb98456eb4956e050"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/contracts.rs: FileTooLong \u2014 1246 significant 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 746 over it, 2.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/perry-wpfacts/src/lib/contracts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6fac01d8710ae5a8299cc711325c7a5d77b926ac95e9436110628765404a96"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::generator::private_frame::lower_list: FunctionTooLong \u2014 perry_transform::generator::private_frame::lower_list runs 249 significant 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 149 over it, 2.49\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/perry-transform/src/generator/private_frame.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb096dd3a49df7592fa982712976b0040414d71b5e7680c56ccfa4d02fcf9296"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gc/telemetry.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). 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/perry-runtime/src/gc/telemetry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a975fbbb5638fc1b88f5ba4a1ae098a67d68aaca0871668e0be6a5cdbad8193a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/compare.rs: FileTooLong \u2014 1231 significant 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 731 over it, 2.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/compare.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a762c5ddc0ed57baa966dd212cfc35707c3bd8242dc2bb87842d5eea3324851"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FuncEmitCtx.emit_stmt: MethodTooLong \u2014 emit_stmt runs 246 significant 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 146 over it, 2.46\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/perry-codegen-wasm/src/emit/stmt.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef379bad29873b135b8d30de85a20e329e9fe4765e762defe12e6350729db9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: turnloop/server_ab.py: FileTooLong \u2014 1228 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 728 over it, 2.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/server_ab.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7084c8e6f451479cbc23a95efc667a4831ada82503f61610e571a4b176dd1772"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collectors/i32_locals.rs: FileTooLong \u2014 1228 significant 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 728 over it, 2.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"178241b73675eef80224528491cc99af563a47cba75b829edcb3a0531a93040d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::env_clones::lower: FunctionTooLong \u2014 perry_codegen::expr::env_clones::lower runs 245 significant 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 145 over it, 2.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/perry-codegen/src/expr/env_clones.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e78d1c85700d161fe9adb91b91e8b2a6bcde1c7388eddb28c04a80f4055a04e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::type_analysis::refine::refine_type_from_init: FunctionTooLong \u2014 perry_codegen::type_analysis::refine::refine_type_from_init runs 245 significant 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 145 over it, 2.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/perry-codegen/src/type_analysis/refine.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52c4f243bcbc2c92587182bba9bea9c1ebdb669791d54a60162cbb48687d47c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::intl::number_format_options::configure_number_format: FunctionTooLong \u2014 perry_runtime::intl::number_format_options::configure_number_format runs 244 significant 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 144 over it, 2.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/perry-runtime/src/intl/number_format_options.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"733d91866474b3f36dca61c3f4ec420897c650c56be3204f547809a99e55a615"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::inline::inline_functions_inner: FunctionTooLong \u2014 perry_transform::inline::inline_functions_inner runs 244 significant 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 144 over it, 2.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/perry-transform/src/inline/mod.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"46aafc78ff0b83a51f6319e1fb00e8df091debc3330cc134f1c6c3025a7adb01"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/node_stream_readwrite.rs: FileTooLong \u2014 1218 significant 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 136 free functions. The bar is 500 significant lines; this is 718 over it, 2.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/node_stream_readwrite.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9072d10e21faa448daa0fcc5a1a96b92299e4b4680de9e76e60e22e4b5f1e68e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: property_get/dynamic_dispatch.rs: FileTooLong \u2014 1211 significant 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 711 over it, 2.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/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02584df494d4b2f1556d04375372d5738272da93652f38bd028f399fdc19ab61"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tls.rs: FileTooLong \u2014 1209 significant 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 79 free functions. The bar is 500 significant lines; this is 709 over it, 2.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/perry-stdlib/src/tls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0ba7839a1873562b5c0b81be4ef40bc1b2d249d538953c7fd925a404695e37"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::closure::lower: FunctionTooLong \u2014 perry_codegen::expr::closure::lower 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/perry-codegen/src/expr/closure.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"78517d6f693f90c192defccc54b226731960fc0226eb3571d5298542fe9fd613"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::native_module_dispatch::lower_native_module_dispatch: FunctionTooLong \u2014 perry_codegen::lower_call::native_module_dispatch::lower_native_module_dispatch 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/perry-codegen/src/lower_call/native_module_dispatch.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8fa8a2ae41f073cead91d80b4ed28878bc18878cadebbe7f67bbb38f97c08e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::runtime_layouts::runtime_layout_word: FunctionTooLong \u2014 perry_runtime::object::runtime_layouts::runtime_layout_word 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/perry-runtime/src/object/runtime_layouts.rs"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"6413b9c52a15f447d0c34f53c4f17db8bd7b2a68084b9898821729a6236dc22e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::object::global_this::builtin_thunks: TooManyFunctions \u2014 72 free functions. The bar is 30 free functions; this is 42 over it, 2.40\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/perry-runtime/src/object/global_this/builtin_thunks.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1d6f13054f6687ba5345462a8a10ef53dde754b8bbdf177778bff85c67abcf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_android::ffi::canvas_picker: TooManyFunctions \u2014 72 free functions. The bar is 30 free functions; this is 42 over it, 2.40\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/perry-ui-android/src/ffi/canvas_picker.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9541059cd1092cfba8e5128a34b84d48c206d962ff4cae08e77136799b2ab853"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compiler_output_harness/verification.py: FileTooLong \u2014 1199 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 699 over it, 2.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/compiler_output_harness/verification.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"204b7db83483423e9bba5de1c41a6d7f4ca9e51b00184ab0e45db3e549ec9923"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: process/node_module.rs: FileTooLong \u2014 1190 significant 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 690 over it, 2.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/perry-runtime/src/process/node_module.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56bd87ce20b1805e5c998d663af9009bd7c14bd3b63cc57c66e58bad6ee19b29"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::node_inspector::runtime_evaluate: FunctionTooLong \u2014 perry_runtime::node_inspector::runtime_evaluate runs 238 significant 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 138 over it, 2.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/perry-runtime/src/node_inspector.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2da937f514e8010094e002b0c1ed0e24f4f84251e76d2ae826b6b80bc616be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/native_abi_evidence_report.py: FileTooLong \u2014 1189 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 689 over it, 2.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":"scripts/native_abi_evidence_report.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab5f108c5a5313756ec414e1be626e63d09ffc0ab4ce07bba135899d0b21ff9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/this_super_call.rs: FileTooLong \u2014 1189 significant 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 689 over it, 2.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/perry-codegen/src/expr/this_super_call.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a39378c3d7ed63420f24073fc0a75d889f8caae7c309675ac8ff63fd969233b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/async_hooks.rs: FileTooLong \u2014 1189 significant 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 87 free functions. The bar is 500 significant lines; this is 689 over it, 2.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/perry-runtime/src/async_hooks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25ba6665bae9fe1fa1557ce22ee5d0cb3a78abd165bc6a32725f390d44f7dd2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/summary.rs: FileTooLong \u2014 1186 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 68% of them inside a single declaration: Model (572-1899). The bar is 500 significant lines; this is 686 over it, 2.37\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/perry-wpfacts/src/summary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea15f7912883469cce63df13e0c6ff0d9c29645ebaf40f8942c475d3105eb4e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/PerryBridge.kt: FileTooLong \u2014 1181 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 681 over it, 2.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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28297edccb705356dcc76eb1f79ae2a8b985d9ba6510128e3f9411ad43924a64"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: emit/compile.rs: FileTooLong \u2014 1181 significant 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 100% of them inside a single declaration: WasmModuleEmitter (8-1674). The bar is 500 significant lines; this is 681 over it, 2.36\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/perry-codegen-wasm/src/emit/compile.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b4495fa3035dd3e6ba8cd38158d3042b1e184f88df6385876bf1d386e50594"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/gen_expr.rs: FileTooLong \u2014 1177 significant 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 100% of them inside a single declaration: Gen (16-1545). The bar is 500 significant lines; this is 677 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/perry-wpfacts/src/gen_expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3945638287ed6fd96bf5078605202e2c570e2e1288b4a03a6d1fbd4f1caa378e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::object_ops::keys_array::ensure_key_in_keys_array_inner: FunctionTooLong \u2014 perry_runtime::object::object_ops::keys_array::ensure_key_in_keys_array_inner runs 235 significant 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 135 over it, 2.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/object_ops/keys_array.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0feb3e3c5abfd0261eed846e915cec3f457e81cb8f925f212cf067345378a7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::resolve::native_library::parse_native_abi_descriptor: FunctionTooLong \u2014 perry::commands::compile::resolve::native_library::parse_native_abi_descriptor runs 235 significant 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 135 over it, 2.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/resolve/native_library.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5a70ab5a59e04c5b40f560d1cb9e5ccb664ee76a3bdeb1f15a27620549e889"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::js_transform::local_natives::fix_native_instance_expr_with_locals: FunctionTooLong \u2014 perry_hir::js_transform::local_natives::fix_native_instance_expr_with_locals runs 234 significant 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 134 over it, 2.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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb5b30174104442c50b5d13d68d85dd83e99ac4a3e5aaed07d131567d70a279"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: JniCache: TooManyFields \u2014 70 stored fields. The bar is 30 stored fields; this is 40 over it, 2.33\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/perry-ui-android/src/jni_bridge.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9916cd97f5552761ef45c1386fc58c7d3f0dce6a87c5efb2ea327fcf9277a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/descriptors.rs: FileTooLong \u2014 1165 significant 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 665 over it, 2.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/perry-runtime/src/object/descriptors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1e182e2379debe1c73b57ae4a902959a2cff2b127bdca4c2c19281d9445c8e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::static_field_meta::lower_class_evaluation_object: FunctionTooLong \u2014 perry_codegen::expr::static_field_meta::lower_class_evaluation_object runs 233 significant 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 133 over it, 2.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/perry-codegen/src/expr/static_field_meta.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2e77f8976a321f099a369c984dac13dbb549b1cbfc1bf80287badbb303b547"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::versioned_indexed_loop::lower: FunctionTooLong \u2014 perry_codegen::stmt::versioned_indexed_loop::lower runs 233 significant 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 133 over it, 2.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/perry-codegen/src/stmt/versioned_indexed_loop.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cedff37e9512b44251665b547af0dc58dc1a0a99764acac18a7987a2ccb239f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_call::native_module::process_module::try_process_module_methods: FunctionTooLong \u2014 perry_hir::lower::expr_call::native_module::process_module::try_process_module_methods runs 233 significant 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 133 over it, 2.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/perry-hir/src/lower/expr_call/native_module/process_module.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb7c165ebd97a9702a96683f074b04e04415099a8050ad22105d6d75b3f2b23"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/gc_1090_evidence_report.py: FileTooLong \u2014 1164 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 664 over it, 2.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":"scripts/gc_1090_evidence_report.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a75385dfeafbf3cac910851360930993908033b10ed5d68e8b60b7f1a5ad8d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/bigint_set.rs: FileTooLong \u2014 1162 significant 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 662 over it, 2.32\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/perry-codegen/src/expr/bigint_set.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73bcfd90e6e168b3109bd3e214b0430ae755513e4f922a0f0a7ae4445195df1a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gc/roots.rs: FileTooLong \u2014 1160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 50 free functions. The bar is 500 significant lines; this is 660 over it, 2.32\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/perry-runtime/src/gc/roots.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04070b8d4b3e43e60d605affc93475e4a51ccd8370976be939d1253d90659659"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stmt/indexed_owner_loop.rs: FileTooLong \u2014 1159 significant 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 659 over it, 2.32\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/perry-codegen/src/stmt/indexed_owner_loop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71383db7e1a12f4c6d6f2d6b2f243d1bea6ce9004f68d3a7e1b4bcb377879a90"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/webassembly.rs: FileTooLong \u2014 1159 significant 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 68 free functions. The bar is 500 significant lines; this is 659 over it, 2.32\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/perry-runtime/src/webassembly.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1beb9e39f67a11076a556a358f40eba425d51b5d0fcaf8ed76fc77c5a21b22f7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LlBlock: ClassTooLong \u2014 926 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 107 methods, 2 blocks, lines 404-1962. The bar is 400 significant lines; this is 526 over it, 2.32\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/perry-codegen/src/block.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12437ea59d0c9c7a3b248ee1849b2f4b515a5da1c2295c13107f58113502b4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/node_vm.rs: FileTooLong \u2014 1156 significant 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 106 free functions. The bar is 500 significant lines; this is 656 over it, 2.31\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/perry-runtime/src/node_vm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73989dfecc23fcd1f8f8a102fe5725a97937dd9fa664a02d98f6d21619541c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_call::static_and_instance::try_static_method_and_instance: FunctionTooLong \u2014 perry_hir::lower::expr_call::static_and_instance::try_static_method_and_instance 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/perry-hir/src/lower/expr_call/static_and_instance.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab334437068b3f6c43b52f29288784ab5a0c23b9e63801d2ff2348e200917b51"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fs/mod.rs: FileTooLong \u2014 1152 significant 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 104 free functions. The bar is 500 significant lines; this is 652 over it, 2.30\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/perry-runtime/src/fs/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb458c65c1aa887b80eac4b9a78c682573ac90ba566158196fdb7c9aef0d5f01"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tls.rs: FileTooLong \u2014 1151 significant 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 78 free functions. The bar is 500 significant lines; this is 651 over it, 2.30\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/perry-runtime/src/tls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2446e271521f346919ee97b11d4dbc94e5a794385c301e9ea6ad1fac3d969b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::runtime_decls::arrays::declare_phase_b_arrays: FunctionTooLong \u2014 perry_codegen::runtime_decls::arrays::declare_phase_b_arrays 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/perry-codegen/src/runtime_decls/arrays.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d9241cdd34f037d9eb3944a4c04c74eaa18be66f95f82c17ce1a6721cad9c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_component_host::task_exit::instrument::instrument: FunctionTooLong \u2014 perry_component_host::task_exit::instrument::instrument 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/perry-component-host/src/task_exit/instrument.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"467af7005b92aa7374cba51a4f90c14ccd69d187806833fcdf575d5eec076cde"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::lower_expr::arm_class::lower_class_expr: FunctionTooLong \u2014 perry_hir::lower::lower_expr::arm_class::lower_class_expr runs 229 significant 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 129 over it, 2.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/perry-hir/src/lower/lower_expr/arm_class.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"03282d39594602a4b91307c9b177bce732009f6547d320dad9688d906f9ece6c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::size_report::build_report: FunctionTooLong \u2014 perry::commands::compile::size_report::build_report runs 229 significant 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 129 over it, 2.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/perry/src/commands/compile/size_report.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5610db0b721f4353eb884f476009520399e7dbe4a349fbea8e3dbc5939a0029"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/app.rs: FileTooLong \u2014 1141 significant 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 641 over it, 2.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/perry-ui-macos/src/app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1119479fbc0610b7f7d6f833bea5c2114d5fa902fbbf86fd704319e5c6c33525"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/console.rs: FileTooLong \u2014 1140 significant 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 90 free functions. The bar is 500 significant lines; this is 640 over it, 2.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/perry-runtime/src/builtins/console.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"973cf13ba5d0f15b1392a3cc8d295395fb841c914466d275d349b951eac671e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: server/handle_dispatch.rs: FileTooLong \u2014 1135 significant 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 635 over it, 2.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-http/src/server/handle_dispatch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d6ad6c36b7b3232ff33750ecb42284f76cdd1b60746eb723593cdee2b3c155"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_stdlib::worker_threads::channel_pump::js_worker_threads_channels_process_pending: FunctionTooLong \u2014 perry_stdlib::worker_threads::channel_pump::js_worker_threads_channels_process_pending 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/perry-stdlib/src/worker_threads/channel_pump.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7a2e11ee5b74783a542d6582a204dd901fa0d64924e536314b85fcbbadb206"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_visionos::ffi_system: TooManyFunctions \u2014 68 free functions. The bar is 30 free functions; this is 38 over it, 2.27\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/perry-ui-visionos/src/ffi_system.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8cd80816768bb99dfaea1f61e25c0d76ec860cdabbb1b0d3f82dcea4bc9efd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::method_site::emit_method_site: FunctionTooLong \u2014 perry_codegen::expr::method_site::emit_method_site 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/perry-codegen/src/expr/method_site.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1b7ed5429086f57b5ea083a27119653e4e68a6067929be81d493a4b7e88f2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::runtime_decls::stdlib_ffi::third_party::declare_third_party: FunctionTooLong \u2014 perry_codegen::runtime_decls::stdlib_ffi::third_party::declare_third_party 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/perry-codegen/src/runtime_decls/stdlib_ffi/third_party.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"493df0bafe0be1337afe4893b6b6cb7ec041e372c592654e69fa77e4ca1ea544"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: global_this/proto_methods.rs: FileTooLong \u2014 1128 significant 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 628 over it, 2.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/perry-runtime/src/object/global_this/proto_methods.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8daff8665c4be1617bca74157e0af5abd6e0e151cb6c5764502d8555a6c07b0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gen/export.rs: FileTooLong \u2014 1127 significant 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 100% of them inside a single declaration: Gen (11-1898). The bar is 500 significant lines; this is 627 over it, 2.25\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/perry-wpfacts/src/gen/export.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"264b02bdad7cb468de451bd9f3cde2e56f921f3e58a71383b6e3b4ae01307046"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/path.rs: FileTooLong \u2014 1126 significant 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 89 free functions. The bar is 500 significant lines; this is 626 over it, 2.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/perry-runtime/src/path.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0df5cf7bf93bf70b21e2fa173c47b0e47c60999f9fabb0bc74d742daddcd16b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::namespace_call::try_lower_namespace_member_call: FunctionTooLong \u2014 perry_codegen::lower_call::namespace_call::try_lower_namespace_member_call 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/perry-codegen/src/lower_call/namespace_call.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b2ec0336a56dd54fadbbf19b77044a1333579aa39b1d673322f6993643e052"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::analysis::fn_infer::infer_module: FunctionTooLong \u2014 perry_hir::analysis::fn_infer::infer_module 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/perry-hir/src/analysis/fn_infer.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d3886a1136d32f5fd85478f70c71aff099ba63bf59c99bd982450a54f7efe2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cluster.rs: FileTooLong \u2014 1124 significant 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 624 over it, 2.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/perry-runtime/src/cluster.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae0376f568974fd24c535503a80d16ec1bc32034686b02074ff70dc43036cc8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node_api_host/values.rs: FileTooLong \u2014 1123 significant 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 95 free functions. The bar is 500 significant lines; this is 623 over it, 2.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/perry-runtime/src/node_api_host/values.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b30adf24ae15a5a559c997e33ae4c44c7edea29ceaf802f69fc1c797e872cb2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayFactCollector.collect_expr: MethodTooLong \u2014 collect_expr runs 224 significant 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 124 over it, 2.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/hir_facts.rs"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"139e3c178f3bc19bda824e4519c89b0501034526ad91665327ef026c12ebe457"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_wpfacts::lib::contracts::fn_contract_of: FunctionTooLong \u2014 perry_wpfacts::lib::contracts::fn_contract_of runs 224 significant 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 124 over it, 2.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/lib/contracts.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb556389834895ce0194a5c6c0d7901828f7968e30c62bca9129ca29a2e09cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: arena/reset.rs: FileTooLong \u2014 1118 significant 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 618 over it, 2.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/perry-runtime/src/arena/reset.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d91c3aede57b6dd3ad1db95e1fa160c8ddcbdee62eb4ad2321a0cf2427ab80"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LlModule: 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/perry-codegen/src/module.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"12dda6a835600eee015d8589a1a14296c08e5fb9f10c67cc76b28b551243c83c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compile/strip_dedup.rs: FileTooLong \u2014 1116 significant 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 616 over it, 2.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/perry/src/commands/compile/strip_dedup.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af15dba07672d165367c6eead7047f4a1ec1800547eec085a4715869b951625"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/index_set.rs: FileTooLong \u2014 1114 significant 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 614 over it, 2.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/perry-codegen/src/expr/index_set.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56bf9a1f95c35bd64654efc658202f1faa1bb13f1032739623acda706000a9ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/gen.rs: FileTooLong \u2014 1114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: Gen (2 blocks, 93-1616). The bar is 500 significant lines; this is 614 over it, 2.23\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/perry-wpfacts/src/gen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"937acfc48a33df39acc119a67a41ae1b9dbd0bfdef0a7c7ac77a4e37a9ff0ef6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1113 significant 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 613 over it, 2.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/perry-ext-http/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c57231d40f352c6db4a47938e8cf4ecff01d524af9b0b54e4f857eafd975471"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generator/linearize.rs: FileTooLong \u2014 1109 significant 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 609 over it, 2.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/perry-transform/src/generator/linearize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd8fcdcb82556502cc7a0556c84fa8fd8a16062d8a74e638d0ede14bdb8e648"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower/lower_module_fn.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). 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/perry-hir/src/lower/lower_module_fn.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffbd7b459e71b957fd777a72719bc84383ca304f304bc4605378a3e7e3b84a0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/logical_collections.rs: FileTooLong \u2014 1103 significant 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 603 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/perry-codegen/src/expr/logical_collections.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f1455b4b6ed38cce1bc5207c56c76133c68bc3df0c13301a00ede4b71c43dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_module/module_keys.rs: FileTooLong \u2014 1102 significant 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 602 over it, 2.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/perry-runtime/src/object/native_module/module_keys.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bbd8553dd81358749bc7b5c54b303de026ab71c8570bdeb6919a983897a8f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen_arkts::emit_widget::emit_widget: FunctionTooLong \u2014 perry_codegen_arkts::emit_widget::emit_widget runs 220 significant 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 120 over it, 2.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/perry-codegen-arkts/src/emit_widget.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0188940f50cee39c7d0276ffd3b56c9d0fa71ee9676db895eec784e8454c43a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::array_literal::emit_array_from_lowered_values: FunctionTooLong \u2014 perry_codegen::expr::array_literal::emit_array_from_lowered_values runs 220 significant 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 120 over it, 2.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/perry-codegen/src/expr/array_literal.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf4ca2c44a005c57d6428f6839fe03890edd8bea6b0cf86b611a1deb7241f87"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::run::resign::create_dev_profile_via_api: FunctionTooLong \u2014 perry::commands::run::resign::create_dev_profile_via_api runs 220 significant 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 120 over it, 2.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/perry/src/commands/run/resign.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1926051c8783554822d2792b177f7829f41b91e5f57135ef3d8c33562f9155"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/layout_probe.rs: FileTooLong \u2014 1099 significant 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 56 free functions. The bar is 500 significant lines; this is 599 over it, 2.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/perry-runtime/src/object/layout_probe.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb260a62328832011d382f1c3838ad944c4a1fd7b070e4dfa908222f5b074fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/linker.rs: FileTooLong \u2014 1098 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 50 free functions. The bar is 500 significant lines; this is 598 over it, 2.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/perry-codegen/src/linker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d815db17f31a42cf035c246796f45beef1fe8c0c053b8afaa7f6e29726faa0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dynamic_import.rs: FileTooLong \u2014 1098 significant 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 598 over it, 2.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/perry-hir/src/dynamic_import.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"606ae6b7a61f6bbcfced45bed2a8abde760eedab70ea7fa17c97070d3cbed748"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1098 significant 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 598 over it, 2.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/perry-wpfacts/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3375e2b9353ab6d03a432b5e12a752206bcb3ac2d560c765a5f69fa45727ef94"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/node_stream_pipeline.rs: FileTooLong \u2014 1096 significant 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 70 free functions. The bar is 500 significant lines; this is 596 over it, 2.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/perry-runtime/src/node_stream_pipeline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4786a2bec9824b6aafe83f018d9a605ef0318d46bb30126c12f4ac0706fd1c72"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/block.rs: FileTooLong \u2014 1093 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 85% of them inside a single declaration: LlBlock (2 blocks, 404-1962). The bar is 500 significant lines; this is 593 over it, 2.19\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/perry-codegen/src/block.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec202c42dd82e125c502d43c002cabe6f931fba235a17a8e77ba10994b38d273"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/boxed_vars.rs: FileTooLong \u2014 1090 significant 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 590 over it, 2.18\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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a57c67fe6cfb68e260f0a8fc8b8dd6a23bce3969e5170ba0821c75d71d74151"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: child_process/reactor.rs: FileTooLong \u2014 1088 significant 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 588 over it, 2.18\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/perry-runtime/src/child_process/reactor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da53b8b448b28d9a90d2d5b222498cf0ca4029671c78f56a88895f362e6d74cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/layout_families.rs: FileTooLong \u2014 1087 significant 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 587 over it, 2.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/perry-codegen/src/layout_families.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1105750b0ba879e5d356078f54459717e54700d8aeebbd602d1a5229275c327d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::gc::oldgen::legacy_sweep_with_age_bump_and_old_reclaim_targets: FunctionTooLong \u2014 perry_runtime::gc::oldgen::legacy_sweep_with_age_bump_and_old_reclaim_targets 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/perry-runtime/src/gc/oldgen.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7457f40b632cda179eb67e7b9e21aa05db495302ef58af969d69e80b4831d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_wpfacts::decl_units::closed: FunctionTooLong \u2014 perry_wpfacts::decl_units::closed 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/perry-wpfacts/src/decl_units.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d1dc2f5ac8eb28cc8d1e60d3a0f17240663062ff74181012e7c17820cb7afa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::collect_modules::finish::collect_module_finish: FunctionTooLong \u2014 perry::commands::compile::collect_modules::finish::collect_module_finish 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/perry/src/commands/compile/collect_modules/finish.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f052fca44788fc772682a3cb7d29c3def22b4239857a0e0908b2ec735cc4d622"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gc/verify.rs: FileTooLong \u2014 1084 significant 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 584 over it, 2.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/perry-runtime/src/gc/verify.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f97c393294c029f41aa85ee782eb4a6dbdb3116ed75644e06e66d751fd615b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/decl_units.rs: FileTooLong \u2014 1084 significant 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 584 over it, 2.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/perry-wpfacts/src/decl_units.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"461c017f89cd5d14f52d303e16719f0cebcee1a8f6d50cb19164e708e88d513d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LlFunction: TooManyMethods \u2014 65 methods, declared across 2 files: src/function.rs (64), function/proof_dominance.rs (1). The bar is 30 methods; this is 35 over it, 2.17\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/function.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0f18df5a7239a706470f0398060590e374c86a41de07d694917ee01fe5ac3d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_macos::lib_ffi::interactivity: TooManyFunctions \u2014 65 free functions. The bar is 30 free functions; this is 35 over it, 2.17\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/perry-ui-macos/src/lib_ffi/interactivity.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"303ae538aaa5b5958bc5571825d85d7836d1c44a85b8ef4bcbfd739fbe220722"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/app.rs: FileTooLong \u2014 1083 significant 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 583 over it, 2.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/perry-ui-windows/src/app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39ff083cfc2294188b44745c72e18ffa820ab8760d2fa7c7e548bd5f21cfd4b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: global_this/math_temporal.rs: FileTooLong \u2014 1082 significant 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 49 free functions. The bar is 500 significant lines; this is 582 over it, 2.16\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/perry-runtime/src/object/global_this/math_temporal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c109e256fbf1d855ad812968db08395f45a2caf902ef6f88187ec0a5e47c3e89"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: units/driver.rs: FileTooLong \u2014 1081 significant 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 581 over it, 2.16\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/perry-wpfacts/src/units/driver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7104df43b881f387f51c53a21ed4361cffb36edb5845adb8e8d223f4d16aec45"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::binary::lower: FunctionTooLong \u2014 perry_codegen::expr::binary::lower runs 216 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 116 over it, 2.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/binary.rs"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b8d413c5f097de8a685e040babc3cf57430a6b4f72ecbd308311521e34e939"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::to_string_tag::js_object_to_string: FunctionTooLong \u2014 perry_runtime::object::to_string_tag::js_object_to_string runs 216 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 116 over it, 2.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/to_string_tag.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ecb2d7f70bb28b7afd8ed4145f5d6841a0bc36d27586f719f8d0eeddd38a6a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compile/lowering_report.rs: FileTooLong \u2014 1077 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 577 over it, 2.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/perry/src/commands/compile/lowering_report.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97b85d3759aaed47813235ff4b5611446bdd7493f1022cccd4c3183c731811c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/agent.rs: FileTooLong \u2014 1076 significant 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 76 free functions. The bar is 500 significant lines; this is 576 over it, 2.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/perry-ext-http/src/agent.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdf3684848f067a4dd43c855e08cc71d3642a539a889fef57ba705b6e5ca646"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::call_spread_short::try_lower: FunctionTooLong \u2014 perry_codegen::expr::call_spread_short::try_lower runs 215 significant 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 115 over it, 2.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/perry-codegen/src/expr/call_spread_short.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed152a9702881ec91ece74e7b1cb709e01f03a077334d185e1649fb9604c9f15"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::stable_packed_loop::lower: FunctionTooLong \u2014 perry_codegen::stmt::stable_packed_loop::lower runs 215 significant 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 115 over it, 2.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/perry-codegen/src/stmt/stable_packed_loop.rs"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f058b75bdaf060c59052f0b4dc1edd36876900287cc38c894bdf200336bae3a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Gen.runtime_extern: MethodTooLong \u2014 runtime_extern runs 214 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 114 over it, 2.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/gen_call.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"1970a6f6f654de43ede34db1f5d9ffb54db5c333c6edce4930b997f93118449c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower/module_decl.rs: FileTooLong \u2014 1069 significant 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 569 over it, 2.14\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/perry-hir/src/lower/module_decl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1763cd07023cb724d867f81e16fae938e7ee80e4e622106d0fd4ed823cc81f35"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/worker_threads.rs: FileTooLong \u2014 1068 significant 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 94 free functions. The bar is 500 significant lines; this is 568 over it, 2.14\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/perry-stdlib/src/worker_threads.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"499449a0808e83ff57fb0f9229e402192254828b998d68ca8df7d636317b8cce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower/stmt.rs: FileTooLong \u2014 1065 significant 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 565 over it, 2.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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ac5aa1f7c74eb5de973345c4a8704177227b0b6283a21d25f5afb474be2fe9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gc/oldgen.rs: FileTooLong \u2014 1065 significant 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 565 over it, 2.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/perry-runtime/src/gc/oldgen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c058946ddc531a9917e448794e23846cfb7fd8548901ee7e71c326c0f661db"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_call::native_module::object_statics::try_object_statics: FunctionTooLong \u2014 perry_hir::lower::expr_call::native_module::object_statics::try_object_statics runs 213 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 113 over it, 2.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/native_module/object_statics.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b41fab698039aeb1e1747f9bc4a74b77bafa2b8a22acabc22197d9785a0b33d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::module_decl::namespace::lower_namespace_block: FunctionTooLong \u2014 perry_hir::lower::module_decl::namespace::lower_namespace_block runs 213 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 113 over it, 2.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/module_decl/namespace.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfe0f10a855d7e790dca6c62837822eb38242ec78ebec2abb0ae27a1377b635"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/perf_hooks.rs: FileTooLong \u2014 1061 significant 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 86 free functions. The bar is 500 significant lines; this is 561 over it, 2.12\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/perry-runtime/src/perf_hooks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5a2306a85aefffc669aab17fd9043c0e533d05340a62e2b60ced165bff994a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: promise/then.rs: FileTooLong \u2014 1060 significant 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 56 free functions. The bar is 500 significant lines; this is 560 over it, 2.12\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/perry-runtime/src/promise/then.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efdf62ee12b23811b35f131ae99551dc5d1310df5c428736ec7f12c18a6bf1ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::i32_locals::walk_writes_for_strict: FunctionTooLong \u2014 perry_codegen::collectors::i32_locals::walk_writes_for_strict 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/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"f931fb28d419f26bdd6e52264017ddd872587f99bba27caf5e0fc21abc796cf7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UseWalk.walk_expr: MethodTooLong \u2014 walk_expr 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/perry-codegen/src/collectors/ptr_shape.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"8deefd8d6617f6d5cf3302c2ceb138eb73531576ce41e2d2ca49b6706223266e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LlModule.layout_codegen_units: MethodTooLong \u2014 layout_codegen_units 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/perry-codegen/src/module.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5c05594f96002e435547d94f834e40abe2af14a1605d21da5eb1b9deb9ceb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::native_module_dispatch::dispatch_util::nm_dispatch_util: FunctionTooLong \u2014 perry_runtime::object::native_module_dispatch::dispatch_util::nm_dispatch_util 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/perry-runtime/src/object/native_module_dispatch/dispatch_util.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a491a54956a59699ea0d23057da5b80b2e49be9686db9ff69e13243f7b8def1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::setup::harmonyos::harmonyos_wizard: FunctionTooLong \u2014 perry::commands::setup::harmonyos::harmonyos_wizard 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/perry/src/commands/setup/harmonyos.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b52e741f4cc0c6518de2983cbb3397f95dda2af37c970bdace00a2c66c27d66"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::lower_stmt_inner: FunctionTooLong \u2014 perry_codegen::stmt::lower_stmt_inner 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/perry-codegen/src/stmt/mod.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"407a986d6f180950f07392c76b04a2c70839e5e4e69f28734f9798616880182c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower_decl::fn_decl::lower_fn_decl: FunctionTooLong \u2014 perry_hir::lower_decl::fn_decl::lower_fn_decl 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/perry-hir/src/lower_decl/fn_decl.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fbfda4569557a50057f7530dfa7dca8ad70c9ca45d879913c2f6d1b86a445f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::array::push_pop::proxy_array_mutator: FunctionTooLong \u2014 perry_runtime::array::push_pop::proxy_array_mutator 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/perry-runtime/src/array/push_pop.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d434b17fb3da0118ab8ff63af68c28f3636522690fef4f526791a1ef6db822"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Model.store_into: MethodTooLong \u2014 store_into 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/perry-wpfacts/src/solve/store.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cdddca7bb5ec1ad202a275e413fc7ef01710715bb555300da0f684e3692dcd6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Writer: ClassTooLong \u2014 842 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 33 methods, 2 blocks, lines 262-1436. The bar is 400 significant lines; this is 442 over it, 2.11\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/perry-runtime/src/thread/clone_write.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"c785e018204048ab1083e78ad170d8d7571b78db1f2aa7ce0b9c57c9099afef5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: link/build_and_run.rs: FileTooLong \u2014 1051 significant 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 551 over it, 2.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/perry/src/commands/compile/link/build_and_run.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f91367b64363eb34f1efdd05e14c1133b0be8061bc9a92ea743724d17b9679"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::array_methods::lower: FunctionTooLong \u2014 perry_codegen::expr::array_methods::lower runs 210 significant 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 110 over it, 2.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/perry-codegen/src/expr/array_methods.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"531adb692e3c184715e95cf4486253fb710eb112c2d3b3ec6f8560808ee362d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_android::jni_bridge::build_cache: FunctionTooLong \u2014 perry_ui_android::jni_bridge::build_cache runs 210 significant 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 110 over it, 2.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/perry-ui-android/src/jni_bridge.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a92383f7b988b128555066f5c122740222d7eccee2d1164cecf7bf5216691be"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_wpfacts::builtins::tok_load: FunctionTooLong \u2014 perry_wpfacts::builtins::tok_load runs 210 significant 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 110 over it, 2.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/perry-wpfacts/src/builtins.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e88dd8065f2533daf432948ba37cab54bd1201cb95692b1dbb1aefd2a44409"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: LoweringSummary: TooManyFields \u2014 63 stored fields. The bar is 30 stored fields; this is 33 over it, 2.10\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/perry/src/commands/compile/lowering_report.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc056b5b6ee14071c915f0a6f8a4004a49f4fec0812be42e3005b4e5f76b0be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: server/response.rs: FileTooLong \u2014 1049 significant 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 69 free functions. The bar is 500 significant lines; this is 549 over it, 2.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/perry-ext-http/src/server/response.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59ca441039c6f3773e4ab8da828d862325d371619b4b190a148301a3d65ca74"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: field_get_set/enumeration.rs: FileTooLong \u2014 1048 significant 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 548 over it, 2.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/perry-runtime/src/object/field_get_set/enumeration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba5341d320106a7db68026c9ed7819766c5748ad4317b47426737e7e261ff5a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::index_set_guarded::emit_guarded_inbounds_array_store_keyed: FunctionTooLong \u2014 perry_codegen::expr::index_set_guarded::emit_guarded_inbounds_array_store_keyed runs 209 significant 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 109 over it, 2.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/perry-codegen/src/expr/index_set_guarded.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"1794b18813827d38058318ea33d51d57c6ce6243fd93dce57a5f84af5f4c1e67"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.main: FunctionTooLong \u2014 main runs 209 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 109 over it, 2.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":"upstream/actions/jdx/mr-boxington-action/src/index.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fabc456d32925740594d09c1b46d41d739f9440376b128982eb4cfcd59913c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower/builder_fold.rs: FileTooLong \u2014 1044 significant 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 42 free functions. The bar is 500 significant lines; this is 544 over it, 2.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/builder_fold.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8a007b9cdcf22d24d346ab6cac70ad3d486569e4fd2ddd08b236090018cb8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: array/push_pop.rs: FileTooLong \u2014 1044 significant 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 544 over it, 2.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/array/push_pop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc772253b531d1c94bbba482328750cb87c990fc080e970ea21594c11d12181a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: solve/call_and_construct.rs: FileTooLong \u2014 1043 significant 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 100% of them inside a single declaration: Model (4-1739). The bar is 500 significant lines; this is 543 over it, 2.09\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/perry-wpfacts/src/solve/call_and_construct.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed1a815b9cd3a8c5f6e8f20f32e994f36a42e21c57b0378c1d80f6fcf102018"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LlModule: ClassTooLong \u2014 832 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 67 methods, 2 blocks, lines 53-1692. The bar is 400 significant lines; this is 432 over it, 2.08\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/perry-codegen/src/module.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4144d611b19df32b3d16ea60875def6f312ce269ee13d92ed97983adcc0581"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower/expr_object.rs: FileTooLong \u2014 1040 significant 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 540 over it, 2.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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd7ecfe868c75d1ffdf24be91e38acd66d1caaebe2a357cfb012a1afdb4d263"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower/closure_analysis.rs: FileTooLong \u2014 1038 significant 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 538 over it, 2.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/perry-hir/src/lower/closure_analysis.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d01e7d204d86e7ea2f91c15e1088757dae355b86547f912bca149bd1b4f024"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/native_payload.rs: FileTooLong \u2014 1036 significant 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 536 over it, 2.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/perry-runtime/src/native_payload.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a36a1f0feb9f6c975a00ac925c32f9c37724b85751ebffb0cf0f0ade8a58ba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.with_class_id_start_salted: MethodTooLong \u2014 with_class_id_start_salted runs 207 significant 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 107 over it, 2.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/perry-hir/src/lower/context_new.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7316ee9cdff482a85a93083b876e5c1ddaa58ba460c026fd426cec367f5141d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower_types::infer_call_return_type: FunctionTooLong \u2014 perry_hir::lower_types::infer_call_return_type runs 207 significant 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 107 over it, 2.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/perry-hir/src/lower_types.rs"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"67179f0c7cd5578aa3146d6c8b608bcf1430b5076420b71a30f1571cb3744b45"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: region_loop/plan.rs: FileTooLong \u2014 1031 significant 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 531 over it, 2.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/region_loop/plan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8278deb65d1a412fc5a60fbf0727113aa301c46a9447b9406cedaed9b34cdcb3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: readline/mod.rs: FileTooLong \u2014 1026 significant 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 78 free functions. The bar is 500 significant lines; this is 526 over it, 2.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/perry-stdlib/src/readline/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9616719934ca79a3f7aff66ef8363db45807cc9148b61dbec293c09dfc4556c2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GcCycleState: ClassTooLong \u2014 820 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 23 methods, 3 blocks, lines 614-1937. The bar is 400 significant lines; this is 420 over it, 2.05\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/perry-runtime/src/gc/cycle.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f75894928f862e4a6d1fd3cbde598708ca75e326664e5fcb0b7197b4e18bbd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::calls::crypto_hash::arm_crypto_hash_chain: FunctionTooLong \u2014 perry_codegen::expr::calls::crypto_hash::arm_crypto_hash_chain runs 205 significant 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 105 over it, 2.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/perry-codegen/src/expr/calls/crypto_hash.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"88531b686afa31c40ae2f3b151dfb36c706d4a4a41935849b1b016904582beac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_object::lower_method_prop: FunctionTooLong \u2014 perry_hir::lower::expr_object::lower_method_prop runs 205 significant 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 105 over it, 2.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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58c452dcad75bc63d2b90a552255fdbc0282033d89b995c8c062f53a843423b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: intl/number_format.rs: FileTooLong \u2014 1023 significant 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 64 free functions. The bar is 500 significant lines; this is 523 over it, 2.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/perry-runtime/src/intl/number_format.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa02f36b0279a823ccb415ca5b433ae0d3fc9f383d2766cd9dbf356e11280777"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/layout_desc.rs: FileTooLong \u2014 1023 significant 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 49 free functions. The bar is 500 significant lines; this is 523 over it, 2.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/perry-runtime/src/object/layout_desc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f335ce2107b381561411a356babe9ba4dd0f4cdb14d1dfc58c700e83ba2aa790"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_module/callable_exports.rs: FileTooLong \u2014 1020 significant 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 60 free functions. The bar is 500 significant lines; this is 520 over it, 2.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/perry-runtime/src/object/native_module/callable_exports.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d4ba354588470aec617549d51a29efca177120ab4cd9fda7575ca18dac9e32"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::region_loop::plan::plan_once: FunctionTooLong \u2014 perry_codegen::stmt::region_loop::plan::plan_once runs 204 significant 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 104 over it, 2.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/perry-codegen/src/stmt/region_loop/plan.rs"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"027bc8955f0959d119b7dba89f7319782e413e300a732d98a3f8e39f5eefd7e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower/widget_decl.rs: FileTooLong \u2014 1019 significant 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 519 over it, 2.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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b165bcb1feb64bd68720f724e84bf87c235dc72a82f22fb0b558c7b9d25ae5b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/module_require.rs: FileTooLong \u2014 1019 significant 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 70 free functions. The bar is 500 significant lines; this is 519 over it, 2.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/perry-runtime/src/module_require.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abcbcac9f5203707c39807a2a674f835bc7b69ab5da4b0d6a581ec5541ae02d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sqlite/database_sync.rs: FileTooLong \u2014 1018 significant 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 74 free functions. The bar is 500 significant lines; this is 518 over it, 2.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/perry-stdlib/src/sqlite/database_sync.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79d0b740dd3a5224417b85c85773e8c66de26b3aa48a84f8c38427a20d1f9f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compiler_output_harness/repsel_census.py: FileTooLong \u2014 1017 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 517 over it, 2.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/compiler_output_harness/repsel_census.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4368427332fbf2103eaa6daec502de46f64bbc86e8d389296e07033c644d42"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower_call/console_promise.rs: FileTooLong \u2014 1017 significant 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 517 over it, 2.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/console_promise.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"452e088bd18351f5d4091bccf21d537a4a86a509cf7dddca90970d080673cc0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: array/generic.rs: FileTooLong \u2014 1017 significant 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 53 free functions. The bar is 500 significant lines; this is 517 over it, 2.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/array/generic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17c99cf61495c98edc66a1a1dbd10867e6bbd829aaca533f8783c5b1bfa9350"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: turnloop_net/transport.rs: FileTooLong \u2014 1017 significant 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 517 over it, 2.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/turnloop_net/transport.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af1705935a53681aa8ad85a7d49c153b43a6a69557cfc5d4b1ae8e9e4a404e2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::object::date_proto_thunks: TooManyFunctions \u2014 61 free functions. The bar is 30 free functions; this is 31 over it, 2.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/perry-runtime/src/object/date_proto_thunks.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9f2dbc0d09ec94b73e75e9cbe6e097c15105c29e8344ed21ff9923026920af"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: RegexDiag: TooManyFields \u2014 61 stored fields beside 5 methods. The bar is 30 stored fields; this is 31 over it, 2.03\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/perry-runtime/src/hot_diag.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"3306d4bb86c16fe010456dc797e44a1d464236336ca13ba3cab0edd9da29c3db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collectors/int_valued_ta_locals.rs: FileTooLong \u2014 1016 significant 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 516 over it, 2.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/int_valued_ta_locals.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"226db4cb9b44576263cfab0f266d65e68e211e9dc41699916d177015873dbe52"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/bun.rs: FileTooLong \u2014 1015 significant 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 515 over it, 2.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-typescript/src/bun.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c1fe7cb4e3790cf75ffd09afe7d9ced99a5934bed200e20452338b499de0ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cjs_wrap/wrap.rs: FileTooLong \u2014 1015 significant 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 515 over it, 2.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/cjs_wrap/wrap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e36c56db24a532c0ff2b2710d1d7d362b8cdc618dff88352a55e2ed542e0a08"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FuncEmitCtx.try_emit_expr_math: MethodTooLong \u2014 try_emit_expr_math runs 203 significant 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 103 over it, 2.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/emit/expr/math.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"4282600b1983b8e06e0252fe4265fcb6757e75cf9e04b43824550712d7449c2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::builtins::formatting::format_object_as_json: FunctionTooLong \u2014 perry_runtime::builtins::formatting::format_object_as_json runs 203 significant 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 103 over it, 2.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/builtins/formatting.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5d01e33da34effc7833a5a464203879304605b05aa6c655fc35384ceaef141"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Proof.expr: MethodTooLong \u2014 expr runs 202 significant 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 102 over it, 2.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/perry-hir/src/analysis/numeric_order.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fae4d14249ab15b11e441b3bcf08cc53cd6d94f699547cb4e835952d82843a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::monomorph::specialize::specialize_class: FunctionTooLong \u2014 perry_hir::monomorph::specialize::specialize_class runs 202 significant 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 102 over it, 2.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/perry-hir/src/monomorph/specialize.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad8a70f822fdd2c2921d5dfa9265ac1347900eda5091b6728693ed4411fbe7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::perf_hooks::prototypes::attach_perf_hooks_constructor: FunctionTooLong \u2014 perry_runtime::perf_hooks::prototypes::attach_perf_hooks_constructor runs 202 significant 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 102 over it, 2.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/perry-runtime/src/perf_hooks/prototypes.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ee798ab8b70ab6a547e53c22db079d1e8ff3f33c7f83e4f724d21cb5615cba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower_call/extern_func.rs: FileTooLong \u2014 1009 significant 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 509 over it, 2.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/perry-codegen/src/lower_call/extern_func.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d29234a3610a85222451e077fca5a17e07a56053390c71973908a9bdbb6efc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fs/fd_ops.rs: FileTooLong \u2014 1007 significant 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 69 free functions. The bar is 500 significant lines; this is 507 over it, 2.01\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/perry-runtime/src/fs/fd_ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a030ac0e7e181348078c031e65c59b3cd4bc13ae05d376dfab7f321368425c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GuardState.matches: MethodTooLong \u2014 matches runs 201 significant 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 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":"crates/perry-runtime/src/param_type_guard.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49a2a09c0ff4b4f1bf93c407b978346adba8880719bab9d5abc1f7a90627dfa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: thread/clone_write.rs: FileTooLong \u2014 1004 significant 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 84% of them inside a single declaration: Writer (2 blocks, 262-1436). The bar is 500 significant lines; this is 504 over it, 2.01\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/thread/clone_write.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37e739c5c28f9c5b4326572509118866309138d9a8dd1696f4ec40adc4f1027"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/mod.rs: FileTooLong \u2014 1002 significant 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 502 over it, 2.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2615c63c3b4135734c87a8963fd0d9a3c9ad9d6be7bb7f3fecba10836dd3895"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower_call/func_ref.rs: FileTooLong \u2014 1001 significant 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 501 over it, 2.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/func_ref.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e95b47d442a43638a2700fff11557153ac95af3e071bbbfe570d034af42ffcd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lower_types.rs: FileTooLong \u2014 1000 significant 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 500 over it, 2.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4900c51ca43ac17602d5c71b1c145f67019d8e2b2b5c95fc9b42c276e0387b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::native_value::verify::verify_native_rep_records: FunctionTooLong \u2014 perry_codegen::native_value::verify::verify_native_rep_records runs 200 significant 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 100 over it, 2.00\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/perry-codegen/src/native_value/verify.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5390b107fda06a1914cb960fada1e0bb173045ee15a8087db4b97a1a08ede1a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_parser::normalize_unicode_identifier_escapes_with_metadata: FunctionTooLong \u2014 perry_parser::normalize_unicode_identifier_escapes_with_metadata runs 200 significant 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 100 over it, 2.00\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/perry-parser/src/lib.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67820ea25e57a14ea9944d6d857ef91944a8048c353c65c0271c699d714b108"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::os::js_os_cpus: FunctionTooLong \u2014 perry_runtime::os::js_os_cpus runs 200 significant 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 100 over it, 2.00\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/perry-runtime/src/os.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"248210bed9ad3073d7ed96d1d6c3110893acab31cef993f1584ac12b3b2d0f65"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::os_process_streams_build::build_stream_object_with_write: FunctionTooLong \u2014 perry_runtime::os_process_streams_build::build_stream_object_with_write runs 200 significant 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 100 over it, 2.00\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/perry-runtime/src/os_process_streams_build.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c317ee2a9578571554996c32c3ba6b23b9fd4b0243983ec36980645cd6ee77ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_wpfacts::summary::map_cons: FunctionTooLong \u2014 perry_wpfacts::summary::map_cons runs 200 significant 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 100 over it, 2.00\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/perry-wpfacts/src/summary.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c54a9ee9bdad583527be08c0c4787681fff2d8a5884ee5e1d4d8b2d376120f7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CompileArgs: TooManyFields \u2014 60 stored fields. The bar is 30 stored fields; this is 30 over it, 2.00\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/perry/src/commands/compile/types.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a22418fe791041d517b886abf57161b2fb6bd1ab244faeaa194e423cb113af"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gc/types.rs: FileTooLong \u2014 999 significant 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 499 over it, 2.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/gc/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c54ca684007df4dfacbecb49ba1c3a229ab03116d354938f3ab772000af589"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compile/targets.rs: FileTooLong \u2014 999 significant 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 499 over it, 2.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/targets.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe696609f3a6bf81552a899e375c3332b740866db1be0add010da7ab75415d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime_decls/strings_part2.rs: FileTooLong \u2014 996 significant 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 496 over it, 1.99\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/perry-codegen/src/runtime_decls/strings_part2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a088b8004f4e662a29175a93603adeb4a4c37bc99ae107fbf5578235ac9b680b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: class_registry/parent_static.rs: FileTooLong \u2014 995 significant 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 43 free functions. The bar is 500 significant lines; this is 495 over it, 1.99\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/perry-runtime/src/object/class_registry/parent_static.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c971b8b8a9e88d90afe664cf4ada6921ffe5504b38753eb503f3ac36e740615"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::stmt_loops::mark_iterator_completion_on_abrupt: FunctionTooLong \u2014 perry_hir::lower::stmt_loops::mark_iterator_completion_on_abrupt 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8fd207051266880648f142123a922a584dfcf7c5b9bb0492c006e2ec4802f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::typed_array_proto_thunks::dispatch_uint8_buffer_method: FunctionTooLong \u2014 perry_runtime::object::typed_array_proto_thunks::dispatch_uint8_buffer_method 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/perry-runtime/src/object/typed_array_proto_thunks.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d991a29a3f6a1a499d7ce174601162af7278e4140235a8ea9c16cbf5f1aee4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 993 significant 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 493 over it, 1.99\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/perry-ext-ws/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b3149bee4268f89425d864b5dc9ff6f678c3e6ba02ff3a4f33fb75c502ec15"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::native_record::native_fact_uses_for_record: FunctionTooLong \u2014 perry_codegen::expr::native_record::native_fact_uses_for_record runs 198 significant 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 98 over it, 1.98\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/perry-codegen/src/expr/native_record.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e038e59f19dea7c04d5f5e277dba88d21d11ca6412b026f0996e3dcdd958c9f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::widget_decl::try_lower_widget_decl: FunctionTooLong \u2014 perry_hir::lower::widget_decl::try_lower_widget_decl runs 198 significant 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 98 over it, 1.98\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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"001d35668db2c7fa2ac6696c4157ceea1d764feaa6efcf81f5363e82af033a58"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower_types::extract::extract_ts_type_with_ctx: FunctionTooLong \u2014 perry_hir::lower_types::extract::extract_ts_type_with_ctx runs 198 significant 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 98 over it, 1.98\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/perry-hir/src/lower_types/extract.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd64e0d8e4a34b6e10aa17207a467ad91b16d04c22113e7e9772745a1cf2d0c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: page_meta/mod.rs: FileTooLong \u2014 985 significant 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 485 over it, 1.97\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/perry-runtime/src/arena/page_meta/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9cc50fbeeea31490b7f9195657dbcd06092cea738923b2d139939d82f3cc5d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ext_zlib::stream::create_stream: FunctionTooLong \u2014 perry_ext_zlib::stream::create_stream runs 197 significant 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 97 over it, 1.97\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/perry-ext-zlib/src/stream.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82eb8ea1d11b16b0bfb2e1e3e475ad1beafe6096a3b628620b8ab830c5b9486"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::component::persistent::poll::complete: FunctionTooLong \u2014 perry_runtime::component::persistent::poll::complete runs 197 significant 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 97 over it, 1.97\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/perry-runtime/src/component/persistent/poll.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8a761d8542fe95f041f1fefea1faa124466d7eb5223ec264c0157380647849"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::value::dyn_index::js_dyn_index_get: FunctionTooLong \u2014 perry_runtime::value::dyn_index::js_dyn_index_get runs 197 significant 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 97 over it, 1.97\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/perry-runtime/src/value/dyn_index.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2eac2d199dbb6a29756bcbcc764d4f9112a4b2210064ab8417ca2d8768084f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_wpfacts::lib::contracts::describe_nodes: FunctionTooLong \u2014 perry_wpfacts::lib::contracts::describe_nodes runs 197 significant 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 97 over it, 1.97\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/perry-wpfacts/src/lib/contracts.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8641d279c580cd804f188aebd0683ed3e80854fa98723b2dbfa46c186d0719"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower/shared_mutable_capture.rs: FileTooLong \u2014 984 significant 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 484 over it, 1.97\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/perry-hir/src/lower/shared_mutable_capture.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86100a02c133b95b8a86ad2531bfb186aec29478f11c72c37e62acbb112cb516"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_android::ffi::embed_misc: TooManyFunctions \u2014 59 free functions. The bar is 30 free functions; this is 29 over it, 1.97\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/perry-ui-android/src/ffi/embed_misc.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81216287bf0153c3488a10ffff5331167e587a3fe17957a28a6a4f782cb61d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower/context.rs: FileTooLong \u2014 983 significant 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 96% of them inside a single declaration: LoweringContext (2 blocks, 41-1858). The bar is 500 significant lines; this is 483 over it, 1.97\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/perry-hir/src/lower/context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a0ba8e5962973b28b436148a5c94c6cf242b8e2dc0f62dfb54601a61cd7a8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gc/copying.rs: FileTooLong \u2014 983 significant 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 483 over it, 1.97\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/perry-runtime/src/gc/copying.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b31962e82c89e5908e407e2c5582c19f4cb8c7acb622f56aedc61777d572aa7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collectors/ptr_shape.rs: FileTooLong \u2014 980 significant 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 480 over it, 1.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/perry-codegen/src/collectors/ptr_shape.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d270e847e516ac21ba4a1928ebba780a0a836baa9cd7b389737fbedd99dd85"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::uppercase_strings::check_uses_in_stmt: FunctionTooLong \u2014 perry_codegen::collectors::uppercase_strings::check_uses_in_stmt runs 196 significant 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 96 over it, 1.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/perry-codegen/src/collectors/uppercase_strings.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"552567ee6fa62bfac21cf34cbe597f2ef0068c7360ab2a5e0ba53be14fa61413"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::array_append::try_lower: FunctionTooLong \u2014 perry_codegen::expr::array_append::try_lower runs 196 significant 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 96 over it, 1.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/perry-codegen/src/expr/array_append.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"28eccce033f9d86a60c6d551e8def431e3498e2242c467cb3a128e096f735c76"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collectors/loop_bounded_i32.rs: FileTooLong \u2014 977 significant 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 477 over it, 1.95\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/loop_bounded_i32.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"427c6339befce68f37a30a05991566650770c17f8c98bc94619d863ef325adc0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/proto_constants.rs: FileTooLong \u2014 977 significant 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 38 free functions. The bar is 500 significant lines; this is 477 over it, 1.95\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/proto_constants.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd597889d7b87dfaf47ebe8361615ccd2146c4f58c115560b0a03d10955cbb6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/turnloop_net.rs: FileTooLong \u2014 975 significant 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 56 free functions. The bar is 500 significant lines; this is 475 over it, 1.95\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ffi/src/turnloop_net.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2148dd9b9c64b5c4a8e7d917788ce9d5167f6cd6a775bffb42bf317c6c90fcb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower/expr_member.rs: FileTooLong \u2014 975 significant 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 475 over it, 1.95\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_member.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c39c5189192349fc6e7a4bc5555b24b4c0d6f030534ca51a49843d8dfcb0302"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::js_runtime::lower: FunctionTooLong \u2014 perry_codegen::expr::js_runtime::lower runs 195 significant 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 95 over it, 1.95\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/perry-codegen/src/expr/js_runtime.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"69058e68fdd1bd366fce454a24eb9a8dbb959556b9566a2d4d67e2cf09c1fddb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower/expr_new.rs: FileTooLong \u2014 971 significant 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 471 over it, 1.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_new.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5df3b57adff9f2e5e26888134ba7b75c2ed7d57fc98bf53473b46292d8c8ade"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: promise/combinators.rs: FileTooLong \u2014 971 significant 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 471 over it, 1.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/promise/combinators.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d5fd8aa0acd7a1c55631f3bc106cf55dbc93e2b6ef31dcd7eecb0d6ea65182"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/json_tape.rs: FileTooLong \u2014 970 significant 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 470 over it, 1.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/json_tape.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd571dd1ab74414e5d7a3b1b357f331966d839b80353bd313d6623a24b335abd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsEmitter.emit_native_method_call: MethodTooLong \u2014 emit_native_method_call runs 194 significant 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 94 over it, 1.94\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/perry-codegen-js/src/emit/native.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"89190d66205036848d6382b8482480ab5b5033093ab716e9ff8bb5567f883416"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/formatting.rs: FileTooLong \u2014 969 significant 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 31 free functions. The bar is 500 significant lines; this is 469 over it, 1.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/builtins/formatting.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c28da59adde6e6e124d4e8fcd0a7440708eaadddd807407362e667e748c7593"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/class_constructors.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 32 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/perry-runtime/src/object/class_constructors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"047071676cc998f326ca3e19f76cb2902c647c1830c0460c531bff9581e8bc9e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compile/resolve.rs: FileTooLong \u2014 966 significant 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 53 free functions. The bar is 500 significant lines; this is 466 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/perry/src/commands/compile/resolve.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"106cf53f5d59b2c26123f2c2e709dec67405d7a35765b9d1621145867981d6ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bun_compat/cli_utils.rs: FileTooLong \u2014 965 significant 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 465 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/perry-runtime/src/bun_compat/cli_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81c459cfda2ba5e9a2304e731940af2d617089cd679b42e069503857534cb0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/error.rs: FileTooLong \u2014 965 significant 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 95 free functions. The bar is 500 significant lines; this is 465 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/perry-runtime/src/error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5144785006aa415bde86e56b6e0b303697de4bb2b210b4a167f09f663877fd3e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::i32_locals::collect_localset_ids_in_stmts_filtered: FunctionTooLong \u2014 perry_codegen::collectors::i32_locals::collect_localset_ids_in_stmts_filtered runs 193 significant 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 93 over it, 1.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":"crates/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"976cad00e929fc57bdbb865fe6361dffe7c361b69dc270e8098e6c6fa2b0a58b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::js_transform::local_natives::fix_class_field_expr: FunctionTooLong \u2014 perry_hir::js_transform::local_natives::fix_class_field_expr runs 193 significant 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 93 over it, 1.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":"crates/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ffb23de5cc8fca45eb162cd338cf63752c1c06f7dba62591a8b7ea960862bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::gc::heap_snapshot::gc_build_v8_heap_snapshot_json_with_format: FunctionTooLong \u2014 perry_runtime::gc::heap_snapshot::gc_build_v8_heap_snapshot_json_with_format runs 193 significant 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 93 over it, 1.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":"crates/perry-runtime/src/gc/heap_snapshot.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"3becd68a08dcaf2fe6a8dab33715003e5e613d1148305532483424c1136b48d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: crypto/x509.rs: FileTooLong \u2014 963 significant 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 463 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/perry-stdlib/src/crypto/x509.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ba07a0bae049483952e32cc8bbd4d57331eb8215ac03936ca149f9aff4860f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: turnloop_client/exchange.rs: FileTooLong \u2014 963 significant 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 463 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/perry-stdlib/src/turnloop_client/exchange.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1559eb043d43e46906ef72f1c7a7ed465bc88de3e329499c11f4871027a5f4e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/mod.rs: FileTooLong \u2014 962 significant 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 462 over it, 1.92\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/perry-ui-android/src/widgets/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"745c943450d688df0f134c97484094f8908abf31c7e62c99aea5be81388a1326"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::closure_analysis::collect_closure_assigned_in_body_expr: FunctionTooLong \u2014 perry_hir::lower::closure_analysis::collect_closure_assigned_in_body_expr 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/perry-hir/src/lower/closure_analysis.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b600ff6c6a2962b2d6ac4264b40e79d4e061414de93a4b9d6dfa6e4ddedeb62"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::layout_probe::computed::perry_probe_get_value: FunctionTooLong \u2014 perry_runtime::object::layout_probe::computed::perry_probe_get_value 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/perry-runtime/src/object/layout_probe/computed.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf97ee8f334ec2dc20513a307a6eb194ae9c4e90faad8bda22c60ee019fdbd7d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_stdlib::fetch::request_copy::js_request_new_from_input: FunctionTooLong \u2014 perry_stdlib::fetch::request_copy::js_request_new_from_input 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/perry-stdlib/src/fetch/request_copy.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d966ebd37668c48adcec805d6fa7c56bf8236b7f1b303d4a628586707ab0fb56"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/widgets.rs: FileTooLong \u2014 958 significant 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 458 over it, 1.92\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/perry-ui-windows-winui/src/widgets.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67cf71f082a3a77e698ff611c9b9ac2516c9350f25b18348c91b4c3a4952bae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower_call/new.rs: FileTooLong \u2014 956 significant 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 456 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/perry-codegen/src/lower_call/new.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59ecc38ceff0476be8ba77c761e25fe0d083d73d552fbd33813f9acd4431ae4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower/expr_function.rs: FileTooLong \u2014 955 significant 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 455 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/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90903d75795b5fe6353382dc9724b9cb405cba533e97a963ac48d4b96619da88"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::inline_birth_invariant::check: FunctionTooLong \u2014 perry_codegen::lower_call::inline_birth_invariant::check runs 191 significant 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 91 over it, 1.91\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/perry-codegen/src/lower_call/inline_birth_invariant.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"34294b3b19c74ff1747dc77301c8e553597d5168a9e9f3b2a5beb30ee5950e78"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::gc::census::take_census: FunctionTooLong \u2014 perry_runtime::gc::census::take_census runs 191 significant 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 91 over it, 1.91\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/perry-runtime/src/gc/census.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"2681bc05a05ad6df18bce259679dd900003448c60410ed2e6968027cf031779e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::layout_desc::registration::register_bound: FunctionTooLong \u2014 perry_runtime::object::layout_desc::registration::register_bound runs 191 significant 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 91 over it, 1.91\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/perry-runtime/src/object/layout_desc/registration.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7ed1a70569737c61e40e2463014076bbd59d0ab8fbad1cd89edd1e665d31cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/async_to_generator.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 36 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/perry-transform/src/async_to_generator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ea3c1292bea86ea3c71111b022a851e9c27d3f8a54600aaaa8bc55eea98e59"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr_call/module_static.rs: FileTooLong \u2014 952 significant 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 452 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/perry-hir/src/lower/expr_call/module_static.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60b9e0a2212fbd33c1339264fa8a786ff8dc4e9bdf914d266e309e77ce7a655"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/audio_playback.rs: FileTooLong \u2014 951 significant 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 451 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/perry-ui-ios/src/audio_playback.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a695c42bf5ca3c904886f8ea0a270c7dc0da91441434ec97fe471ff4a00ca67"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/audio_playback.rs: FileTooLong \u2014 951 significant 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 451 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/perry-ui-tvos/src/audio_playback.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40bfe2c5d683f421b1aa5d49fd036d9a2bea4fe8e535ac28396a0756e51e470"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/audio_playback.rs: FileTooLong \u2014 951 significant 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 451 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/perry-ui-visionos/src/audio_playback.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ba14d0747466471fabed597c803499696c0247f7b8531bf9ba94c77ddc4858"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/audio_playback.rs: FileTooLong \u2014 951 significant 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 451 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/perry-ui-watchos/src/audio_playback.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb0cb40bce8c180d9aee363f065cc543790c5e33b3cb18b36f86c4c6ea6bfc6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::buffer::numeric: TooManyFunctions \u2014 57 free functions. The bar is 30 free functions; this is 27 over it, 1.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/perry-runtime/src/buffer/numeric.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"919722003c42bfe2ba36bc68864e44a8996ccbb73a50f4af9e9cd74213a192cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::loops::lower_packed_f64_versioned_for_with_protocol: FunctionTooLong \u2014 perry_codegen::stmt::loops::lower_packed_f64_versioned_for_with_protocol 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e103fe23001f59f222806e5d95c6434929a5601f2f393f07e7aac9817b5501"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::type_analysis::numeric::is_numeric_expr: FunctionTooLong \u2014 perry_codegen::type_analysis::numeric::is_numeric_expr 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/perry-codegen/src/type_analysis/numeric.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebc410eb0a297aaccbc2565c213b0b21b54daf76f4db78b3e5c0f93a2d9d0ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower_decl::body_stmt::nested_fn_decl::lower_nested_fn_decl: FunctionTooLong \u2014 perry_hir::lower_decl::body_stmt::nested_fn_decl::lower_nested_fn_decl 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/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c238c154f1ef13515d78b7c0082d8afc1f18218a91514b883fba39006166d1a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::value::dynamic_object::js_dynamic_object_get_property: FunctionTooLong \u2014 perry_runtime::value::dynamic_object::js_dynamic_object_get_property 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/perry-runtime/src/value/dynamic_object.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"e273e9eccafbace8984dcdb12fae70d42035163fc099b567c42cef8b6f98dec0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_stdlib::webcrypto::wrap::js_webcrypto_unwrap_key: FunctionTooLong \u2014 perry_stdlib::webcrypto::wrap::js_webcrypto_unwrap_key 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/perry-stdlib/src/webcrypto/wrap.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabc91b2dc7d3fa577b6ca7ae5ea234af0e82fa5c529b1603bbcdf84407ea024"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_android::widgets::bottom_nav::add_item: FunctionTooLong \u2014 perry_ui_android::widgets::bottom_nav::add_item 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/perry-ui-android/src/widgets/bottom_nav.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"329a0e93a2377c6310f117f4a4ba3d75e30bed62427fa9275cfb2132f945f65a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generator/lower.rs: FileTooLong \u2014 949 significant 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 449 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/perry-transform/src/generator/lower.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c019b06c0a626164d129c78c41686abf12b8e3da4494dea76cc950672b5901bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/index_get.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/perry-codegen/src/expr/index_get.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa5729efbdc100acd0c83611fde39b98516527e649da6bc8c866dadcb9a0c99"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcrypto/util.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), declaring 68 free functions. 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/perry-stdlib/src/webcrypto/util.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20119c6eabb0ea470f0d460967798557a08c16e2a737b98fcf092566b65e4352"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node_stream/proto_methods.rs: FileTooLong \u2014 947 significant 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 447 over it, 1.89\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/perry-runtime/src/node_stream/proto_methods.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a73e73a746e189beaaa52bc2c44b6c226209542395e0ffb45a4092171dcd91"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/audio_playback.rs: FileTooLong \u2014 947 significant 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 447 over it, 1.89\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/perry-ui-macos/src/audio_playback.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9508799e58c1916793904b9920fcb7932cd4792d427792e9f19712fcf26b831"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower_call/scalar_method.rs: FileTooLong \u2014 945 significant 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 445 over it, 1.89\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/perry-codegen/src/lower_call/scalar_method.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02beb9aab071910ccc95b66cf9d9dfe992b3ebc5a238f59f8f10b9942f211ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: crypto/kdf.rs: FileTooLong \u2014 945 significant 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 47 free functions. The bar is 500 significant lines; this is 445 over it, 1.89\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/perry-stdlib/src/crypto/kdf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"435e9874cd9f8a49e63f8d10b9015303596e90a42cc09821c64d33b64f671696"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::logical_collections::lower_captureless_some_inline: FunctionTooLong \u2014 perry_codegen::expr::logical_collections::lower_captureless_some_inline runs 189 significant 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 89 over it, 1.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/logical_collections.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c42e5e641d4cad505af454577a7b2eec9bec87429dc826feea8f0a2035f4f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::child_process::reactor::cp_reactor_pump_inner: FunctionTooLong \u2014 perry_runtime::child_process::reactor::cp_reactor_pump_inner runs 189 significant 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 89 over it, 1.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/child_process/reactor.rs"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c4c6098c37dc2d793f44e730ed37b9073c629b0c171061583419399ab9eedc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: emit/exprs.rs: FileTooLong \u2014 941 significant 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 100% of them inside a single declaration: JsEmitter (4-1265). The bar is 500 significant lines; this is 441 over it, 1.88\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/perry-codegen-js/src/emit/exprs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ce9b511264c3704b31fb286bb104d45e2ae40154a97ba0f7f26a21fdf9dc03"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/shapes_store.rs: FileTooLong \u2014 941 significant 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 441 over it, 1.88\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/perry-runtime/src/object/shapes_store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8b9cf99f82e7c6ab7b83f1360ef2690c0e9c87b3c0c9900afb8cb668d5250b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/layout_desc.rs: FileTooLong \u2014 940 significant 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 440 over it, 1.88\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/perry-codegen/src/layout_desc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90cf6b0d85130933c918262bb78d2709693e547da325d2121ade6417fce91b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower_decl/class_captures.rs: FileTooLong \u2014 940 significant 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 440 over it, 1.88\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/perry-hir/src/lower_decl/class_captures.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22832bb023878c6e101105344129ecf7f4ff1d4e0faff42d4115c8c9adf12ac2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/update_checker.rs: FileTooLong \u2014 940 significant 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 440 over it, 1.88\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/perry/src/update_checker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e2b6748d462233383273adc0c397b3f9e8f5e58d34fdab59d75b65dbd05756"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::func_ref::try_emit_spec_static_call: FunctionTooLong \u2014 perry_codegen::lower_call::func_ref::try_emit_spec_static_call runs 188 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/func_ref.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42446ad75046692f407556c1b90698c0a971d1b8ee779bd3cc07ad7974d2f68"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: crypto/cipher.rs: FileTooLong \u2014 939 significant 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 31 free functions. The bar is 500 significant lines; this is 439 over it, 1.88\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/perry-stdlib/src/crypto/cipher.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ac92b4706b8b9b51f281faae288abb891d8bdda850954ea8c485f8a8e7e5e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/static_field_meta.rs: FileTooLong \u2014 938 significant 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 438 over it, 1.88\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/perry-codegen/src/expr/static_field_meta.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83bea369f2cbf5f168d8c1d286553e06465dcd3a33bc46a28df2a76d2ad0c92"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node_submodules/diagnostics.rs: FileTooLong \u2014 937 significant 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 84 free functions. The bar is 500 significant lines; this is 437 over it, 1.87\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/perry-runtime/src/node_submodules/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80df54307a63fdb3cfbf22bddac8b717df415718c12b8cd65021c0d9d02b5937"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/property_get.rs: FileTooLong \u2014 936 significant 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 436 over it, 1.87\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/perry-codegen/src/expr/property_get.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ade14eca038c1ec51daca3a91cf4d9b1535d3b005d976f03e24aaebc591b2e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: options/fetch.rs: FileTooLong \u2014 935 significant 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 435 over it, 1.87\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/perry-codegen/src/lower_call/options/fetch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f126da09d8f97d62ea2db5f06b3f0d0c1780742c6490b1e2ac0f6f7497a2728"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NumberAtReadFlow.stmt: MethodTooLong \u2014 stmt runs 187 significant 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 87 over it, 1.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/perry-codegen/src/collectors/number_by_construction.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"36802e1bfae5782a47bcf039aa8b8690696f81ee94e4ecd1c4a1fec78104d1d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::child_proc::lower: FunctionTooLong \u2014 perry_codegen::expr::child_proc::lower runs 187 significant 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 87 over it, 1.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/perry-codegen/src/expr/child_proc.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba5d943437c29342b98f16e008d62711ed3cf505d06816bf4e017ed026ff141"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ext_ws::js_ws_process_pending: FunctionTooLong \u2014 perry_ext_ws::js_ws_process_pending runs 187 significant 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 87 over it, 1.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/perry-ext-ws/src/lib.rs"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d00233cbcfd5796c7cea35411613222a475ff770be87f9525455da74091393a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::field_get_set::get_field_by_name::class_value_get_field: FunctionTooLong \u2014 perry_runtime::object::field_get_set::get_field_by_name::class_value_get_field runs 187 significant 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 87 over it, 1.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/perry-runtime/src/object/field_get_set/get_field_by_name.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"799434bc61999702bc2d429d506f41e6dcd0ed7d596274a5e20b794c958789ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: field_get_set/get_field_by_name_tail.rs: FileTooLong \u2014 934 significant 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 434 over it, 1.87\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/perry-runtime/src/object/field_get_set/get_field_by_name_tail.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61212ca32276d5704a8d341c253b548654823ca4322f6699f0b3ffcf81765bd0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::buffer::store::layout: TooManyFunctions \u2014 56 free functions. The bar is 30 free functions; this is 26 over it, 1.87\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/perry-runtime/src/buffer/store/layout.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8368ed6354c5302f21b552adbeed918c0f4f4eb26ffdd7a4827607841e9dcc74"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: region_loop/mod.rs: FileTooLong \u2014 933 significant 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 433 over it, 1.87\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/perry-codegen/src/stmt/region_loop/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e7a9a58fe35f279a2bae252619a3b72bed27b77dc3709d4ef5f90318dacb8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::ui_styling::apply_inline_style: FunctionTooLong \u2014 perry_codegen::lower_call::ui_styling::apply_inline_style runs 186 significant 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 86 over it, 1.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/perry-codegen/src/lower_call/ui_styling.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d12c9e1f5e39fa38c810d3537cea506925a74c0bd446b5903c4e00e17b18069"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_call::native_module::imported_module_dispatch::try_imported_module_dispatch: FunctionTooLong \u2014 perry_hir::lower::expr_call::native_module::imported_module_dispatch::try_imported_module_dispatch runs 186 significant 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 86 over it, 1.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/perry-hir/src/lower/expr_call/native_module/imported_module_dispatch.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"00729aa22adc710ad1433bde7af67a8e2f65c7b580fbbda3d98a318305e36759"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::class_constructors::js_super_construct_apply: FunctionTooLong \u2014 perry_runtime::object::class_constructors::js_super_construct_apply runs 186 significant 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 86 over it, 1.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/perry-runtime/src/object/class_constructors.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b93111fcb6fe920e99aade6b3cb3884443bc767747ae2efff3fc159789d3bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::class_registry::parent_static::js_class_static_method_call: FunctionTooLong \u2014 perry_runtime::object::class_registry::parent_static::js_class_static_method_call runs 186 significant 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 86 over it, 1.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/perry-runtime/src/object/class_registry/parent_static.rs"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"e588db6b1d38bb71ad18aff1fc48d8a00b420afb4c43f5fad266df4ec1ec476a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_stdlib::webcrypto::hmac::js_webcrypto_verify: FunctionTooLong \u2014 perry_stdlib::webcrypto::hmac::js_webcrypto_verify runs 186 significant 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 86 over it, 1.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/perry-stdlib/src/webcrypto/hmac.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"5051cdcea60a665c034a891321519e7733c75223af0e4faf62b538e5cdce7e6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/math_simple.rs: FileTooLong \u2014 928 significant 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 428 over it, 1.86\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/perry-codegen/src/expr/math_simple.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"267961e4456ccaf48176490974d09ac894488a572947ff79a3e830310b872b89"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower_call/builtin.rs: FileTooLong \u2014 928 significant 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 428 over it, 1.86\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/perry-codegen/src/lower_call/builtin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5192b4fa27f70fbfe4b319e9e5bb34c09e76ff9c9a50f8907dc7da09d9d608b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bun_ffi/dlopen.rs: FileTooLong \u2014 927 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 51 free functions. The bar is 500 significant lines; this is 427 over it, 1.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/perry-runtime/src/bun_ffi/dlopen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7185edfbefc96a461995aa2543c84652857128e1842b70190a71f1692868c3b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower/const_fold_fn.rs: FileTooLong \u2014 925 significant 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 425 over it, 1.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/perry-hir/src/lower/const_fold_fn.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7534320ddb83e43d66cc2d6da08ffd68a385262f9c354b21ab3c94047a53ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: array/subclass.rs: FileTooLong \u2014 925 significant 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 425 over it, 1.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/perry-runtime/src/array/subclass.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc16e25abb7e4a45118c1df72f408265ade540d154850b19c7dd4a05eb5b6f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::intl::date_collator::temporal::temporal_locale_string: FunctionTooLong \u2014 perry_runtime::intl::date_collator::temporal::temporal_locale_string runs 185 significant 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 85 over it, 1.85\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/perry-runtime/src/intl/date_collator/temporal.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4954d25e8d03723ea6b4af4b95291da168e92e25640f6278efa0529c4034cf5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::json_tape::build_tape_into: FunctionTooLong \u2014 perry_runtime::json_tape::build_tape_into runs 185 significant 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 85 over it, 1.85\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/perry-runtime/src/json_tape.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d8c68b3226e1484bc12730ec6fcb258323c5b852d92f3003ecb03eac427fc6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::native_call_method::collection_methods::dispatch_map_set: FunctionTooLong \u2014 perry_runtime::object::native_call_method::collection_methods::dispatch_map_set runs 185 significant 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 85 over it, 1.85\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/perry-runtime/src/object/native_call_method/collection_methods.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"413b6a4aeed5b3a26aef4fbabab54a7ef7c2b9b98bff372ea83e30cd9a0cfe11"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/perf_frontier_report.py: FileTooLong \u2014 923 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 423 over it, 1.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":"scripts/perf_frontier_report.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52833793a623453f6410bdc4f06ca7d5dac5ae60d72f83e19637914ea0753267"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/module.rs: FileTooLong \u2014 923 significant 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 90% of them inside a single declaration: LlModule (2 blocks, 53-1692). The bar is 500 significant lines; this is 423 over it, 1.85\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/perry-codegen/src/module.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af32034a318f00067b0de439a4ba3f0ed9d0a932eaaa20b1718005117fbcb69"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stmt/element_shape_loop.rs: FileTooLong \u2014 922 significant 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 422 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/perry-codegen/src/stmt/element_shape_loop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b4f421e718f4a74ab2880b8dcf85bb9d40cb752523f160b3fc45b11f30130c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dns.rs: FileTooLong \u2014 922 significant 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 113 free functions. The bar is 500 significant lines; this is 422 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/perry-runtime/src/dns.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"deae1d46d35ffb7b5587665c8e2f55d758cf9e5e02a4eb7631cf452562514d4d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: monomorph/substitute_expr.rs: FileTooLong \u2014 921 significant 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 421 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/perry-hir/src/monomorph/substitute_expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9a30881f2a97fbdae56aa2be77309570e02f200b1e73cf1df000baf6b7e033"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: array/iterator.rs: FileTooLong \u2014 920 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 50 free functions. The bar is 500 significant lines; this is 420 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/perry-runtime/src/array/iterator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fbd73c240c87bc2d57afac010630a2f1225b69117a0929629784e413d21003"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsEmitter.emit_stmt: MethodTooLong \u2014 emit_stmt runs 184 significant 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 84 over it, 1.84\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/perry-codegen-js/src/emit/stmts.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ca35a4a27a74b0da78b4b347c890d799c2c61221daab157ba666670a18cb76"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::property_get::completed_object::try_lower: FunctionTooLong \u2014 perry_codegen::lower_call::property_get::completed_object::try_lower runs 184 significant 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 84 over it, 1.84\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/perry-codegen/src/lower_call/property_get/completed_object.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ffc7d10626290842de33976ad745a762f045aea4d7c6b2ee66d473ec0f27e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::opt_report::render::render_text_with_sources: FunctionTooLong \u2014 perry_codegen::opt_report::render::render_text_with_sources runs 184 significant 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 84 over it, 1.84\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/perry-codegen/src/opt_report/render.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e44318ba620fd301000ae7185efad44a3d4ae71c272ff13883c5d781fa93acd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::js_transform::imports::transform_stmt: FunctionTooLong \u2014 perry_hir::js_transform::imports::transform_stmt runs 184 significant 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 84 over it, 1.84\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/perry-hir/src/js_transform/imports.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f92484f8dfa3fceae3003d7adc682e564e92f5fd48144d6b1c4dee42f016fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::gc::layout_slot_visit::visit_gc_rewrite_slot_descriptors_with: FunctionTooLong \u2014 perry_runtime::gc::layout_slot_visit::visit_gc_rewrite_slot_descriptors_with runs 184 significant 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 84 over it, 1.84\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/perry-runtime/src/gc/layout_slot_visit.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"38739acd4c8a00680633d0bd11fa726f65e331cc879cb5c708bcd17ecb961746"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypeFacts: TooManyMethods \u2014 55 methods. The bar is 30 methods; this is 25 over it, 1.83\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/perry-codegen/src/collectors/hir_facts.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"24516010060c8adfcc7318314b99063ec5242aedf723a5b881dcdb90b1a676ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/package_bench_attr.py: FileTooLong \u2014 916 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 416 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":"scripts/package_bench_attr.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b128b3d1e349a7a26ad5a98e92b41897cd1a1076683b62eea20b338e92693adc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::loop_bounded_i32::walk_accumulator_stmts: FunctionTooLong \u2014 perry_codegen::collectors::loop_bounded_i32::walk_accumulator_stmts runs 183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/loop_bounded_i32.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"faaa4250a11142f63bab4730dac3be34084fac4765103973a78d6ed8251eeeeb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::lower_expr::arm_bin::lower_bin_expr: FunctionTooLong \u2014 perry_hir::lower::lower_expr::arm_bin::lower_bin_expr runs 183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/lower_expr/arm_bin.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fce4890990fb1f7faee7f3be0f452ce0428f0ccf1112b1704eb16d9dd39bf2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::turnloop_net::dispatch: FunctionTooLong \u2014 perry_runtime::turnloop_net::dispatch runs 183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/turnloop_net/mod.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01f58a70691105f5efd1a8384d0618ee8b8d0b8c87fc67a869d4ae3952710f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/arrays_finds.rs: FileTooLong \u2014 912 significant 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 412 over it, 1.82\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/perry-codegen/src/expr/arrays_finds.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b87a80f00738d4ea59669356a7d948e8eeaa108c62183698c5d8f6398eed54"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stmt/let_stmt.rs: FileTooLong \u2014 912 significant 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 412 over it, 1.82\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/perry-codegen/src/stmt/let_stmt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b70bd183f5a507ec9fb7cfd97f7c522e39668565f29247c064497f09d87fcd2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 912 significant 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 412 over it, 1.82\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/perry-wasm-host/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38dcf19931652d2817436abdbf48850d2a0f912084d90e49dc659b8fa507b91b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js_transform/local_natives.rs: FileTooLong \u2014 910 significant 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 410 over it, 1.82\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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c4c633fe9887e56dfdcfe5157e61490f783ae5cc3f0b4cc6e988ca932e1ead"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/os_process_streams.rs: FileTooLong \u2014 910 significant 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 78 free functions. The bar is 500 significant lines; this is 410 over it, 1.82\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/perry-runtime/src/os_process_streams.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b17326fca32287b42e1786c01c82e90195948f5bc56555292a9ffdf551af8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals: FunctionTooLong \u2014 perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals runs 182 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/pre_scan/weakref_locals.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c1c6e772623ebed5c8935b504e970b1f8ebeeb9e8f461dc691fb9e9cbe9534"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fetch/mod.rs: FileTooLong \u2014 909 significant 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 68 free functions. The bar is 500 significant lines; this is 409 over it, 1.82\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/perry-stdlib/src/fetch/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11bc88e1f8e8da51c0cab0abde0087c052b9d3a359fcee75989ace79fada055"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collectors/segview.rs: FileTooLong \u2014 906 significant 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 406 over it, 1.81\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/perry-codegen/src/collectors/segview.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"132f078a769531fa22faf7ad960dbffa16047bf5981fe9d70892fcc077680e44"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/misc_methods.rs: FileTooLong \u2014 906 significant 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 406 over it, 1.81\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/perry-codegen/src/expr/misc_methods.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b17c67e3c37327b6ee9b4a254608bf6d7a2c177384943e52c37eff6da6ab5cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: inline/cross_module.rs: FileTooLong \u2014 905 significant 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 405 over it, 1.81\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/perry-transform/src/inline/cross_module.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfff2607f56ba567bb4b41534c289286c9254bb6e7ac3e5b61867485902f7c8c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::slot_rep::collect_canonical_str_ineligible_locals: FunctionTooLong \u2014 perry_codegen::expr::slot_rep::collect_canonical_str_ineligible_locals runs 181 significant 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 81 over it, 1.81\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/perry-codegen/src/expr/slot_rep.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"de04106a207c0ad8a0e1a9a0990f1b037136e20eae7d01a5b9a366d7c8f29de9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::loops::expr_array_length_effect: FunctionTooLong \u2014 perry_codegen::stmt::loops::expr_array_length_effect runs 181 significant 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 81 over it, 1.81\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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":9107}}}],"partialFingerprints":{"codehealthFindingId/v1":"7886cb9e88071eac75c31146dd40d8233a643c5c50a12c0807b55e00c9765e7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::class_registry::construct::construct_function_impl: FunctionTooLong \u2014 perry_runtime::object::class_registry::construct::construct_function_impl runs 181 significant 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 81 over it, 1.81\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/perry-runtime/src/object/class_registry/construct.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c1af0fb285b5e312794b829a0871eb8d127349f15af2f89c589a1f09d31730"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::property_ops::put_value::object_array_numeric_write_slots: FunctionTooLong \u2014 perry_runtime::object::property_ops::put_value::object_array_numeric_write_slots runs 181 significant 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 81 over it, 1.81\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/perry-runtime/src/object/property_ops/put_value.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"978f10b35225ad75046dfae788d078edaa79874cea671ca23db378f1b2ea0e4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lower_string_method.rs: FileTooLong \u2014 904 significant 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 404 over it, 1.81\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/perry-codegen/src/lower_string_method.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a885959c63406c84d97ee64063e7ed3f8c80a9e2ad8dc35740d717f61542e08"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/node_stream_iter_helpers.rs: FileTooLong \u2014 904 significant 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 404 over it, 1.81\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/perry-runtime/src/node_stream_iter_helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"159298b72faca27c4738709218388b6f3ed81063c1c9bddfc140c17af657582b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Planner.expr: MethodTooLong \u2014 expr runs 180 significant 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 80 over it, 1.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/perry-codegen/src/stmt/region_loop/plan.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"592d1b3f6c12529f4693a5f35bef43902889db517e8725b70c6965d196ccbd41"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ext_http::server::http2_server::pump::process_pending_h2_events: FunctionTooLong \u2014 perry_ext_http::server::http2_server::pump::process_pending_h2_events runs 180 significant 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 80 over it, 1.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/perry-ext-http/src/server/http2_server/pump.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63a6915b3f0af62ebe76308e515779274291f55241de1619bf88f48737b879a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::json::replacer::js_json_stringify_full: FunctionTooLong \u2014 perry_runtime::json::replacer::js_json_stringify_full runs 180 significant 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 80 over it, 1.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/perry-runtime/src/json/replacer.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d7f227e0f9ba6e50c363754b8a5692238ab77bfd67fed39d9fa7ed1c881ce6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::json::stringify::stringify_array_depth: FunctionTooLong \u2014 perry_runtime::json::stringify::stringify_array_depth runs 180 significant 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 80 over it, 1.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/perry-runtime/src/json/stringify.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d720d8021eadd9dfd0f58125d5f4617c3d62133fd180aa8c3672b84ad6a368"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/gc_runtime_root_holders.py: FileTooLong \u2014 899 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 399 over it, 1.80\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":"scripts/gc_runtime_root_holders.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"735e64f4d1de9620108cc83030afc0f3f8f4b3d8ea109be459a8c8095563c26b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower_decl/block.rs: FileTooLong \u2014 898 significant 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 398 over it, 1.80\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/perry-hir/src/lower_decl/block.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc842a9578da759c5c9e8382bea61062798a876127748d46709b610711ade21f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gc/trace.rs: FileTooLong \u2014 897 significant 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 397 over it, 1.79\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/perry-runtime/src/gc/trace.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25828fe38401d2e7fef8b57708def14f3257c629e729803546fda8bc9e3ef0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/weakref.rs: FileTooLong \u2014 897 significant 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 60 free functions. The bar is 500 significant lines; this is 397 over it, 1.79\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/perry-runtime/src/weakref.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5eacea7a868169f59abfa6688f64f2a6fb876ce4a62bc3f033952f6fe787cd5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/key_attrs.rs: FileTooLong \u2014 896 significant 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 69 free functions. The bar is 500 significant lines; this is 396 over it, 1.79\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/perry-runtime/src/object/key_attrs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d4af65768ad0e16bbb750c36650d2fd8e4b37188e0b7d04cbd30ebee6280cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::escape_objects::check_object_literal_escapes_in_expr: FunctionTooLong \u2014 perry_codegen::collectors::escape_objects::check_object_literal_escapes_in_expr 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/perry-codegen/src/collectors/escape_objects.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a527930229d092b2467b502ebd40487e342166ed7f2a8420e470468f81a26b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::closure_analysis::widen_mutable_captures_expr: FunctionTooLong \u2014 perry_hir::lower::closure_analysis::widen_mutable_captures_expr 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/perry-hir/src/lower/closure_analysis.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"372c15595affa2b0e37fa2aa3d1bf377b95dfc4f37ff0a94e1ad5c5e0d15c714"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::builtins::formatting::format_jsvalue: FunctionTooLong \u2014 perry_runtime::builtins::formatting::format_jsvalue 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/perry-runtime/src/builtins/formatting.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3738d41105726a0496ff95bf45ec867bda959030f33001697bddd608f1b6d75"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_stdlib::common::dispatch::method_dispatch::arm_http_server: FunctionTooLong \u2014 perry_stdlib::common::dispatch::method_dispatch::arm_http_server 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/perry-stdlib/src/common/dispatch/method_dispatch.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fa9f4739378a962b5bfb69d54d949ccc89343175ddd7ed35dde8c0d5d88343"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower/expr_assign.rs: FileTooLong \u2014 892 significant 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 392 over it, 1.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_assign.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4113ddcfd4980976bc5cf26462647b8e86ff9deff19098a94995dce1824f6bb0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::loops::match_packed_f64_range_loop: FunctionTooLong \u2014 perry_codegen::stmt::loops::match_packed_f64_range_loop runs 178 significant 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 78 over it, 1.78\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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":1754}}}],"partialFingerprints":{"codehealthFindingId/v1":"190391929a93433c1ee1e4fc599fd8ce216dc8930120d9e695080cdcfdc46f8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: class_registry/state.rs: FileTooLong \u2014 889 significant 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 79 free functions. The bar is 500 significant lines; this is 389 over it, 1.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/class_registry/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3ea3fa5246cfdab5e3081010e9f76677a1d731a0819adb4474c6f0065d3634"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/eh_walker.rs: FileTooLong \u2014 886 significant 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 386 over it, 1.77\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/perry-runtime/src/eh_walker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f2a340da0be74b955b77f80dba5eebcf188a5ca896a67642b8ef962dd4dec5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcrypto/aes.rs: FileTooLong \u2014 885 significant 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 385 over it, 1.77\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/perry-stdlib/src/webcrypto/aes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"311cfd45f8372614855a83ba46aa5dfebae634699024667500b5c39826272f77"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::ptr_shape_numeric::expr_numeric_by_construction_with_region: FunctionTooLong \u2014 perry_codegen::collectors::ptr_shape_numeric::expr_numeric_by_construction_with_region runs 177 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/ptr_shape_numeric.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39fecc201c394f43d5e77b5bf1b1e560142cd9de17b3bcf84bb6490378f71a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_stdlib::common::dispatch::property_dispatch::prop_http_server: FunctionTooLong \u2014 perry_stdlib::common::dispatch::property_dispatch::prop_http_server runs 177 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/common/dispatch/property_dispatch.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"59faee202843a5cc2cdd3db670823610d30c29f477b877c72f4f49baed4b4f32"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/event_target.rs: FileTooLong \u2014 884 significant 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 76 free functions. The bar is 500 significant lines; this is 384 over it, 1.77\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/perry-runtime/src/event_target.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1ca9f727d6ec48e14e330f0468cb8e625b208a99f024e0078fead0696339be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/os.rs: FileTooLong \u2014 884 significant 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 384 over it, 1.77\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/perry-runtime/src/os.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"305d5c623014cd75a790042970e4c23de150ab1f46928a6c5771deca78a72343"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: model/operations.rs: FileTooLong \u2014 884 significant 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 100% of them inside a single declaration: Model (2 blocks, 3-1431). The bar is 500 significant lines; this is 384 over it, 1.77\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/perry-wpfacts/src/model/operations.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed79d2fb7e5f13c90d1bd3e331f33f6668ec3958828ca3301a748b6037f41ee6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::dyn_eval::bridge: TooManyFunctions \u2014 53 free functions. The bar is 30 free functions; this is 23 over it, 1.77\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/perry-runtime/src/dyn_eval/bridge.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f096647d06d79b12580c623129de4563594fdb08eac96fb61cc0a5e02728df"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::node_submodules::stream_promises: TooManyFunctions \u2014 53 free functions. The bar is 30 free functions; this is 23 over it, 1.77\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/perry-runtime/src/node_submodules/stream_promises.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1912968bb421aa6f876be5d5253b92a731ffaffe53d5bd3332420c01ee1546f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/binary.rs: FileTooLong \u2014 882 significant 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 382 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/perry-codegen/src/expr/binary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4fc9960dd630cbe6a11b405f82d2050af233aaae393d92ae04a5c2d8af1fbe8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js_transform/imports.rs: FileTooLong \u2014 881 significant 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 381 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/perry-hir/src/js_transform/imports.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ca2e1d6c522166581ae6a698f11b19523dcf85a1b595e14d123b3bf4c9ba46"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: json/replacer.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/perry-runtime/src/json/replacer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01eea35538372aea7d6164aa04a3d59c26d066dbe6b2525f8b43085936c33e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::let_scalar_new::try_lower_scalar_replaced_new: FunctionTooLong \u2014 perry_codegen::stmt::let_scalar_new::try_lower_scalar_replaced_new runs 176 significant 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 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/let_scalar_new.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f77ac82b4b2e0807b371781aa9d0e91e51c1688bd7df69a1bed3b49f3fa5916"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::component::persistent::poll::cycle: FunctionTooLong \u2014 perry_runtime::component::persistent::poll::cycle runs 176 significant 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 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/component/persistent/poll.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"834ab75d8ec891cb87536fe191a81294468163262c61bd9c68a2762909c61192"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::generator::lower::async_step::build_async_step_driver_direct: FunctionTooLong \u2014 perry_transform::generator::lower::async_step::build_async_step_driver_direct runs 176 significant 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 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/generator/lower/async_step.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fdbd2bb4afb1b97d3af6959f649089885a0c13c3209eb2f378d74b407d25c89"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::inline::call_inliner::try_inline_simple_call: FunctionTooLong \u2014 perry_transform::inline::call_inliner::try_inline_simple_call runs 176 significant 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 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/inline/call_inliner.rs"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"43de114bd014b593ad874d54a6f0ad5b6aa3416eb447ed7b376adfa5f48c5347"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/copied_minor_fallback_report.py: FileTooLong \u2014 878 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 378 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":"scripts/copied_minor_fallback_report.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2defc24bcb0d82846a63433dd74db29669279f57087e8c7311c64349d8fb3a7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: url/node_compat.rs: FileTooLong \u2014 877 significant 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 377 over it, 1.75\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/perry-runtime/src/url/node_compat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6043533066170c9ef06d0557c7eafcd0599e6e44d409c93c84989abaad941897"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dyn_eval/interp.rs: FileTooLong \u2014 876 significant 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 376 over it, 1.75\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/perry-runtime/src/dyn_eval/interp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0977f38ab560386137f06af03a1cbebf8625134c14e5e25821797abcc65dbe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: array/iter_methods.rs: FileTooLong \u2014 875 significant 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 31 free functions. The bar is 500 significant lines; this is 375 over it, 1.75\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/perry-runtime/src/array/iter_methods.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1d7f9e94ca20a8144a5a413ce94780d533982706d827aa5dac9b527a98e2d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::child_process::fork::js_child_process_fork: FunctionTooLong \u2014 perry_runtime::child_process::fork::js_child_process_fork runs 175 significant 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 75 over it, 1.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/child_process/fork.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4c7c045a783d594a22991669cb116773fcd612de8de51a7af0654feaf232d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compile/object_cache.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). 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/perry/src/commands/compile/object_cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b2fc08c276cbccb622c20bf431e523ec3f6ba44ca7300324d98ab830fec14f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::loops::stmt_array_length_effect: FunctionTooLong \u2014 perry_codegen::stmt::loops::stmt_array_length_effect 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":8887}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6eceac3b33be3758f9548cb1aea2c5fca29e7b7400ab4c05e957660322e7df4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::native_call_method::common_methods::dispatch_common: FunctionTooLong \u2014 perry_runtime::object::native_call_method::common_methods::dispatch_common 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/perry-runtime/src/object/native_call_method/common_methods.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"09788605d0a86bd2e902538babe4341054a991e31651ded271867389627529c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: json/parser.rs: FileTooLong \u2014 869 significant 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 369 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/perry-runtime/src/json/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30df0852b8e4af3326824407e70d4f553682403df562fc15e9855f03b937fac8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/class_value.rs: FileTooLong \u2014 868 significant 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 86 free functions. The bar is 500 significant lines; this is 368 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/perry-runtime/src/object/class_value.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf196758f0313c2b8648d5ca7a2e0256a24ac3b193c8308f4b9f2b363cb4b2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/emit.rs: FileTooLong \u2014 867 significant 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 367 over it, 1.73\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/perry-codegen-swiftui/src/emit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"906be40b3acf40676fcac60077083f619720be39a9f1fd2987d61e09bc2a3570"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: string/concat.rs: FileTooLong \u2014 867 significant 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 367 over it, 1.73\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/perry-runtime/src/string/concat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ced9527390bb4860f6db25cfe75640c40a0cb61652f3b585ab24304e16afd2c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::closure::dispatch::calln: 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/perry-runtime/src/closure/dispatch/calln.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b874c4d30ba496f7e5244a63df499e28f64088ba53dee5555ca1022f216247e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::url_hooks: 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/perry-runtime/src/url_hooks.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9210eb5728ec256fe228b9cff37dfbef2731ca9152b67b47a5b43fe6af34929b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::util_mime: 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/perry-runtime/src/util_mime.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a656560daecc5e98e9b9de810a6c707da6284a45028b664f030c69d8a4d6379"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_tvos::ffi::media_extras: 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/perry-ui-tvos/src/ffi/media_extras.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d801b02e90f76ba6cda290e0e067a3d75e8ac42fa1171ab3dd7cb053122fd203"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_visionos::ffi_core: 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/perry-ui-visionos/src/ffi_core.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"577ad71434964086d6ffcaeffe1e59d96d1202f783fae7a61dee74844df60d79"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ComposeService: TooManyFields \u2014 52 stored fields beside 14 methods. The bar is 30 stored fields; this is 22 over it, 1.73\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/perry-container-compose/src/types.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"c436fc1a985ee2baa4677124fad07d91c61bab4817064dba6c0a8e7aad546b52"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fs/callbacks.rs: FileTooLong \u2014 865 significant 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 365 over it, 1.73\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/perry-runtime/src/fs/callbacks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41cf1646070b34bf8b06fbaeb24f8f65b090abcc2064237a473fa349e0fd4ccb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/assert.rs: FileTooLong \u2014 865 significant 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 75 free functions. The bar is 500 significant lines; this is 365 over it, 1.73\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/perry-runtime/src/object/assert.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd243dce9ca6f44ee65f78e438fb7afb1bd3229f16ad8f80f4be33db7aec4a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::masked_window_region::lower_masked_window_region: FunctionTooLong \u2014 perry_codegen::stmt::masked_window_region::lower_masked_window_region runs 173 significant 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 73 over it, 1.73\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/perry-codegen/src/stmt/masked_window_region.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ea0270e496501b8a0df330bdcecb88c9e53edf392a4e0e8e65930bb92c9407"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::closure::dispatch::bound::function_bind_observable: FunctionTooLong \u2014 perry_runtime::closure::dispatch::bound::function_bind_observable runs 173 significant 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 73 over it, 1.73\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/perry-runtime/src/closure/dispatch/bound.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20adfae4006e7fa0cdc5cebc92ce45e93106309a6c8cabf6d9ae5d4aa099a0c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Gen.unit_boundary: MethodTooLong \u2014 unit_boundary runs 173 significant 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 73 over it, 1.73\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/perry-wpfacts/src/gen/export.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"485984e333edf9f09892cc82152b3c3f1c2d00b7c57b1d321af2c297765fd5f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lower_patterns.rs: FileTooLong \u2014 864 significant 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 364 over it, 1.73\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/perry-hir/src/lower_patterns.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee9d0233a3e241d7f9abde516ded203f3f9182aa750271af16d86835b8df22d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: array/indexing.rs: FileTooLong \u2014 862 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 33 free functions. The bar is 500 significant lines; this is 362 over it, 1.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/perry-runtime/src/array/indexing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84a29089e5dbd228b6da7425765aa64134c4e5ce02120052e58f772553d5300"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::escape_arrays::check_array_escapes_in_expr: FunctionTooLong \u2014 perry_codegen::collectors::escape_arrays::check_array_escapes_in_expr runs 172 significant 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 72 over it, 1.72\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/perry-codegen/src/collectors/escape_arrays.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eef9d2927ed857d4be9da4f8f41d4607daba8580bac9913d63fbe1fb598cda7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::proto_constants::lower_class_holder_read: FunctionTooLong \u2014 perry_codegen::proto_constants::lower_class_holder_read runs 172 significant 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 72 over it, 1.72\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/perry-codegen/src/proto_constants.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e50082fb1c6318058f864bc49fd107efca489a462d452fbe32b6dbb083c1313"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_call::nested_namespace::try_web_crypto_subtle: FunctionTooLong \u2014 perry_hir::lower::expr_call::nested_namespace::try_web_crypto_subtle runs 172 significant 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 72 over it, 1.72\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/perry-hir/src/lower/expr_call/nested_namespace.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"993848c00cd3deccfd4b90219ba89ef070ba98572bd310120c3e2d3052bd9249"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::monomorph::defaults::fill_defaults_in_expr: FunctionTooLong \u2014 perry_hir::monomorph::defaults::fill_defaults_in_expr runs 172 significant 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 72 over it, 1.72\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/perry-hir/src/monomorph/defaults.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb5b90db547b15828721c34a59b5fc487dfeb128548c7967c02bac255d696a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::native_module::constructor_exports::is_native_module_constructor_export: FunctionTooLong \u2014 perry_runtime::object::native_module::constructor_exports::is_native_module_constructor_export runs 172 significant 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 72 over it, 1.72\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/perry-runtime/src/object/native_module/constructor_exports.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd796e39046f7fad44f08a778438786f97ced61053753705d21080ddebba8e24"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: promise/async_step.rs: FileTooLong \u2014 858 significant 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 358 over it, 1.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/perry-runtime/src/promise/async_step.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f48bd6d437bfd6c634143925ffde3ad6017e32daa3b3a8a6ecde5ce2a6d7e3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: field_get_set/class_object_template.rs: FileTooLong \u2014 855 significant 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 355 over it, 1.71\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/perry-runtime/src/object/field_get_set/class_object_template.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5dff1c1857a0abd56d22275d10fd642ed7818ae8ac719eb09233814c63ce9b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::ptr_shape_elements::collect_element_shape_facts: FunctionTooLong \u2014 perry_codegen::collectors::ptr_shape_elements::collect_element_shape_facts runs 171 significant 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 71 over it, 1.71\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/perry-codegen/src/collectors/ptr_shape_elements.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"1acd5891e4ccdf2aa832235e5d11bbb9cd71aa417624693c965db22f015d0b68"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::analysis::fn_infer::round: FunctionTooLong \u2014 perry_hir::analysis::fn_infer::round runs 171 significant 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 71 over it, 1.71\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/perry-hir/src/analysis/fn_infer.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"57aabd63cb5a89759651bbb388fc44dc615141a36fb5ced8c00dd68e84a6c8d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::setup::android::android_wizard: FunctionTooLong \u2014 perry::commands::setup::android::android_wizard runs 171 significant 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 71 over it, 1.71\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/perry/src/commands/setup/android.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae29f9592b8b76e69387f50a8f0e17c48dff785067162edc081676326d88460"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/stream.rs: FileTooLong \u2014 851 significant 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 68 free functions. The bar is 500 significant lines; this is 351 over it, 1.70\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/perry-ext-zlib/src/stream.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a8ee505e58c37e8279cd42467dc8ef897506fb9381183cb78a22b371944cb8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: array/header.rs: FileTooLong \u2014 851 significant 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 79 free functions. The bar is 500 significant lines; this is 351 over it, 1.70\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/perry-runtime/src/array/header.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47d89deb093a350efdaaddff7be14df52265bb17962fa6965d992556e340bd7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ShapeRecord: TooManyMethods \u2014 51 methods, declared across 7 files: object/shapes_store.rs (29), shapes_store/transitions.rs (11), shapes_store/extras.rs (3), object/shapes_store_symbol_presence.rs (3), \u002B3 more file(s). The bar is 30 methods; this is 21 over it, 1.70\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/shapes_store.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b50c6fe1eef759f48951eda7f85f9bd1cc7f775970333f2120c2769caa87fa"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::object::util_types: TooManyFunctions \u2014 51 free functions. The bar is 30 free functions; this is 21 over it, 1.70\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/perry-runtime/src/object/util_types.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7a2b6ff3ab7aedb91782adbc68084d1aab317d5f7238b758feac8545886247"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::gc_map::decode_v3: FunctionTooLong \u2014 perry_codegen::gc_map::decode_v3 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/perry-codegen/src/gc_map.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee80f1438601bc706b07b5e33a662c1771832c2e5cc88ed1e3e46eeb997d99f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tty.rs: FileTooLong \u2014 848 significant 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 69 free functions. The bar is 500 significant lines; this is 348 over it, 1.70\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/perry-runtime/src/tty.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a06e3f085cdf0a31dbb02852d470dc0d6e8e11386cf900a4b71169e32b3ec5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: turnloop_serve/conn.rs: FileTooLong \u2014 846 significant 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 49 free functions. The bar is 500 significant lines; this is 346 over it, 1.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/perry-ext-http/src/server/turnloop_serve/conn.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a949915bd84b0e6ffc3aad2ad2726721d68f49513cf9a4b9ecbdb78e5a9cadd3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/canonical_keys.rs: FileTooLong \u2014 845 significant 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 31 free functions. The bar is 500 significant lines; this is 345 over it, 1.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/perry-runtime/src/object/canonical_keys.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f632940c5140f56874f339ef9c8b6a1e1d8a2fccf57b153563a1e2174e1a4b3c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/instance_misc1.rs: FileTooLong \u2014 843 significant 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 343 over it, 1.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/perry-codegen/src/expr/instance_misc1.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d32255fb4284953f651d5162b9916ac9f7ebd28fab352117e8f7c761c0a06ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/analysis.rs: FileTooLong \u2014 843 significant 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 343 over it, 1.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/perry-hir/src/analysis.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6876acb21945d7e8b5aa684eaa3a1adc50b877194001b906d9e688e5680544"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: process/env_misc.rs: FileTooLong \u2014 843 significant 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 80 free functions. The bar is 500 significant lines; this is 343 over it, 1.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/perry-runtime/src/process/env_misc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de319dddf1807493b60e5d7746af69381cebdf119a76e797453b07e8382c392"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: field_get_set/get_field_by_name.rs: FileTooLong \u2014 842 significant 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 342 over it, 1.68\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/perry-runtime/src/object/field_get_set/get_field_by_name.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b143751f86df39bb9a8f74bb1a87ebb0e9ab7ecd7cffed6acc02f79c1246a010"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bun_compat/spawn.rs: FileTooLong \u2014 840 significant 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 340 over it, 1.68\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/perry-runtime/src/bun_compat/spawn.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90aef63f4e2608c877449f1edaf81f763fc30a3195e7cc1eb99f5f92e616c0f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: os/signal.rs: FileTooLong \u2014 840 significant 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 340 over it, 1.68\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/perry-runtime/src/os/signal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8669b7a3558b722b605d78d3d7a128e785fc8413485a4213e0138bd6c2dc8b84"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: streams/transform.rs: FileTooLong \u2014 840 significant 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 340 over it, 1.68\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/perry-stdlib/src/streams/transform.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d865fb8d84a3c742892562f9d50c797fd7785621319d6e353a83a00938376f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::wasi_net::pump: FunctionTooLong \u2014 perry_runtime::wasi_net::pump runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/wasi_net/mod.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dbbc3d35594fb81f686c3a948f6884c90c58071409535af7a276de967d4e129"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::aggregate_scalar::return_record_stmts_are_safe: FunctionTooLong \u2014 perry_transform::aggregate_scalar::return_record_stmts_are_safe runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/aggregate_scalar.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"1857422cb69d3e016cfd70641f5023f65fb75ac2e8392df2a1c6bf2055cde2a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/literals_vars.rs: FileTooLong \u2014 839 significant 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 339 over it, 1.68\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/perry-codegen/src/expr/literals_vars.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7edf9e434e7e16733843ce3dface72b9578f033ede836eeaf994b78066fc48f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/model.rs: FileTooLong \u2014 838 significant 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 338 over it, 1.68\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/perry-wpfacts/src/model.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34b1aed9b90dce6def0ba7ad60998b6c4abe7a3dce40f9e37d2aefd6ec11b7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/native_module.rs: FileTooLong \u2014 837 significant 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 337 over it, 1.67\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/perry-runtime/src/object/native_module.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7416bd582b1240f89d5de8a4ac2fc8e7da57dc8c2eca5e2883540027ce368bdb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node_stream_constructors/web_adapter.rs: FileTooLong \u2014 835 significant 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 71 free functions. The bar is 500 significant lines; this is 335 over it, 1.67\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/perry-runtime/src/node_stream_constructors/web_adapter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7e4f5e5da2db65e180972eec6078c66b8501dc961b87df46b3fe9a83843905"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::loops::stmt_preserves_array_length: FunctionTooLong \u2014 perry_codegen::stmt::loops::stmt_preserves_array_length 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":9337}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc271c7e9624933242c51a53d279845db6412d4cc5dde8075ad83f68f38bd48"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::child_process::reactor::exec_async::cp_exec_async: FunctionTooLong \u2014 perry_runtime::child_process::reactor::exec_async::cp_exec_async 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/perry-runtime/src/child_process/reactor/exec_async.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2833184537b060f60dc3237458173dda31e24a9f3fccc998d294535d3d4faa54"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::field_get_set::enumeration::js_object_keys_shape: FunctionTooLong \u2014 perry_runtime::object::field_get_set::enumeration::js_object_keys_shape 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/perry-runtime/src/object/field_get_set/enumeration.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0d41f0cf4e7c991bbcba47261b59d5ef1b05dbbac111fca31f935d3c7d2f94"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::field_set_by_name::fast_paths::object_set_field_by_name_transition_fast_impl_value: FunctionTooLong \u2014 perry_runtime::object::field_set_by_name::fast_paths::object_set_field_by_name_transition_fast_impl_value 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/perry-runtime/src/object/field_set_by_name/fast_paths.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9b21449b2752db4f08b002e811ffc5375ae3c53a0bd4c7cd0a14f0a57cb1cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_stdlib::webcrypto::aes::js_webcrypto_encrypt: FunctionTooLong \u2014 perry_stdlib::webcrypto::aes::js_webcrypto_encrypt 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/perry-stdlib/src/webcrypto/aes.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56669640eab563ce2989b721e9665a57b269c1895cf3a450f6b5f4734372b26"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_stdlib::webcrypto::aes::js_webcrypto_decrypt: FunctionTooLong \u2014 perry_stdlib::webcrypto::aes::js_webcrypto_decrypt 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/perry-stdlib/src/webcrypto/aes.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea29ac32c6faed45fe60c7dc9c451d34a3aa5191169b178220e1ccdb81f4d836"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/gc_map.rs: FileTooLong \u2014 834 significant 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 334 over it, 1.67\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/perry-codegen/src/gc_map.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a046da9df2391e8f6b7a5f692822c7fabc5d79c5ab1eba9d37b7d9079e1dd8e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::object::native_module::web_locks: TooManyFunctions \u2014 50 free functions. The bar is 30 free functions; this is 20 over it, 1.67\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/perry-runtime/src/object/native_module/web_locks.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a97b9988cbc525bc0f5aede339e51cca91987e3309aa115daed1a5fb15931db"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::index_set_typed_array::emit_inline_ta_set: FunctionTooLong \u2014 perry_codegen::expr::index_set_typed_array::emit_inline_ta_set runs 166 significant 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 66 over it, 1.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/perry-codegen/src/expr/index_set_typed_array.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e08cfade5a9eb144850b541fc119a8b4691fea186bccec8e7fbeda229833b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_string_method::char_code_at::lower_inline: FunctionTooLong \u2014 perry_codegen::lower_string_method::char_code_at::lower_inline runs 166 significant 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 66 over it, 1.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/perry-codegen/src/lower_string_method/char_code_at.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"2106c5f840271892f93c8c14dfac5be0414bc5bdb9a1bb3a728b91286354631d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_call::native_module::try_native_module_methods: FunctionTooLong \u2014 perry_hir::lower::expr_call::native_module::try_native_module_methods runs 166 significant 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 66 over it, 1.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/perry-hir/src/lower/expr_call/native_module.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5e46a23babf808cb9512a20183778e3053e767141c935b81525608a76e0c98"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::component::asynchronous::step: FunctionTooLong \u2014 perry_runtime::component::asynchronous::step runs 166 significant 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 66 over it, 1.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/perry-runtime/src/component/asynchronous.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4e77b9786d08fc5a5e36f32ed208e7b8a77f45b189fbd3e5db6c3f77109d10"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::native_get::try_data_lookup_key: FunctionTooLong \u2014 perry_runtime::object::native_get::try_data_lookup_key runs 166 significant 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 66 over it, 1.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/perry-runtime/src/object/native_get.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b5c3f67e6e62412ea7bb55c4db52db4ba52b551e9f8d58f7f575493199c9ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::lowering_report::print_text_report: FunctionTooLong \u2014 perry::commands::compile::lowering_report::print_text_report runs 166 significant 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 66 over it, 1.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/perry/src/commands/compile/lowering_report.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"8521d107f7aad3d2764437b49225bcbd6e865401df057eb0e946401b4afaf1ea"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsEmitter.emit_ui_method_call: MethodTooLong \u2014 emit_ui_method_call runs 165 significant 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 65 over it, 1.65\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/perry-codegen-js/src/emit/calls.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"995cfd02ce39486cf93ca45eebc09a8ec7eced68416d270a5c604089ed2506ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::property_get::map_set::try_lower_map_set_methods: FunctionTooLong \u2014 perry_codegen::lower_call::property_get::map_set::try_lower_map_set_methods runs 165 significant 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 65 over it, 1.65\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/perry-codegen/src/lower_call/property_get/map_set.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a519024d3edd55270ddda776e6705d9efe660fd0315cb9cd1ba6c444780e1d0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Prepared.new: MethodTooLong \u2014 new runs 165 significant 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 65 over it, 1.65\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/perry-component-host/src/async_values/compose.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7622ca7033f2092b116b65658390476e8c56021ff90bb153ed27896295afe47e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::destructuring::assignment_expr::lower_destructuring_assignment: FunctionTooLong \u2014 perry_hir::destructuring::assignment_expr::lower_destructuring_assignment runs 165 significant 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 65 over it, 1.65\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/perry-hir/src/destructuring/assignment_expr.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a844d876be4b37d6b50161ba31da0de9d447645b15f6d24d4de45b711764cb6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::event_target::prototype::install: FunctionTooLong \u2014 perry_runtime::event_target::prototype::install runs 165 significant 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 65 over it, 1.65\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/perry-runtime/src/event_target/prototype.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"064d2df8b4ae55d630fca0bfb7758bceb561df0ca5ac2df29a071733430b7746"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::node_stream::proto_methods::build_stream_prototype: FunctionTooLong \u2014 perry_runtime::node_stream::proto_methods::build_stream_prototype runs 165 significant 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 65 over it, 1.65\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/perry-runtime/src/node_stream/proto_methods.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00c6b44dbef82c9a94e8d570aca95650318fdc7a908c99f229ffe54fc61f424"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_android::screenshot::perry_ui_screenshot_capture: FunctionTooLong \u2014 perry_ui_android::screenshot::perry_ui_screenshot_capture runs 165 significant 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 65 over it, 1.65\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/perry-ui-android/src/screenshot.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db96f4efb1be74e3aaca43d8124a82c0014fc43fc68e77f952185cce993efa2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: inline/factory_specialize.rs: FileTooLong \u2014 823 significant 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 323 over it, 1.65\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/perry-transform/src/inline/factory_specialize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f078cb6df49b8c2cc80f7b6666fa45a504f736c6c5e3f326f27e06c6c76da69"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_module/constants.rs: FileTooLong \u2014 819 significant 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 319 over it, 1.64\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/perry-runtime/src/object/native_module/constants.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2d9491da5e6cf75b0e8768cef3f389711efd581386f8f84052fd4ceff8884f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcrypto/jwk.rs: FileTooLong \u2014 819 significant 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 319 over it, 1.64\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/perry-stdlib/src/webcrypto/jwk.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad5c68066cbb4efd23a7bf11c47af0868e3160f8a6e15efc4a04cf28fc0eeee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compile/bootstrap.rs: FileTooLong \u2014 817 significant 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 317 over it, 1.63\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/perry/src/commands/compile/bootstrap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb696c4a5972f0a26dda10cad3456bb3227c5bcae1b4cabe51d9fa3b82f88c7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::node_v8: TooManyFunctions \u2014 49 free functions. The bar is 30 free functions; this is 19 over it, 1.63\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/perry-runtime/src/node_v8.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cb52c7a7920d62163e098cc22046df8bd4ab48ffa5b414e8ae2f55ffde68df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 816 significant 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 47 free functions. The bar is 500 significant lines; this is 316 over it, 1.63\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/perry-audio-miniaudio/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf20026609cd2c5dad6baec4987dd936a09654deea66f149f7054efb626893c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: intl/locale.rs: FileTooLong \u2014 816 significant 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 70 free functions. The bar is 500 significant lines; this is 316 over it, 1.63\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/perry-runtime/src/intl/locale.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"249e9c041cba62e349abb254b1ff998d3723cb48066d6fc8447c75c37a9e21e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::masked_window_region::try_match_masked_window_region: FunctionTooLong \u2014 perry_codegen::stmt::masked_window_region::try_match_masked_window_region 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/perry-codegen/src/stmt/masked_window_region.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81e0a198205c65a4245082f77d2952dd36870dcea8c632e9ebd5b6844f5e1ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::js_transform::cross_module_natives::fix_native_instance_expr: FunctionTooLong \u2014 perry_hir::js_transform::cross_module_natives::fix_native_instance_expr 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/perry-hir/src/js_transform/cross_module_natives.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd976ce2e109bcfbeb9f6c80d67693bc98b2cb7e3c1abf68129a8e3284f1d679"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_call::native_module::reflect_statics::try_reflect_statics: FunctionTooLong \u2014 perry_hir::lower::expr_call::native_module::reflect_statics::try_reflect_statics 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/perry-hir/src/lower/expr_call/native_module/reflect_statics.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e331cf8c16783471d0bce91376ea15de0529f92421b99c761302ee2e93ad45"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node_submodules/fs_promises.rs: FileTooLong \u2014 812 significant 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 312 over it, 1.62\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/perry-runtime/src/node_submodules/fs_promises.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"297d3fdcbccdc2bb5ec0f1673b901837fb32e70530da69137ba69a42883574f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collectors/typed_locals.rs: FileTooLong \u2014 810 significant 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 310 over it, 1.62\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/perry-codegen/src/collectors/typed_locals.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7804656b32231836e277fd0032a44a2b2be824899f8932ab8030dfcd6f46924"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collect_modules/feature_detect.rs: FileTooLong \u2014 810 significant 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 310 over it, 1.62\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/perry/src/commands/compile/collect_modules/feature_detect.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeda36a536f6a259b22ea83d9508a971513209fd1548c0d18af6cd9959dcdacc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower_decl::class_members::lower_constructor_in_scope: FunctionTooLong \u2014 perry_hir::lower_decl::class_members::lower_constructor_in_scope 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/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d277587bf1d8fdfb8a31f0bb0e58e7bc1e0838b8aa8b99484b1143c628fdb5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::native_module_dispatch::dispatch_m_p::nm_dispatch_path: FunctionTooLong \u2014 perry_runtime::object::native_module_dispatch::dispatch_m_p::nm_dispatch_path 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/perry-runtime/src/object/native_module_dispatch/dispatch_m_p.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fd1c856f23203f4984ad4fb5efd4e71a49ad182589fdc254579fc518525a35"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::generator::lower::abrupt::build_yield_star_throw_routes: FunctionTooLong \u2014 perry_transform::generator::lower::abrupt::build_yield_star_throw_routes 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/perry-transform/src/generator/lower/abrupt.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23a37240c3e858b8c282a54a478cdae09907466ba9b8cc97fd43f60862f1d20"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/i18n.rs: FileTooLong \u2014 809 significant 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 309 over it, 1.62\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/perry-runtime/src/i18n.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a993381c68223341feb5c2832407e2fe34d1d099f07b8c2dbbb6dae1a1c0aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::closure_analysis::collect_closure_assigned_expr: FunctionTooLong \u2014 perry_hir::lower::closure_analysis::collect_closure_assigned_expr runs 161 significant 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 61 over it, 1.61\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/perry-hir/src/lower/closure_analysis.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"8742c3a420e63a37e36afcdd7b13fa6e96b54b3b858146adac24ce8d62b947dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::value::to_string::js_jsvalue_to_string_impl: FunctionTooLong \u2014 perry_runtime::value::to_string::js_jsvalue_to_string_impl runs 161 significant 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 61 over it, 1.61\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/perry-runtime/src/value/to_string.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c8e6c5487f13a41389fc0ab8e515743908d1ec6cf2d7e21beac2a2da0826e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_windows_winui::widgets::render_handle: FunctionTooLong \u2014 perry_ui_windows_winui::widgets::render_handle runs 161 significant 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 61 over it, 1.61\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/perry-ui-windows-winui/src/widgets.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fba3a04672d4a04c8409bc0458dd758c846b7809d18f78f71389b177d3671ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/runtime_abi_check.py: FileTooLong \u2014 803 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 303 over it, 1.61\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":"scripts/runtime_abi_check.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc5be16581b427202d6ff935485f4a883fc7f3586de933e60b577010494a713"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compile/library_search.rs: FileTooLong \u2014 803 significant 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 303 over it, 1.61\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/perry/src/commands/compile/library_search.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cd216a7efc9f7e96c18d70c124c25885b54d16dedbee96ea880d80046ebf0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: roots/stack_maps.rs: FileTooLong \u2014 802 significant 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 302 over it, 1.60\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/perry-runtime/src/gc/roots/stack_maps.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dabdc0c43bbebb4c40578bb8215de5d8d6cfc5f40d12af94c8487108af69b5a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/arguments.rs: FileTooLong \u2014 800 significant 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 43 free functions. The bar is 500 significant lines; this is 300 over it, 1.60\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/perry-runtime/src/object/arguments.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a459d28be26f8a89a42a5944e920356ae2d32fe2109f78ff43239ca9002cf4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::typed_locals::collect_typed_locals: FunctionTooLong \u2014 perry_codegen::collectors::typed_locals::collect_typed_locals 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/perry-codegen/src/collectors/typed_locals.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63b496c7ba3d0229fc7bdc30b90605d0eab5f0dd6849c612b7a99cc26316f3b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeRepSummary.from_records: MethodTooLong \u2014 from_records 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/perry-codegen/src/native_value/artifact.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b417d8c1734d554c15e1f794da5e4d43d49a618534e9070ed95986be1fcba3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::type_analysis::predicates::static_type_of: FunctionTooLong \u2014 perry_codegen::type_analysis::predicates::static_type_of 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/perry-codegen/src/type_analysis/predicates.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab45d7acda5944dddf9b9f3ad798a7be0f58adaaa55fb2009a43954831df91bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::object_ops::has_own::object_has_own_generic: FunctionTooLong \u2014 perry_runtime::object::object_ops::has_own::object_has_own_generic 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/perry-runtime/src/object/object_ops/has_own.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ca597584911a2ccdd801e455be623511e32e06ff5028dd8ecb92cdb132dbd4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::inline::cross_module::localize_cross_module_functions: FunctionTooLong \u2014 perry_transform::inline::cross_module::localize_cross_module_functions 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/perry-transform/src/inline/cross_module.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63d5085249bda6e59ad36a9f76c06f9490f4ccfbb89d2d62c1b0c0af3eac579"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/typedarray_props.rs: FileTooLong \u2014 799 significant 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 52 free functions. The bar is 500 significant lines; this is 299 over it, 1.60\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/perry-runtime/src/typedarray_props.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31dc6310d127d981c4b8bfb24936788f9dd8d1b535177335d71c213f13c32ac4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: barrier/mod.rs: FileTooLong \u2014 796 significant 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 73 free functions. The bar is 500 significant lines; this is 296 over it, 1.59\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/perry-runtime/src/gc/barrier/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b83d5721caa8bed78c5d453b8751b522f7999c64ab848bf06d93aee497c238"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: global_this/install_static.rs: FileTooLong \u2014 796 significant 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 296 over it, 1.59\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/perry-runtime/src/object/global_this/install_static.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a519f7ea7bc9320d1857308099439937716213c94a0f5be0af2e928a3a573809"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::property_set::emit_proven_class_field_store: FunctionTooLong \u2014 perry_codegen::expr::property_set::emit_proven_class_field_store runs 159 significant 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 59 over it, 1.59\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/perry-codegen/src/expr/property_set.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdcd367e2e9fbde01bff24f2ff76edf80dbdf99ceafd8fc9dea64fe08b7b6514"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::typed_array_rmw::try_lower_guarded_uint32_add: FunctionTooLong \u2014 perry_codegen::expr::typed_array_rmw::try_lower_guarded_uint32_add runs 159 significant 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 59 over it, 1.59\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/perry-codegen/src/expr/typed_array_rmw.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"9813661870b585b11420d274ee79fd1b50164d88b5750b92854af1765ed5b1d6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LlInst.render_into: MethodTooLong \u2014 render_into runs 159 significant 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 59 over it, 1.59\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/perry-codegen/src/inst.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"095978da4fdeb3e4ef55bfbaf4d1127175f1bf7acf27f0f352f38c071f018bed"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::destructuring::var_decl::alias_tracking::track_decl_aliases: FunctionTooLong \u2014 perry_hir::destructuring::var_decl::alias_tracking::track_decl_aliases runs 159 significant 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 59 over it, 1.59\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/perry-hir/src/destructuring/var_decl/alias_tracking.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"142909b02e8926b2f91a45a4cd7ff347bebb4e86f2b2b9055c82dfe277a6def8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_stdlib::readline::pump::js_readline_process_pending: FunctionTooLong \u2014 perry_stdlib::readline::pump::js_readline_process_pending runs 159 significant 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 59 over it, 1.59\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/perry-stdlib/src/readline/pump.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4be8d48ee9fcec27fa35da54f7b36f7286bcaf72ec547a21fc751d29279a737"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collectors/escape_check.rs: FileTooLong \u2014 792 significant 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 292 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/perry-codegen/src/collectors/escape_check.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca56ae2b5ff20cacf13cfe96f7110075d33c471e05796617b425125c3ee1c23"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/check_gate_freshness.py: FileTooLong \u2014 791 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 291 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":"scripts/check_gate_freshness.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3e2b42395038c9adf4d524276d4861179106afea9658ef39d5ebc672a1460d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ext_http::client_request_surface::dispatch_method: FunctionTooLong \u2014 perry_ext_http::client_request_surface::dispatch_method 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/perry-ext-http/src/client_request_surface.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1be6b77722242ce730ebfb926cf8b5d7700681c97bb2930b430602c3806a3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_call::inline_array_methods::try_inline_array_methods: FunctionTooLong \u2014 perry_hir::lower::expr_call::inline_array_methods::try_inline_array_methods 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/perry-hir/src/lower/expr_call/inline_array_methods.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4383151475c6f1fb5577150c40e61addbdd9f05df752ae3a23bcb8c93bc41e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_call::module_class_static::try_module_class_static: FunctionTooLong \u2014 perry_hir::lower::expr_call::module_class_static::try_module_class_static 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/perry-hir/src/lower/expr_call/module_class_static.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78b3be25b757594b598f34276dc1dab2ae9a962b3f9481ba67e63933758eaf8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::intl::install_intl_namespace_members: FunctionTooLong \u2014 perry_runtime::intl::install_intl_namespace_members 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/perry-runtime/src/intl.rs"},"region":{"startLine":1756}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66e03c631542743e94a2a9aabd4c99e6f32a1ca52f16251d2a9903f502f7b11"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::property_ops::put_value::js_put_value_set: FunctionTooLong \u2014 perry_runtime::object::property_ops::put_value::js_put_value_set 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/perry-runtime/src/object/property_ops/put_value.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e307387e5807a223bb746956790079024b9c5c52b2dc3d31a13e585fee140b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_stdlib::webcrypto::wrap::js_webcrypto_wrap_key: FunctionTooLong \u2014 perry_stdlib::webcrypto::wrap::js_webcrypto_wrap_key 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/perry-stdlib/src/webcrypto/wrap.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"c499186b31e887e44800a3068d5109c45c59aaaafe10359177eacef0df7964a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_wpfacts::builtins::members::ns_statics: FunctionTooLong \u2014 perry_wpfacts::builtins::members::ns_statics 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/perry-wpfacts/src/builtins/members.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"838ccc6fdd01b515274227cc5acd7facb1148bad2bbcdabbdf19f7de980725a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: buffer/from.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 48 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/perry-runtime/src/buffer/from.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b085d5691de58fd70f9a84ae08618c48d610f40ef77564fd6de88ffb6077af88"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/proxy_reflect.rs: FileTooLong \u2014 785 significant 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 285 over it, 1.57\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/perry-codegen/src/expr/proxy_reflect.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1334d746538cb55a9bb9f0e5e2ffae76df0f2402a1688e036e0c0e08906de5d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/static_shapes.rs: FileTooLong \u2014 785 significant 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 285 over it, 1.57\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/perry-runtime/src/object/static_shapes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95939be94b2f503cf6c4cfb493dbc7109f1a47a269d7a5fd9d53d426e7c6fe65"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::element_shape_guard::emit_element_shape_loop_preheader_check: FunctionTooLong \u2014 perry_codegen::expr::element_shape_guard::emit_element_shape_loop_preheader_check runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/element_shape_guard.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"fccda5e81dbf84e71b2c708ddc6bca96b08eb2e5528364e6ad79cb1e0888ffd2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::index_set_packed_loop::lower_packed_numeric_loop_index_set: FunctionTooLong \u2014 perry_codegen::expr::index_set_packed_loop::lower_packed_numeric_loop_index_set runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/index_set_packed_loop.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"5231384c58fc55f7b1ba930253703636b45c331099d0a1a30f62a24c09b9d252"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::dynamic_import::resolve_import_path_with_context: FunctionTooLong \u2014 perry_hir::dynamic_import::resolve_import_path_with_context runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/dynamic_import.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"f219c27fb73e57244a936da2331f3d157c02c608a29f525816ace295061db362"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower_decl::block::lower_fn_body_block_stmt_inner: FunctionTooLong \u2014 perry_hir::lower_decl::block::lower_fn_body_block_stmt_inner runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_decl/block.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"3576fcc89fb7a184be2bc2ee441a7ebe26908fc82c7ffcccdddc2c8f31cbb335"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::native_module_dispatch::dispatch_d_i::nm_dispatch_fs: FunctionTooLong \u2014 perry_runtime::object::native_module_dispatch::dispatch_d_i::nm_dispatch_fs runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/native_module_dispatch/dispatch_d_i.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"3976b7c09bdf9c46cbc4b90adfb3a1397590d64def622e916ee17871d9ad3ec2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ext_net::native_transport: TooManyFunctions \u2014 47 free functions. The bar is 30 free functions; this is 17 over it, 1.57\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/perry-ext-net/src/native_transport.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a9e7ed4607cb0eff5845b91ab49409716149add952d9e02e68bd91d60a643f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::node_submodules::consumers: TooManyFunctions \u2014 47 free functions. The bar is 30 free functions; this is 17 over it, 1.57\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/perry-runtime/src/node_submodules/consumers.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"db56247ca9955bc94062290c49a23cd18ced9b753c8c47354ec49687e7e8ff0a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_visionos::ffi_layout: TooManyFunctions \u2014 47 free functions. The bar is 30 free functions; this is 17 over it, 1.57\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/perry-ui-visionos/src/ffi_layout.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9b7b40f288c87ab3e9cea1878a7b2c595b83b67bd54221f88d9018167e582e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/wasi.rs: FileTooLong \u2014 782 significant 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 282 over it, 1.56\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/perry-runtime/src/wasi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a723c60242156c64892af9483fccb97457ce86d7135a551801a5b9bb578df7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::i32_fast_path::lower_expr_native_i32: FunctionTooLong \u2014 perry_codegen::expr::i32_fast_path::lower_expr_native_i32 runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42540d17bc5f5f0b74af523cfd059e2cc4e6b9676b159babb75e62509e62884"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::analysis::replace_this_in_expr: FunctionTooLong \u2014 perry_hir::analysis::replace_this_in_expr runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/analysis.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f99c8de57f0b1689a2f9293fc05a9b72fa2ec05551bab509cf81307e34dc4bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::intl::date_collator::format_ms_with_dtf_obj: FunctionTooLong \u2014 perry_runtime::intl::date_collator::format_ms_with_dtf_obj runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/intl/date_collator.rs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"8abceefc5bc072f382869bc20703aef4aee33da21dcdf29dff9cfa5f007ae46b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_wpfacts::derive::template_facts: FunctionTooLong \u2014 perry_wpfacts::derive::template_facts runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/derive.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"836a1d4e34b330b2e45fd9d0fda880543f8e1fa15d47badba07d71cc95dbac60"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower_call/early_branches.rs: FileTooLong \u2014 775 significant 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 275 over it, 1.55\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/perry-codegen/src/lower_call/early_branches.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab9643c2cdf7f51aac1fbf740d50f7059dc78e3eac13610837ba79026e45a8e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::scalar_method::try_lower_scalar_replaced_method_call: FunctionTooLong \u2014 perry_codegen::lower_call::scalar_method::try_lower_scalar_replaced_method_call runs 155 significant 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 55 over it, 1.55\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/perry-codegen/src/lower_call/scalar_method.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae316797b9b243f0a4ec9fa4c52ded1f55034e24b6d6b45c3eb2fb2c8141e97f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/array_push.rs: FileTooLong \u2014 774 significant 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 274 over it, 1.55\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/perry-codegen/src/expr/array_push.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f86cd6b9a1dec8861628610199660adf72dac493803b350b45d833cae2176fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node_stream/async_iterator.rs: FileTooLong \u2014 774 significant 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 274 over it, 1.55\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/perry-runtime/src/node_stream/async_iterator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8e28b15b1b774e35194c645b071807d1ba49969f0c42d03aa158a96c797f63"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stream/driver.rs: FileTooLong \u2014 773 significant 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 273 over it, 1.55\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/perry-ext-zlib/src/stream/driver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2495d751ae40831256e8e2e996627435a4721790a74b5bc5bca5c84d0c208b35"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/delete_rest.rs: FileTooLong \u2014 770 significant 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 270 over it, 1.54\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/perry-runtime/src/object/delete_rest.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8da16c9003ed5b3d88678af5e3f41d2ad92eaca281d14582f92200f9d5551e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::compare_chain::try_lower: FunctionTooLong \u2014 perry_codegen::expr::compare_chain::try_lower runs 154 significant 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 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/compare_chain.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc818f4e60aae6e816470bd567ea6f7ca929e699cae1c9a49eb4750460e689ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::options::notification::lower_notification_schedule: FunctionTooLong \u2014 perry_codegen::lower_call::options::notification::lower_notification_schedule runs 154 significant 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 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/options/notification.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb9c031fea4baf3222220b35bf12608424c9dcd3b87ff70c14da0c1d2bef6bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime_manifest::realm_json::parse: FunctionTooLong \u2014 perry_runtime_manifest::realm_json::parse runs 154 significant 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 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime-manifest/src/realm_json.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2564166cf11af254913226081c55f4cf33ab20277626a85c04d0803dda7c256"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::collection_proto_thunks::install_collection_proto_methods: FunctionTooLong \u2014 perry_runtime::object::collection_proto_thunks::install_collection_proto_methods runs 154 significant 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 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/collection_proto_thunks.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f355c4af3e09bec4b1857887bd6353f25d95d381a1c25944efe4780966b25df4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::regex::perex_replace_direct::replace: FunctionTooLong \u2014 perry_runtime::regex::perex_replace_direct::replace runs 154 significant 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 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/regex/perex_replace_direct.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c26b3992680396b504670f563f053b934e25eccdbbb0e9d7643e694c69bfaf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_windows::app::app_run: FunctionTooLong \u2014 perry_ui_windows::app::app_run runs 154 significant 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 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-windows/src/app.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace202bc565593b7afe3b5549bd682c065e20426926bc1c18d2e933864fdb6b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: temporal/options.rs: FileTooLong \u2014 768 significant 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 82 free functions. The bar is 500 significant lines; this is 268 over it, 1.54\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/perry-runtime/src/temporal/options.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a663fc399201b4159b93da67572e512d6431571b6659773fb2b64f4fa230435"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::typedarray_hook_slots: TooManyFunctions \u2014 46 free functions. The bar is 30 free functions; this is 16 over it, 1.53\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/perry-runtime/src/typedarray_hook_slots.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86c42bbc270cb4ad3485224c7cd03ef2248d0667b55f5403cef86db1dcc77e4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_stdlib::domain: TooManyFunctions \u2014 46 free functions. The bar is 30 free functions; this is 16 over it, 1.53\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/perry-stdlib/src/domain.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b606d5377554cdd3d3dbef72663e9700c8635ba68b28478a4d250b5e45e33bf3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::index_uses::walk_index_uses_in_expr: FunctionTooLong \u2014 perry_codegen::collectors::index_uses::walk_index_uses_in_expr 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/perry-codegen/src/collectors/index_uses.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f33c124a2d1b1977429ba29ff1ff98d3892cc19311590d391bc907fd86fdc38"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::this_as_value::expr_uses_this_as_value: FunctionTooLong \u2014 perry_codegen::collectors::this_as_value::expr_uses_this_as_value 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/perry-codegen/src/collectors/this_as_value.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d2011ac31115d7e104f540df5d1fa4900ecc06943a874093015d0744a2d73c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::closure_analysis::collect_closure_captures_expr: FunctionTooLong \u2014 perry_hir::lower::closure_analysis::collect_closure_captures_expr 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/perry-hir/src/lower/closure_analysis.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"03202a6dd398ea5d8c22c7fe1f109b071d41be21f1479dcbbc0a1a131ca6e5e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_gtk4::app::app_run: FunctionTooLong \u2014 perry_ui_gtk4::app::app_run 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/perry-ui-gtk4/src/app.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fc07e2cf7c151fc1b807985fbfca13743523db46c4e57dc26bc71a2ad2a1f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_windows::app::wnd_proc: FunctionTooLong \u2014 perry_ui_windows::app::wnd_proc 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/perry-ui-windows/src/app.rs"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"abad7efc80c743385160301e8aec42648bfa6a62600b96b9d62d380016e35cfb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::main_inner: FunctionTooLong \u2014 perry::main_inner 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/perry/src/main.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e765df3dba4d14d420997658b35a199948d2b020207faf07cc976d9debe244"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/derive.rs: FileTooLong \u2014 764 significant 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 264 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/perry-wpfacts/src/derive.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eeda34b7d1f6bf004c831ed50a2a589fde5e2b4fe9a7b2352df9e52ee6c883e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: intl/list_relative_plural.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), declaring 46 free functions. 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/perry-runtime/src/intl/list_relative_plural.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4afc1925ccab9f9c6a92d7b625bc0657f4b3a1458b7ad993a438c857c32d831"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cjs_wrap/hoist_classes.rs: FileTooLong \u2014 762 significant 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 262 over it, 1.52\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/perry/src/commands/compile/cjs_wrap/hoist_classes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc4574b8b01b301623acc0670573ff64f130bc30706a07f058b5472fd2a12ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/payload_abi.rs: FileTooLong \u2014 760 significant 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 95 free functions. The bar is 500 significant lines; this is 260 over it, 1.52\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/perry-ext-net/src/payload_abi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d64eeddcacd7616b215ea60c3411979d8ec91c6d2bb38cb0c4ee9a38989866"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: array/from_concat.rs: FileTooLong \u2014 760 significant 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 260 over it, 1.52\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/perry-runtime/src/array/from_concat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d01ef6710226fafed2c99245a05a93707cafbc6c6d67c75c204721769458c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/mod.rs: FileTooLong \u2014 760 significant 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 260 over it, 1.52\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/perry-ui-macos/src/widgets/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59724e25373665d8d0a33c7c04326aa983a82fc4294519d3171ce8c57e43d96"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen_wasm::emit::closures::collect_closures_from_expr: FunctionTooLong \u2014 perry_codegen_wasm::emit::closures::collect_closures_from_expr runs 152 significant 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 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/emit/closures.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"0022202135667a3b20040c647b33bc2b7c181c16c302c3fcff0777b235026c07"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_assign::lower_assign: FunctionTooLong \u2014 perry_hir::lower::expr_assign::lower_assign runs 152 significant 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 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_assign.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83f75821cb346d4517f493c0a2ff08438e730a67a3493c2663c51f960897711"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_call::imported_array_methods::try_imported_array_methods: FunctionTooLong \u2014 perry_hir::lower::expr_call::imported_array_methods::try_imported_array_methods runs 152 significant 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 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/imported_array_methods.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa8fcfb5590f8db6029559add989095f1d8f09e9b3cb9f82e23f993023e7b66"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::widget_decl::reactive_animate::try_desugar_reactive_animate: FunctionTooLong \u2014 perry_hir::lower::widget_decl::reactive_animate::try_desugar_reactive_animate runs 152 significant 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 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/widget_decl/reactive_animate.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef82ec494fbb50a8428b4495160ab8ef770ccc6a54386e22e80f08bce085202a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_wpfacts::derive::judge: FunctionTooLong \u2014 perry_wpfacts::derive::judge runs 152 significant 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 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/derive.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7e0a86a5268ea127181ed8b911a0376e7b7cd6ef172c168ef7dae41947ceb8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_wpfacts::lib::contracts::arg_contract_of: FunctionTooLong \u2014 perry_wpfacts::lib::contracts::arg_contract_of runs 152 significant 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 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/lib/contracts.rs"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"9688de8805387487ee122d57411ac93d37ae888b5a6a56535862660ab567a7d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/dyn_extern_i18n.rs: FileTooLong \u2014 757 significant 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 257 over it, 1.51\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/perry-codegen/src/expr/dyn_extern_i18n.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2421eea6e141f6ebcd045025b2286eb268503297eb36b7524e10898f4ad4a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object_ops/define_property.rs: FileTooLong \u2014 757 significant 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 257 over it, 1.51\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/perry-runtime/src/object/object_ops/define_property.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d24d393efa0aa4046bc81fd231368aa1594c909d43e99b775d1ae26a612b32"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/descriptor_state.rs: FileTooLong \u2014 756 significant 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 52 free functions. The bar is 500 significant lines; this is 256 over it, 1.51\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/perry-runtime/src/object/descriptor_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dff4af6a474b55e752cb80db73a6e1083a1e2f78085c9c36a5c627861d5ec2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/typed_array_proto_thunks.rs: FileTooLong \u2014 755 significant 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 75 free functions. The bar is 500 significant lines; this is 255 over it, 1.51\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/perry-runtime/src/object/typed_array_proto_thunks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66d9b518e8ea608060d6565aad3f2aa366edf928bcef84f1284db8f91d390e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::array_pop::lower_array_pop_inline: FunctionTooLong \u2014 perry_codegen::expr::array_pop::lower_array_pop_inline runs 151 significant 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 51 over it, 1.51\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/perry-codegen/src/expr/array_pop.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46a2b963b7ec29f83dd4b0dcfebede3cb3c603eff647a128b23b55ef27025cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::native_value::materialize::materialize_js_value_bits: FunctionTooLong \u2014 perry_codegen::native_value::materialize::materialize_js_value_bits runs 151 significant 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 51 over it, 1.51\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/perry-codegen/src/native_value/materialize.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e80f1640ab78ab62cb0bb1f6a4d9eea6ae01a39d3f9ca9429203c72ee4a6ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_component_host::driver::async_values::execute: FunctionTooLong \u2014 perry_component_host::driver::async_values::execute runs 151 significant 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 51 over it, 1.51\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/perry-component-host/src/driver/async_values.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"8def9c66c8fc5527816d6a5fa0e7ecb57357bccb250848764ba455fb2dd08098"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::destructuring::pattern_binding::lower_array_pattern_binding: FunctionTooLong \u2014 perry_hir::destructuring::pattern_binding::lower_array_pattern_binding runs 151 significant 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 51 over it, 1.51\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/perry-hir/src/destructuring/pattern_binding.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe513bac456d87653204159401ac8092dffe187f57f2e5fdfef00281064df41"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::lower_expr::lower_expr_impl: FunctionTooLong \u2014 perry_hir::lower::lower_expr::lower_expr_impl runs 151 significant 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 51 over it, 1.51\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/perry-hir/src/lower/lower_expr.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5ae065979d25df3f63d9ce7061fc0539018c680453d8525ee3ae5ef4facdad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_stdlib::worker_threads::js_worker_threads_worker_new: FunctionTooLong \u2014 perry_stdlib::worker_threads::js_worker_threads_worker_new runs 151 significant 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 51 over it, 1.51\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/perry-stdlib/src/worker_threads.rs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b69dd3621242d8f5b6ea2774b9f5316e44845cb50020914a27e61dd4c509ff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Gen.runtime_glue: MethodTooLong \u2014 runtime_glue runs 151 significant 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 51 over it, 1.51\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/perry-wpfacts/src/gen/glue.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"326edeb04db9fce2a700cdf91508d8168fd63a7dcd87da25f7bf2da872ef4b94"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dyn_eval/expr.rs: FileTooLong \u2014 754 significant 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 254 over it, 1.51\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/perry-runtime/src/dyn_eval/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee9b961b13fe35b86f7fecfc01f03940418b3cd59a0fd41eaab93565f212452"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/objects-cache.ts: FileTooLong \u2014 754 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 254 over it, 1.51\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":"upstream/actions/jdx/mr-boxington-action/src/objects-cache.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f899b1beaf0b3c37a78adf53f47b2cbcbd8293b5341720b12aadca59acce570e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hot_diag.rs: FileTooLong \u2014 753 significant 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 253 over it, 1.51\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/perry-runtime/src/hot_diag.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ccefaa280a0511ef938e3827b04ff7999f036d303ed8f462be41f23655db62"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: symbol/get.rs: FileTooLong \u2014 753 significant 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 253 over it, 1.51\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/perry-runtime/src/symbol/get.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"306ea129fb8a13ade2f336ac590da9b8c691f3808568678ed46aa22f11c817fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/media_playback.rs: FileTooLong \u2014 751 significant 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 251 over it, 1.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/perry-ui-ios/src/media_playback.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e815e21177828fea4290c28613f32c7dcfa2caf68c6521ba575e64d3a2f0c92"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::async_context: TooManyFunctions \u2014 45 free functions. The bar is 30 free functions; this is 15 over it, 1.50\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/perry-runtime/src/async_context.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dad7214571d7100c9857482d6e405846288a91a4d9d976579cf7c7e081dde92"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::feature_hooks: TooManyFunctions \u2014 45 free functions. The bar is 30 free functions; this is 15 over it, 1.50\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/perry-runtime/src/feature_hooks.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"fddb29d353ff0d5f152ea2121e841437c7d09b59070d3f7d69842a20b748f443"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::gc::instruments: TooManyFunctions \u2014 45 free functions. The bar is 30 free functions; this is 15 over it, 1.50\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/perry-runtime/src/gc/instruments.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08ba53d687fe7ec3463472946efe955cb3814d70d90ac36bb7c48efa8b3da74"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: NodeData: TooManyFields \u2014 45 stored fields beside 1 method. The bar is 30 stored fields; this is 15 over it, 1.50\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/perry-ui-watchos/src/tree.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcad838a4d067b796383d4a39fec751dd77d5cdeb8ec9e827d72f81ee210b9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::inprocess::optimize_emit::optimize_and_emit: FunctionTooLong \u2014 perry_codegen::inprocess::optimize_emit::optimize_and_emit runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/inprocess/optimize_emit.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"100fd4be524cb8466f49af952a9cbf81120885cfb51a14ef665a2f6f52ab08e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::property_get::number_string::try_lower_number_string_methods: FunctionTooLong \u2014 perry_codegen::lower_call::property_get::number_string::try_lower_number_string_methods runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/property_get/number_string.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a4295d40cfa4afdef41ffca2913d91d500ca85e6c5eb7f43a076cc262ebbfb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::number_local_loop::lower: FunctionTooLong \u2014 perry_codegen::stmt::number_local_loop::lower runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/number_local_loop.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc14c1681919639b47a36bcdef209b11ba974cee9f36476b35e05db2cb844c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ext_net::tls::js_tls_connect: FunctionTooLong \u2014 perry_ext_net::tls::js_tls_connect runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-net/src/tls.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff5a3a78f1d334a6f7ab7d34db9e0182c4f9ab1ee77128cc25b15fa1ee3ed55"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::promise::async_step::js_async_step_chain: FunctionTooLong \u2014 perry_runtime::promise::async_step::js_async_step_chain runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/promise/async_step.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e92c697609942669606d5500ddaa386c4bdfcf3ffa9838e39a60ed72f67972"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::generator::lower::abrupt::build_yield_star_return_routes: FunctionTooLong \u2014 perry_transform::generator::lower::abrupt::build_yield_star_return_routes runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/generator/lower/abrupt.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a20790fdffc54104f015bb737da29e62c5324a37c8aa0c66e5c8e99161c071"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_wpfacts::lib::contracts::describe_toks: FunctionTooLong \u2014 perry_wpfacts::lib::contracts::describe_toks runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/lib/contracts.rs"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6abb66445cea53962900849af2b93983552433e81db98d0e2f19bbdb3fb1b47"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::targets::compile_for_watchos_widget: FunctionTooLong \u2014 perry::commands::compile::targets::compile_for_watchos_widget runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/targets.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f50393b02a4b0c956a85f55c4c5f000a54cfc077985b0e2adee7fb58a45db84"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: field_get_set/has_property.rs: FileTooLong \u2014 749 significant 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 249 over it, 1.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/perry-runtime/src/object/field_get_set/has_property.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc10fd4ce4b6891fdd9656b3952c617b78934c4aa3b570ddee57fdab660fbae0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: server/request.rs: FileTooLong \u2014 748 significant 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 248 over it, 1.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/perry-ext-http/src/server/request.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7dead7a91b9d1789057ffc1b75e4d4bb8be6983286a486c07ff9f16ba75f91"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/units.rs: FileTooLong \u2014 748 significant 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 248 over it, 1.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/perry-wpfacts/src/units.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62ad6882ae37ebc7e52d68848e0a1a5e5c4ee9da2b94d6f5a8b377c14ffc792"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/native_method.rs: FileTooLong \u2014 746 significant 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 100% of them inside a single declaration: FuncEmitCtx (8-958). The bar is 500 significant lines; this is 246 over it, 1.49\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/perry-codegen-wasm/src/emit/expr/native_method.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb27742ec08198103e882545ffa4fb7c2ee7ab2ff380245bfca10f887832e3e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::loops::expr_preserves_array_length: FunctionTooLong \u2014 perry_codegen::stmt::loops::expr_preserves_array_length runs 149 significant 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 49 over it, 1.49\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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":9570}}}],"partialFingerprints":{"codehealthFindingId/v1":"6539b77abaa4a030485b0b2a8011b94432bbf3cded67c13f7184e0a4a0350945"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_function::lower_arrow: FunctionTooLong \u2014 perry_hir::lower::expr_function::lower_arrow runs 149 significant 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 49 over it, 1.49\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/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb4b6685b88001bd02256b22d955048d1ddab76cc272542b40fc40bea678111"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::array::splice_slice::js_array_splice: FunctionTooLong \u2014 perry_runtime::array::splice_slice::js_array_splice runs 149 significant 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 49 over it, 1.49\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/perry-runtime/src/array/splice_slice.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c32320b40447f413375028b44d3ea74a4e39489652cbfacf1ba1feec1cc92a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::native_module_dispatch::dispatch_m_p::nm_dispatch_process: FunctionTooLong \u2014 perry_runtime::object::native_module_dispatch::dispatch_m_p::nm_dispatch_process runs 149 significant 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 49 over it, 1.49\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/perry-runtime/src/object/native_module_dispatch/dispatch_m_p.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fbe3d452b14f591c222dec5ea56052b3c5723e536dca4619147e0ad8b01637f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr_call/array_only_methods.rs: FileTooLong \u2014 742 significant 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 242 over it, 1.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/perry-hir/src/lower/expr_call/array_only_methods.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61f295de36078964b37e008036863f6e4cf093b6a14bf5ad1b1494b7d3afac6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: solve/apply.rs: FileTooLong \u2014 740 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 100% of them inside a single declaration: Model (3-1152). The bar is 500 significant lines; this is 240 over it, 1.48\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/solve/apply.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09935e134dd8bd11677031852c0a2f3dbcaddbfa5fc7b4ee4255132dc99cfa9b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::builtins::formatting::util_format::js_util_format: FunctionTooLong \u2014 perry_runtime::builtins::formatting::util_format::js_util_format runs 148 significant 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 48 over it, 1.48\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/perry-runtime/src/builtins/formatting/util_format.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b66797abd0b2bb83123919d61a7e51119fdba13cfe0ed45cddd519e38f83378"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::shape_mint_census::dump: FunctionTooLong \u2014 perry_runtime::object::shape_mint_census::dump runs 148 significant 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 48 over it, 1.48\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/perry-runtime/src/object/shape_mint_census.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"d950b854fa9fd05d497ff298d95b16f098e4b7f282efb4c3dcd572aaddee1490"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::regex::perex_replace::regexp: FunctionTooLong \u2014 perry_runtime::regex::perex_replace::regexp runs 148 significant 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 48 over it, 1.48\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/perry-runtime/src/regex/perex_replace.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a9340e2c51ba56b1e09b69a3094e4155716e623a8af06b8e88a2d9a9aa05dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::aggregate_scalar::scalarize_stmts: FunctionTooLong \u2014 perry_transform::aggregate_scalar::scalarize_stmts runs 148 significant 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 48 over it, 1.48\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/perry-transform/src/aggregate_scalar.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"565964680ae1deb36765b6d47254fbd066ab739fa609c1848621b2c6b43ad643"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Gen.register_class: MethodTooLong \u2014 register_class runs 148 significant 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 48 over it, 1.48\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/perry-wpfacts/src/gen.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11d1301dbc2ed5be4970bbf9853c86fc5c18d2d8dd41da96680199518479a92"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: release.ensureTagAndRelease: FunctionTooLong \u2014 ensureTagAndRelease runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\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":"scripts/publish/release.mts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"7807f7ba591769f08a15442b320bcdfdef251261d7cb8283d15b578d2a1767c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: global_this/array_error.rs: FileTooLong \u2014 739 significant 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 74 free functions. The bar is 500 significant lines; this is 239 over it, 1.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/perry-runtime/src/object/global_this/array_error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c18c0b728b095be5e0d5ef65f9e77cacb67d3cc386081abf73ff3edd916bdc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collectors/definite_init.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). 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/perry-codegen/src/collectors/definite_init.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de850c0748e8ac023f842f0cb064cdd608f17cebed02c6c2014d4d65dcecd2dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: index_get/guarded_array.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). 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/perry-codegen/src/expr/index_get/guarded_array.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7416624bdb262b324f362bd2fb0bff152b907047e8a02d62889aaac2f0908e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gen/class_values.rs: FileTooLong \u2014 736 significant 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 100% of them inside a single declaration: Gen (3-1111). The bar is 500 significant lines; this is 236 over it, 1.47\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/gen/class_values.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"005ad4982c05a3bac3af2b04051a75201ebfc58bbf38670460cde970d2398fe5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dir_glob_watch/glob.rs: FileTooLong \u2014 735 significant 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 235 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/perry-runtime/src/fs/dir_glob_watch/glob.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf33f3e9e5bed29c83bc1903def5c7fa28dae4bd6988204e809630cbda7bd3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compile/host_config.rs: FileTooLong \u2014 735 significant 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 235 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/perry/src/commands/compile/host_config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c777ae704039fa4cfd79bd5b43bbb2ed7623e63701c6a80e81fe5db7e4db6d80"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ext_http::server::handle_dispatch::js_ext_http_server_response_dispatch_method: FunctionTooLong \u2014 perry_ext_http::server::handle_dispatch::js_ext_http_server_response_dispatch_method runs 147 significant 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 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-http/src/server/handle_dispatch.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1ff46af6b7af2a77d9c14fd34c372a0a38407119a51de64bb8e156b6a733d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::builtins::formatting::format_jsvalue_for_json: FunctionTooLong \u2014 perry_runtime::builtins::formatting::format_jsvalue_for_json runs 147 significant 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 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/builtins/formatting.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3bcdcd586143c8082d5b37c5c3a1466b40b4c273a72f82f131f85e2553ce52"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::object_ops::has_own::js_object_property_is_enumerable: FunctionTooLong \u2014 perry_runtime::object::object_ops::has_own::js_object_property_is_enumerable runs 147 significant 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 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/object_ops/has_own.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"d271a559cbf0916b626046a7ff6bcaae26284274f64982696ce121c4ce72b583"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::value::dyn_index::js_dyn_index_set_strict: FunctionTooLong \u2014 perry_runtime::value::dyn_index::js_dyn_index_set_strict runs 147 significant 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 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/value/dyn_index.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"689a19aa74bc6737ffeeb3cf02bd8947149e91292d38952265e14f9a437b2604"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_stdlib::tls::event_pump::js_tls_process_pending: FunctionTooLong \u2014 perry_stdlib::tls::event_pump::js_tls_process_pending runs 147 significant 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 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/tls/event_pump.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"2008dd82cd773c644170d6ce3c1a2ab93da258696d3e9e18fdd8e8033da14a59"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_wasi::p2::common: FunctionTooLong \u2014 perry_wasi::p2::common runs 147 significant 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 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wasi/src/p2.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3f3b01dd73a117eb3b74f0bf696231d03bf26f4152a0bf6224903e227ef7da"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_wpfacts::builtins::collections::array_method: FunctionTooLong \u2014 perry_wpfacts::builtins::collections::array_method runs 147 significant 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 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/builtins/collections.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f6ff74fb6d2dce073e05f0067a9a1fbc6f05676f524a9dd77277e0548f34c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_wpfacts::summary::compose::compress: FunctionTooLong \u2014 perry_wpfacts::summary::compose::compress runs 147 significant 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 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/summary/compose.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf8a922620175c68901f33217004b1cfc6538d40c613aab780bdecbf04fba03"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::object::class_handles: TooManyFunctions \u2014 44 free functions. The bar is 30 free functions; this is 14 over it, 1.47\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/perry-runtime/src/object/class_handles.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8966c5ac2cbc0985d422a53de3965f542479643540976c439f42e26b1e9c95e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::webassembly_host: TooManyFunctions \u2014 44 free functions. The bar is 30 free functions; this is 14 over it, 1.47\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/perry-runtime/src/webassembly_host.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"570b6ade13b5e4de9be380ca396be0e5db2b592526e6c237d57aad18d992c274"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_android::ffi::image_nav: TooManyFunctions \u2014 44 free functions. The bar is 30 free functions; this is 14 over it, 1.47\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/perry-ui-android/src/ffi/image_nav.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa531ee50ada98ddf0cccb6da2645c08bdd46d564f5b833ff6a0d09b0c1cd4b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: BuildManifest: TooManyFields \u2014 44 stored fields. The bar is 30 stored fields; this is 14 over it, 1.47\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/perry/src/commands/publish/server_api.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"1390f6c10344372c607386993441877ad913a7261df71a919db2c8550d3ed597"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/range_facts.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), declaring 41 free functions. 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/perry-codegen/src/expr/range_facts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22b1f644bb29a534d857479297f948c37cc7d7f8d7bada55fec2295a0b19440"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collectors/refs.rs: FileTooLong \u2014 731 significant 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 231 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/perry-codegen/src/collectors/refs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3a920c77a756a99be355ee8513c2a7faec4f1ff339bed68e39b63ac40ac5c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/date.rs: FileTooLong \u2014 730 significant 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 230 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/perry-runtime/src/date.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98306c72efe5d6b93d61eb0aa84f959276a8241a86a8ffe3e4e5f89cbbe65cb6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::super_method::lower: FunctionTooLong \u2014 perry_codegen::expr::super_method::lower runs 146 significant 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 46 over it, 1.46\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/perry-codegen/src/expr/super_method.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"386ea3d9f384c45769aac6b6796a94322f2f5dcb6fce214d1146a806fec1d543"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::aggregate_scalar::rewrite_return_record_stmts: FunctionTooLong \u2014 perry_transform::aggregate_scalar::rewrite_return_record_stmts runs 146 significant 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 46 over it, 1.46\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/perry-transform/src/aggregate_scalar.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2b3820240e1cf6935a0a6704f5c9fe8b98ba0881259be787117ee2ca06b7d3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Emitter.lower_inner: MethodTooLong \u2014 lower_inner runs 146 significant 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 46 over it, 1.46\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/perry-wit/src/guest_c/values.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38a4b57aae49f2b4139920179604f34af503f7ddb9e4ded6f565069054271bf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Gen.nested_fields: MethodTooLong \u2014 nested_fields runs 146 significant 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 46 over it, 1.46\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/perry-wpfacts/src/gen/export.rs"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1dba0a97d5d76cd69171a0b539196be54cc7c4824d8e68897748dd750d921a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::tiny_program::try_compile: FunctionTooLong \u2014 perry::commands::compile::tiny_program::try_compile runs 146 significant 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 46 over it, 1.46\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/perry/src/commands/compile/tiny_program/mod.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b93a3e25563715256b8de02531925782c0b7b7c1526819d42148d261e1e7fc8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/plugin.rs: FileTooLong \u2014 729 significant 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 229 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/perry-runtime/src/plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e812e0b385305dc119848910225c85a4055f4886cf683e7d8cfd1d889d6272"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: server/server.rs: FileTooLong \u2014 728 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 48 free functions. The bar is 500 significant lines; this is 228 over it, 1.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-http/src/server/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"114c928e92c178bc7db0e7961024b1f685f2414d5c6da23552553ae3405dc869"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: turnloop_h2/conn.rs: FileTooLong \u2014 728 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 40 free functions. The bar is 500 significant lines; this is 228 over it, 1.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-http/src/server/turnloop_h2/conn.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a38d4c995d3900d465ea41ba9e24c061d14c05039347ea4715d30fb1719cfa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: regex/perex_runtime.rs: FileTooLong \u2014 728 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 228 over it, 1.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/regex/perex_runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc5221940a5aaf074a4b8b78f0ebf10772eb7bb35dabca91cb59c087196e081"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/crypto_hash_chain.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). 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/perry-transform/src/crypto_hash_chain.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0349ed62069a496fd1748d8768251e863f60bea6904159bfd15aef6d7e3d758a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::ui_tables::lower_perry_ui_table_call: FunctionTooLong \u2014 perry_codegen::lower_call::ui_tables::lower_perry_ui_table_call 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/perry-codegen/src/lower_call/ui_tables.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c647334a77534d6f3a35ad6edc87e95a9d051ab78796014577da134abac424"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::runtime_decls::stdlib_ffi::streams_events::declare_streams_events: FunctionTooLong \u2014 perry_codegen::runtime_decls::stdlib_ffi::streams_events::declare_streams_events 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/perry-codegen/src/runtime_decls/stdlib_ffi/streams_events.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3347bc7e227bb97999f9cba87920e1a43331882626b5be91c5fd9ff5fce359"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::intl::date_collator::format_components: FunctionTooLong \u2014 perry_runtime::intl::date_collator::format_components 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/perry-runtime/src/intl/date_collator.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99cdcf4f8b18992d2cb49e51c78f7ea67cd1274fb8dcd86788e4cc235fbe56b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::url::node_compat::legacy_url_parse_impl: FunctionTooLong \u2014 perry_runtime::url::node_compat::legacy_url_parse_impl 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/perry-runtime/src/url/node_compat.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afc3402b36742362282a38e9ceebf4a500949445a7252fd2a20b740ee246a20"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_stdlib::webcrypto::hmac::js_webcrypto_sign: FunctionTooLong \u2014 perry_stdlib::webcrypto::hmac::js_webcrypto_sign 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/perry-stdlib/src/webcrypto/hmac.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"203e4501c9cac1aaf4f7b35f94482666fffebf7acca718c313a0a346bb6090ce"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Model.cons_line: MethodTooLong \u2014 cons_line 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/perry-wpfacts/src/solve.rs"},"region":{"startLine":1694}}}],"partialFingerprints":{"codehealthFindingId/v1":"8388f46c0b25a2154e583c02dad6c6395323cb9819abf15c10243ba1e16056aa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompilationContext.new: MethodTooLong \u2014 new 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/perry/src/commands/compile/types.rs"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff86b681592efd4c243fb917a0b9722983e5a9bee7469c71eb0c72952ebdfd3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_llvmc_spike::run_demo: FunctionTooLong \u2014 perry_llvmc_spike::run_demo 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":"experiments/llvm-inprocess-spike/src/main.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a29f8d1ecbf296a9d1df5510d3286be539a1f57f73c7b1b49e58c9e5cf605b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: link/platform_cmd.rs: FileTooLong \u2014 722 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 222 over it, 1.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/link/platform_cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a132b9f3b050ee7f735bfce338926078962c8b6105ee9fd2ccc2125e983252d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/shape_store.rs: FileTooLong \u2014 720 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 220 over it, 1.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/shape_store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"431f290137f01e622db69cd222563d5e7f86a3cef0a5d49ad779dc5fb734ce43"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_string_concat::lower_tag_dispatched_str_self_append: FunctionTooLong \u2014 perry_codegen::lower_string_concat::lower_tag_dispatched_str_self_append runs 144 significant 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 44 over it, 1.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/perry-codegen/src/lower_string_concat.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a35da207b3393eebe7069037f38acdce02bf01aab6bc0f7ea4b26606eff7917"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::inline::call_inliner::try_inline_call: FunctionTooLong \u2014 perry_transform::inline::call_inliner::try_inline_call runs 144 significant 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 44 over it, 1.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/perry-transform/src/inline/call_inliner.rs"},"region":{"startLine":2051}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7f7f0f3e4181401d244161b8a4965e59b9b5577a5b42b51358da9302e59150"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Model.publish_class: MethodTooLong \u2014 publish_class runs 144 significant 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 44 over it, 1.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/perry-wpfacts/src/solve/call_and_construct.rs"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd98cf6bd637d53ca3b0528482140e373801692a9636b1cb555562122becf111"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/function.rs: FileTooLong \u2014 719 significant 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 219 over it, 1.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/function.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa80c0c90aaaca19369d69cc2a56f9346a078f037dca14523fe80040f757bb3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: json/stringify.rs: FileTooLong \u2014 719 significant 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 219 over it, 1.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/json/stringify.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"001005e50eec18e1f979dedac6e394dc86502dc53ff342305911d310af9b070a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower_decl/class_members.rs: FileTooLong \u2014 718 significant 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 218 over it, 1.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2eb9a6983c48936a15cee87f18e80dd0c6e23f8bc81733128a75b8b489dc901"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: turnloop_net/mod.rs: FileTooLong \u2014 718 significant 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 218 over it, 1.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/turnloop_net/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa5ab3fed51094a917385d30f8f790c5d91e3ec870422492b16ad891fca6a39"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::perf_hook_slots: TooManyFunctions \u2014 43 free functions. The bar is 30 free functions; this is 13 over it, 1.43\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/perry-runtime/src/perf_hook_slots.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e8bd3ef1851f8e3edd509972f266f817d819a1a85cdfaa3e6c76de1b1af3dc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::tui::hooks: TooManyFunctions \u2014 43 free functions. The bar is 30 free functions; this is 13 over it, 1.43\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/perry-runtime/src/tui/hooks.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ab17b11f3f62ea36ddf7a6aa2b512ded65a9f40912206b9e4ce79afa2282cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generator/per_iteration.rs: FileTooLong \u2014 716 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 40 free functions. The bar is 500 significant lines; this is 216 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":"crates/perry-transform/src/generator/per_iteration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fd45c27f085a9c73dabb1a58cb5ed0431e6830c15aa3a46cf650209729f236"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::region_loop::begin_with: FunctionTooLong \u2014 perry_codegen::stmt::region_loop::begin_with runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/region_loop/mod.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"417dfdc42f18ae8e84103e9f845773b9fffb97fe1209af1571eb03ec4873893a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_windows::audio::start: FunctionTooLong \u2014 perry_ui_windows::audio::start runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-windows/src/audio.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd859eda5f167269f4c1cdaebf8605ef482baa2d36a4b11e38001129ee36c9b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collectors/ptr_shape_elements.rs: FileTooLong \u2014 714 significant 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 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":"crates/perry-codegen/src/collectors/ptr_shape_elements.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec76d0958258943ffdc75bf6a7ecf76251656cd12614b76e200fd67d1e7dca68"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: property_ops/set.rs: FileTooLong \u2014 714 significant 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 31 free functions. 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":"crates/perry-runtime/src/object/property_ops/set.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9593a2d0032d6274a713c7da9719705bb84499170718d9c01cb80b5af519df68"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/buffer_dispatch.rs: FileTooLong \u2014 710 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 210 over it, 1.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/buffer_dispatch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94ac9d842d86c94f903c28831364952b1ec256b60f845b6aa2206396c2f426f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/overflow.rs: FileTooLong \u2014 710 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 56 free functions. The bar is 500 significant lines; this is 210 over it, 1.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/overflow.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ac0df4fd84244b8b4ba6d681a6256797378eedb9b539edecbc79c1f2982fd3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::fallback_diag::enter_expr: FunctionTooLong \u2014 perry_codegen::fallback_diag::enter_expr 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/perry-codegen/src/fallback_diag.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff27952942d3fea89710946ee51ee4df0845650162e976fb5f6586df8502026"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::extern_timers::try_lower_extern_timer_call: FunctionTooLong \u2014 perry_codegen::lower_call::extern_timers::try_lower_extern_timer_call 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/perry-codegen/src/lower_call/extern_timers.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fefe998222e822e9f468c6489bc0157acf335abaac66fed7b30396ba211a9ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: global_this/fetch_globals.rs: FileTooLong \u2014 709 significant 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 31 free functions. The bar is 500 significant lines; this is 209 over it, 1.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/global_this/fetch_globals.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7db4a50602b429715fc2cb6ebbc98300a256618a516f37933e7d2c78799d493"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ComposeEngine: ClassTooLong \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), 22 methods, 2 blocks, lines 32-998. The bar is 400 significant lines; this is 166 over it, 1.42\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/perry-container-compose/src/compose.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d8385c09b755d54f061a77545527967be61e14e591deb9ac1390ee689cb6fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lower_array_method.rs: FileTooLong \u2014 706 significant 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 206 over it, 1.41\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/perry-codegen/src/lower_array_method.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba1eea27119f84776f06f546258b80b57433dfa75af4aa41202c7ce73b20a39"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FuncEmitCtx.try_emit_expr_calls: MethodTooLong \u2014 try_emit_expr_calls 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/perry-codegen-wasm/src/emit/expr/calls.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a1fd9e644407d4b4adf3e0c46d8324774073e5f9fc7ed5902ed100c5e3a271"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::segview::rewrite_site: FunctionTooLong \u2014 perry_codegen::collectors::segview::rewrite_site 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/perry-codegen/src/collectors/segview.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3cb59c0ecb450da77a08881869314ba537270db44d9870009f91dc3b552a1a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::eval_super_scan::scan_expr: FunctionTooLong \u2014 perry_hir::lower::eval_super_scan::scan_expr 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/perry-hir/src/lower/eval_super_scan.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"6debf9d94497580fbde5db422d981e3648b1d8bc76f87d4364058dd09ea6795d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::lower_expr::reactive_text::try_desugar_reactive_text: FunctionTooLong \u2014 perry_hir::lower::lower_expr::reactive_text::try_desugar_reactive_text 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/perry-hir/src/lower/lower_expr/reactive_text.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd48f6ed9145dfa1ec70b9cd8e0ebebf78a46215f270219551eb245dd312155"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower_decl::class_members::lower_class_method_in_scope: FunctionTooLong \u2014 perry_hir::lower_decl::class_members::lower_class_method_in_scope 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/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"0246abf7c89ae576018f63cb6f63e7ba0e0f06ad65770a599b94264abaff5eb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::class_registry::construct::js_new_function_construct_with_new_target: FunctionTooLong \u2014 perry_runtime::object::class_registry::construct::js_new_function_construct_with_new_target 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/perry-runtime/src/object/class_registry/construct.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e1d92f704f14272a86f4f10569d8fa059a4813d56e6c05c5ca7e43e861ea7b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Generator.function: MethodTooLong \u2014 function 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/perry-wit/src/guest_c.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"3195ebec6fdd6812f7eb4500e0672874c8b34d743da5e084d76f28593734894d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_wpfacts::units::driver::unit_io: FunctionTooLong \u2014 perry_wpfacts::units::driver::unit_io 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/perry-wpfacts/src/units/driver.rs"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ec61264761a47de2e33d0fece4b0078839b0ed822ec96249dab27fb8641fb0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::bundle_apple::bundle_for_watchos: FunctionTooLong \u2014 perry::commands::compile::bundle_apple::bundle_for_watchos 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/perry/src/commands/compile/bundle_apple.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"e975647902c34dcfaf8411210b31d1cec6c4e892b066d3f1db592159742fb84f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/property_set.rs: FileTooLong \u2014 704 significant 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 204 over it, 1.41\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/perry-codegen/src/expr/property_set.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5c6fcf7319ac87d82ad6bb37fa4be0c6dad0e89de73a0f2436c512995468d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/native_emit.rs: FileTooLong \u2014 703 significant 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 203 over it, 1.41\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/perry-codegen/src/native_emit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4930700884b4e23a1e89f14502e6552956304b64883cb22dd876f3bfcad8f91b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gc/mod.rs: FileTooLong \u2014 702 significant 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 202 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/perry-runtime/src/gc/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ed31b516daffb1ae8a049e6b93e4104da5077d59d423a8bb8f9a5cad37ab6e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/global_this_webassembly.rs: FileTooLong \u2014 701 significant 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 201 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/perry-runtime/src/object/global_this_webassembly.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eee0bf6716d0ad2a6755bd08e91dcab74ec3a5a5dde3e5c91d91de5f9670f27"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Solver: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\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":"scripts/wpfacts_recompute.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"baaaed4ef7b005763e2b4337a75a1c0ba111dc0f6234f520d8deb4faff142c55"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ffi::handle: TooManyFunctions \u2014 42 free functions. The bar is 30 free functions; this is 12 over it, 1.40\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/perry-ffi/src/handle.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2901c963fb71a14ee6713acbebf8938b936c6df325cd1783e73466ac6d0a72b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::os_hook_slots: TooManyFunctions \u2014 42 free functions. The bar is 30 free functions; this is 12 over it, 1.40\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/perry-runtime/src/os_hook_slots.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2d605aaade0e1eec09c4fed2cf8fb499a564462aa5fa6c81ba50844162d850"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::url::url_class: TooManyFunctions \u2014 42 free functions. The bar is 30 free functions; this is 12 over it, 1.40\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/perry-runtime/src/url/url_class.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aaeb6f918d5358789136a1fbc52b7a8436fea50b20a460f31aeb97feb90cf30"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_ios::ffi::system: TooManyFunctions \u2014 42 free functions. The bar is 30 free functions; this is 12 over it, 1.40\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/perry-ui-ios/src/ffi/system.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf5667c68dba237a7144eeba8bd6ccff9f4497e4ebd9146ac58514d93849699"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Api: TooManyFields \u2014 42 stored fields beside 9 methods. The bar is 30 stored fields; this is 12 over it, 1.40\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/tls/roots/macos.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8396a5e3f6e8ddd9b96ec246681fbc7cb57aa603fed8b4994eb1b4caaf719c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ProgramFacts: TooManyFields \u2014 42 stored fields beside 8 methods. The bar is 30 stored fields; this is 12 over it, 1.40\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/lib.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"9828e028c7ec8e1b90d4a7b62bbe73312ff47b3d31db73da1071890bc6df750d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::proto_constants::emit_family_run_proof: FunctionTooLong \u2014 perry_codegen::proto_constants::emit_family_run_proof 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/perry-codegen/src/proto_constants.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a24f9395f97a6d647ffbac16dc3580a60ae5e42fbe7b15e66e3cbf8bc4c5080"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stubs::static_shape_seed_ll_with_plan: FunctionTooLong \u2014 perry_codegen::stubs::static_shape_seed_ll_with_plan 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/perry-codegen/src/stubs.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a3d1037a25532f9753956514d00982d9ae26e643b6f4758f56c267d970dad9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::json::stringify::stringify_value: FunctionTooLong \u2014 perry_runtime::json::stringify::stringify_value 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/perry-runtime/src/json/stringify.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb7b13d94f1b5368050833e673e47a89e15e6ee8e08c7712a41987565ae9d0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/compose.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), about 81% of them inside a single declaration: ComposeEngine (2 blocks, 32-998). The bar is 500 significant lines; this is 199 over it, 1.40\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/perry-container-compose/src/compose.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a0b29ac99eb7d43efe2405ad01a910f2f714d23794f02eb2fe94c708cc0feb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/dispatch.rs: FileTooLong \u2014 698 significant 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 198 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/perry-codegen/src/expr/dispatch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47fa62eb7cf00c7fa607addcf84c7298872279f882556c36179da476b410603"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collectors/pointer_locals.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/perry-codegen/src/collectors/pointer_locals.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec79990c8270c01e653a3bf674593023ccb8b110d80200d50e32f70e96dcfd8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/media_playback.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), declaring 35 free functions. 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/perry-ui-android/src/media_playback.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab98a06258fcbd22129ecf43d2e2f656aa535853e96c1a31e1d10cca41b8d94c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_wasm_host::instantiate_with_import_callbacks: FunctionTooLong \u2014 perry_wasm_host::instantiate_with_import_callbacks 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/perry-wasm-host/src/lib.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd8cbdcddbb637fe221edd1b5d4025de63f3401d0b3b3b40e28af7651c3fcfa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower_decl/class_decl.rs: FileTooLong \u2014 694 significant 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 194 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/perry-hir/src/lower_decl/class_decl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"283a8f5071d774d04acbe5b589f79c9b096f787f8c5f06f56ae1a3b775f0c3ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/app.rs: FileTooLong \u2014 690 significant 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 190 over it, 1.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/perry-ui-ios/src/app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"802f88cdc7264bacf5155763cbc30070c44f0d417bf157c041f149802a26edd9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Model.build: MethodTooLong \u2014 build 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/perry-codegen/src/collectors/definite_init.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"2431caca72739aff9574f227a87181b4fffc4668abcd3f0fb791a066fafac918"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::new_helpers::emit_native_instance_base_init: FunctionTooLong \u2014 perry_codegen::lower_call::new_helpers::emit_native_instance_base_init 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/perry-codegen/src/lower_call/new_helpers.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e430978556a56ba5c25a46089ea5be6fa7fa81472c1548e5fc61685d20b4fa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SolidJsx.native_parts: MethodTooLong \u2014 native_parts 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/perry-hir/src/solid_jsx/native.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"197a91daa30a55751cc89a4d803bf5139b8a8c4e4488b8d3cafe2903d0bc1e39"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::property_ops::set::own_set_descriptor: FunctionTooLong \u2014 perry_runtime::object::property_ops::set::own_set_descriptor 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/perry-runtime/src/object/property_ops/set.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4819007c00c2255b7ffd6bc85b52d8276b584ebb3e09577cce1b7a071caa0d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Session.finish: MethodTooLong \u2014 finish 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/perry/src/commands/compile/source_need.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a286abaf93703b8c841422c842d81db766e5552bdcb96ba70d4c411ec2049f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::widget_build::build_declared_widgets_ios: FunctionTooLong \u2014 perry::commands::compile::widget_build::build_declared_widgets_ios 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/perry/src/commands/compile/widget_build.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d539d1c96a4b4780ad307dd9c2edd967823dbbef91da988fc3f346f5caeaf05"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: setup/ios.rs: FileTooLong \u2014 689 significant 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 189 over it, 1.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/perry/src/commands/setup/ios.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c0d018d67b5cd07d5aa7cfa589edae6f3712a76b6dce0fbb5e64fbeeb3ef7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: crypto/util.rs: FileTooLong \u2014 685 significant 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 62 free functions. The bar is 500 significant lines; this is 185 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/crypto/util.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e8f47109390af785633697a8ca518a4dec60b54b116bdb207670e1318d8e5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::private_method::try_lower_private_method_call: FunctionTooLong \u2014 perry_codegen::lower_call::private_method::try_lower_private_method_call runs 137 significant 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 37 over it, 1.37\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/perry-codegen/src/lower_call/private_method.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a00715c87fe206f2f970f88b008e95a68d7ad41d36533b8561d0ac199b3096"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_component_host::ffi::new_bridge: FunctionTooLong \u2014 perry_component_host::ffi::new_bridge runs 137 significant 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 37 over it, 1.37\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/perry-component-host/src/ffi.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe374c5ad4a0bcb57e39c6a209c4c4d25f53d9446e872f6b18942809c50c7ac8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Gen.new: MethodTooLong \u2014 new runs 137 significant 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 37 over it, 1.37\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/perry-wpfacts/src/gen.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d97b90320cb91e5b7968fa42a66071eceb9837d3d5ed3f2e4c9d78d4019a9cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/method_site.rs: FileTooLong \u2014 684 significant 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 184 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/method_site.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b428c6eb2c8ea8d7150cb151378af644851e0fd91911034bc6ed28a6e0237d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DirectParser: TooManyMethods \u2014 41 methods, declared across 2 files: json/parser.rs (40), json/parser_escape_chunk.rs (1). The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/json/parser.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1139fd287252eab40b30a75d6452ca736a697e11c3aa031ba3192dcf6dc99f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::os::os_process_emitter: TooManyFunctions \u2014 41 free functions. The bar is 30 free functions; this is 11 over it, 1.37\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/perry-runtime/src/os/os_process_emitter.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e9d64a47c21f2c3d52f21d8591dd7766238b73e47cded3a22a7f1d5f8d4224"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::proxy_hooks: TooManyFunctions \u2014 41 free functions. The bar is 30 free functions; this is 11 over it, 1.37\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/perry-runtime/src/proxy_hooks.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4df52bda53f1e9ba888594d09daa8f72dbe39a7e36cc3d231a60e2bd9f286d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: WasmHostOps: TooManyFields \u2014 41 stored fields. The bar is 30 stored fields; this is 11 over it, 1.37\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/perry-abi/src/wasm_host.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7849864b997daa6ef0a0f72cf0f219e0485e174638c8cab875f20b54395c0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: url/search_params.rs: FileTooLong \u2014 683 significant 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 56 free functions. The bar is 500 significant lines; this is 183 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/url/search_params.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dad6484e604428225a33764cecc19c0883a01bbe0422d704b6f5566d8f0d52e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collectors/receiver_regions.rs: FileTooLong \u2014 682 significant 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 182 over it, 1.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/perry-codegen/src/collectors/receiver_regions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d328b28d7a00a9ae25d628b3be36dcec8c6a290c697fa68a5091af2592a0ee9b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gen/import_values.rs: FileTooLong \u2014 681 significant 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 100% of them inside a single declaration: Gen (3-1049). The bar is 500 significant lines; this is 181 over it, 1.36\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/perry-wpfacts/src/gen/import_values.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d556a2cce0910da7cdd67328878ff264a195bdfe69d1a52882f0f69c218d112a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen_wear_tiles::emit::emit_node: FunctionTooLong \u2014 perry_codegen_wear_tiles::emit::emit_node 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/perry-codegen-wear-tiles/src/emit.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"423ec0507991577c059492344f9fa3e001ad2a7ca948039b5e62d10d1c1f2828"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::ptr_shape_numeric::prove_numeric_fields: FunctionTooLong \u2014 perry_codegen::collectors::ptr_shape_numeric::prove_numeric_fields 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/perry-codegen/src/collectors/ptr_shape_numeric.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"1712e14b072753a2733a41b3eb63450ff83de0f468dd040919ef0a322cb11638"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::index_set_packed_loop::lower_packed_f64_range_loop_index_set: FunctionTooLong \u2014 perry_codegen::expr::index_set_packed_loop::lower_packed_f64_range_loop_index_set 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/perry-codegen/src/expr/index_set_packed_loop.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7531ed5cc1374409d6a29ad9d8d9b4ee55e44aa9702e88d9792090149ea158d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::type_analysis::strings::is_string_expr: FunctionTooLong \u2014 perry_codegen::type_analysis::strings::is_string_expr 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/perry-codegen/src/type_analysis/strings.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0e056b8b3a12c7a3c68e1daa052d9cc502f3783acb8e275346cead1a3fa993"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GcCycleState.step_reclaim: MethodTooLong \u2014 step_reclaim 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/perry-runtime/src/gc/cycle.rs"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"7115795360a9a7e4d92cefdb376c5fdcabc11b0d3d84d49223f662ba6d35d28e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::intl::date_collator::build_parts_from_components: FunctionTooLong \u2014 perry_runtime::intl::date_collator::build_parts_from_components 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/perry-runtime/src/intl/date_collator.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37450a601879c4254ecf75f02d42be4308b436baf1549fee6f2b07529a1e6b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::publish::preflight::ios_preflight_validation: FunctionTooLong \u2014 perry::commands::publish::preflight::ios_preflight_validation 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/perry/src/commands/publish/preflight.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb397ca108722366e60749ee77ac885162e674642096ec5f3a8c514f8e7b21e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_module_dispatch/dispatch_m_p.rs: FileTooLong \u2014 679 significant 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 179 over it, 1.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/perry-runtime/src/object/native_module_dispatch/dispatch_m_p.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb8880a358489418310518656ab9a756b71d3b53f7c6a60a39d55d1a655681b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: layout_families/late.rs: FileTooLong \u2014 678 significant 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 178 over it, 1.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/perry-codegen/src/layout_families/late.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc629f2ec312ebdc6b220b79f2bea5bf8d97b152d242a7326056ed64633f53a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_module_dispatch/dispatch_a_c.rs: FileTooLong \u2014 678 significant 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 178 over it, 1.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/perry-runtime/src/object/native_module_dispatch/dispatch_a_c.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65204cf50521f0be18a9010c0f428ef2e0da7f2afebda02485c4f7cb9ed61889"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collectors/integer_locals.rs: FileTooLong \u2014 676 significant 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 176 over it, 1.35\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/perry-codegen/src/collectors/integer_locals.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b8fb74c0ca4182284e7ef234fc971ac61b6608bbfec73da0238ebaa511023a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generator/break_continue.rs: FileTooLong \u2014 676 significant 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 176 over it, 1.35\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/perry-transform/src/generator/break_continue.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9ada18351ca25eadd1b3deda39608bebad4095ec362a7a83b723433a28def0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::native_value::verify::abi::validate_native_abi_type_record: FunctionTooLong \u2014 perry_codegen::native_value::verify::abi::validate_native_abi_type_record runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/native_value/verify/abi.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"249584fe43cff61a521caef9096a0a7ed194366999e47d226405096c4e569d86"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stable_hash/expr.rs: FileTooLong \u2014 672 significant 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 98% of them inside a single declaration: Expr (30-704). The bar is 500 significant lines; this is 172 over it, 1.34\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/stable_hash/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c91c52c8d884ba33439018cf78ad79ee0d32cb6394b74954feb756f836a0db6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collectors/escape_news.rs: FileTooLong \u2014 670 significant 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 170 over it, 1.34\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/perry-codegen/src/collectors/escape_news.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a2e4dc07258dc3fd37cbf52e47e294cf6aa498b949a099132b524551d3edda"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::indexed_owner_loop::numeric: FunctionTooLong \u2014 perry_codegen::stmt::indexed_owner_loop::numeric 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/perry-codegen/src/stmt/indexed_owner_loop.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eef69647eb0c70028856a1704a2cb4f151484b027d4323cc13610d1ef764863"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_call::nested_namespace::dispatch_path_subnamespace: FunctionTooLong \u2014 perry_hir::lower::expr_call::nested_namespace::dispatch_path_subnamespace 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/perry-hir/src/lower/expr_call/nested_namespace.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eccf6ccb8f7a83ec65d79421e9a514a9280e15c46cb591a7cb5a8ed17fa6f72"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::lower_expr::arm_ident::lower_ident_expr: FunctionTooLong \u2014 perry_hir::lower::lower_expr::arm_ident::lower_ident_expr 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/perry-hir/src/lower/lower_expr/arm_ident.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0813b92c10e5e6b9a5984501abe17e30e9993e027403f220813082f0d3ff6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::node_http_prototypes::build_http_prototype: FunctionTooLong \u2014 perry_runtime::object::node_http_prototypes::build_http_prototype 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/perry-runtime/src/object/node_http_prototypes.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af16ad1374d7f1562a69028a3a03ae79f2f71c23be907f7f2898c569e8cf6eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::async_to_generator::hoist_awaits_in_stmt: FunctionTooLong \u2014 perry_transform::async_to_generator::hoist_awaits_in_stmt 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/perry-transform/src/async_to_generator.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0648f9472fd77495b1073198e3ac5e84f8964791820eecb235f70059274a951"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_module/namespace_builders.rs: FileTooLong \u2014 668 significant 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 168 over it, 1.34\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/perry-runtime/src/object/native_module/namespace_builders.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fdf1a103bba323e469ec11ba97d4fce7e68e7949982bca7cd7efef74a9ecc4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/shapes_slot_list.rs: FileTooLong \u2014 667 significant 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 167 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/perry-runtime/src/object/shapes_slot_list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"859a8d38f44be76a23e82b9d06efc9c6bf8bbc7f57ca1d26bc8905c63614e082"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::node_submodules::trace_events: TooManyFunctions \u2014 40 free functions. The bar is 30 free functions; 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/perry-runtime/src/node_submodules/trace_events.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ac25308dd87e4bf142c1a2c0714c61760356139a8bcabb6d326e08b272f6a1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::object::global_this::ctor_thunks: TooManyFunctions \u2014 40 free functions. The bar is 30 free functions; 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/perry-runtime/src/object/global_this/ctor_thunks.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"0752f058c8e61a8e02078a4e9ff254c6079a02dd3a464ddc0dbd54103810a35b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JSValue: 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/perry-runtime/src/value/jsvalue.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a1dee780b11d1ecd78b98e5afb876320803a460a64e96d90d8462f71b33569"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_visionos::ffi_focus_menu: TooManyFunctions \u2014 40 free functions. The bar is 30 free functions; 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/perry-ui-visionos/src/ffi_focus_menu.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad98711f1854596c2ad5c01a9b690fbfec4696fb47f55755f3c18274d204fe27"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen_swiftui::emit::emit_node: FunctionTooLong \u2014 perry_codegen_swiftui::emit::emit_node 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/perry-codegen-swiftui/src/emit.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"0adb2b730480d33e844583c054d300b87b627bf01e5c1730ed32696b264f54f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::method_override::emit_pshape_argument_dispatch: FunctionTooLong \u2014 perry_codegen::lower_call::method_override::emit_pshape_argument_dispatch 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/perry-codegen/src/lower_call/method_override.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"43150554e36836fcec67d8ba5d5dd48e23dc4fb302613397bac938aa6d985090"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::gc::gc_init: FunctionTooLong \u2014 perry_runtime::gc::gc_init 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/perry-runtime/src/gc/mod.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f6efcf9cc3a7aefce4fd4a37c147a5eb9c9e525298d10da4afd617f21b6413"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::url::parse::parse_url: FunctionTooLong \u2014 perry_runtime::url::parse::parse_url 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/perry-runtime/src/url/parse.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78662b839a9fffbfa0dee60a77dd78fb8522373af4f135cf0ec8cae956af598"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Emitter.lift: MethodTooLong \u2014 lift 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/perry-wit/src/guest_c/values.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5aceb541c85337bf318b813286079f495e37cb0545064b3b39f07de33cf1486"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: turnloop_net/abi.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), declaring 60 free functions. 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/perry-runtime/src/turnloop_net/abi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b8b34d2c410667c4f6ebf218f7cf06a9010b9264ca37cc5262385c9eb4e753"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/root_reload.rs: FileTooLong \u2014 661 significant 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 161 over it, 1.32\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/perry-codegen/src/root_reload.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1a6f4acd33c4134f8c05b91b443681f7ffb8986606151496b7001c39ceac5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/pod_record.rs: FileTooLong \u2014 660 significant 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 160 over it, 1.32\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/perry-codegen/src/expr/pod_record.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"459c588ea9c503967eb6e01ff7d5cbe7f09c22d89d87bff777629b80dd4ef56f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ext_net::payload_socket::destroy: FunctionTooLong \u2014 perry_ext_net::payload_socket::destroy 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/perry-ext-net/src/payload_socket.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"11666aa56927adda35cf414a84a7097f111aa6359cf12f91db13d23eb5d8532a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::shared_mutable_capture::desugar_shared_mutable_captures: FunctionTooLong \u2014 perry_hir::lower::shared_mutable_capture::desugar_shared_mutable_captures 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/perry-hir/src/lower/shared_mutable_capture.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfa0c3cadf2b52379679e54c620a6b7f7fb5383d0172a07a1f63c37d8bae6ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_windows::widgets::paint_shadow_for_child: FunctionTooLong \u2014 perry_ui_windows::widgets::paint_shadow_for_child 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/perry-ui-windows/src/widgets/mod.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"323b33cf5d8e99f6a585430426eb6f6eb8ac0917b9fb1807b122eb6df5b82788"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lodash.rs: FileTooLong \u2014 659 significant 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 47 free functions. The bar is 500 significant lines; this is 159 over it, 1.32\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/perry-stdlib/src/lodash.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e92d8159070c7967bc2ca51def968ad34e6f87c7bb7fc602e80a9fa8dd03d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node_stream_constructors/builders.rs: FileTooLong \u2014 658 significant 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 158 over it, 1.32\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/perry-runtime/src/node_stream_constructors/builders.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"658e13847d7185c10d538e3ab70c12985f5c5ce157f83f16f15e8eb9573f3c8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: crypto/hash_handles.rs: FileTooLong \u2014 657 significant 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 57 free functions. The bar is 500 significant lines; this is 157 over it, 1.31\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/perry-stdlib/src/crypto/hash_handles.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce0ce1fb5a7464239f267f3ae31ecf7c39c0a353a4f7a5699981736b7b28bea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compile/size_report.rs: FileTooLong \u2014 655 significant 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 155 over it, 1.31\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/perry/src/commands/compile/size_report.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea4b8d718bb808e66317e16637a2552492f8045fcf0725c651ce97280b1d687"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::int_valued_ta_locals::collect_int_valued_ta_locals: FunctionTooLong \u2014 perry_codegen::collectors::int_valued_ta_locals::collect_int_valued_ta_locals 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/perry-codegen/src/collectors/int_valued_ta_locals.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"656327ac2fd2a6cbf26b7872cddaccc3142bbc7124a93491167ac58a7d961ce8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::fs_await::lower: FunctionTooLong \u2014 perry_codegen::expr::fs_await::lower 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/perry-codegen/src/expr/fs_await.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76bf92695e074cf0fd473691c00ce63974094532ad9bda7f0564f4d2d7c4196"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::region_loop::guard::emit_guard: FunctionTooLong \u2014 perry_codegen::stmt::region_loop::guard::emit_guard 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/perry-codegen/src/stmt/region_loop/guard.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7134728eb3e52a26552953faf908f15cb4588c7658c16ebc89937cc9c0ee95"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower_decl::block::lower_stmts_using_aware_inner: FunctionTooLong \u2014 perry_hir::lower_decl::block::lower_stmts_using_aware_inner 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/perry-hir/src/lower_decl/block.rs"},"region":{"startLine":1518}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a32616441d27f180ca727ea341e3c865e974ff6efe2fe9b9fedc66b3ef5f80f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime_manifest::realm_source::declarations: FunctionTooLong \u2014 perry_runtime_manifest::realm_source::declarations 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/perry-runtime-manifest/src/realm_source.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b2e8038fba6547fd4fd8d5dffce6f915f73a092787d72ada0c7e6c46048db8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::intl::number_format::number_parts_core: FunctionTooLong \u2014 perry_runtime::intl::number_format::number_parts_core 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/perry-runtime/src/intl/number_format.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fa654bcbda95fcabd190a12f2f972aa3f7bc988655f05ad758ee1263ac57fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::object_ops_frozen::object_integrity_level: FunctionTooLong \u2014 perry_runtime::object::object_ops_frozen::object_integrity_level 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/perry-runtime/src/object/object_ops_frozen.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e05845a752a472a05c7c4907a1c966a108cef86f24e1a09886da388e1d1ae68"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::generator::transform_generator_closures_in_stmts: FunctionTooLong \u2014 perry_transform::generator::transform_generator_closures_in_stmts 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/perry-transform/src/generator/mod.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fbbed6608d2ac42fd13c87da07c9c40901e8823794419cc1ad9667707b626c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Session.finish: MethodTooLong \u2014 finish 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/perry/src/commands/compile/reach_report.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d086dddd7cca5e0a29d74276ac21ebd5be0f51572afb1b31021f0b31c7fd05"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: global_this/populate.rs: FileTooLong \u2014 653 significant 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 153 over it, 1.31\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/perry-runtime/src/object/global_this/populate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc80e59cf48824ffe1297d28bff56f5a5343a4f71298eb40b110672670279e0e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::bun_compat: TooManyFunctions \u2014 39 free functions. The bar is 30 free functions; this is 9 over it, 1.30\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/perry-runtime/src/bun_compat/mod.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"153741974e78df75cf4ab06806363e48a0204bbcce5038ecf566c9859bd26e5f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::dyn_eval: TooManyFunctions \u2014 39 free functions. The bar is 30 free functions; this is 9 over it, 1.30\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/perry-runtime/src/dyn_eval/mod.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"887d6d9a9e7d656abc464fef2dbae11bd7690e46db4a011b6a7d9f338330c570"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::text: TooManyFunctions \u2014 39 free functions. The bar is 30 free functions; this is 9 over it, 1.30\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/perry-runtime/src/text.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3198b5b2130e4c473072de0e0805bba2e221e1578b2a58e04114c3afae98255"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::web_storage: TooManyFunctions \u2014 39 free functions. The bar is 30 free functions; this is 9 over it, 1.30\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/perry-runtime/src/web_storage.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c383cb6317cf269bfcb5b771b23dcffee9dededabfaa762e6b7e9c5dfc001f33"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_android::ffi::tabbar_layout: TooManyFunctions \u2014 39 free functions. The bar is 30 free functions; this is 9 over it, 1.30\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/perry-ui-android/src/ffi/tabbar_layout.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06c3233e45772f9e9c315e95f1db8cbe5b41b9ac3e554995348475b994ee21f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SocketFields: TooManyFields \u2014 39 stored fields beside 1 method. The bar is 30 stored fields; this is 9 over it, 1.30\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/perry-ext-net/src/payload_transport.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd67429bc7b46f6693ef69a8c5718111171af05b17d97c954cc7fbe6cdfe0e9d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::compare::lower_string_literal_strict_eq: FunctionTooLong \u2014 perry_codegen::expr::compare::lower_string_literal_strict_eq 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/perry-codegen/src/expr/compare.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f21f4daa129468befb570bfca5c6f1f422336fcedc611c7dbacc0f27e823d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::object_literal::lower_object_literal: FunctionTooLong \u2014 perry_codegen::expr::object_literal::lower_object_literal 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/perry-codegen/src/expr/object_literal.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a5f99be70a31b07a4767dc68655dd4eb2e93c1e6631006802e5bde110a1836"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::destructuring::var_decl::type_infer::infer_decl_type: FunctionTooLong \u2014 perry_hir::destructuring::var_decl::type_infer::infer_decl_type 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/perry-hir/src/destructuring/var_decl/type_infer.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcef51253f186da3878547c2c0d3aa3d76d1c932faa433c726060e109cc1fd74"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::array::flat_clone::js_array_clone: FunctionTooLong \u2014 perry_runtime::array::flat_clone::js_array_clone 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/perry-runtime/src/array/flat_clone.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"99eec045901327361c0b0dc4224c2be23ce2bbbb12898c69dc855a7a09964780"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::child_process::reactor::js_child_process_spawn_streams: FunctionTooLong \u2014 perry_runtime::child_process::reactor::js_child_process_spawn_streams 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/perry-runtime/src/child_process/reactor.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35de52ff0c96413793f1b4d3887b44b57a06b926b8784b68769581099520f1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::layout_probe::derive_word::derive_word: FunctionTooLong \u2014 perry_runtime::object::layout_probe::derive_word::derive_word 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/perry-runtime/src/object/layout_probe/derive_word.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f75df20441aeb543f8d11f80172305cf9089eeb1d9458340dfea9ba8bb3e73f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_gtk4::widgets::canvas::create: FunctionTooLong \u2014 perry_ui_gtk4::widgets::canvas::create 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/perry-ui-gtk4/src/widgets/canvas.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66afa0a45130c4849824012d6ee1be39a077f5d86604113c3562c372e47e38a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_windows::widgets::canvas::paint_canvas: FunctionTooLong \u2014 perry_ui_windows::widgets::canvas::paint_canvas 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/perry-ui-windows/src/widgets/canvas.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f5b90553b775bbab47f348c71e2af237f23763dcd9ac7ead9be9d7900de051"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: promise/microtasks.rs: FileTooLong \u2014 649 significant 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 149 over it, 1.30\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/perry-runtime/src/promise/microtasks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9c7ec08be5bbed01e4741a666ecaff9f619e7e6089a08a331b9fd49d8fceb6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: string/mod.rs: FileTooLong \u2014 649 significant 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 42 free functions. The bar is 500 significant lines; this is 149 over it, 1.30\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/perry-runtime/src/string/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95bf38af66be073b5cbcb9c51cecf4d366d3fafff33f3791a89a3ae363a2b93d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/buffer_access.rs: FileTooLong \u2014 648 significant 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 148 over it, 1.30\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/perry-codegen/src/expr/buffer_access.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66a7ae8bdabbf5f3cc0f45185560c1f113bd4d48853f6603ca9e8049c17e8ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/async_hook_slots.rs: FileTooLong \u2014 648 significant 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 70 free functions. The bar is 500 significant lines; this is 148 over it, 1.30\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/perry-runtime/src/async_hook_slots.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ac2576e3b56044daf8f10decf0f5146497a936746b6247b8d89e6ea8d0fbc8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: global_this/bigint_promise.rs: FileTooLong \u2014 648 significant 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 78 free functions. The bar is 500 significant lines; this is 148 over it, 1.30\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/perry-runtime/src/object/global_this/bigint_promise.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dcf074c2020bce1f05decf1b13788717485d2e5e26223e90bba1fae0f02e340"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/thread.rs: FileTooLong \u2014 648 significant 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 148 over it, 1.30\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/perry-runtime/src/thread.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48eb191bd728e821eb21bb0311f89c7580fcf957d3db82b28d09a9efb0893928"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: arena/walk.rs: FileTooLong \u2014 647 significant 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 147 over it, 1.29\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/perry-runtime/src/arena/walk.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afbcf6ede9e30bf9318984b32e9320a092f761992a8850baf9d83a7f0ecbccd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/timer.rs: FileTooLong \u2014 646 significant 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 76 free functions. The bar is 500 significant lines; this is 146 over it, 1.29\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/perry-runtime/src/timer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb65de156413b410bc917f759f899da4e060534a97660c000edf113231b1014d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tls_client.rs: FileTooLong \u2014 645 significant 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 145 over it, 1.29\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/perry-ext-http/src/tls_client.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff168ea49ac1bfd1fb5b27bfd10f9f5e19081e776262acf40de137a35dcbb867"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::native::box_style::apply_box_style: FunctionTooLong \u2014 perry_codegen::lower_call::native::box_style::apply_box_style 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/perry-codegen/src/lower_call/native/box_style.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"832703e7a47b45a3c3ec5ecf5de77184ec86f3203025cdeedfd80e53ad878c2d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::destructuring::var_decl::native_new::register_native_from_new_and_calls: FunctionTooLong \u2014 perry_hir::destructuring::var_decl::native_new::register_native_from_new_and_calls 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/perry-hir/src/destructuring/var_decl/native_new.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e570255164b3602b3bf5a5496490388f12265a617e4c96c6eace2099477d42bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::closure::dynamic_props::closure_get_dynamic_prop_keyed: FunctionTooLong \u2014 perry_runtime::closure::dynamic_props::closure_get_dynamic_prop_keyed 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/perry-runtime/src/closure/dynamic_props.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9b88eebcb2ee57cb03cee46efc8d12a41d641903ee5fac7b0919e52fe9144d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::json::stringify::stringify_value_depth: FunctionTooLong \u2014 perry_runtime::json::stringify::stringify_value_depth 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/perry-runtime/src/json/stringify.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36c7d2051f710dca84a4dced20fcbe8a0564e33afb6e70a3c66da4797f1dfae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_stdlib::tls::dispatch::dispatch_tls_handle: FunctionTooLong \u2014 perry_stdlib::tls::dispatch::dispatch_tls_handle 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/perry-stdlib/src/tls/dispatch.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b18f4adfb24e7719d4dfd89913e224aca6e4348339b7d475c7a6567d1452e5d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Gen.link_exports: MethodTooLong \u2014 link_exports 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/perry-wpfacts/src/gen/export.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c148f18d594895f6661302d17705dad90c8044c5551a2733e853acb327fc6b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/write_barrier.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). 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/perry-codegen/src/expr/write_barrier.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ba81fde4a35c8dc73048b16a211825a88b0f04753a792702ac5370f34b240b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/media_playback.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 39 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/perry-ui-tvos/src/media_playback.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0280534c514d68b026a7268c829d4879598c1a1ab1556fbb8554cde9641d29"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/media_playback.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 39 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/perry-ui-visionos/src/media_playback.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e837e674fb6e125085f27bc6dbfe08230f232b9d237d068d9c32c00b1fa75627"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js_transform/cross_module_natives.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). 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/perry-hir/src/js_transform/cross_module_natives.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef245a301b3474692b7f83a7e74dc1bbaed7a8b735f358c6d4a47cb296ec1a2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr_call/globals.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). 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/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ca249ee461b979ba0efd3a11a8be1cbead21f15b8e47016925426a3ea973e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: closure/alloc.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 35 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/perry-runtime/src/closure/alloc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e48e05f15d34363a51190befb9b29e87ee98f3f722f2feee4303ccaee738c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/media_playback.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 39 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/perry-ui-watchos/src/media_playback.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89125b13ce92ba92b68bb011578f147851e70e661cdfd43196fa0541caa5dec"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrayWalk.walk_expr: MethodTooLong \u2014 walk_expr runs 128 significant 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 28 over it, 1.28\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/perry-codegen/src/collectors/ptr_shape_elements.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"b216d18e6bbe2b856c9fe04287aa0ead7f3474c8f20caafe13940d7a3cd90b9b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::dyn_eval::expr::eval_call: FunctionTooLong \u2014 perry_runtime::dyn_eval::expr::eval_call runs 128 significant 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 28 over it, 1.28\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/perry-runtime/src/dyn_eval/expr.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb95be4fa1fde2b8a8bf8bf72460fb37b5c332c30776bb0ceb5f1099ab90fc91"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::util_parse_args::js_util_parse_args: FunctionTooLong \u2014 perry_runtime::util_parse_args::js_util_parse_args runs 128 significant 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 28 over it, 1.28\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/perry-runtime/src/util_parse_args.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3859909bf19fc53d791c592b546b0c9c42205d11ae1a3dbaaf96865b9c2e24"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_stdlib::webcrypto::jwk::js_webcrypto_export_key: FunctionTooLong \u2014 perry_stdlib::webcrypto::jwk::js_webcrypto_export_key runs 128 significant 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 28 over it, 1.28\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/perry-stdlib/src/webcrypto/jwk.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"630092b9756dacfa066297329a8750044961842e7ddf4b361c630a4376a2c2d2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Gen.contract_check: MethodTooLong \u2014 contract_check runs 128 significant 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 28 over it, 1.28\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/perry-wpfacts/src/gen/export.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"88258dfc2e6fee6362a64af6dde4289845a04c28480f5be549acd062e830a9e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::resolve::resolve_import_with_bunfs: FunctionTooLong \u2014 perry::commands::compile::resolve::resolve_import_with_bunfs runs 128 significant 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 28 over it, 1.28\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/perry/src/commands/compile/resolve.rs"},"region":{"startLine":1580}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6f971afef66ef516d253e3b1283263d1b08327d657a76ff91528c4a965163c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: field_get_set/ic_miss.rs: FileTooLong \u2014 639 significant 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 139 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/perry-runtime/src/object/field_get_set/ic_miss.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"197251e3a4d8aac403c4faea63cbdbff141e8299bee285ccdf525ad5abe8e393"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: arena/block.rs: FileTooLong \u2014 637 significant 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 137 over it, 1.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/arena/block.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2c00d4869dcb72921919f75b3639c73076a7d6313a3826162cde5c89234a98"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: streams/pipe.rs: FileTooLong \u2014 637 significant 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 137 over it, 1.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/streams/pipe.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08258b402a61208728d481b27423595157c9ef5da4e408924594f6f06c1fc57"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Walk.stmt: MethodTooLong \u2014 stmt runs 127 significant 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 27 over it, 1.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/perry-codegen/src/collectors/read_before_write.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc85bfabd6537bb4eb7adbfe6b9e67b40ef6ecac32714c5d901acb1c0876078"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ext_net::payload_io::sink: FunctionTooLong \u2014 perry_ext_net::payload_io::sink runs 127 significant 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 27 over it, 1.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/perry-ext-net/src/payload_io.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c1a101f4dbdef942aeb0b60209872211d2471e62becc6fdd9ea800b8b13a02"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::global_this_webassembly::create_webassembly_namespace: FunctionTooLong \u2014 perry_runtime::object::global_this_webassembly::create_webassembly_namespace runs 127 significant 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 27 over it, 1.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/perry-runtime/src/object/global_this_webassembly.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"245fdce346cc2a2e41b25b920158154b97180d63441ec4840f3fae0a5e4bfe41"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stmt/masked_window_region.rs: FileTooLong \u2014 634 significant 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 134 over it, 1.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/masked_window_region.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8faf8aaa549f66516c046fe905b444049c47b2fa12c7b7b38fa2c4aba25e28f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JsEmitter: TooManyMethods \u2014 38 methods, declared across 7 files: emit/mod.rs (17), emit/decls.rs (8), emit/calls.rs (7), emit/exprs.rs (2), \u002B3 more file(s). The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/emit/mod.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6059e7f325351b2d1c648455ab79f7116a79f7035818e133c79b3ec43c3a96bc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ext_http::server::response_payload: TooManyFunctions \u2014 38 free functions. The bar is 30 free functions; this is 8 over it, 1.27\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/perry-ext-http/src/server/response_payload.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd527ed064c7a56f5c490e504b2a19be610021be711ec194da8614556147fb5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::closure::props: TooManyFunctions \u2014 38 free functions. The bar is 30 free functions; this is 8 over it, 1.27\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/perry-runtime/src/closure/props.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ca05fbbfaa7c01eec4b6da5823535220c11cadf073319ae09353ad2f1e0ce8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ShapeSlab: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\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/perry-runtime/src/object/shapes_store.rs"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fc9eb03915231e7acfa9337eaf867bc08e5decdedd521e2a02c9614df1c02e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::regex: TooManyFunctions \u2014 38 free functions. The bar is 30 free functions; this is 8 over it, 1.27\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/perry-runtime/src/regex.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0dbd7cfe9e799e02086b55400bd7029e205fbf8ffcf8a8ba10b8eb1cb67c47d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::symbol: TooManyFunctions \u2014 38 free functions. The bar is 30 free functions; this is 8 over it, 1.27\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/perry-runtime/src/symbol.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab6955ecd88365d7cd90e38fc38fe8d279f0847ed9810619d28998ac3904260"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_android::ffi::text_scroll: TooManyFunctions \u2014 38 free functions. The bar is 30 free functions; this is 8 over it, 1.27\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/perry-ui-android/src/ffi/text_scroll.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b862909bad7c705f6af9bf8168a5330726cdc41bdab60b81b6050396c3e3c31"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_gtk4::ffi::platform_audio_camera_toast: TooManyFunctions \u2014 38 free functions. The bar is 30 free functions; this is 8 over it, 1.27\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/perry-ui-gtk4/src/ffi/platform_audio_camera_toast.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"48657edadbca5205717566eafd29f8cbf2d77f233f953f615aaeb80656f28efe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/folded_builtin_override.rs: FileTooLong \u2014 633 significant 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 133 over it, 1.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/folded_builtin_override.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ae549edb63aeb1382f64fab6dce0126080216929d7b20b7b4cb1b659753536"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.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). 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/perry-ext-parcel-watcher/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"830ef4fd7f2f01de511c91707aa094ad133959c808098cb3e4d1fac1fd7fd2ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::property_get::imported_object::try_lower_dynamic_object_method_call: FunctionTooLong \u2014 perry_codegen::lower_call::property_get::imported_object::try_lower_dynamic_object_method_call 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/perry-codegen/src/lower_call/property_get/imported_object.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d172ce82873ba3efaaa1b63a19653a7b5bcb5de1b8a7fb4d99502b750bcf273"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::scalar_method::lower_scalar_replaced_int32_method_call: FunctionTooLong \u2014 perry_codegen::lower_call::scalar_method::lower_scalar_replaced_int32_method_call 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/perry-codegen/src/lower_call/scalar_method.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebc5ad601e98040b52bfbcb3024f085ea517fb1987e557d6e580e6e19124a28"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::lower_module_fn::collect_assigned_function_binding_candidates: FunctionTooLong \u2014 perry_hir::lower::lower_module_fn::collect_assigned_function_binding_candidates 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/perry-hir/src/lower/lower_module_fn.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"298446b18a4d0e1681ba0f2c8fe24e37e106d5a3fe29e2ede07c94f86cdd30ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::intl::locale::install_locale: FunctionTooLong \u2014 perry_runtime::intl::locale::install_locale 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/perry-runtime/src/intl/locale.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"9158171d370fcdd8760d96ceee3e1971e667f922b6de72ec65299b19df72102d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_macos::app::app_run: FunctionTooLong \u2014 perry_ui_macos::app::app_run 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/perry-ui-macos/src/app.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfb743d48e0f8ae837ddf66929927622d38a39f513e92b7cf9541c70e1f3ab0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::collect_modules::walk::walk_modules: FunctionTooLong \u2014 perry::commands::compile::collect_modules::walk::walk_modules 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/perry/src/commands/compile/collect_modules/walk.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"508fff2829684f336929574ef74335c40d0550770eb13e3ce2886beb9866672e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower/abrupt.rs: FileTooLong \u2014 629 significant 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 129 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/perry-transform/src/generator/lower/abrupt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b557ad6e43eb8476e9f929961e4ceea058235f8ede4babe69aaeeffe792505"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: property_get/generic_dispatch.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/perry-codegen/src/expr/property_get/generic_dispatch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef6be3c3a11ea7c493a1c6e88dd3fd009a056578586f7486af54595410aa246"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dispatch/bound.rs: FileTooLong \u2014 625 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 125 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/closure/dispatch/bound.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aba267412e75d09604ade952d0fec0d79fc8299012bcf222e5ac658a9b39d7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 625 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 125 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23060970d769fde8144a93e813b0e8b91c1232a3e2542a2abb365995f6f0f37"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ext_http::server::response_end::standalone_end: FunctionTooLong \u2014 perry_ext_http::server::response_end::standalone_end runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-http/src/server/response_end.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd07d3eef4c02b508a843a47f71891e200c2a6500eb2fe01cefc667ab1a14d73"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Module.hash: MethodTooLong \u2014 hash runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/stable_hash/module.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef76dddf9e5d2cafc8ea6e4480859b10637c08ef8d8c0ec83481c858c3409898"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_wasi::filesystem::primitives::windows::fs::create_file_at_w::CreateFileAtW: FunctionTooLong \u2014 perry_wasi::filesystem::primitives::windows::fs::create_file_at_w::CreateFileAtW runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wasi/src/filesystem/primitives/windows/fs/create_file_at_w.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0f8f906b85a35e1e79e45f7a452d024dc7d6fcf91bf590d2db94d8215c28a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/alloc.rs: FileTooLong \u2014 624 significant 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 124 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/perry-runtime/src/object/alloc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8439e7a0d51ce66f76577ae26760efaf503e0831931658e9239056ddb7131ec1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/filesystem.rs: FileTooLong \u2014 624 significant 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 124 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/perry-wasi/src/filesystem.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36eb4466e86b38ab9d2739e3abdc7a9a75405d219b911b53d59d1c9fb1c490ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/assign.rs: FileTooLong \u2014 622 significant 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 122 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/perry-runtime/src/object/assign.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f685539a9d4b44cd2df3ae179aeba393ed896fecaf5bba5dfeef4d1ad8218f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/media_playback.rs: FileTooLong \u2014 622 significant 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 38 free functions. The bar is 500 significant lines; this is 122 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/perry-ui-macos/src/media_playback.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0971cbdc181b907f9a12d0e3841f95e0832b2acfaefaf76b8728b54aaa3e275"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::native::perf_hooks::lower_perf_hooks_method: FunctionTooLong \u2014 perry_codegen::lower_call::native::perf_hooks::lower_perf_hooks_method runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/native/perf_hooks.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d464caa8a5235d441660a882a406ab99fa177f14d5316b1e86a4bdd1707cea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_component_host::wire::lower_at: FunctionTooLong \u2014 perry_component_host::wire::lower_at runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-component-host/src/wire.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b239302dddc3971ded349909ed1496640dfb74234b625506934db9e0c51fd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_call::crypto::lower_crypto_passthrough: FunctionTooLong \u2014 perry_hir::lower::expr_call::crypto::lower_crypto_passthrough runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/crypto.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4894b5bc5c152358e79d0e2d39d6a27e01e80a1ce52bd744386106a5db297ad8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::class_registry::prototype_objects::resolve_proto_chain_field_inner: FunctionTooLong \u2014 perry_runtime::object::class_registry::prototype_objects::resolve_proto_chain_field_inner runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/class_registry/prototype_objects.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"61cc4770dceee8fe17bf2aa96bbacabb2d4065bfbd0e4edc4123dab2c2c26c7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::typedarray_props::typed_array_define_own_property: FunctionTooLong \u2014 perry_runtime::typedarray_props::typed_array_define_own_property runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/typedarray_props.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8237541ef4f91861992d4b7bc8ebefd09427fc4571eb9aab612ddbf781145d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_android::audio::start: FunctionTooLong \u2014 perry_ui_android::audio::start runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-android/src/audio.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c67987c5b5b4883b5a730e4036b4fa70a6ad612f4180e5aa9120e4e92cda445"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_ios::audio_playback::perry_audio_play: FunctionTooLong \u2014 perry_ui_ios::audio_playback::perry_audio_play runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-ios/src/audio_playback.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c571327e174c9838f857f78413fad327233a09f7b02c7480a17515910573f21"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_macos::audio_playback::perry_audio_play: FunctionTooLong \u2014 perry_ui_macos::audio_playback::perry_audio_play runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-macos/src/audio_playback.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0b9ef64364dc2664cbb275ac6f6efabc2258d45dd8585356cd4e5c198edd41"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_tvos::audio_playback::perry_audio_play: FunctionTooLong \u2014 perry_ui_tvos::audio_playback::perry_audio_play runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-tvos/src/audio_playback.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7507ccc7064c112f619154a3ef8a5949ed657118c1d1864b81dce833533e55"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_visionos::audio_playback::perry_audio_play: FunctionTooLong \u2014 perry_ui_visionos::audio_playback::perry_audio_play runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-visionos/src/audio_playback.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96c3617a21eee549087f12de46da714a2f4002d4a1cb70917124077b017be9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_watchos::audio_playback::perry_audio_play: FunctionTooLong \u2014 perry_ui_watchos::audio_playback::perry_audio_play runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-watchos/src/audio_playback.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53c387570e18e2aee567bad3d6b5afeb5f518f41d6629f5e3dab94a201e33f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_windows::layout::measure_intrinsic: FunctionTooLong \u2014 perry_ui_windows::layout::measure_intrinsic runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-windows/src/layout.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c4f63182552769b4fb7f20ff11f698d715f906cf7bdf9a546f2ae04dec952d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::embed::generate_embedded_asset_object: FunctionTooLong \u2014 perry::commands::compile::embed::generate_embedded_asset_object runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/embed.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"675f0cd6dfba7f989b7b104c26008c30fe63e4f463225401e6b2510f1d864eac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::run_pipeline::imported_class_from_hir: FunctionTooLong \u2014 perry::commands::compile::run_pipeline::imported_class_from_hir runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/run_pipeline.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"3273b07e47cdd39eff89a20995a9cabe719a78714c2841344d25e9ac351311df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: field_get_set/accessors.rs: FileTooLong \u2014 618 significant 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 118 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/perry-runtime/src/object/field_get_set/accessors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c2b8a1f74d404d119a050e633f7cd9ff76f00a4233e3c3e630159b85786ee0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: link/link_cache.rs: FileTooLong \u2014 618 significant 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 42 free functions. The bar is 500 significant lines; this is 118 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/perry/src/commands/compile/link/link_cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5aa4b11f4606b12491a399142c2b5012fc36dd6db0fa478fa213ca469e05c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 617 significant 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 117 over it, 1.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/perry-parser/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"732392f284a996e4f6ce05ea2ff5ed02a73b8d02b7a0c68436c5ff627805f49c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_hir::ir::constants: TooManyFunctions \u2014 37 free functions. The bar is 30 free functions; this is 7 over it, 1.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/perry-hir/src/ir/constants.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3056c03c536842ed6971e9812555cad95fd2f33836e5c09ed5797c15bbd34a9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::event_target_hook_slots: TooManyFunctions \u2014 37 free functions. The bar is 30 free functions; this is 7 over it, 1.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/perry-runtime/src/event_target_hook_slots.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f709ad3f3a51cad8af2566fbe15ba2770781220b6ac54bb4e8f3a11247853e1e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RuntimeRootVisitor: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.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/perry-runtime/src/gc/roots.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85e0d4452ac5628ae4e0cda55d77b1ed58c7f0882e8cfbefa08cb419dcae7c4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::math: TooManyFunctions \u2014 37 free functions. The bar is 30 free functions; this is 7 over it, 1.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/perry-runtime/src/math.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6db0f237db6d32044f0c8ae6c5a101706551ffd3fb5e0e888be937056b0a96d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_android::ffi::system_api: TooManyFunctions \u2014 37 free functions. The bar is 30 free functions; this is 7 over it, 1.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/perry-ui-android/src/ffi/system_api.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"66755e14b6710bb1f84fff4c62a468e8f5d5d0dd5001067135d06f527f5c2431"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_gtk4::ffi::stubs_webview_attrtext_screenshot: TooManyFunctions \u2014 37 free functions. The bar is 30 free functions; this is 7 over it, 1.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/perry-ui-gtk4/src/ffi/stubs_webview_attrtext_screenshot.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a182d0d17adcbd708d77796b947ddd3a5312c380ae892cd0a5537c0b62a31a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::int_valued_ta_locals::additive_flow_stmt: FunctionTooLong \u2014 perry_codegen::collectors::int_valued_ta_locals::additive_flow_stmt 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/perry-codegen/src/collectors/int_valued_ta_locals.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4bf440a59cf8307433b43ed8066d97eb35f841f10e3eaad0a7aa6a62ea601b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::array::iterator::array_from_spread_value: FunctionTooLong \u2014 perry_runtime::array::iterator::array_from_spread_value 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/perry-runtime/src/array/iterator.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b576c0050a724af0b96ddaf41ddd35346862055cadd403a0295999a14620399"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::json::stringify_record_output::emit_cached_record_memo: FunctionTooLong \u2014 perry_runtime::json::stringify_record_output::emit_cached_record_memo 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/perry-runtime/src/json/stringify_record_output.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b8512e24fd0d07d2c26873620ceb72dbf3642c69c4ba7e372a20f3751dd1c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::inline::exact_receivers::collect_module_prototype_facts: FunctionTooLong \u2014 perry_transform::inline::exact_receivers::collect_module_prototype_facts 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/perry-transform/src/inline/exact_receivers.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b349911a4c3b68c21b1ccc7e310bbe5caa26a7de65aab6686cc299388df43c19"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::asset_modules::generate: FunctionTooLong \u2014 perry::commands::compile::asset_modules::generate 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/perry/src/commands/compile/asset_modules.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37628f4d2d837000400e1e76ec1091f32639c7f172253342ab33fe208e21b76"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::update_checker::perform_self_update: FunctionTooLong \u2014 perry::update_checker::perform_self_update 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/perry/src/update_checker.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"53763613da75c8683cdbaa0e1b320ba7207c78f83b2d6936a0af594c02c12749"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/node_http_prototypes.rs: FileTooLong \u2014 614 significant 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 114 over it, 1.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/perry-runtime/src/object/node_http_prototypes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"405982ede49a7d85bfa772b624effc43aacac8c0f9c0a7ccefc420c95de65664"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/canvas.rs: FileTooLong \u2014 614 significant 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 114 over it, 1.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/perry-ui-android/src/widgets/canvas.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c218b07546232e619cb6fe9f4ca13f665aa2b75a9b7f7bc9a384af0ac6873f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mutations.rs: FileTooLong \u2014 613 significant 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 113 over it, 1.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/perry-codegen-arkts/src/mutations.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dee2b5d4dc1153edcf15dd7e28dcb7ddcc49eeb957070f673728d3bb5d35700"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/constfn_executable_gates.py: FileTooLong \u2014 611 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 111 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":"scripts/constfn_executable_gates.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d99d6cc8df8961dd0ba694a4f2f2be89f500cc209da40af22acc33ba4220d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: streams/writable.rs: FileTooLong \u2014 611 significant 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 111 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/perry-stdlib/src/streams/writable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35623fed694fc22719ff820616b28f052eb2da1031cb845312f9df03c8e56471"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UseWalk.walk_stmt: MethodTooLong \u2014 walk_stmt runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/ptr_shape.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c37af90d44ba820bfa1856d615272790dc2fa6975e1f1bb31106c7b10725c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::channel::lower_channel_reduction: FunctionTooLong \u2014 perry_codegen::expr::channel::lower_channel_reduction runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/channel.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"978d20dac1405795c66a3ba09e1f92633a9aa4e93511debd454d0cdcfb5ba55c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::class_env::lower: FunctionTooLong \u2014 perry_codegen::expr::class_env::lower runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/class_env.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1360dbf3b500bf4f7a36188f53658ac5381e5755e3d4fbb9e8fb925549bad7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::buffer_intrinsic::module_shadows_buffer_read_method: FunctionTooLong \u2014 perry_codegen::lower_call::buffer_intrinsic::module_shadows_buffer_read_method runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/buffer_intrinsic.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d8de49e46d0e9e2f133e9035414229b79ede9ad4d0c6024c8f3bb3b1ea552a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::gc::pin::pinned_young_move_report: FunctionTooLong \u2014 perry_runtime::gc::pin::pinned_young_move_report runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/gc/pin.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"601c48672dd2cf86d3b66b71f181b622a5f91be47407e390a4f33684885aab78"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::native_module::constructor_shapes::install_event_emitter_statics: FunctionTooLong \u2014 perry_runtime::object::native_module::constructor_shapes::install_event_emitter_statics runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/native_module/constructor_shapes.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0dc4f0afc2bf19ea59e36aa80e62f26d2139f8ae8b409d0a67dc7f2c4a1286f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::state_desugar::try_rewrite_navstack: FunctionTooLong \u2014 perry_transform::state_desugar::try_rewrite_navstack runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/state_desugar.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"7640dd8deec17c8d82bb786baeb82544d6bc8b1a3c71a6b70b5cb50a554e301a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::collect_modules::reexport_prune::forwarding::normalize: FunctionTooLong \u2014 perry::commands::compile::collect_modules::reexport_prune::forwarding::normalize runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/collect_modules/reexport_prune/forwarding.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ed821b0d1f3dde22d0a4e5aee93bc76644d6c050caa2b1f124bc65864b4eb5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::targets::compile_for_ios_widget: FunctionTooLong \u2014 perry::commands::compile::targets::compile_for_ios_widget runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/targets.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3df3da0ec2cef8a4de3ad1a290bd08b8312049eac050bc0aee1e1c6b6bc9e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: emit/string_collection.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), about 100% of them inside a single declaration: WasmModuleEmitter (9-1051). The bar is 500 significant lines; this is 109 over it, 1.22\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/perry-codegen-wasm/src/emit/string_collection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7719f8d76792c6a0f0a16ec6c8ed971ce313373a4859866495e5da36bbc1b8d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/client_request_surface.rs: FileTooLong \u2014 608 significant 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 108 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/perry-ext-http/src/client_request_surface.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c744d9a76b0db5ee4a92f39620b81814ce6493e3cf7e9115a3902cb92c1f48d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/util_parse_args.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), declaring 34 free functions. 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/perry-runtime/src/util_parse_args.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"180f53929d9dedb1c18c45d0bfd1daf13e9c821b0b744ab38f0e8d2701fc0513"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr_call/local_array_methods.rs: FileTooLong \u2014 605 significant 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 105 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/perry-hir/src/lower/expr_call/local_array_methods.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c08ca5c03d42228d6b6791766d58edadd5576d9a93d3bb5c694ac295a179a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unroll/mod.rs: FileTooLong \u2014 605 significant 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 105 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/perry-transform/src/unroll/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58334d0ad423306786af93cc9f1563ab9676fc53659a6a4a403cad5b90e105b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::channel::try_match_channel_reduction: FunctionTooLong \u2014 perry_codegen::expr::channel::try_match_channel_reduction runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/channel.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ea571d08f1844264820b58da3b3f195794ff99e03143753b35eb0f2118b997"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::extern_func::pod_params::lower_manifest_pod_param: FunctionTooLong \u2014 perry_codegen::lower_call::extern_func::pod_params::lower_manifest_pod_param runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/extern_func/pod_params.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a441cd0c9fcf7716e325b6a670fe7431feef493d078d2001b36e7771781cd8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::js_transform::cross_module_natives::fix_cross_module_native_instances: FunctionTooLong \u2014 perry_hir::js_transform::cross_module_natives::fix_cross_module_native_instances runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/js_transform/cross_module_natives.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fec1dd44ff1d4f227f8552aadfebf7126e9495923b4e6123872d91aeddf12fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::iterator_helpers::dispatch_iterator_helper_method: FunctionTooLong \u2014 perry_runtime::iterator_helpers::dispatch_iterator_helper_method runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/iterator_helpers.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37a6232c5f66612bc99e5746d3866a0034093b20194ebf72aa1cc8dbfb30f45"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::turnloop_net::transport::dispatch_stream: FunctionTooLong \u2014 perry_runtime::turnloop_net::transport::dispatch_stream runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/turnloop_net/transport.rs"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"f431f4ccfd21f84ff740bef2e79aae5acbbfb287fa1ebc7bfc2bdcb7117ef6bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_stdlib::events::events_on::js_events_on: FunctionTooLong \u2014 perry_stdlib::events::events_on::js_events_on runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/events/events_on.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ceb85d33b3cec726151661043e8b2d2121296ef8eb194e28f53e35ecf9f4ccc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::i18n::replace_in_stmt: FunctionTooLong \u2014 perry_transform::i18n::replace_in_stmt runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/i18n.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"322d97e797831a478e16a9eef0bcb4fa6d91aed908cb42e1d3ccfa591e9500d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: regex/perex_api.rs: FileTooLong \u2014 604 significant 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 104 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/perry-runtime/src/regex/perex_api.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6389997957e1e1713e397ffc450142b357bda5d7041cb3360ddc30146f2f81"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_value/pod.rs: FileTooLong \u2014 603 significant 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 103 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/perry-codegen/src/native_value/pod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9244804bb494b257771aa1f4e212415b8c83feb41c27997e1c06f8c38336abd4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/state_desugar.rs: FileTooLong \u2014 603 significant 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 103 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/perry-transform/src/state_desugar.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"613e5f37688f01184a71f0b73b5ae3cdfabf31216856d55e52492d63142ff859"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 602 significant 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 42 free functions. The bar is 500 significant lines; this is 102 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/perry-ext-sharp/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e6b49ef320e26815b9c29cfb37cd1d77ddf246c5fd5790a2a21d14c2403ed0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FnCtx: ClassTooLong \u2014 481 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 33 methods, 2 blocks, lines 367-3237. The bar is 400 significant lines; this is 81 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/mod.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d71b5613019f2436b85c62575f9c1c2bf8fd76eefe054b33478ce5846fefc0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/wpfacts_access.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/perry-codegen/src/expr/wpfacts_access.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51532ed633eb855803c6f0e8dd241294434407050e1d324c4be5d4f6ca08e7b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/fallback_diag.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/perry-codegen/src/fallback_diag.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c616ce4a6607bdec81c9f96fb1fb76a6f704c1f2f151bd3302cb67069765d639"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcrypto/hmac.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/perry-stdlib/src/webcrypto/hmac.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fe7a00ea8315ea7818f221a3d74a2807941431bf07013382050236d05777b2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ReceiverDescriptorTable: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/receiver_regions.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"35778035a9efa2cfd3e1ad95c699fc092ee24d905eb93ebb41630340aa4d3632"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::byte_cell_support: TooManyFunctions \u2014 36 free functions. The bar is 30 free functions; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/byte_cell_support/mod.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e490219c063ddd448b12a6fa6aa7768d8c22b9816963ffc600c3a31c374749"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::object::this_binding: TooManyFunctions \u2014 36 free functions. The bar is 30 free functions; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/this_binding.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5881b4fac8f707c56815729d795f4446407fd5cde47693bf4df016ef4916737"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Env: TooManyFields \u2014 36 stored fields beside 15 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/perry-runtime/src/node_api_host/mod.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a420889f2c7b78fe4b094f5f39363e2c2d3be9b2929f00c8f62ecb594168d3c5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Module: TooManyFields \u2014 36 stored fields beside 2 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/perry-hir/src/ir/module.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"42aa0809766c84b38d8c3a250bc6ccec417052235d7fefff9c262a09e71bcaab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: setup/macos.rs: FileTooLong \u2014 600 significant 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 100 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/perry/src/commands/setup/macos.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f86670b46233d2a7f92ce0ba58fc5ad30f60bc8ac976a1cf98b516bceae63c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::anon_key_adds::anon_receiver_added_keys: FunctionTooLong \u2014 perry_codegen::collectors::anon_key_adds::anon_receiver_added_keys 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/perry-codegen/src/collectors/anon_key_adds.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eac846dde61fb77e9310839b3830299d1b08ed4e20c5f870cc813955fcba09f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::loops::iterator_record::lower: FunctionTooLong \u2014 perry_codegen::stmt::loops::iterator_record::lower 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/perry-codegen/src/stmt/loops/iterator_record.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2b2fcc3bcbf0949aa3964fcd9ca5aecc1d83c8b335e1ccb4dd9cd4f55b8a16"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::class_constructors::replay_class_object_constructor_impl: FunctionTooLong \u2014 perry_runtime::object::class_constructors::replay_class_object_constructor_impl 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/perry-runtime/src/object/class_constructors.rs"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d0a44f1cb34d4cfedac9bf4d4d69d9ddad5247dac78ba5850964f77d8484ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::bundle_apple::bundle_for_visionos: FunctionTooLong \u2014 perry::commands::compile::bundle_apple::bundle_for_visionos 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/perry/src/commands/compile/bundle_apple.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"166dda4cc91d16b802bdbe13562fbdb161c5e4beac5eb7530156e56f78e4ca01"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::program_facts::run: FunctionTooLong \u2014 perry::commands::compile::program_facts::run 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/perry/src/commands/compile/program_facts.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bbce7b1402154dd4bd22c32928b49b2118947ef97c24f403d55f03a70899ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collectors/ptr_shape_report.rs: FileTooLong \u2014 599 significant 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 99 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/perry-codegen/src/collectors/ptr_shape_report.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72539531f84a82aaacd28d53c4d4128827a3440399b6229eeba679ee24078998"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: opt_report/mod.rs: FileTooLong \u2014 599 significant 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 31 free functions. The bar is 500 significant lines; this is 99 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/perry-codegen/src/opt_report/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb72f85ff5f2af03d27d4b7c5b2294f12dce90e8281d2c594e80b700b2fdd2de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/types.rs: FileTooLong \u2014 599 significant 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 99 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/perry-container-compose/src/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2491ca57364bac392ad92420e5a9abf82220a7de3a94434cfe0d320510e8ee19"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/system.rs: FileTooLong \u2014 599 significant 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 99 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/perry-ui-android/src/system.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a1a29c12d9387e290c12f46a43d9f2a5dd4312f8d607fd2964d302f0ecbbd9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: class_registry/declarations.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), declaring 32 free functions. 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/perry-runtime/src/object/class_registry/declarations.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9222facc6c2c44017e59e028b0467707cd0fc9f151cecff56ff9082cfc513d0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: json/stringify_record_output.rs: FileTooLong \u2014 596 significant 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 96 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/perry-runtime/src/json/stringify_record_output.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"faca5704a15f2863ceebce05836332295fe944567f05251c0f964fcb2bd7153c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webcrypto/keys.rs: FileTooLong \u2014 596 significant 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 96 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/perry-stdlib/src/webcrypto/keys.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7103d98a3ac81856f5c5ed639468c7bb17c8e04ed71e3866e5c5517cb992e8e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collectors/ptr_shape_numeric.rs: FileTooLong \u2014 595 significant 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 95 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/perry-codegen/src/collectors/ptr_shape_numeric.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b3e7dc4dbb77f7732e137c90147543853f87d4cf9de512deb726fb2354b398"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen_glance::emit::emit_node: FunctionTooLong \u2014 perry_codegen_glance::emit::emit_node runs 119 significant 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 19 over it, 1.19\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/perry-codegen-glance/src/emit.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5cdb4240d9610dd83bf2d9924988933fb42d4594c4eb94c1599da519fed6920"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Flow.expression: MethodTooLong \u2014 expression runs 119 significant 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 19 over it, 1.19\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/perry-codegen/src/layout_desc/array_families.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"05897c7a71a23892f8d7edafe6e2823ccd401f8251ab100953e4cc2df6afa1bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::fs::filehandle::build_filehandle_object: FunctionTooLong \u2014 perry_runtime::fs::filehandle::build_filehandle_object runs 119 significant 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 19 over it, 1.19\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/perry-runtime/src/fs/filehandle.rs"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50832135663f6288840ded79f0ad8c216043e30fc893fa3a46be7984efb47c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_stdlib::tls::dispatch::dispatch_tls_property: FunctionTooLong \u2014 perry_stdlib::tls::dispatch::dispatch_tls_property runs 119 significant 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 19 over it, 1.19\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/perry-stdlib/src/tls/dispatch.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"6719eaaeb8977ef32a40657c664150e71f51dd99685ad62fc0cf43a62181a358"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_stdlib::worker_threads::worker_surface::worker_object: FunctionTooLong \u2014 perry_stdlib::worker_threads::worker_surface::worker_object runs 119 significant 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 19 over it, 1.19\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/perry-stdlib/src/worker_threads/worker_surface.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0fe756bdc66ff4d2e6cf78b283fd89d46e0e39e1f59b762131ff8782be495a7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassContract.join: MethodTooLong \u2014 join runs 119 significant 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 19 over it, 1.19\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/perry-wpfacts/src/units.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"a909dda714325181f55b2f58409d6313c0afa3ce80acb6368fc39cc9fedc228e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::resolve::native_library::parse_backend_configs: FunctionTooLong \u2014 perry::commands::compile::resolve::native_library::parse_backend_configs runs 119 significant 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 19 over it, 1.19\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/perry/src/commands/compile/resolve/native_library.rs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"e688b25ad5ac12c40cfdcc14fec590539feb1509f9b718f31b73b1036c864872"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::run::entry::resolve_target: FunctionTooLong \u2014 perry::commands::run::entry::resolve_target runs 119 significant 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 19 over it, 1.19\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/perry/src/commands/run/entry.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"54266662d8fa36d60e08bd463b4cf01c909be509161b73e84529a767ad995488"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/eh_walker_trace.rs: FileTooLong \u2014 594 significant 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 94 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/perry-runtime/src/eh_walker_trace.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1f0c2cbe5da72a9a25d2ef3eb88315b9d7d5c742fbf226541ee1cfa2e2ff55"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/native_module_registry.rs: FileTooLong \u2014 594 significant 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 56 free functions. The bar is 500 significant lines; this is 94 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/perry-runtime/src/object/native_module_registry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5355c08f813bc5eafbf7f44b0e79a9cfa291f48f3f2f1e5fc483d0076c25685b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/util_promisify.rs: FileTooLong \u2014 594 significant 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 94 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/perry-runtime/src/util_promisify.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1af04d0ddcabb600c34f817ac506d948b68033a2daef17a112db8e74e8dce23"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: emit/js_fallback.rs: FileTooLong \u2014 593 significant 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 93 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/perry-codegen-wasm/src/emit/js_fallback.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfbd5e8c174c93ea9874ff2c2314d2a1b598c101aa1fe93390df225c142d69f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: class_registry/construct.rs: FileTooLong \u2014 592 significant 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 92 over it, 1.18\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/perry-runtime/src/object/class_registry/construct.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6cf0b7ae5515cdcceadb99ba55e7e1070804a02cd7ad16914eca6b7c00a13a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: field_set_by_name/tail.rs: FileTooLong \u2014 592 significant 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 92 over it, 1.18\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/perry-runtime/src/object/field_set_by_name/tail.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"598735e0a360ffd9db54ff9e3596740ddc3ac82242e3770d86cce6f89b18059d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/layout_read.rs: FileTooLong \u2014 591 significant 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 91 over it, 1.18\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/perry-codegen/src/expr/layout_read.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ee46329f64540f127fdfec621daf22d27822f7fbcd676ca7bd318b0b6fef70"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tls.rs: FileTooLong \u2014 590 significant 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 90 over it, 1.18\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/perry-ext-net/src/tls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a7023e8efff09c372af27a8c75e57d5eba0777fe6844221ca7339a5bf1c37c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen_glance::emit_glue::emit_bridge: FunctionTooLong \u2014 perry_codegen_glance::emit_glue::emit_bridge runs 118 significant 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 18 over it, 1.18\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/perry-codegen-glance/src/emit_glue.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f105175a3b12bb34b9a1da02e4dbcd5de700454f60260d76ec8c0c6710119f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::object_ops::define_properties::js_object_set_prototype_of: FunctionTooLong \u2014 perry_runtime::object::object_ops::define_properties::js_object_set_prototype_of runs 118 significant 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 18 over it, 1.18\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/perry-runtime/src/object/object_ops/define_properties.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"69229e71887f6b89a62cacf88e3e531c9d928c2612d36360a17c4b7d8ab4debf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::property_ops::set::ordinary_set_with_receiver: FunctionTooLong \u2014 perry_runtime::object::property_ops::set::ordinary_set_with_receiver runs 118 significant 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 18 over it, 1.18\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/perry-runtime/src/object/property_ops/set.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fefbd08e020bde12c972ad4aaa8a2ac2efa6ce8fec30aac7a63ed880daf1e08"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::regex::perex_results::materialize: FunctionTooLong \u2014 perry_runtime::regex::perex_results::materialize runs 118 significant 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 18 over it, 1.18\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/perry-runtime/src/regex/perex_results.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6384d4d72145299ad337e1d51085a471ad07303987f8fd1496e4758b248547b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower_call/new_helpers.rs: FileTooLong \u2014 589 significant 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 89 over it, 1.18\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/perry-codegen/src/lower_call/new_helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31aeb4e4592e6969bc9a0354aaa110a3602007ebd8d64febb08a7a58eea154aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gc/census.rs: FileTooLong \u2014 589 significant 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 89 over it, 1.18\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/perry-runtime/src/gc/census.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49809226351ee6023347b0760223da45b249340c51dec4e8aed4c9267d2c4ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/table.rs: FileTooLong \u2014 589 significant 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 89 over it, 1.18\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/perry-ui-windows/src/widgets/table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9b433ca8b1612d17af42a2fb2dfb207697b2968b78debdd5b95ece3b824f36"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower/global_eval_hoist.rs: FileTooLong \u2014 587 significant 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 87 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/perry-hir/src/lower/global_eval_hoist.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a33e626c16fbf9d3a2cd0c13bda4ad5670f930f4e6f7779966fba1e33f89780"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: destructuring/pattern_binding.rs: FileTooLong \u2014 586 significant 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 86 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/perry-hir/src/destructuring/pattern_binding.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7855edbef3b651e823df2bf732d9704f1563e0f2821f7c9a0e8308c90b2b52"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: field_set_by_name/fast_paths.rs: FileTooLong \u2014 586 significant 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 86 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/perry-runtime/src/object/field_set_by_name/fast_paths.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e9fc924a95ac7edaed879f66f03e0e4e8e6f927c4f88fb4a71a88868c58658"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen_glance::emit::emit_config_activity: FunctionTooLong \u2014 perry_codegen_glance::emit::emit_config_activity 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/perry-codegen-glance/src/emit.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1657eaf9ce99e253df3ab1f783a5f9ee026a75adfca8a0d8a7e149b747b68ff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FuncEmitCtx.try_emit_expr_map_set: MethodTooLong \u2014 try_emit_expr_map_set 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/perry-codegen-wasm/src/emit/expr/map_set.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4706baad138aaa97297fad29785c48259cac7bef1e4d0b2746a7ed20974612"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::switch_stmt::lower_switch: FunctionTooLong \u2014 perry_codegen::stmt::switch_stmt::lower_switch 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/perry-codegen/src/stmt/switch_stmt.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d2b52b3ac6b1dc0a07d1ea16d19720e038ad7bc5b4834f569db6d17d989c9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::versioned_indexed_loop::match_candidate: FunctionTooLong \u2014 perry_codegen::stmt::versioned_indexed_loop::match_candidate 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/perry-codegen/src/stmt/versioned_indexed_loop.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"32077139d8f15b90ef69eeb0e7422810cb8142dc66a183f1c1894556a2df3572"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::stmt::emit_for_of_pattern_binding: FunctionTooLong \u2014 perry_hir::lower::stmt::emit_for_of_pattern_binding 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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a53c98c9f9dec3938201ab651aae75d1712e850a9b7c1fd6cad437f12a9286b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::json::replacer::stringify_object_with_replacer_pretty: FunctionTooLong \u2014 perry_runtime::json::replacer::stringify_object_with_replacer_pretty 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/perry-runtime/src/json/replacer.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"1423a11765bf90f5b6bc987c598dc743e0a8442e548b96dfe7c3bc52d5f2f8c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::node_stream_constructors::builders::init_transform_kind: FunctionTooLong \u2014 perry_runtime::node_stream_constructors::builders::init_transform_kind 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/perry-runtime/src/node_stream_constructors/builders.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"578f8119a732758cfc0dacbee37941c84c00cc90ec16fc917a86a9aebc458dbd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::native_call_method::collection_methods::dispatch_raw_pointer: FunctionTooLong \u2014 perry_runtime::object::native_call_method::collection_methods::dispatch_raw_pointer 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/perry-runtime/src/object/native_call_method/collection_methods.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7fc937dd5679633dbe3095f0e02c47154b4a0d75d9d73de6174ca4f19b7532"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ext_http::server::https_server: TooManyFunctions \u2014 35 free functions. The bar is 30 free functions; this is 5 over it, 1.17\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/perry-ext-http/src/server/https_server.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fad3d28f3fc699728d98308921f02e72c3116913ea2bd2cc121acb74a47d24"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ext_http::server::response_header_values: TooManyFunctions \u2014 35 free functions. The bar is 30 free functions; this is 5 over it, 1.17\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/perry-ext-http/src/server/response_header_values.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74a96e7ef8981468c80f6bba99edec5736949f0ec212ce8b3dcca6350712bcf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::dgram::net: TooManyFunctions \u2014 35 free functions. The bar is 30 free functions; this is 5 over it, 1.17\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/perry-runtime/src/dgram/net.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90e3ca6d5a76b2db0a355eeebec71181ed0216a0b359608b54aaee8a0ca094c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::wasi_net::transport: TooManyFunctions \u2014 35 free functions. The bar is 30 free functions; this is 5 over it, 1.17\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/perry-runtime/src/wasi_net/transport.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7d046aad0bea64290f9f78fb6c2fb271ca06b123c542eef6e54129f62932f7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_android::ffi::issue_553: TooManyFunctions \u2014 35 free functions. The bar is 30 free functions; this is 5 over it, 1.17\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/perry-ui-android/src/ffi/issue_553.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf774b2c2389e7e2ad26fc9d227bd9c173282754dd9c9014327d8a0db82db2b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_gtk4::ffi::chart_cal_table_tree_combo_picker: TooManyFunctions \u2014 35 free functions. The bar is 30 free functions; this is 5 over it, 1.17\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/perry-ui-gtk4/src/ffi/chart_cal_table_tree_combo_picker.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ba0bc06609a77931eaaf008ab9adbf5c810b49857de2be0eaf5ae2566c4cfe"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TcpSocket: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\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/perry-wasi/src/sockets/tcp.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d97c41d190ed45cf9c0cf123d746607978566127b52749c0628c179e6190ab3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/webview.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), declaring 32 free functions. 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/perry-ui-windows/src/widgets/webview.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e395d087c5401230fd5a4632395baa3e0a03c04faff91fd7c1179caabfabb725"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/gen_call.rs: FileTooLong \u2014 581 significant 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 94% of them inside a single declaration: Gen (8-780). The bar is 500 significant lines; this is 81 over it, 1.16\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/perry-wpfacts/src/gen_call.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd32d61c00164d7e4ccb658fbc5c6655787e53b41cdfe4e68cf7a87c0f30953"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ThisFlowAnalysis.expr_this_safe: MethodTooLong \u2014 expr_this_safe runs 116 significant 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 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/ptr_shape_this_flow.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef1530514e8e859dc8f4c11df5f3bc248bf713b237a98dcb9de5a4899a3a13f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::lower_compare_value: FunctionTooLong \u2014 perry_codegen::expr::lower_compare_value runs 116 significant 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 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/mod.rs"},"region":{"startLine":4237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85b63c7148ccbf4fdf94cf99fb6d232e565908d4945e62dbcdb202a8de559fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::layout_families::own_keys: FunctionTooLong \u2014 perry_codegen::layout_families::own_keys runs 116 significant 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 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/layout_families.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"45eb91f8d8443c8f16b6fa54222783dc5a067511e9e5cbebd11e9d042d88a8d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::stable_packed_accumulator::accumulator_rhs_is_numeric: FunctionTooLong \u2014 perry_codegen::stmt::stable_packed_accumulator::accumulator_rhs_is_numeric runs 116 significant 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 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/stable_packed_accumulator.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fe8d68eaed62c037ed8b7a04ad28f40bfbb64583f0ab64a52fcd8b6e37202f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower_decl::interface_decl::lower_interface_decl: FunctionTooLong \u2014 perry_hir::lower_decl::interface_decl::lower_interface_decl runs 116 significant 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 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_decl/interface_decl.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ea00ba9bed1e58d757e320e507d7daec875e5b24496aed37605a9a5cbfa446"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::component::asynchronous::submit_kind: FunctionTooLong \u2014 perry_runtime::component::asynchronous::submit_kind runs 116 significant 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 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/component/asynchronous.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9d70adbc9b7b03bf9099b308aecc1b9092cc6c140f0b2fa7dcef6f8be60a20"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::date::parse::parse_slash_date: FunctionTooLong \u2014 perry_runtime::date::parse::parse_slash_date runs 116 significant 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 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/date/parse.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdb13318cb03efdce49fa2286095a9c8b60531366f4f0dd27f0c1c896abd62b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::geisterhand_registry::perry_geisterhand_pump: FunctionTooLong \u2014 perry_runtime::geisterhand_registry::perry_geisterhand_pump runs 116 significant 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 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/geisterhand_registry.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"f064174dab42e9b4b0e73e0d28d8c9033082a0cf6dc69f8b917e6c746e7c8b7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::node_http_prototypes::message_init: FunctionTooLong \u2014 perry_runtime::object::node_http_prototypes::message_init runs 116 significant 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 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/node_http_prototypes.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d7682e3dda3a6e9523ae6b5dc50a2cc9d8837ef8a26f66a3058a339e4611a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::shapes::shape_descriptor_intern_with_special_mode: FunctionTooLong \u2014 perry_runtime::object::shapes::shape_descriptor_intern_with_special_mode runs 116 significant 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 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/shapes.rs"},"region":{"startLine":1938}}}],"partialFingerprints":{"codehealthFindingId/v1":"413b2fbba8442880d4586ee92e2f3e4089fab799ef5afcd3d4ed35b9fcc3f6cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::ohos_napi::napi_init: FunctionTooLong \u2014 perry_runtime::ohos_napi::napi_init runs 116 significant 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 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/ohos_napi.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"071714aad9cbca3fc0fdef79e25e17369f240728a33c8d894b7959954dabc665"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::i18n::apply_i18n: FunctionTooLong \u2014 perry_transform::i18n::apply_i18n runs 116 significant 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 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/i18n.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"df479006780f79f895e0c22bcea28e05d98679c41dc021e48ebc5664be80ec8e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::inline::closure_analysis::find_max_local_id: FunctionTooLong \u2014 perry_transform::inline::closure_analysis::find_max_local_id runs 116 significant 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 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/inline/closure_analysis.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7a40c3078fcbc5144693d3829a40f850ecc20bb89e25a9f60fca37a83745ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::collect_modules::feature_detect::module_uses_json_format: FunctionTooLong \u2014 perry::commands::compile::collect_modules::feature_detect::module_uses_json_format runs 116 significant 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 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/collect_modules/feature_detect.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"41016212ed4ebb35d9109ad0f2dbea6961c23ccf9f80d9419ae76d1d06480b8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: renderer.createNativeRenderer: FunctionTooLong \u2014 createNativeRenderer runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/perry-solid/src/renderer.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"70890f63fb9f16da8469dd90c0314c32f0f563bc308bf0ab481dee93cee68c4b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stmt/versioned_indexed_loop.rs: FileTooLong \u2014 577 significant 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 77 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/perry-codegen/src/stmt/versioned_indexed_loop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa826ec13b20a0fadbf0d09d0e09e178c27ac9b842aba177b984a630a259159"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: intl/duration_format.rs: FileTooLong \u2014 577 significant 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 77 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/perry-runtime/src/intl/duration_format.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6de3013387511d879b75f7271e8c1192e2a1063d9d2b2713c146c89197ad52c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/classes.rs: FileTooLong \u2014 576 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 49 free functions. The bar is 500 significant lines; this is 76 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/perry-ext-net/src/classes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a579c07543f7663857948d0362e81dc62f74e75b918e89311b0d6c31e3976a5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/collection_proto_thunks.rs: FileTooLong \u2014 576 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 76 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/perry-runtime/src/object/collection_proto_thunks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"029fe87ef7bcc568b602a61aa69660cd2fd7d7a73e827b973897cf5e52e53c24"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fetch/body_metadata.rs: FileTooLong \u2014 576 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 57 free functions. The bar is 500 significant lines; this is 76 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/perry-stdlib/src/fetch/body_metadata.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ed5bc6185d9b8cf437f0e9f3fdeeaf09e71a7f7f2758f31b2a2adde2f7656c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::integer_locals::collect_extra_integer_let_ids: FunctionTooLong \u2014 perry_codegen::collectors::integer_locals::collect_extra_integer_let_ids 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/perry-codegen/src/collectors/integer_locals.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"79fc2ea8f626f46a50bbb4876f3669bac9ecfd02db85e279fa4fc8afe2b9ae4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::wpfacts_access::prove: FunctionTooLong \u2014 perry_codegen::expr::wpfacts_access::prove 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/perry-codegen/src/expr/wpfacts_access.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"95351b5977dfcd3092b3670a6a2ff86d2286a73f5aba007b4b3f868437c79b74"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::console_promise::lower_split_method_call: FunctionTooLong \u2014 perry_codegen::lower_call::console_promise::lower_split_method_call 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/perry-codegen/src/lower_call/console_promise.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b0e4d15cdcb2bdb411d0d63b9553c0e6abcf522c68dbf0e5b464b80b90b97a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::analysis::builtins::intrinsic_static_function_member: FunctionTooLong \u2014 perry_hir::analysis::builtins::intrinsic_static_function_member 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/perry-hir/src/analysis/builtins.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"df081eb46e803025a385547a3b0acf20831014d805eb8ea2e9d5f809af744451"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::regex::perex_api::execute_rooted_output: FunctionTooLong \u2014 perry_runtime::regex::perex_api::execute_rooted_output 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/perry-runtime/src/regex/perex_api.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"511682b3d67c52abd2df47a3a85a7aaa8a52f403c578b9085e0e7421579deb36"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_stdlib::events::once_helpers::js_events_once: FunctionTooLong \u2014 perry_stdlib::events::once_helpers::js_events_once 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/perry-stdlib/src/events/once_helpers.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b54941ac12f7d16e6d949d3288d0d2cd0c9bf5c121e6406ab5da6c48729d03e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_wpfacts::decl_units::decl_units: FunctionTooLong \u2014 perry_wpfacts::decl_units::decl_units 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/perry-wpfacts/src/decl_units.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8eac240771b537a14bd644990ae36ff07f7970673ce29a90cb243b1b590db72"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::bootstrap::rerun_collect_with_class_field_types: FunctionTooLong \u2014 perry::commands::compile::bootstrap::rerun_collect_with_class_field_types 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/perry/src/commands/compile/bootstrap.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55a626b981694fa333fc30b7f0c07b6e618508701ff0abad144308b13cae276"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::widget_build::build_declared_widgets_android: FunctionTooLong \u2014 perry::commands::compile::widget_build::build_declared_widgets_android 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/perry/src/commands/compile/widget_build.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3cdaf28a2049572aa005249e8bb97ff6321b92a9487f73dcfed6b2f5ab2670"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: event_pump/agent_loop.rs: FileTooLong \u2014 573 significant 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 73 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/perry-runtime/src/event_pump/agent_loop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70df7f36d3a6fbf6d644d82a453a53056a20b1d94e0eb0fd23cd20854a509cd8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/check_npm_publish_freshness.py: FileTooLong \u2014 572 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 72 over it, 1.14\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":"scripts/check_npm_publish_freshness.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b15fd6241d3ed488228175329ee1e9b9e0a5180fb06a910b70315eef05e5e15"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_call_method/handle_methods.rs: FileTooLong \u2014 572 significant 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 72 over it, 1.14\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/perry-runtime/src/object/native_call_method/handle_methods.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"941e9f915f8dd17df206132742a1d59152c8a1fa204b42f297e833f659766a41"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: inline/closure_analysis.rs: FileTooLong \u2014 572 significant 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 72 over it, 1.14\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/perry-transform/src/inline/closure_analysis.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad462622cad734fc000183c61d731d467175e36abc89b55630a148fb802c4b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/node_repl.rs: FileTooLong \u2014 571 significant 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 62 free functions. The bar is 500 significant lines; this is 71 over it, 1.14\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/perry-runtime/src/node_repl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"551d63117cdad67df2497441ea46f9132e7a1cb3082de881c8c3ed113844a1d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ohos_napi.rs: FileTooLong \u2014 571 significant 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 71 over it, 1.14\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/perry-runtime/src/ohos_napi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8912b9b53a7fdf1bed416acd7a3250a4e5329e3cffd7457a8da1c1bfc1225cf7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: string/compare.rs: FileTooLong \u2014 571 significant 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 71 over it, 1.14\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/perry-runtime/src/string/compare.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd9018487b7fe2f4017f978f41e768cf3843f275c6636dce7bef4cf96d4c8d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::call_entry::emit: FunctionTooLong \u2014 perry_codegen::call_entry::emit 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/perry-codegen/src/call_entry.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"811d40421af99b99547473b9d9b77ea7ee5016dc71a9feaa8fec3a4cfba6c577"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::linker::compile_input_to_object_in_with_retention: FunctionTooLong \u2014 perry_codegen::linker::compile_input_to_object_in_with_retention 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/perry-codegen/src/linker.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d13ca02efee13b666bafeec755fc50b19a1445ce4e14427e08af2cda8883b83"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::root_reload::facts_of: FunctionTooLong \u2014 perry_codegen::root_reload::facts_of 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/perry-codegen/src/root_reload.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e1fcde19e64fa038a9a4f57c8afc96860d5087273ba9049e70a16cbf4044f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::loops::emit_packed_f64_range_guards: FunctionTooLong \u2014 perry_codegen::stmt::loops::emit_packed_f64_range_guards 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":3346}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23e526571a5ecf0fc3412b37039b580185214e1aba6ce1d1d1b0f484b28a84c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ext_http::pending_dispatch::js_http_process_pending: FunctionTooLong \u2014 perry_ext_http::pending_dispatch::js_http_process_pending 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/perry-ext-http/src/pending_dispatch.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ccf8c6d08be50dcb90f6fb38826282bcc313d03c5a052c817e068c8dc7fe2ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::builtins::console::try_console_instance_method_dispatch: FunctionTooLong \u2014 perry_runtime::builtins::console::try_console_instance_method_dispatch 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/perry-runtime/src/builtins/console.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdddd2ce20a5717d2a97fa20c272253d26ec4f089fd131a128fc90b4bb2e41ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::delete_rest::try_delete_stable_sso: FunctionTooLong \u2014 perry_runtime::object::delete_rest::try_delete_stable_sso 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/perry-runtime/src/object/delete_rest.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"812f3ad51dc8850eb84e0acc6d7efe0dd671693d44c47301795b33faf0f8f910"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::regex::perex_split::regexp: FunctionTooLong \u2014 perry_runtime::regex::perex_split::regexp 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/perry-runtime/src/regex/perex_split.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"3820954d030c06e91f9ae788c69f2ba0305e9da1277adce8f2dce0b4fd02c731"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_windows::layout::layout_stack: FunctionTooLong \u2014 perry_ui_windows::layout::layout_stack 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/perry-ui-windows/src/layout.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f43c3f799df3a888c8cad67dc075b85dfefd1a7bb4a961224e2b45db3203c7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Graph.value: MethodTooLong \u2014 value 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/perry-wit/src/canonical.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"935e13b64908bbf4e9a701becdfab21c22de88dd2adbcfb2a26c8c4d2db6325b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::run::run: FunctionTooLong \u2014 perry::commands::run::run 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/perry/src/commands/run/mod.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"092da03d8c510e159fa4f8795cbf07015d87bebbb0ffae571ae3f8efb149473a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/canvas.rs: FileTooLong \u2014 569 significant 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 69 over it, 1.14\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/perry-ui-ios/src/widgets/canvas.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d764875d488236019357ddf45e3625033dac92544cf8703397faedf4c4a3bbe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_value/materialize.rs: FileTooLong \u2014 568 significant 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 68 over it, 1.14\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/perry-codegen/src/native_value/materialize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db40e0597084c2831b2972c17cc8ed46506f327e56921e2a09fa00f646a0879"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/payload_server.rs: FileTooLong \u2014 568 significant 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 68 over it, 1.14\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/perry-ext-net/src/payload_server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d329199c349728365742267d6f792f4d2ef399cf63ef613a1976715434abc846"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/builtin_proto.rs: FileTooLong \u2014 568 significant 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 68 over it, 1.14\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/perry-runtime/src/object/builtin_proto.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f0362eb3e21b8fcc8367d1fac0355ad1e1e5369844b9915b5666bc7d43e9da"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: LlFunction: TooManyFields \u2014 34 stored fields beside 65 methods. The bar is 30 stored fields; this is 4 over it, 1.13\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/perry-codegen/src/function.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d1ebd710e16e42863d223c2885ffb196cbc597ffaa6b8b636f004a419d9267"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::date_hook_slots: TooManyFunctions \u2014 34 free functions. The bar is 30 free functions; this is 4 over it, 1.13\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/perry-runtime/src/date_hook_slots.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ebd49bf3c1f7f099effb7a16b5897e3ee12e1b994c78ffc5ece871d3056e5c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::native_abi: TooManyFunctions \u2014 34 free functions. The bar is 30 free functions; this is 4 over it, 1.13\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/perry-runtime/src/native_abi.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e986a4b40e99839589b4976e6226ff935ffb7be9fc35472db499b128e05567"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::object::global_this::typed_array: TooManyFunctions \u2014 34 free functions. The bar is 30 free functions; this is 4 over it, 1.13\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/perry-runtime/src/object/global_this/typed_array.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13e90085a35b153b7b0081e947ebca7de77d99c6f5b7280d0787f7b8df7054d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::process::ipc: TooManyFunctions \u2014 34 free functions. The bar is 30 free functions; this is 4 over it, 1.13\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/perry-runtime/src/process/ipc.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe3eac73c1644f47bbdd5f973082d3bd2bb0597ba5568f4da45f684c9ea3b1e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AgentTimers: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\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/perry-runtime/src/timer/store.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ffdf4a8c94062a5f8ab55f27aa7663496a3c6b2c6f3e0c91d01904218df1f3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_ios::ffi::dialogs_lifecycle: TooManyFunctions \u2014 34 free functions. The bar is 30 free functions; this is 4 over it, 1.13\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/perry-ui-ios/src/ffi/dialogs_lifecycle.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"20295ebfe99b725a70959909cbe561c95453fa8b1cdc6daeb8d92fa72a0c23ab"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_macos::lib_ffi::style_and_canvas: TooManyFunctions \u2014 34 free functions. The bar is 30 free functions; this is 4 over it, 1.13\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/perry-ui-macos/src/lib_ffi/style_and_canvas.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c1d07df5fac8051972c38b0764c52e7db57aeb161118e65abfed3f0d162af8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ClientRequestHandle: TooManyFields \u2014 34 stored fields. The bar is 30 stored fields; this is 4 over it, 1.13\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/perry-ext-http/src/lib.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a8fc3e8f948b68771409f052a69c8be57dd0f0e22a5ef4446140b6874a5e6e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: persistent/poll.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/perry-runtime/src/component/persistent/poll.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be78c5a7c1467361c3f218d654cab6b6c3949678c15e7d1a61b1d819605c1acd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: value/dynamic_arith.rs: FileTooLong \u2014 565 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 40 free functions. The bar is 500 significant lines; this is 65 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/value/dynamic_arith.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8b6e2bf7d348d1a08ffc8985f40cbdfcf5e96ad82bd4832856c77686fce967"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/mod.rs: FileTooLong \u2014 565 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 39 free functions. The bar is 500 significant lines; this is 65 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-gtk4/src/widgets/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9549a546d26775b6ca3b37f3e6c42f66070ea3db869382b74764a046a1a93cbe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::ta_element_read::emit_get: FunctionTooLong \u2014 perry_codegen::expr::ta_element_read::emit_get 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/perry-codegen/src/expr/ta_element_read.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"51726d14d9214e9a46f464547c7372b9e51da35e3a6f519f3e91ea955e591749"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::linker::compile_ll_inprocess_in: FunctionTooLong \u2014 perry_codegen::linker::compile_ll_inprocess_in 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/perry-codegen/src/linker.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb84a046c65bb2b23eefc93675b818b5edcd7593807c1696ec6c790dec91c04"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_diagnostics::compat_report::redact_snippet: FunctionTooLong \u2014 perry_diagnostics::compat_report::redact_snippet 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/perry-diagnostics/src/compat_report.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"a922c7bb978627f8651e1177f4836aff213ea9bd2fb56f696a2f9fc82dcb4c1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_call::native_module::buffer_statics::try_buffer_uint8array_statics: FunctionTooLong \u2014 perry_hir::lower::expr_call::native_module::buffer_statics::try_buffer_uint8array_statics 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/perry-hir/src/lower/expr_call/native_module/buffer_statics.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"270c151ab176480ceadd8636928b16d520bc9461659a2ac913fce51999a1f12a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower_decl::private_members::lower_private_method_in_scope: FunctionTooLong \u2014 perry_hir::lower_decl::private_members::lower_private_method_in_scope 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/perry-hir/src/lower_decl/private_members.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2a2d7dba9d2aa236d21e7777db0264fdfe6643d9eb1a624770897e39fffb7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::builtins::globals::drain_queued_microtasks_count: FunctionTooLong \u2014 perry_runtime::builtins::globals::drain_queued_microtasks_count 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/perry-runtime/src/builtins/globals.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bae8d9726a21bc90004da6e20822be9dab9e40c76058d042279b606716dab8e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::json::replacer::stringify_value_pretty: FunctionTooLong \u2014 perry_runtime::json::replacer::stringify_value_pretty 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/perry-runtime/src/json/replacer.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd218b8ebec670014cc26869d78b23d5b84c85993c14b5f9d79d77b7ffc51d83"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::node_api_host::properties::napi_get_all_property_names: FunctionTooLong \u2014 perry_runtime::node_api_host::properties::napi_get_all_property_names 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/perry-runtime/src/node_api_host/properties.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e324888ad03c0177e0129701e601ec81cc4a602de541b9b252385abe57fe761"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_stdlib::turnloop_client::exchange::start_locked: FunctionTooLong \u2014 perry_stdlib::turnloop_client::exchange::start_locked 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/perry-stdlib/src/turnloop_client/exchange.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1cbf1e9ebdbd0da3eb1c1cd4ac80c1a61b7389d9ce31d6b1f17d7e4ad3ef89"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Gen.register_all: MethodTooLong \u2014 register_all 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/perry-wpfacts/src/gen.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0436d3683adb08fd4f622a815906bc7a0d1bbac3bfbb0b00c2af666aba47f68"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::size_report::render_markdown: FunctionTooLong \u2014 perry::commands::compile::size_report::render_markdown 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/perry/src/commands/compile/size_report.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"f962ee2bda81637e82a17f0a590d275b659f9f523d3b5c1e59f35dd7736a00dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node_module/source_map.rs: FileTooLong \u2014 564 significant 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 64 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/perry-runtime/src/process/node_module/source_map.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"986adb52bcffaa2bfaf362db0ccdf1072cb8d674149f4c5e8fb2c897c3dd5262"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/canvas.rs: FileTooLong \u2014 564 significant 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 64 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/perry-ui-macos/src/widgets/canvas.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3096f1906e7279b5dd55afe77aa6b25034075634e024d9c2cb2e516e08b70d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compile/types.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). 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/perry/src/commands/compile/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c521bcd3382a278d28ec5f00e0b1aa7ba60a4baa810231e58471156f26bf52a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/index.ts: FileTooLong \u2014 563 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"upstream/actions/jdx/mr-boxington-action/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc31339499d6f22036c8e521d3989b578bc1785fdeb3cddcf51071f33b7d5295"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/conn.rs: FileTooLong \u2014 562 significant 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 62 over it, 1.12\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/perry-http-server/src/conn.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0dccfa5b38155365806b315a65ab9f7ef9d6280a93119feb8df8e1e4b2c62c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stmt/mod.rs: FileTooLong \u2014 561 significant 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 61 over it, 1.12\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/perry-codegen/src/stmt/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"503a494c903f274a25e325fbd3985bf45594fcbd927fa4a575ff6101eb96f772"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object_ops/descriptor_helpers.rs: FileTooLong \u2014 560 significant 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 60 over it, 1.12\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/perry-runtime/src/object/object_ops/descriptor_helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4914de883733cf9d8427c4321d6f1a46a62f6d900d2391c4e49777e6204ef8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: solve/lookup.rs: FileTooLong \u2014 560 significant 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 100% of them inside a single declaration: Model (6-902). The bar is 500 significant lines; this is 60 over it, 1.12\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/perry-wpfacts/src/solve/lookup.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"249eef2681d653b4cb9e1e2d92506bc9b98a9955de3c91b0e65463f3b7314391"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::array_record_stack::lower: FunctionTooLong \u2014 perry_codegen::array_record_stack::lower runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/array_record_stack.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c49c4b3d9bceac326db24efc66e332504715ef3c2251361d0a4d289b883d58e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::layout_families::late::module_groups: FunctionTooLong \u2014 perry_codegen::layout_families::late::module_groups runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/layout_families/late.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51f0a82b916aca2c2a8e8a0e2135aec15dc6ad1c2bec130948b374e46e96d9b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::property_get::imported_object::try_lower_imported_object_method_call: FunctionTooLong \u2014 perry_codegen::lower_call::property_get::imported_object::try_lower_imported_object_method_call runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/property_get/imported_object.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5974eb60fa8ad15f8b3706f517103d1a6609a2063a2da577719b8108981f6e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_object::lower_accessor_prop: FunctionTooLong \u2014 perry_hir::lower::expr_object::lower_accessor_prop runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1b2c018f469b7cb883c8c7f9b9344acbab29de63872a7c89c0d58a71feef6c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::field_set_by_name::fast_paths::existing_own_data_overwrite: FunctionTooLong \u2014 perry_runtime::object::field_set_by_name::fast_paths::existing_own_data_overwrite runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/field_set_by_name/fast_paths.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8c11ce772c61d8579b74e2918048ee1b0560c9741e9b4d27b03c7a268b158e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::object_ops::define_symbol_property::define_symbol_property: FunctionTooLong \u2014 perry_runtime::object::object_ops::define_symbol_property::define_symbol_property runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/object_ops/define_symbol_property.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f46d4884a1ba526e1c80f5e1dc5c2c2db6dc5b0298b64e380a6df124045ceff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::pty::reactor::pty_reactor_pump_inner: FunctionTooLong \u2014 perry_runtime::pty::reactor::pty_reactor_pump_inner runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/pty/reactor.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"e106e9aa54227e960dc24666f2f3a1567df0f8fec0f02bc7be3aa28ccc6597d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::aggregate_scalar::run: FunctionTooLong \u2014 perry_transform::aggregate_scalar::run runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/aggregate_scalar.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5154f5a3c4657e396a62d502d7b510a3d10ead6adc6450599136660159c5674"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_android::widgets::add_child: FunctionTooLong \u2014 perry_ui_android::widgets::add_child runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-android/src/widgets/mod.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c86c2a8ca9f29f3f1f6a746125f3f240a16f0248310d7f144dfbe010d35dc98"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_macos::app::setup_menu_bar: FunctionTooLong \u2014 perry_ui_macos::app::setup_menu_bar runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-macos/src/app.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2448dc8451ab16f807fd6f318e3629b8e0cde172c645618417e3ee72c3533d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::publish::tarball::create_project_tarball_with_includes: FunctionTooLong \u2014 perry::commands::publish::tarball::create_project_tarball_with_includes runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/publish/tarball.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45cbe745c980fb073ce448357adcfa6dc25aef037f1c24fde769703efb8f571"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: array/join.rs: FileTooLong \u2014 559 significant 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 59 over it, 1.12\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/perry-runtime/src/array/join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb6d58756d0eeef63ed99b4d20e6e5279d403342ae76a60790cc95a24f69204"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: client_turnloop/protocol.rs: FileTooLong \u2014 558 significant 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 31 free functions. The bar is 500 significant lines; this is 58 over it, 1.12\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/perry-ext-http/src/client_turnloop/protocol.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"008e07bd692839f51a41261829301f11979df48d88aa6ad3c198233d48138375"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dgram.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 61 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/perry-runtime/src/dgram.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee8b9311cc3adfc724fad0a2d131f302c811ae92d51f70c5a4cd9ee4f2ad6ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 556 significant 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 56 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/perry-abi/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d641faf4c090e71ee9d05946de6f53a2b2eb3d48b4246bf22044e287571816"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collectors/sealed_buffers.rs: FileTooLong \u2014 556 significant 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 56 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/perry-codegen/src/collectors/sealed_buffers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc090fcf52103c5eba714f4a8ddcdf28f619f8ec8f885ccec13f19b05e45fd4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::mutation::expr_has_mutation: FunctionTooLong \u2014 perry_codegen::collectors::mutation::expr_has_mutation 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/perry-codegen/src/collectors/mutation.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"661d5c3f2aca37ff26bfe86149f3a03a56fa1138e412125aecf58391b318882a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UseWalk.walk_expr: MethodTooLong \u2014 walk_expr 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/perry-codegen/src/collectors/ptr_numarray.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a40bd961730c847ddf49e81e266389c4901a0634787218551a17532a54d78b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::static_field_meta::lower_computed_member_registration: FunctionTooLong \u2014 perry_codegen::expr::static_field_meta::lower_computed_member_registration 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/perry-codegen/src/expr/static_field_meta.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27bc622b274e56bf070e0f28dcd5c34e6c1797d7ba1a195352f8433ceae176f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_gc_effects::archive::build_graph: FunctionTooLong \u2014 perry_gc_effects::archive::build_graph 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/perry-gc-effects/src/archive.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"206e2cac2a0bec06d7f7dfa0df82acd27f0ede7130b6cf981391cce9ca1a7de2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::js_transform::imports::transform_js_imports: FunctionTooLong \u2014 perry_hir::js_transform::imports::transform_js_imports 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/perry-hir/src/js_transform/imports.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2adb90af87fbba61f0bfd600515419b41c764798cb841b679d7efa8c61d7e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::lower_module_fn::reflect_script_var_initializers: FunctionTooLong \u2014 perry_hir::lower::lower_module_fn::reflect_script_var_initializers 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/perry-hir/src/lower/lower_module_fn.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c4a7fd82e7269783a5c08a1ce5ca285df2f881534fa46937ca54c26828049a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::arena::reset::arena_reset_empty_blocks: FunctionTooLong \u2014 perry_runtime::arena::reset::arena_reset_empty_blocks 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/perry-runtime/src/arena/reset.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"12455d40a3a5b5d506867d062e9071ba93cda29278f7e88cf41e3e0eb866b4d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::bun_compat::cli_utils::yaml_add_js_value: FunctionTooLong \u2014 perry_runtime::bun_compat::cli_utils::yaml_add_js_value 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/perry-runtime/src/bun_compat/cli_utils.rs"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7d60ed0836def7ce61b723d763f9ebb92915dbd01faf120eade0bd02067dba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::bun_ffi::dlopen::node_dlopen_value: FunctionTooLong \u2014 perry_runtime::bun_ffi::dlopen::node_dlopen_value 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/perry-runtime/src/bun_ffi/dlopen.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f508a2f3d701779c4df3d1b1c439403d78bfaaa3294d9fa367cc5f4ad63011"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GcCycleState.step_atomic_finalize_current_subphase: MethodTooLong \u2014 step_atomic_finalize_current_subphase 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/perry-runtime/src/gc/cycle.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc583a02147d9bc272fc324b9ccd778bfd8267debe35b3cfadb498a765f681d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::class_registry::decl_prototype_birth::decl_prototype_born_final: FunctionTooLong \u2014 perry_runtime::object::class_registry::decl_prototype_birth::decl_prototype_born_final 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/perry-runtime/src/object/class_registry/decl_prototype_birth.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19d0185ecec1e1bfb53ebaaf92ad699a4169820c65bdbedc081cd5419017c7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::prototype_chain::object_set_static_prototype_impl_with: FunctionTooLong \u2014 perry_runtime::object::prototype_chain::object_set_static_prototype_impl_with 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/perry-runtime/src/object/prototype_chain.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9f1a568348757501f2c915bba616e2e9bbc8beae0d323fbee6857e941eec41"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::generator::private_frame::closed_effects: FunctionTooLong \u2014 perry_transform::generator::private_frame::closed_effects 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/perry-transform/src/generator/private_frame.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8af6f9adfa1c1ff45a3db29f2c157e43fecf7fb1ba832874a5de58a9e73dc6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::resolve::native_library::parse_target_native_config: FunctionTooLong \u2014 perry::commands::compile::resolve::native_library::parse_target_native_config 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/perry/src/commands/compile/resolve/native_library.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e9f0ad8309e97feac7f9922b6bb8a5c486faf5efffd2708cc553a262bf346e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::strip_dedup::strip_duplicate_objects_from_well_known_lib: FunctionTooLong \u2014 perry::commands::compile::strip_dedup::strip_duplicate_objects_from_well_known_lib 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/perry/src/commands/compile/strip_dedup.rs"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"58307cfd240e39df2975c185cc26d1eea25135abd0fec5efb515d22f9935ff2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: turnloop_h2/stream.rs: FileTooLong \u2014 554 significant 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 31 free functions. The bar is 500 significant lines; this is 54 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/perry-ext-http/src/server/turnloop_h2/stream.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f73e03d49bd483d55acb2f13457e0b8a3486cd9862413776817c72e10b2f7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: intl/number_format_digits.rs: FileTooLong \u2014 554 significant 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 54 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/perry-runtime/src/intl/number_format_digits.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b613a556428d52219ca531e31ebb297747fe0f3916c7ec0ed8d56ff3aeffe6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collectors/escape_arrays.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/perry-codegen/src/collectors/escape_arrays.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d4b8217f99020446dea18560d7046c46ea0fa7c1f1c101fcd4c2c1c370ce57"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: instanceof/static_dispatch.rs: FileTooLong \u2014 552 significant 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 52 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/perry-runtime/src/object/instanceof/static_dispatch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96b11f9d69476e8365d01e6ac39f78419431b1f7eb228c76ddab65d50c69c1f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compile/build_cache.rs: FileTooLong \u2014 552 significant 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 52 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/perry/src/commands/compile/build_cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a76b5e5de356f085b5b120f175766eecf6ba6055d678b656edfc572b537ec6f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/node_core_subset.py: FileTooLong \u2014 551 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 51 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":"scripts/node_core_subset.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85eab4ea24e0fbf679b164bc9db0e2ddf6bc30b49f0bf2d00ba5f4d5b60b3b66"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/string_decoder.rs: FileTooLong \u2014 551 significant 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 47 free functions. The bar is 500 significant lines; this is 51 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/perry-stdlib/src/string_decoder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aadf73607ec9293c6372d2ceed7a69d2d739a2ef18f3616722391f131de5364b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: worker_threads/worker_surface.rs: FileTooLong \u2014 551 significant 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 51 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/perry-stdlib/src/worker_threads/worker_surface.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca38ab3a92668ef641684b954495bf7089c51c24e28fc97cd97eb65f1dd30de9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FnCtx: TooManyMethods \u2014 33 methods, declared across 4 files: expr/mod.rs (23), expr/record_value.rs (8), src/array_storage.rs (1), expr/toint32.rs (1). The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/mod.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04e2273ba1b0799d3f4f2350311fddcafd89fa34e52814a6835d12b6a953923"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::box: 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/perry-runtime/src/box.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09dccf5f8e3169a36b4429250f37ceb5ba94884fb518811427b13d8d4053204"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::dgram::ffi: 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/perry-runtime/src/dgram/ffi.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"46367bcfa75ae58e256082c95da4f35a737fcf7cf7225442fd27292e387c8ae3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::exception: 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/perry-runtime/src/exception.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19c669c4a684949054139aff0776eaa85ed9d6586043500299dbfe6029fa107"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::object::native_module::constructor_shapes: 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/perry-runtime/src/object/native_module/constructor_shapes.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fe2e0c72ed4585830db34a764ff7459fd284245640e250b523810dfd274035"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::string::char_ops: 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/perry-runtime/src/string/char_ops.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaac2e911215377227550c0d262f864c9e564f5d450c31e4f96eccc06eda3f57"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Writer: TooManyMethods \u2014 33 methods. The bar is 30 methods; 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/perry-runtime/src/thread/clone_write.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b03d6711d18fca34c43d3a29c0620c2cb988ed53e44d4aec2ee942b2d7a9a3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_stdlib::sqlite::bind: 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/perry-stdlib/src/sqlite/bind.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e72239008ce72335692dd3b32adbea426eab3f60dcc75f48d4f432cefc0a96"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_ios::ffi::comms: 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/perry-ui-ios/src/ffi/comms.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcde3ab94b27fe0f14feee3aa7feef8b681ec020190c911226202cfd241d1dcc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: UseWalk: ClassTooLong \u2014 440 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 13 methods, 2 blocks, lines 1017-1744. The bar is 400 significant lines; this is 40 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/perry-codegen/src/collectors/ptr_shape.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e19e880bb27583c497c042d1f132c5c505286f7955a75fdbab74c5664e380fe"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: StreamState: TooManyFields \u2014 33 stored fields beside 1 method. The bar is 30 stored fields; this is 3 over it, 1.10\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/perry-runtime/src/fs/stream.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6cd7d9d83966afd837a321176589f8ed9267899f11d5c314605bc0e254f4773"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: monomorph/update_call_sites.rs: FileTooLong \u2014 550 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 50 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/monomorph/update_call_sites.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1ec0196ed49aae979894de152ac839701df444413f686854a43b59b11a5313"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen_arkts::widgets::text::emit_style_modifiers: FunctionTooLong \u2014 perry_codegen_arkts::widgets::text::emit_style_modifiers 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/perry-codegen-arkts/src/widgets/text.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b497c1a30228ba778dfb445ff7aecdd70799ba7b3373c8bb0130b66bdb6e7cb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Env.kind: MethodTooLong \u2014 kind 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/perry-codegen/src/collectors/typed_locals.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"63862bf4f293e275933b4023f3d969fd19b0d21d22deb9ed112bd54a27b6048d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::loops::packed_f64_range_loop_pure_expr_collect: FunctionTooLong \u2014 perry_codegen::stmt::loops::packed_f64_range_loop_pure_expr_collect 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":3121}}}],"partialFingerprints":{"codehealthFindingId/v1":"711e8db65f61b1275656285a9106d88a3ad6268a521f7833a859880b3801724a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::component::callback::invoke_for: FunctionTooLong \u2014 perry_runtime::component::callback::invoke_for 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/perry-runtime/src/component/callback.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6f0d3451c92df0de81d91e23516b1988cfe6f51035e96954140e6b183c6db1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::component::http::pump::step: FunctionTooLong \u2014 perry_runtime::component::http::pump::step 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/perry-runtime/src/component/http/pump.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"b295c183f2dd9d77feb79adebc36b0886889f0a668e79bdd7db6e58c6660d264"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::field_get_set::entries_shape::js_object_entries_shape: FunctionTooLong \u2014 perry_runtime::object::field_get_set::entries_shape::js_object_entries_shape 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/perry-runtime/src/object/field_get_set/entries_shape.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ae842762187368e96a136a0dfdb6561fba68498d0cd3620edfc35d4330658b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::setup::macos::export_cert_from_keychain: FunctionTooLong \u2014 perry::commands::setup::macos::export_cert_from_keychain 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/perry/src/commands/setup/macos.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"755bda03ff4d184322d2dfa117d7c415c74ac7dadeaf3276e41cd27ced788d29"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: NativeRepRecord: TooManyFields \u2014 33 stored fields. The bar is 30 stored fields; this is 3 over it, 1.10\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/perry-codegen/src/native_value/artifact.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f746bc667658f575609c88efc7180579ce6de56e67fa0ad9ceb552698e583b9a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: H2Conn: TooManyFields \u2014 33 stored fields. The bar is 30 stored fields; this is 3 over it, 1.10\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/perry-ext-http/src/server/turnloop_h2/conn.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"914a6fb40c36db7e3c1bfb82fa164a6f8e21c8a5e8ae75ce6765909cd002d1bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: type_analysis/strings.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/perry-codegen/src/type_analysis/strings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd0419695141d82e798505c6b4edf480a0905747de47718f2eb1b0fba26e49b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ArrayFactCollector: ClassTooLong \u2014 439 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 17 methods, 2 blocks, lines 1362-2009. The bar is 400 significant lines; this is 39 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/perry-codegen/src/collectors/hir_facts.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"29cfe648077e67d269f18505d504f28ccd4651edaef8941ed0669c8dd8a563ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/structure.rs: FileTooLong \u2014 548 significant 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 48 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/perry-codegen-arkts/src/widgets/structure.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b620fdae3624682c4f968c5a80d1b13a4f7956d5c76e1c84d0d89f331d68e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cluster_sched.rs: FileTooLong \u2014 548 significant 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 48 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/perry-runtime/src/cluster_sched.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80427932dfd96c77456adc12752971c2760729cea846a84d3c25e6559781bc91"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/object_ops_frozen.rs: FileTooLong \u2014 548 significant 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 48 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/perry-runtime/src/object/object_ops_frozen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea332ca9a885fab3558cb881ab8071ea60f505bc3fe259c1d253c3f20d9931bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/gate_failure_watch.py: FileTooLong \u2014 546 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 46 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gate_failure_watch.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5187b9190d69b9448928124a9fbcada1d1cb1aa41cf0341ac6aa4876d56534ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compiler_output_harness/capture.py: FileTooLong \u2014 545 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 45 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/compiler_output_harness/capture.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7131546328c47b9a519d2547ae8d7008fbbcfbe23b1e02fc77ee4aea57c9c20"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: calls/crypto_misc.rs: FileTooLong \u2014 545 significant 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 45 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/calls/crypto_misc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"567ccd7753db06b6b19b3a39f738defe114babd947154f4248bd6e706c7b5e80"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/instructions.rs: FileTooLong \u2014 545 significant 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 45 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-gc-effects/src/instructions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"947692d50f447a9a45b2c72ec79d4b9522f568d25c6112105454094075d82927"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: guest/frame.rs: FileTooLong \u2014 545 significant 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 45 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/component/guest/frame.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a4ee81a96e5c291c8164f27f620817495850332a58835b8211dd143a8cf09b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen_arkts::conditions::evaluate_condition: FunctionTooLong \u2014 perry_codegen_arkts::conditions::evaluate_condition 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/perry-codegen-arkts/src/conditions.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a10299470eff98293bbd9a23df5bf8607831ccb42e4b3e00b6cd59f3028456"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::native_value::materialize::materialize_js_value: FunctionTooLong \u2014 perry_codegen::native_value::materialize::materialize_js_value 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/perry-codegen/src/native_value/materialize.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc29834317e4b45af55d5e8e987485564da026b2f053d0607cc4a33493a8616"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::shared_mutable_capture::rewrite_expr: FunctionTooLong \u2014 perry_hir::lower::shared_mutable_capture::rewrite_expr 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/perry-hir/src/lower/shared_mutable_capture.rs"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8add3b20976c7849a8d113a1dc43c74998cb2352015a40d70b7d11cdf69bfde"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower_decl::class_members::lower_setter_method_in_scope: FunctionTooLong \u2014 perry_hir::lower_decl::class_members::lower_setter_method_in_scope 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/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3bf68229df7b8aabdca3dc72b621fa3594228907765b6291023eb1902075ebc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::json::replacer::property_list::stringify_object_with_array_replacer: FunctionTooLong \u2014 perry_runtime::json::replacer::property_list::stringify_object_with_array_replacer 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/perry-runtime/src/json/replacer/property_list.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0dbe0fb28e4e6ee46188158c726578c5a2972a928ed50cf2f18b773efb9364"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::class_registry::parent_static::js_register_class_computed_method: FunctionTooLong \u2014 perry_runtime::object::class_registry::parent_static::js_register_class_computed_method 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/perry-runtime/src/object/class_registry/parent_static.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"141d87a1c70310ac61e68408b6774160f1a1c489277de49225fbef9236ff2222"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::native_module::scan_native_callable_export_roots_mut: FunctionTooLong \u2014 perry_runtime::object::native_module::scan_native_callable_export_roots_mut 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/perry-runtime/src/object/native_module.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6dd7e624df4c2e54b676e0090d1fceed828fea3d246b03097f1547bb05cb6f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Gen.walk_class: MethodTooLong \u2014 walk_class 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/perry-wpfacts/src/gen/walk.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9e72cd76900b4286147eb493adfffe281822e1f857faa744b27d502113003c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Model.solve: MethodTooLong \u2014 solve 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/perry-wpfacts/src/solve.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce31687fb5753398c79a945eb57433d06df0b0305ea0879d81b2ddd5c4c7ff62"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::setup::visionos::visionos_wizard: FunctionTooLong \u2014 perry::commands::setup::visionos::visionos_wizard 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/perry/src/commands/setup/visionos.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"327596e664347963e0c6e1fb69af7f7a1f5efe776519e115db1dbea9349e8487"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/emit.rs: FileTooLong \u2014 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). The bar is 500 significant lines; this is 44 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-glance/src/emit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d3f609b9be15ef99e73fd3594d7285eabf21b93db14da1ffd04e5bfbc31c1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: property_ops/put_value.rs: FileTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 43 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/property_ops/put_value.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9a149d4a5220c6154b4256871a9e2675af36febb2f030fb3cf1d08c944f495"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: index_get/inline_dyn_typed_array.rs: FileTooLong \u2014 542 significant 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 42 over it, 1.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/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24285f0716799865f703f1a4b739583fcc3df9555cd6d571ae34f00291c8dc9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lower_string_concat.rs: FileTooLong \u2014 542 significant 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 42 over it, 1.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/perry-codegen/src/lower_string_concat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5aad7a278ac922b93961bc5fc932cc2e2811df3397fdf69f2a54f520dda456"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/graph.rs: FileTooLong \u2014 542 significant 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 42 over it, 1.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/perry-gc-effects/src/graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d81b4c46921732692bb139901a98e0ba67605455fb5b7a9c33b6eea13e27608"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/messaging.rs: FileTooLong \u2014 542 significant 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 53 free functions. The bar is 500 significant lines; this is 42 over it, 1.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/perry-runtime/src/messaging.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e99fcd16f552e2496e66719bc557e8348698facbb5952d031da52bb71d25b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_module_dispatch/dispatch_q_u.rs: FileTooLong \u2014 542 significant 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 42 over it, 1.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/perry-runtime/src/object/native_module_dispatch/dispatch_q_u.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"090ab447f7f17fc5167484a59e693e1ab01266afac9eb49a211db8a023e2d301"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/media_playback.rs: FileTooLong \u2014 542 significant 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 42 over it, 1.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/perry-ui-gtk4/src/media_playback.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff811c75de5c6b305f029896ad5301d1decd42263bb9081afa2504d622119a09"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: inprocess/native_homes.rs: FileTooLong \u2014 541 significant 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 41 over it, 1.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/perry-codegen/src/inprocess/native_homes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fdb81205b38e5eed4b8aa30cb59f2c7e88fe32112ed9045e60d114e202230b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/client_events.rs: FileTooLong \u2014 541 significant 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 41 over it, 1.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/perry-ext-http/src/client_events.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce88e1dca3ad58cabd9e4e895acb0587b3a2f4078883b3f09c4b0cf8b0f1fbd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compiler_output_harness/analyzers.py: FileTooLong \u2014 540 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 40 over it, 1.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":"scripts/compiler_output_harness/analyzers.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ab371fbcbfabd95e7c4eb0816907b0d59f72186f9705ab20baeab385135e8c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: global_this/generator_state.rs: FileTooLong \u2014 540 significant 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 40 over it, 1.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/perry-runtime/src/object/global_this/generator_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"566e6cc3e213c8bb09e19ba0459db9e890f709f50e6b79417ef215c29db09ef6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generator/private_frame.rs: FileTooLong \u2014 540 significant 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 40 over it, 1.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/perry-transform/src/generator/private_frame.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0369db5a06b719bab86ea418d8e45c2b527ce197eb23d9cc81f5bab237e5f7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_new::non_ident::lower_new_non_ident: FunctionTooLong \u2014 perry_hir::lower::expr_new::non_ident::lower_new_non_ident runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_new/non_ident.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c503021125c28c78e04529bc5db6299c84485891a28cfb05b3feec04abafa1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RootScanCycleState.step_current_subphase: MethodTooLong \u2014 step_current_subphase runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/gc/cycle.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed8114f7afee05d68bea3e4478d8fec5aae76c1df20cec935b5dcad6b7cd999"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::native_module::callable_exports::bound_native_callable_export_value: FunctionTooLong \u2014 perry_runtime::object::native_module::callable_exports::bound_native_callable_export_value runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/native_module/callable_exports.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"141fdf9bf0f9536aa3a097f1c8aa8a4579c2f158ca5a6bdbc8c0c3de80839153"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_ios::camera::start: FunctionTooLong \u2014 perry_ui_ios::camera::start runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-ios/src/camera.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"f456e054d466e82d42f5f2a5421639b5ce00269a2e8519375defb65d68b9f2e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_visionos::camera::start: FunctionTooLong \u2014 perry_ui_visionos::camera::start runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-visionos/src/camera.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a6099599ec7163d3312bf2de0ae34dcaa30e94f3f934332d5e05c0c31ac6b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: type_analysis/refine.rs: FileTooLong \u2014 539 significant 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 39 over it, 1.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/perry-codegen/src/type_analysis/refine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae19cad4321bd686e8a345bbd9a47bf90c380aab36b0fa17b07d86a54efee54"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime_layouts/ascii_chars.rs: FileTooLong \u2014 538 significant 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 38 over it, 1.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/perry-runtime/src/object/runtime_layouts/ascii_chars.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"668b5f72aa9637b24f2bc7cd39d3e8077b00a3b0287e782708a2530d78f4f87e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compile/bundle_apple.rs: FileTooLong \u2014 538 significant 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 38 over it, 1.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/perry/src/commands/compile/bundle_apple.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f690903c69bf6b0e173cd998a36f38b4aa924474fee5b4ba4c98bb2a3e76481f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: global_this/generator.rs: FileTooLong \u2014 537 significant 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 37 over it, 1.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/perry-runtime/src/object/global_this/generator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fd16f9abfc4818cfae13ded589eabbec6ddc9301e25872d013e83b1a505806"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/stdlib_stubs.rs: FileTooLong \u2014 537 significant 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 37 over it, 1.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/perry-ui-android/src/stdlib_stubs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8094dee10bc387c5c1e963bc28d659e64ca0e704b2c0ef044418172f27cc39eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: run/android.rs: FileTooLong \u2014 536 significant 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 36 over it, 1.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/perry/src/commands/run/android.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02690e9d3864eff63ecd65553f504910a1848f82a39fab294a61ccd03b057e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/geisterhand_registry.rs: FileTooLong \u2014 535 significant 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 31 free functions. The bar is 500 significant lines; this is 35 over it, 1.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/perry-runtime/src/geisterhand_registry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9758de569c1e9ec58e25194fa35ad586e8c580495013a605d3befe1ebb9f2484"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compile/widget_build.rs: FileTooLong \u2014 535 significant 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 35 over it, 1.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/perry/src/commands/compile/widget_build.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4420c0a716a909617d76bbbfff1d1683472f1a85742100ba8188f7d418170f72"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Scan.walk_expr: MethodTooLong \u2014 walk_expr 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/perry-codegen/src/collectors/sealed_buffers.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0a4aa0ff5228782f0f0ffa640f5e6fb5e6079fdb4ef7f50ffd7ae0eaf3a98a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::i32_fast_path::try_lower_expr_native_i32_structural: FunctionTooLong \u2014 perry_codegen::expr::i32_fast_path::try_lower_expr_native_i32_structural 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/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7c67d4eaf26ea3abfffae0179e29334aa8a3d981530b5b76e6197d146cad98"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::layout_desc::create_families::lower_add: FunctionTooLong \u2014 perry_codegen::layout_desc::create_families::lower_add 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/perry-codegen/src/layout_desc/create_families.rs"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf59c48fe513672a51163d82a7eeb53328edbc5b504893ba68c0b93130c7fd6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::console_promise::try_lower_native_method_str_dispatch: FunctionTooLong \u2014 perry_codegen::lower_call::console_promise::try_lower_native_method_str_dispatch 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/perry-codegen/src/lower_call/console_promise.rs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59af7615030ddc25f87218d1d72293eb079d74d00af7e3cbbcde7d72e0364f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::type_analysis::strings::string_value_is_runtime_guaranteed: FunctionTooLong \u2014 perry_codegen::type_analysis::strings::string_value_is_runtime_guaranteed 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/perry-codegen/src/type_analysis/strings.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78e613ab5be6185908e871e2432623e5b3cc0589599ce43638cf610f03b11ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_component_host::driver::http::execute: FunctionTooLong \u2014 perry_component_host::driver::http::execute 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/perry-component-host/src/driver/http.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f0977bfbd7bb3b84683fe3a6d4a1d844d691f8f677c5b40d83994ad8241ec5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DriverClient.submit: MethodTooLong \u2014 submit 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/perry-component-host/src/driver/requests.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"2048b97858f875a9f2108afa2581e785ccd497556814f2e5ed890410d42e6856"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::closure::native_constructor::inherits_function: FunctionTooLong \u2014 perry_runtime::closure::native_constructor::inherits_function 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/perry-runtime/src/closure/native_constructor.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bfbd5af240b3de848a20e59c5209a86c3751b6f02c5a1efd85d68c65c30ae03"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::shape_store::try_array_store: FunctionTooLong \u2014 perry_runtime::object::shape_store::try_array_store 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/perry-runtime/src/object/shape_store.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"d280d3bb901444032bfa7dac1bf2b020eddc910c80572c530d072eeb2b786d2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_android::widgets::qrcode::create: FunctionTooLong \u2014 perry_ui_android::widgets::qrcode::create 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/perry-ui-android/src/widgets/qrcode.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b194d0e09c8a32db5e2685c8cfbdda85b7ee9a05b64d0986fc399952ebfb5742"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::resolve::native_library::parse_native_pod_fields: FunctionTooLong \u2014 perry::commands::compile::resolve::native_library::parse_native_pod_fields 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/perry/src/commands/compile/resolve/native_library.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e0059e21fa8b5776245b5419e99cca6a532ecb94ebee7867c1fcf846bb65be"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::targets::compile_for_web: FunctionTooLong \u2014 perry::commands::compile::targets::compile_for_web 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/perry/src/commands/compile/targets.rs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44c5c091851c1a2cb99a62004d40de77c93665a8a0bb7e3e67f69fbd666fbd9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: promise/mod.rs: FileTooLong \u2014 534 significant 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 34 over it, 1.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/perry-runtime/src/promise/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8acc8652f474bced69c41e313e0a31fbdb5e458ab64546fecaf0cbfd6d7c4ab"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::array::alloc: TooManyFunctions \u2014 32 free functions. The bar is 30 free functions; 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/perry-runtime/src/array/alloc.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7dcae12165c000349e49d97c1dcb422aa8199ed3d0dcf70a4ea453fb0f08d2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::child_process::emitter: TooManyFunctions \u2014 32 free functions. The bar is 30 free functions; 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/perry-runtime/src/child_process/emitter.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"695015c247e86f5ec49deb88625bebfb9bc2d0b7b05080d44c20e9bc10f35a72"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::disposable: TooManyFunctions \u2014 32 free functions. The bar is 30 free functions; 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/perry-runtime/src/disposable.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"797c83639d9433b27c6bb50ae08a302aa88942bb9bcd7b2530f7721c78bda63a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::event_pump: TooManyFunctions \u2014 32 free functions. The bar is 30 free functions; 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/perry-runtime/src/event_pump.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f509c0432f85e49fb04099eaf8513afb48c3e0c9e514529d7980488be7a616"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::json: TooManyFunctions \u2014 32 free functions. The bar is 30 free functions; 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/perry-runtime/src/json/mod.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec45caf0592bd98dfdc0a785e698c38f7b89e1eef90f34d03017d0634c07f84"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::media_playback: TooManyFunctions \u2014 32 free functions. The bar is 30 free functions; 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/perry-runtime/src/media_playback.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4619d55144257079a8d57707316de6037afef011b6d81e8c0653620d84380b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::object::global_this::async_generator_state: TooManyFunctions \u2014 32 free functions. The bar is 30 free functions; 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/perry-runtime/src/object/global_this/async_generator_state.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6a6ca56f421c2ae5711f3c59debead604fc1879becb5677637a02514da32ba"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_gtk4::ffi::widget_create: TooManyFunctions \u2014 32 free functions. The bar is 30 free functions; 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/perry-ui-gtk4/src/ffi/widget_create.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da4d20d703aae1ecd6f496c3a13618f659300452b00c17ddb7cf37bf0db2947"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dgram/ops.rs: FileTooLong \u2014 533 significant 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 33 over it, 1.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/perry-runtime/src/dgram/ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41644444c5d1373a673becc3780a0caf8a47f5a46c2a3a3c4e245b60015e45b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/addr_class_inventory.py: FileTooLong \u2014 532 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 32 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/addr_class_inventory.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32e26cca276d4c07aacf5f82a021e3bd7f687013a0ee8fe99c08ffe5e2f7370"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/atomics.rs: FileTooLong \u2014 532 significant 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 43 free functions. The bar is 500 significant lines; this is 32 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/atomics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa0ec1ebff705aad16a06fbaf736018af2e6ef1196a89fbac085bafcbb048ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: region_loop/guard.rs: FileTooLong \u2014 531 significant 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 31 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/region_loop/guard.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c414987227a6460ae0d0a676ec843678bbca2b3ddfcb0b8222fc9215020e3c2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/iterator_prototypes.rs: FileTooLong \u2014 531 significant 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 31 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/iterator_prototypes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"616c1e1beb49f0011d60320ac9ebc9d64f5f965ac278224439b1bbbe2f487504"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node_submodules/blob.rs: FileTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 30 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/node_submodules/blob.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1ae28bf02a7e2ccf69d118aae49c6acb8f53c50c48aa9c62cead6b6bb132d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_component_host::async_values::reader::generate: FunctionTooLong \u2014 perry_component_host::async_values::reader::generate 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/perry-component-host/src/async_values/reader.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"97108da3758347e78b17dbce3f73754f06caa6dc84d60731470f68da1e7ffb83"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ext_net::payload_socket::connect: FunctionTooLong \u2014 perry_ext_net::payload_socket::connect 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/perry-ext-net/src/payload_socket.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8809272a0ba2121523a21a7e3f93d88e072db7d8784dcb1daca44f9372a6cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ext_net::payload_socket::get: FunctionTooLong \u2014 perry_ext_net::payload_socket::get 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/perry-ext-net/src/payload_socket.rs"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"299c5428c7a17e6f477eae665b31cccaa21c0e6d24a4706498dca41d65d14aec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ext_typescript::transpile: FunctionTooLong \u2014 perry_ext_typescript::transpile 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/perry-ext-typescript/src/lib.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e006b9484bd90dae698b1131f4621ace3c594296cee4a2aa42189388ee57cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_assign::lower_ident_assignment: FunctionTooLong \u2014 perry_hir::lower::expr_assign::lower_ident_assignment 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/perry-hir/src/lower/expr_assign.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e9c19c73dd7bd3ca20428430ac75615d817c562b3507d151e7b98ff9a8c65d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::field_get_set::class_object_props::finish_class_evaluation_prototype: FunctionTooLong \u2014 perry_runtime::object::field_get_set::class_object_props::finish_class_evaluation_prototype 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/perry-runtime/src/object/field_get_set/class_object_props.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"d181da22ed88489c1bebe54c5f8f0c427706b8ed45a010df89acab881317a4d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/shape_mint_census.rs: FileTooLong \u2014 529 significant 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 29 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/shape_mint_census.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4b0a6b5cfff6351b8e44dd49d1dcc578258c04913b47a7427f5c1df5ced7f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compile/bundle_ios.rs: FileTooLong \u2014 528 significant 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 28 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/bundle_ios.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d010f3362643ff60ef7030460caa17e1a2cd744028b604b6ec4bfb5fdf736d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: host/filesystem.rs: FileTooLong \u2014 527 significant 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 60% of them inside a single declaration: WasiFilesystemCtxView (4 blocks, 17-462). The bar is 500 significant lines; this is 27 over it, 1.05\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/perry-wasi/src/p2/host/filesystem.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da3622e2b152657508c6958f5efebbb7f636b907bd38de3591237e2f13dd857"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: layout_desc/array_families.rs: FileTooLong \u2014 526 significant 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 26 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/perry-codegen/src/layout_desc/array_families.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1018b4580089e2f359dae02c5b9155c59b2aafbd12bff7511a9718b0c65f6747"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/perf_histogram.rs: FileTooLong \u2014 526 significant 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 26 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/perry-runtime/src/perf_histogram.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdadc48ee7a26a80764b87ac0120d10cf932bf755dba93b2073c92764ed567a8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GcCycleTrace: ClassTooLong \u2014 420 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 7 methods, 2 blocks, lines 963-1464. The bar is 400 significant lines; this is 20 over it, 1.05\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/perry-runtime/src/gc/telemetry.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f7eaac59f483b46042e9269ecb556214ae422858b2a598c30c90eb5f5c6dc8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: node_submodules/zlib.rs: FileTooLong \u2014 525 significant 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 25 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/perry-runtime/src/node_submodules/zlib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5e5bdc684e57e9ecf930609f233713be2000d316bd23d80a8a0c8dd766abb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/update_notify.rs: FileTooLong \u2014 525 significant 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 25 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/perry-runtime/src/update_notify.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13797ce07fc53efcf006cdb55c5ab5b14cc5674f2e8374bf0a0fc99224b0aa3e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: url/parse.rs: FileTooLong \u2014 525 significant 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 25 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/perry-runtime/src/url/parse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2578f5d706510e32e0270315d2d1743eaaeb5c9e57ac60aa85c50371e7168ede"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::index_get::lower_numeric_index_get_for_number_context: FunctionTooLong \u2014 perry_codegen::expr::index_get::lower_numeric_index_get_for_number_context 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/perry-codegen/src/expr/index_get.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bc1c0b6502d56163b4f026670fe6ecc709e282e274037ecb2183cefe821c09"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::layout_families::program_families: FunctionTooLong \u2014 perry_codegen::layout_families::program_families 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/perry-codegen/src/layout_families.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d59f6f762dd797bc88276d0baca27321102eb3f9c5219ea91f05694a33e488c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::stable_packed_loop::match_candidate: FunctionTooLong \u2014 perry_codegen::stmt::stable_packed_loop::match_candidate 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/perry-codegen/src/stmt/stable_packed_loop.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78f0581df617567f8f3438e3b3d0c54d2c4c606cfde884b089be9de67aea54e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::type_analysis::refine::proven_type_from_init: FunctionTooLong \u2014 perry_codegen::type_analysis::refine::proven_type_from_init 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/perry-codegen/src/type_analysis/refine.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"4548dda8f02aa1856412faf6763fb1b455a2e8cb8500347e718d4bcb93a4e67c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::dynamic_eval::lower: FunctionTooLong \u2014 perry_hir::lower::dynamic_eval::lower 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/perry-hir/src/lower/dynamic_eval.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a17a7511208299ed4ed1fa551261703a9f87e6c830dd068b0fea42a7d0ccbde"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RegexDiag.render: MethodTooLong \u2014 render 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/perry-runtime/src/hot_diag.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4716b7f0ef3f0e6fb26c25028b8c77215d3f3f9c6451cb959c39b91f8546ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::json::replacer::stringify_object_pretty: FunctionTooLong \u2014 perry_runtime::json::replacer::stringify_object_pretty 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/perry-runtime/src/json/replacer.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"124b10ab959d5c0a47e846f4c75485cf5a521a136c617f26fd6ee88843f4d5f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::json::stringify_record_output::emit_record: FunctionTooLong \u2014 perry_runtime::json::stringify_record_output::emit_record 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/perry-runtime/src/json/stringify_record_output.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd27b6cc962cb1f826ba120477262757b91c2cf929b964eb526b06799d338a0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_wpfacts::builtins::collections::bobj_method: FunctionTooLong \u2014 perry_wpfacts::builtins::collections::bobj_method 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/perry-wpfacts/src/builtins/collections.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b781711183c3f79465bd63670e0f2a6f82b3fae94efc955bca69ecf68d7b72"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/ffi.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), declaring 45 free functions. 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/perry-runtime/src/tui/ffi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a33c347b8e5daf296ecfbff551cea46674af812346e36114e8a128e6ee9d12"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/pdf_view.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/perry-ui-windows/src/widgets/pdf_view.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d39500f55e5f855655ebb8a0ac5469ecc21c4eaf77681799ef84bfd3fbadf30"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ic_miss/private_guard_fast.rs: FileTooLong \u2014 523 significant 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 23 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/perry-runtime/src/object/field_get_set/ic_miss/private_guard_fast.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ef5a30791a93f3607e83f2d236b7ccd12217a5926982b406bc94e2c04861b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: wasi_net/mod.rs: FileTooLong \u2014 523 significant 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 23 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/perry-runtime/src/wasi_net/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4abcd93fe03dc815be4d807ab6d169294b67169742af5275b911681a117c108"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/server.rs: FileTooLong \u2014 522 significant 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 22 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/perry-ui-geisterhand/src/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce20e0ab8b1527836c552ba1f072aefedd22d7ad9e0dea3d1a99148c376ed8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ffi/widgets_basic.rs: FileTooLong \u2014 521 significant 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 139 free functions. The bar is 500 significant lines; this is 21 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/perry-ui-ios/src/ffi/widgets_basic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf1ecda8ea4ca18d33cf3ffb11a951ef503b817bdc470ca23fa219e7b139f6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_module_dispatch/dispatch_d_i.rs: FileTooLong \u2014 520 significant 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 20 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/perry-runtime/src/object/native_module_dispatch/dispatch_d_i.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0522417f0139289a46cb3163dcd38041f8fb8031b2c1aa6500bdb17ac96be9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/i18n.rs: FileTooLong \u2014 520 significant 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 20 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/perry-transform/src/i18n.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dbf6901ff3237bf1599a51f7bcb87a34fe322f72ec6bee53f4a474d5110805"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: p2/handlers.rs: FileTooLong \u2014 520 significant 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 97% of them inside a single declaration: WasiHttpCtxView (12 blocks, 19-743). The bar is 500 significant lines; this is 20 over it, 1.04\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/perry-wasi/src/http/p2/handlers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6dc9597d019468522deeadebbece98cd941a6c14d928ac24e34c56b7bacbbd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen_arkts::emit_index_ets: FunctionTooLong \u2014 perry_codegen_arkts::emit_index_ets 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/perry-codegen-arkts/src/lib.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aae906576f21e742f03b796ec3bc75784daf7698751a55da7bbdc1624b570a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen_wear_tiles::emit::emit_tile_service: FunctionTooLong \u2014 perry_codegen_wear_tiles::emit::emit_tile_service 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/perry-codegen-wear-tiles/src/emit.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d8bc32f97409f502f6161cf035b95beccbedafbb3f17a65f277a9ebbf27b0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::int_valued_ta_locals::collect_facts: FunctionTooLong \u2014 perry_codegen::collectors::int_valued_ta_locals::collect_facts 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/perry-codegen/src/collectors/int_valued_ta_locals.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8905353f50e1a534e9021aaea78b0850f22c5b275d5743a59536657fb9488a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::native_value::verify::layout::validate_pod_layout: FunctionTooLong \u2014 perry_codegen::native_value::verify::layout::validate_pod_layout 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/perry-codegen/src/native_value/verify/layout.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0792cf0b86e921a219d0dfc283963ce45c198d11a5787ea9987dca323e30d5a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::bigint_dispatch::dispatch_bigint_binary_method: FunctionTooLong \u2014 perry_runtime::object::bigint_dispatch::dispatch_bigint_binary_method 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/perry-runtime/src/object/bigint_dispatch.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"188b437f2d08b2e28d268973c446a36ca8e9e12086856bdd7bece52115fe1bc5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::instanceof::shape_ancestry::class_shape_reaches: FunctionTooLong \u2014 perry_runtime::object::instanceof::shape_ancestry::class_shape_reaches 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/perry-runtime/src/object/instanceof/shape_ancestry.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88d74922141b00c723eae5464f0666ca09817e40fc2d6caad3a1e5aeed7c08a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::regex::perex_replace::string: FunctionTooLong \u2014 perry_runtime::regex::perex_replace::string 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/perry-runtime/src/regex/perex_replace.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f479f86c78fadd55a3fe498a9e4101cdd43252a579da8fa22913e4f25f7e2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_wpfacts::units::driver::solves: FunctionTooLong \u2014 perry_wpfacts::units::driver::solves 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/perry-wpfacts/src/units/driver.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6bced0c2039b596facad63f9b688e32e4c59d85c3f705a9798ca5c450a43a2d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::strip_dedup::strip_bundled_runtime_from_well_known_lib: FunctionTooLong \u2014 perry::commands::compile::strip_dedup::strip_bundled_runtime_from_well_known_lib 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/perry/src/commands/compile/strip_dedup.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1487e40f3cb58a1396c4e4293a2539a6620dcf070e675d9ad80199d4c6e7b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::strip_dedup::strip_bundled_shared_deps_from_well_known_lib: FunctionTooLong \u2014 perry::commands::compile::strip_dedup::strip_bundled_shared_deps_from_well_known_lib 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/perry/src/commands/compile/strip_dedup.rs"},"region":{"startLine":1675}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7599b35a247a99533f365fcd1e58b7d354a04a69532b8a56bfd8b71bf8638a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::targets::compile_for_wasm: FunctionTooLong \u2014 perry::commands::compile::targets::compile_for_wasm 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/perry/src/commands/compile/targets.rs"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"901273a12fe79959d5c86722404dd9f1a5beb000bdfd8bcae24624c092ea68f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::publish::credentials::auto_export_p12_from_keychain: FunctionTooLong \u2014 perry::commands::publish::credentials::auto_export_p12_from_keychain 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/perry/src/commands/publish/credentials.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a2ef19170a30cd002f0b9ebc0493676a4ec9497327321e2f2f8581d6d26130"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::setup::tvos::tvos_wizard: FunctionTooLong \u2014 perry::commands::setup::tvos::tvos_wizard 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/perry/src/commands/setup/tvos.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d19e37076ce739b77c6c33fcb84bee1a2ea4890050fa7512e7621ef6df1df9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::setup::watchos::watchos_wizard: FunctionTooLong \u2014 perry::commands::setup::watchos::watchos_wizard 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/perry/src/commands/setup/watchos.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0fb3c8e05bc86b597b57b86fee3720fdf1ab62ffe475bf14564ae8b89db3035"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: arena/quarantine.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/perry-runtime/src/arena/quarantine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a415feec40f420efc34ae8ab0c806366d50b59c51baff03afdc5f14631e20d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/mod.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), declaring 31 free functions. 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/perry-ui-ios/src/widgets/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a88de87c292c8bcd6bdcb92a278c8c1c47c4de8358657fc95a6352f099c106a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: class_registry/prototype_objects.rs: FileTooLong \u2014 518 significant 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 18 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/perry-runtime/src/object/class_registry/prototype_objects.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"113cba17a4ec2ced42b36f0b6926083a73000b1606596cb6674e60f3b15b8029"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: server/bun_server.rs: FileTooLong \u2014 517 significant 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 17 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-http/src/server/bun_server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c108a6d4cc6b64e34c04fd26414cca3d43633c9ab1377e923408801134e4e1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FuncEmitCtx: TooManyMethods \u2014 31 methods, declared across 21 files: emit/function.rs (5), emit/memcall.rs (4), emit/binary.rs (3), emit/stmt.rs (2), \u002B17 more file(s). The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/emit/func_emit_ctx.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7830b522b82f1929d79f7090e8c3495f0f8cdf862d775d76fed1bd8c11d82d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ext_ws::turnloop_io: 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/perry-ext-ws/src/turnloop_io.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8056bc035818d5b3c5279fe4208eb14e0fcb0d3a1ada73c4061b3a43889e056f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::bigint_hooks: 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/perry-runtime/src/bigint_hooks.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac8be1dc1762a89942515b98e564866ee070ab12d680ddff28521cddddbe6ee"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::builtins::fn_metadata: 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/perry-runtime/src/builtins/fn_metadata.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f847e501cc6f83fe50f696493a1a84c7a872baab2a1cb117c429dc1c3de8433d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::event_target::prototype: 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/perry-runtime/src/event_target/prototype.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6864e3639758f8e18591ec040b9d1c15c051934bb2b92fec33077e2830be8de8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::fs::cp: 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/perry-runtime/src/fs/cp.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7d764f4f34e4c6d3cf0446fe852396c5983b047f74c4c5d4728a7104d5bb9a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::object::global_fetch: 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/perry-runtime/src/object/global_fetch.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2ce2c913ee913ae18a1898282da0760b377235b6284744be1885c426168b2d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ShapeRecordRef: TooManyMethods \u2014 31 methods, declared across 2 files: object/shapes.rs (29), object/shapes_spread.rs (2). The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/shapes.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"c851b4fee4e77c3b40516e409f3dc4a1456f31962e6da1e5ab327b89ff3102a9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::promise::native_async: 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/perry-runtime/src/promise/native_async.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ca3f46c4cf710429916ff4d15cbae65fdc8120a8b55179da1fbf853d28d6fb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::symbol::properties: 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/perry-runtime/src/symbol/properties.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"361807c906f0ad5e00a8c12638d9863d73f7fa4db2bf805a6557c61582a6f6f0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_runtime::yoga: 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/perry-runtime/src/yoga.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9206740b19ac0f3646c554bd96cfef77bb6a26ec9dd73a43d7068eab965f198"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_stdlib::events: 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/perry-stdlib/src/events.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71ff76ccf2affe54106b4f5a7c4f66b57f7904e8d18da1616e3f934999dbe4b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_stdlib::querystring: 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/perry-stdlib/src/querystring.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab48f87d4a694ce0973138d92f1d294bedac71ef448e5955c13480beb7843a7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_ios::ffi::misc: 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/perry-ui-ios/src/ffi/misc.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3407b2552fb7704a43efa1ee6375e9ec7f80eab325b35da37504ea7908ab29d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_windows_winui::app: 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/perry-ui-windows-winui/src/app.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd43e402d26c3ba5e9d94867344c48011acffdbfe83a286cc6f1932f7463cbb1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: perry_ui_windows::ffi::widget_create: 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/perry-ui-windows/src/ffi/widget_create.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"238cbbf37dc46c433f66bd8ec9966b4ed391f0ceeef10ed4c61bb087c95618b1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: GcCycleTrace: TooManyFields \u2014 31 stored fields beside 7 methods. The bar is 30 stored fields; this is 1 over it, 1.03\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/perry-runtime/src/gc/telemetry.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a44d8a96d35ad1ea152d02f7939cd7906b2a6bae394bf97665d880ba82a8f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_value/artifact.rs: FileTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 16 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/native_value/artifact.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f161d1a91a23eada02912a18aefd24b9290c8d80c82d85d8fdbf7c5f6148f5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ArenaSweepObjectsState: ClassTooLong \u2014 412 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 19 methods, 3 blocks, lines 6-706. The bar is 400 significant lines; this is 12 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/perry-runtime/src/gc/oldgen/sweep_objects.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7c5883179df7d72f1ce65f44aa48737b1f3d1d4538a306b2559e208d13fce8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/check_thread_locals.py: FileTooLong \u2014 515 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 15 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check_thread_locals.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ee7f94fef0694ae756e3456fac8a0bb1a12792a0a80081a66af6f90ef3c524"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsEmitter.emit_class: MethodTooLong \u2014 emit_class runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/emit/decls.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37d188d669c4a22d2c6558c111b024af0c1227efd8d27edec80740b80186238"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::worker_new::lower_candidates: FunctionTooLong \u2014 perry_codegen::expr::worker_new::lower_candidates runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/worker_new.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1627370793b4f22a16e9d9a5f6326733187d574522ff571aa1e52a1586688a3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::inprocess::native_homes::retain: FunctionTooLong \u2014 perry_codegen::inprocess::native_homes::retain runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/inprocess/native_homes.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d4924a34036d003566967d467e19c7657d0308ee9ec7c023444255d44ae2fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_component_host::driver::run: FunctionTooLong \u2014 perry_component_host::driver::run runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-component-host/src/driver.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea7a9c240ce1774e01faf7af16a582e3629ee33d82dea37af20f26694fcc7c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ext_net::payload_socket::write: FunctionTooLong \u2014 perry_ext_net::payload_socket::write runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-net/src/payload_socket.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b00d23f30f1bd7432952b8f0cc7f963da10080f5232e24d83241ee2d381fd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::js_transform::cross_module_natives::scan_for_native_func_returns: FunctionTooLong \u2014 perry_hir::js_transform::cross_module_natives::scan_for_native_func_returns runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/js_transform/cross_module_natives.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58086634bfe5400d8aa5ee7fab5816f6a2c105ee9e2ec6287816aec00a876a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::lower::expr_assign::hoist_compound_member_assign: FunctionTooLong \u2014 perry_hir::lower::expr_assign::hoist_compound_member_assign runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_assign.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d49da3fc8eb74974be9a3afc4013f4db57076f8f363b1d82f91cbf6acb93e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::intl::list_relative_plural::configure_plural_rules: FunctionTooLong \u2014 perry_runtime::intl::list_relative_plural::configure_plural_rules runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/intl/list_relative_plural.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"022e4bfeb5eccd280cd03a1e28b1292915fda10880ac1fde578e11df8cd174ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::module_require::require_path: FunctionTooLong \u2014 perry_runtime::module_require::require_path runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/module_require.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ec4aabaf5384bff149d5209517f2e9d0ab80c1dfec78ce0ebf43462a93e9ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_stdlib::streams::release_web_streams_in_freed_ranges: FunctionTooLong \u2014 perry_stdlib::streams::release_web_streams_in_freed_ranges runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/streams.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a4dc9ab1c5590742ba5ebca33aebfd440809870fd78be3887c6ccd1487a6bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_stdlib::tls::js_tls_client_preflight: FunctionTooLong \u2014 perry_stdlib::tls::js_tls_client_preflight runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/tls.rs"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"83aa7c659b00c7f156049695ad49790764ec5cf50dd7c2ccde714e20af93259b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::generator::per_iteration::rewrite_cells_in_expr: FunctionTooLong \u2014 perry_transform::generator::per_iteration::rewrite_cells_in_expr runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/generator/per_iteration.rs"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"db895a7b62990c1a3713cdb20123a8d197bc408ad8e6bb6329e97359c179230c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_ios::widgets::rich_tooltip::present_overlay: FunctionTooLong \u2014 perry_ui_ios::widgets::rich_tooltip::present_overlay runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-ios/src/widgets/rich_tooltip.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2ca89f08f50bf2f24de1715fb73500cba7b8fb7e91e2e9843522456bd69333"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_visionos::widgets::rich_tooltip::present_overlay: FunctionTooLong \u2014 perry_ui_visionos::widgets::rich_tooltip::present_overlay runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-visionos/src/widgets/rich_tooltip.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f825de03d98fecfae230e990e6efc3ac0ac0cdd07b0b23a28af37ef2a0c9d12e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::program_facts::elision_for: FunctionTooLong \u2014 perry::commands::compile::program_facts::elision_for runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/program_facts.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1691bff0c4f639b05b1c584533e960efaa7a624937999172bb326892cd9b07"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: generator.generateTheme: FunctionTooLong \u2014 generateTheme runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/perry-styling/src/generator.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af44daa3a9386ea45dedce25d0c704b9616fdae104c471b0408753ab1a07c32"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: string/intern.rs: FileTooLong \u2014 514 significant 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 14 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/string/intern.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83cef4341b81053d258d974d6355dddf08c995d6c17b781cd8e21cbf8dde54c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: typed_feedback/guards.rs: FileTooLong \u2014 513 significant 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 13 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/typed_feedback/guards.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc2329ad01401a8b52a8e8ca1b8209722a4b89f09ead781aa73f9455d6c341a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collectors/scalar_method_dispatch.rs: FileTooLong \u2014 512 significant 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 12 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/perry-codegen/src/collectors/scalar_method_dispatch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1baafbc404516a25b4ad8a90363202921491ea813ed09eb73a6592e3679fd1ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dispatch/method_dispatch.rs: FileTooLong \u2014 512 significant 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 12 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/perry-stdlib/src/common/dispatch/method_dispatch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f026d841764f7b66eee88dc141fab57eeddb8642b668559f51fbfdd04dd9d9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tree.rs: FileTooLong \u2014 512 significant 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 70 free functions. The bar is 500 significant lines; this is 12 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/perry-ui-watchos/src/tree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"913054140dedc4d7fbbb66be38004cf43fd4c2efaf15a5495fe438493530c194"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/node_compat_matrix.mjs: FileTooLong \u2014 510 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 10 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":"scripts/node_compat_matrix.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10bcc94070779e2c1741ee0f80ebb01a2152bc5f0e632a9eb05a50ac317d50c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::hoisted_callback_calls::collect_loop_called_callee_bindings: FunctionTooLong \u2014 perry_codegen::collectors::hoisted_callback_calls::collect_loop_called_callee_bindings 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/perry-codegen/src/collectors/hoisted_callback_calls.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9224195e48c9a48bf0792276be1dfe418a55a912061a732e81aaa4f85bf54e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::int_valued_ta_locals::observe_stmts: FunctionTooLong \u2014 perry_codegen::collectors::int_valued_ta_locals::observe_stmts 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/perry-codegen/src/collectors/int_valued_ta_locals.rs"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b2a54dd8ba7f05aa60c772b65b4f686b7c0c6bdfc4ac0e9177145aebe50f99"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::expr::write_barrier::lower_stream_super_init: FunctionTooLong \u2014 perry_codegen::expr::write_barrier::lower_stream_super_init 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/perry-codegen/src/expr/write_barrier.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f609fd3a8ec763831afc41f439c2b1df457c45e6e76ed3ef65bcc719aa7b33"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::gc_map::verify_roundtrip: FunctionTooLong \u2014 perry_codegen::gc_map::verify_roundtrip 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/perry-codegen/src/gc_map.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"84102f529a84c05ce513d8ac10086ff77fab46137e0aaabe9714ea17f10c7625"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::layout_families::late::add_variants: FunctionTooLong \u2014 perry_codegen::layout_families::late::add_variants 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/perry-codegen/src/layout_families/late.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d7049389fde7e3406886477c4663e79cb349deed7400729d56e9d4d361883b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_component_host::driver::writers::execute: FunctionTooLong \u2014 perry_component_host::driver::writers::execute 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/perry-component-host/src/driver/writers.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62470a75ba737781c4bd84a1d704287a98e3d74a74ae701f45dc2fcf9cffd18"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_hir::analysis::builtins::builtin_static_function_length: FunctionTooLong \u2014 perry_hir::analysis::builtins::builtin_static_function_length 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/perry-hir/src/analysis/builtins.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11ea4c295b415c838af7b3c62f068f7444af856045aeb3de8ffbe10682f77b6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IteratorRecordPlan.drive: MethodTooLong \u2014 drive 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/perry-hir/src/iterator_record.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc145a278d7c2a28ee79827e316e81a8489001e9d8f43b7bcf69ad3484f9163b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::json::stringify_proxy::try_stringify: FunctionTooLong \u2014 perry_runtime::json::stringify_proxy::try_stringify 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/perry-runtime/src/json/stringify_proxy.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87e83dbb869eafe5f54cf70bd7297ec93673eecafba1982c69a53f4033c2481"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_ui_windows::widgets::table::create: FunctionTooLong \u2014 perry_ui_windows::widgets::table::create 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/perry-ui-windows/src/widgets/table.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fe92c347be30d5dc566ed368754b937b9ee4817bc1d28050c945beaa201a07"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::login::run: FunctionTooLong \u2014 perry::commands::login::run 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/perry/src/commands/login.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc00cbc9a824d1d5c4d13da981233451de60986fd6498c4f995b2ec1b4438df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: timer/store.rs: FileTooLong \u2014 508 significant 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: AgentTimers (2 blocks, 224-839). The bar is 500 significant lines; this is 8 over it, 1.02\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/perry-runtime/src/timer/store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5406a340e4b63242d73d1b9053be48ba237e876b4205759171de9422935f355"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Host: ClassTooLong \u2014 406 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 21 methods, 4 blocks, lines 88-608. The bar is 400 significant lines; this is 6 over it, 1.02\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/perry-component-host/src/lib.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0bc6c864602fac6b7d289f6dfd397c869caba848d52ab5c2d867d3cc8bb0fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower_call/new_alloc.rs: FileTooLong \u2014 507 significant 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 7 over it, 1.01\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/perry-codegen/src/lower_call/new_alloc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9774d4d437505bc2c37993e7fbaafb52ea537c28a408623fdeab3ee97f9b41"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/param_type_guard.rs: FileTooLong \u2014 507 significant 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 79% of them inside a single declaration: GuardState (2 blocks, 159-806). The bar is 500 significant lines; this is 7 over it, 1.01\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/param_type_guard.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"342cff2c594349ec17c20113139f30b0935687a34481f4822be44040ec36adec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/process.rs: FileTooLong \u2014 507 significant 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 7 over it, 1.01\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/perry-runtime/src/process.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7c01ac51154be34173a333e62b9a21edade7487e07e818ac55664a8d569ed5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/error_stack_frames.rs: FileTooLong \u2014 506 significant 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 6 over it, 1.01\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/perry-runtime/src/error_stack_frames.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa6721625ccb3d97b46be5a38efbac45cc9fd0db10e29ea83dfcfa224466099"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: inline/analysis.rs: FileTooLong \u2014 505 significant 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 5 over it, 1.01\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/perry-transform/src/inline/analysis.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a60d37745e5c160f2b65297943be1cd68cc9a6b9a8cb004a5a77f72ff08c19"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::escape_objects::collect_used_object_fields_in_stmts: FunctionTooLong \u2014 perry_codegen::collectors::escape_objects::collect_used_object_fields_in_stmts 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/perry-codegen/src/collectors/escape_objects.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20dcb34901fb9b1bb355b890015a3d7b787a3aa69e8cdb0cf9c34a14f28fe0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::i32_locals::collect_integer_let_ids: FunctionTooLong \u2014 perry_codegen::collectors::i32_locals::collect_integer_let_ids 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/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0022d503052d6d7e1f23853d2a76247e20f3913d6dfe7c49280e1010e5c313"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::object_literal_exports::capability_from_init: FunctionTooLong \u2014 perry_codegen::collectors::object_literal_exports::capability_from_init 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/perry-codegen/src/collectors/object_literal_exports.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b8040d6296098572b585ae3a9c16edd670dcb34e4a73ea4e9b883757731493"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::collectors::scalar_method_dispatch::collect_module_dispatch_facts: FunctionTooLong \u2014 perry_codegen::collectors::scalar_method_dispatch::collect_module_dispatch_facts 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/perry-codegen/src/collectors/scalar_method_dispatch.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c4508e114e511d3162b546e7ac6325cdfc53ec2a20d0b184dc823bcc34ded8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::lower_call::scalar_method::materialize_scalar_receiver: FunctionTooLong \u2014 perry_codegen::lower_call::scalar_method::materialize_scalar_receiver 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/perry-codegen/src/lower_call/scalar_method.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac816b5446f1c95c516a03a808dab6c6af10cafc0a7fdd8d1d5ec31d7e8713a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_codegen::stmt::loops::packed_f64_range_loop_dense_stmts_collect: FunctionTooLong \u2014 perry_codegen::stmt::loops::packed_f64_range_loop_dense_stmts_collect 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":2711}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d96b297c43b040d29ff76869599303cca39088cba3b73c5861547358eb985b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime_manifest::realm_source::tokens: FunctionTooLong \u2014 perry_runtime_manifest::realm_source::tokens 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/perry-runtime-manifest/src/realm_source.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"75311b87942eea21e9833ffec0cc9e769a6db5aa6fa842c153760ca4a65c4fdf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::component::js_component_load: FunctionTooLong \u2014 perry_runtime::component::js_component_load 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/perry-runtime/src/component/mod.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa33dc5b2120db5745cda5ff5ccb1c7f17ee7f735ac7b66bf774a44564511f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::object::native_module_dispatch::dispatch_d_i::nm_dispatch_inspector: FunctionTooLong \u2014 perry_runtime::object::native_module_dispatch::dispatch_d_i::nm_dispatch_inspector 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/perry-runtime/src/object/native_module_dispatch/dispatch_d_i.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"63fc911595289b5b6029693972535bac0a7c1d0c1533752d6a6b918e4946b5b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::tty::ensure_tty_prototypes: FunctionTooLong \u2014 perry_runtime::tty::ensure_tty_prototypes 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/perry-runtime/src/tty.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd5197fc4da0650fff1be4f290e9a7d20fd01ee68cc239fe88f2f11c581d22b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_runtime::value::equality::js_jsvalue_loose_equals: FunctionTooLong \u2014 perry_runtime::value::equality::js_jsvalue_loose_equals 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/perry-runtime/src/value/equality.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bde849f4aede6d75b65ac48d7e7c0fba152c38d615bda4b522564b62a8431c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry_transform::deforest::call_sites::rewrite_call_sites_in_stmts_with_local_pass: FunctionTooLong \u2014 perry_transform::deforest::call_sites::rewrite_call_sites_in_stmts_with_local_pass 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/perry-transform/src/deforest/call_sites.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"358005ffc25ac60126fb4d46f8ad6d771824928e28d3c7182f9085d8a747823e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::bundle_apple::bundle_for_tvos: FunctionTooLong \u2014 perry::commands::compile::bundle_apple::bundle_for_tvos 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/perry/src/commands/compile/bundle_apple.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fd5e1329484600acdd4e39f5773e40a3920afa5ab704862b5db2235b9e9318"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perry::commands::compile::link::wasi::link_wasi: FunctionTooLong \u2014 perry::commands::compile::link::wasi::link_wasi 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/perry/src/commands/compile/link/wasi.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"513c9cf5b4b9578b7577b07c861914b4612ab7413e70f78c9075f421d4405f7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bun_ffi/callback.rs: FileTooLong \u2014 504 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 4 over it, 1.01\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/perry-runtime/src/bun_ffi/callback.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"900f2659f37bacc06c8f05a621aa116072b0eb65bbd364e704f40a8ae08368df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtins/globals.rs: FileTooLong \u2014 503 significant 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 3 over it, 1.01\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/perry-runtime/src/builtins/globals.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f3a881ab02b33de1d0d2aa1249a022e705c05711f1c1da4a7c05766fd796a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fetch/headers.rs: FileTooLong \u2014 502 significant 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 31 free functions. The bar is 500 significant lines; this is 2 over it, 1.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/fetch/headers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5e7a4c69b2ddc36e3612d9ffba8d817172788e9f723dd74266c6de38d7513c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Reader: ClassTooLong \u2014 401 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 21 methods, 2 blocks, lines 95-627. The bar is 400 significant lines; this is 1 over it, 1.00\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/perry-runtime/src/thread/clone_read.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d490fd8ab5ccda68c4a3eb706125d464060f212feb760b37215902cdf5c45e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/mod.rs: FileTooLong \u2014 501 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 1 over it, 1.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-visionos/src/widgets/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fef833715c31da38e9269841b17b1a27a29134b51bb8307a1cb446aeb1c8ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (8 members, 21 shared lines): docs/audits/gc-rss-instructions-2026-10-03/latest-main2026-normal-auto-driver.py:31-76 | docs/audits/gc-rss-instructions-2026-10-03/primary-entry-once-main07-v46-auto.py:45-101 | docs/audits/gc-rss-instructions-2026-10-03/primary-lazy-rss-main07-v52-auto.py:45-101 | docs/audits/gc-rss-instructions-2026-10-03/primary-learned-floor-main07-v60-auto.py:44-100 | docs/audits/gc-rss-instructions-2026-10-03/primary-mainad0-v79-auto.py:39-86 | docs/audits/gc-rss-instructions-2026-10-03/primary-map-prefix-main07-v69-auto.py:44-100 | docs/audits/gc-rss-instructions-2026-10-03/primary-map-prefix-main07-v69r1-auto.py:44-100 | docs/audits/gc-rss-instructions-2026-10-03/primary-map-prefix-main07-v69r2-auto.py:54-112 \u2014 These 8 members are variants of one another: a block of 21 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 8 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/audits/gc-rss-instructions-2026-10-03/latest-main2026-normal-auto-driver.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d208c5af1144233afcb4c51303ca3a5dc515c255947a84345928ba01c54e33"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (7 members, 24 shared lines): crates/perry-codegen/src/expr/bigint_set.rs:77-142 | crates/perry-codegen/src/expr/bigint_set.rs:189-254 | crates/perry-codegen/src/expr/bigint_set.rs:256-323 | crates/perry-codegen/src/expr/logical_collections.rs:479-546 | crates/perry-codegen/src/expr/math_simple.rs:200-267 | crates/perry-codegen/src/expr/math_simple.rs:295-362 | crates/perry-codegen/src/expr/math_simple.rs:364-429 \u2014 These 7 members are variants of one another: a block of 24 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/bigint_set.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"8903e69164032b61178b358f3ac2fd63455a3ac216211b39a3e63e174a3fea0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 32 shared lines): crates/perry-hir/src/monomorph/infer.rs:253-312 | crates/perry-hir/src/monomorph/infer.rs:363-421 | crates/perry-hir/src/monomorph/update_call_sites.rs:572-621 | crates/perry-hir/src/monomorph/update_call_sites.rs:628-679 \u2014 These 4 members are variants of one another: a block of 32 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/monomorph/infer.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3744c06544b205de2cae8f5828155d30a32b7a7601d33beae1c76b340c79d3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 23 shared lines): crates/perry-container-compose/src/backend/apple.rs:63-136 | crates/perry-container-compose/src/backend/apple.rs:138-192 | crates/perry-container-compose/src/backend/docker.rs:88-154 | crates/perry-container-compose/src/backend/docker.rs:156-207 \u2014 These 4 members are variants of one another: a block of 23 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-container-compose/src/backend/apple.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"df438886fea877590effad662bbb20fe0382442422fe96f942145a4af94eec26"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 8 shared lines): crates/perry-codegen/src/expr/calls/crypto_kdf.rs:64-94 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:101-132 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:232-262 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:308-338 \u2014 These 4 members are variants of one another: a block of 8 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/calls/crypto_kdf.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f126b932725e318eee813b765bda633c7d2ac14897e4d2b484eb4d5e62a849b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 55 shared lines): docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py:38-117 | docs/audits/gc-rss-instructions-2026-10-03/gc-currentc170-regression-profile-v23.py:38-117 | docs/audits/gc-rss-instructions-2026-10-03/gc-final-instruction-profile.py:38-119 \u2014 These 3 members are variants of one another: a block of 55 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"224e86f69c8cbc06d810cc493b1cac65e7f930b542d0b82ec40032e60e7e7bb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 27 shared lines): crates/perry-codegen/src/codegen/closure.rs:39-111 | crates/perry-codegen/src/codegen/function.rs:225-284 | crates/perry-codegen/src/codegen/method_trampolines.rs:24-83 \u2014 These 3 members are variants of one another: a block of 27 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba3d355cbbe4df96e7770f918cae09539028c4eb97abf543bca047896cb49e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 16 shared lines): scripts/buffer_b1_validate.py:150-205 | scripts/buffer_b4_validate.py:162-217 | scripts/buffer_b5_validate.py:19-65 \u2014 These 3 members are variants of one another: a block of 16 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/buffer_b1_validate.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac2606e8cb1254ff5964ddfbc78350ea8c192014a92252d915c0c9b3704be7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 10 shared lines): docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py:12-34 | docs/audits/gc-rss-instructions-2026-10-03/gc-currentc170-regression-profile-v23.py:12-34 | docs/audits/gc-rss-instructions-2026-10-03/gc-final-instruction-profile.py:12-34 \u2014 These 3 members are variants of one another: a block of 10 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d043b84316f787a5506698f6b704c5d42893284cac86ef6b97e1a96883954f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (1909 shared lines): crates/perry-hir/src/walker/expr_mut.rs:9-1974 | crates/perry-hir/src/walker/expr_ref.rs:10-1934 \u2014 These two members are variants of one another: 1909 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/perry-hir/src/walker/expr_mut.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf8409db6f1e7907c7ad07b5b3f5e92bd17dd0d0bb19ca4018358ce37b92adb"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (494 shared lines): crates/perry-hir/src/lower/stmt_loops.rs:658-1863 | crates/perry-hir/src/lower_decl/body_stmt.rs:105-2535 \u2014 These two members are variants of one another: 494 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c5436405a85218bacc5ad1029e05a5b634c0a0cc1a177f441591e07eb9a033"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (460 shared lines): crates/perry-codegen/src/collectors/i32_locals.rs:1240-1761 | crates/perry-codegen/src/collectors/refs.rs:206-1023 \u2014 These two members are variants of one another: 460 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/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e922bef245ec18b821ef307ba65905ff1d0cfc52e82107e2e6f95060572391"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (420 shared lines): crates/perry-hir/src/lower_decl/class_decl.rs:115-1412 | crates/perry-hir/src/lower_decl/class_decl/from_ast.rs:15-763 \u2014 These two members are variants of one another: 420 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/perry-hir/src/lower_decl/class_decl.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ef3158358e56c9ce00ec5e74583a82c9221e2c465821e0daaf8a155959b4e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (161 shared lines): crates/perry-codegen/src/dialect/mod.rs:1097-1343 | crates/perry-codegen/src/dialect/mod.rs:1348-1922 \u2014 These two members are variants of one another: 161 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/perry-codegen/src/dialect/mod.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c19b8f85c0959d8621a2834534e8c5823996c64c2f263ba9f838e7951dc655"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (78 shared lines): crates/perry-codegen/src/expr/calls/fs.rs:11-113 | crates/perry-codegen/src/expr/calls/fs.rs:135-483 \u2014 These two members are variants of one another: 78 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/perry-codegen/src/expr/calls/fs.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"491643c87a2cbd82dc45d04f756c0777d86bd59e3e6cabb6d3a47fb71d5e3052"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (75 shared lines): crates/perry-hir/src/lower/lower_expr/reactive_text.rs:36-239 | crates/perry-hir/src/lower/widget_decl/reactive_animate.rs:106-317 \u2014 These two members are variants of one another: 75 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/perry-hir/src/lower/lower_expr/reactive_text.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ea5f3acc54597352f97a0b2c070f701828d5f07dc758abd1d86aa0ff56cd6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (63 shared lines): crates/perry-hir/src/monomorph/infer.rs:9-149 | crates/perry-hir/src/monomorph/update_call_sites.rs:682-779 \u2014 These two members are variants of one another: 63 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/perry-hir/src/monomorph/infer.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"79be15f2812d93e16c183ea155b143e1190c1cfc1667a224f9f0a55eabbcd463"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (57 shared lines): crates/perry-codegen/src/codegen/method_entries.rs:36-123 | crates/perry-codegen/src/codegen/method_entries.rs:136-230 \u2014 These two members are variants of one another: 57 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/perry-codegen/src/codegen/method_entries.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3825f5dd8cf506d57032cda7a6c1cc8f9b2bc3c0d9732f8216e3899c30990cee"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (50 shared lines): crates/perry-codegen/src/type_analysis/strings.rs:352-454 | crates/perry-codegen/src/type_analysis/strings.rs:683-917 \u2014 These two members are variants of one another: 50 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/perry-codegen/src/type_analysis/strings.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d2b1cffa97cf24396f8990de5d00716aeedd391f54ca8d78d1e1b13707f620"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (45 shared lines): crates/perry-codegen-glance/src/emit.rs:401-548 | crates/perry-codegen-swiftui/src/emit.rs:840-1005 \u2014 These two members are variants of one another: 45 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/perry-codegen-glance/src/emit.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"80436e1f0154176a5ecc679b0e944b09d3ca6f758ddc12920096867f1fd2817e"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (44 shared lines): crates/perry-codegen/src/native_value/verify/abi.rs:298-360 | crates/perry-codegen/src/native_value/verify/abi.rs:362-424 \u2014 These two members are variants of one another: 44 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/perry-codegen/src/native_value/verify/abi.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"b711fb9379c8aee7e4b0d3dd58e7df908cece4c252ac788d099a88b9f32ae6b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (36 shared lines): crates/perry-codegen/src/expr/pod_record.rs:263-329 | crates/perry-codegen/src/expr/pod_record.rs:336-441 \u2014 These two members are variants of one another: 36 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/perry-codegen/src/expr/pod_record.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"3144ec520f4530ea8ff53202fae127c8076478ee155cfba6d3f8fd0872ebf1ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (34 shared lines): crates/perry-codegen/src/lower_call/direct_method_guard.rs:40-129 | crates/perry-codegen/src/lower_call/method_override.rs:383-439 \u2014 These two members are variants of one another: 34 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/perry-codegen/src/lower_call/direct_method_guard.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe988c36c6157615e8c0ef504649d08298b493f8e21ff5f9ba927931710b47f"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (29 shared lines): crates/perry-ext-better-sqlite3/src/lib.rs:346-400 | crates/perry-ext-better-sqlite3/src/lib.rs:412-482 \u2014 These two members are variants of one another: 29 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/perry-ext-better-sqlite3/src/lib.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"9483351af211744c533e3d842e62bdc0ac4fd4c938d8f22e3a469cf81a144463"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (27 shared lines): crates/perry-codegen/src/expr/compare.rs:596-707 | crates/perry-codegen/src/expr/compare.rs:1083-1169 \u2014 These two members are variants of one another: 27 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/perry-codegen/src/expr/compare.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de59232e072a91a1bde4101512bf0e58ec1a775968e8aecd8ee3607064aa944"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (25 shared lines): crates/perry-codegen-glance/src/emit.rs:39-108 | crates/perry-codegen-wear-tiles/src/emit.rs:40-169 \u2014 These two members are variants of one another: 25 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/perry-codegen-glance/src/emit.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb0d76a1e3da4b7f29e8cdb98d6269043068cc98bdc17776015f1345232a594"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (22 shared lines): crates/perry-codegen/src/proto_constants.rs:225-282 | crates/perry-codegen/src/proto_constants.rs:562-622 \u2014 These two members are variants of one another: 22 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/perry-codegen/src/proto_constants.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"385ae8cb6430a7e0d2b0865c6ec7617466462937820580862d250bc61f8e4d95"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (19 shared lines): docs/audits/gc-rss-instructions-2026-10-03/current0ed-meta-observer-v17.py:11-51 | docs/audits/gc-rss-instructions-2026-10-03/current0ed-meta-observer-v19.py:11-61 \u2014 These two members are variants of one another: 19 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":"docs/audits/gc-rss-instructions-2026-10-03/current0ed-meta-observer-v17.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2f8f94519f9649f8d02bf328f09c51242ffedf0ad587a65838f8c17897f3ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (18 shared lines): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:92-115 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:93-116 \u2014 These two members are variants of one another: 18 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ab2c7210c6a81cd6e12b985f725ebd10be3682fb2817f83ccc5bee078f0d12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/perry-codegen/src/collectors/hot_callees.rs:125-172 | crates/perry-codegen/src/collectors/hot_callees.rs:224-316 \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/perry-codegen/src/collectors/hot_callees.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"154791fedd00ea896c2b3c5eda603c16787e927914411240f47a5a6977cf5c53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/perry-codegen/src/expr/binary.rs:1108-1145 | crates/perry-codegen/src/expr/mod.rs:4036-4073 \u2014 These two members are one piece of code written twice and then edited apart: 31 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/perry-codegen/src/expr/binary.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"739489e968044d2c91cd124a27c812ca6d841cbbcd3649fdcff6e68eb14bff12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/perry-hir/src/destructuring/assignment_stmt.rs:228-299 | crates/perry-hir/src/destructuring/pattern_binding.rs:115-188 \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/perry-hir/src/destructuring/assignment_stmt.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29c18e1f78c7920c22d29feb43c38118c019e63ce6d78d9f9497b64fd955bca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/perry-hir/src/lower/expr_assign.rs:32-47 | crates/perry-hir/src/lower/lower_expr/helpers.rs:308-320 \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/perry-hir/src/lower/expr_assign.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2adef898545bf597bb118586016c9551911be6da4b487f837bc28b62764d9213"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/perry-ext-net/src/payload_closed.rs:63-80 | crates/perry-ext-net/src/payload_closed.rs:82-100 \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/perry-ext-net/src/payload_closed.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd783f26a7a418efb02c4f9f17a12cd03f31e168cbf20af42dfc3c46fe84c01"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): crates/perry-codegen/src/expr/calls/crypto_hash.rs:350-378 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:39-57 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:101-132 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:139-173 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:232-262 | crates/perry-codegen/src/expr/calls/crypto_keys.rs:189-211 | crates/perry-codegen/src/expr/calls/crypto_keys.rs:218-245 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:44-84 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:272-288 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:398-417 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:456-495 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:594-621 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:628-646 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:653-675 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:682-708 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/calls/crypto_hash.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"29941cfb56ff51de3788c7907f914fe028d58fd874abc8bb9e3554ac7773521a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (13 members, 50\u002B identical tokens): crates/perry-codegen/src/expr/array_pop.rs:46-236 | crates/perry-codegen/src/expr/array_push.rs:804-1533 | crates/perry-codegen/src/expr/i32_fast_path.rs:1153-1211 | crates/perry-codegen/src/expr/i32_fast_path.rs:1216-1274 | crates/perry-codegen/src/expr/index_get.rs:706-805 | crates/perry-codegen/src/expr/index_get/guarded_array.rs:746-845 | crates/perry-codegen/src/expr/index_set_guarded.rs:223-532 | crates/perry-codegen/src/expr/index_set_packed_loop.rs:103-281 | crates/perry-codegen/src/expr/index_set_packed_loop.rs:293-499 | crates/perry-codegen/src/expr/masked_window.rs:52-61 | crates/perry-codegen/src/expr/masked_window.rs:314-362 | crates/perry-codegen/src/expr/ptr_numarray_access.rs:49-100 | crates/perry-codegen/src/expr/string_window.rs:46-63 \u2014 These 13 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 13 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 13 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/array_pop.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2603b28bc1f246a525b9d5390e67e7ffc68cbb0f380f46adde53e04d6d78fc3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): crates/perry-codegen/src/codegen/entry_outline.rs:748-857 | crates/perry-codegen/src/codegen/fresh_class_templates.rs:70-119 | crates/perry-codegen/src/codegen/function_source_header.rs:217-247 | crates/perry-codegen/src/codegen/split_regions_facts.rs:359-380 | crates/perry-codegen/src/collectors/cjs_scaffolding.rs:192-226 | crates/perry-codegen/src/collectors/cjs_scaffolding.rs:425-458 | crates/perry-codegen/src/collectors/ptr_shape_returns.rs:393-426 | crates/perry-codegen/src/collectors/scalar_method_dispatch.rs:394-505 | crates/perry-codegen/src/collectors/scalar_method_dispatch.rs:510-669 | crates/perry-codegen/src/scope_env/mod.rs:223-265 \u2014 These 10 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 10 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/entry_outline.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79ac9ba879bc1a392183e796ccf72e03a3328cb5251523dd1218c422e9d83d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): crates/perry-ext-net/src/payload_abi.rs:474-486 | crates/perry-ext-net/src/payload_abi.rs:496-508 | crates/perry-ext-net/src/payload_abi.rs:518-530 | crates/perry-ext-net/src/payload_abi.rs:540-552 | crates/perry-ext-net/src/payload_abi.rs:711-723 | crates/perry-ext-net/src/payload_abi.rs:733-745 | crates/perry-ext-net/src/payload_abi.rs:755-767 | crates/perry-ext-net/src/payload_abi.rs:777-789 | crates/perry-ext-net/src/payload_abi.rs:1059-1071 | crates/perry-ext-net/src/payload_abi.rs:1081-1093 \u2014 These 10 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 10 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-net/src/payload_abi.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a7fc62c1bdb7a250d660d4faccc448184429cab640c7930b7c3139f72ab3a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (9 members, 50\u002B identical tokens): crates/perry-ext-net/src/payload_abi.rs:558-568 | crates/perry-ext-net/src/payload_abi.rs:648-658 | crates/perry-ext-net/src/payload_abi.rs:664-674 | crates/perry-ext-net/src/payload_abi.rs:680-690 | crates/perry-ext-net/src/payload_abi.rs:795-805 | crates/perry-ext-net/src/payload_abi.rs:841-851 | crates/perry-ext-net/src/payload_abi.rs:857-867 | crates/perry-ext-net/src/payload_abi.rs:1004-1014 | crates/perry-ext-net/src/payload_abi.rs:1102-1112 \u2014 These 9 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 9 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 9 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-net/src/payload_abi.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b73f128d23d21c713bb8acd5713c0c5dc6eea54fbe469686aa2c27b5fe6009"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (9 members, 50\u002B identical tokens): crates/perry-hir/src/lower/expr_function.rs:594-1442 | crates/perry-hir/src/lower/expr_object.rs:171-499 | crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs:22-346 | crates/perry-hir/src/lower_decl/class_members.rs:73-327 | crates/perry-hir/src/lower_decl/class_members.rs:482-725 | crates/perry-hir/src/lower_decl/class_members.rs:888-1039 | crates/perry-hir/src/lower_decl/fn_decl.rs:27-404 | crates/perry-hir/src/lower_decl/private_members.rs:85-247 | crates/perry-hir/src/lower_decl/private_members.rs:321-394 \u2014 These 9 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 9 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 9 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fa41690ba01e632b1e920c49f26e1f267a32bf7be493e219658f421879a1e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): crates/perry-codegen/src/codegen/typed_abi.rs:849-880 | crates/perry-codegen/src/codegen/typed_abi.rs:944-996 | crates/perry-codegen/src/codegen/typed_abi.rs:1010-1062 | crates/perry-codegen/src/codegen/typed_abi.rs:1067-1123 | crates/perry-codegen/src/codegen/typed_abi.rs:1139-1195 | crates/perry-codegen/src/codegen/typed_abi.rs:1199-1228 | crates/perry-codegen/src/codegen/typed_abi.rs:1232-1261 | crates/perry-codegen/src/codegen/typed_abi.rs:1263-1292 \u2014 These 8 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 8 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/typed_abi.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"da23d74b32ea2afda619193154ffae90ede261fb06bac52422d87b1ec701d315"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): crates/perry-codegen/src/codegen/split_regions_facts.rs:473-568 | crates/perry-codegen/src/collectors/definite_init.rs:481-661 | crates/perry-codegen/src/collectors/segview.rs:1369-1425 | crates/perry-hir/src/dynamic_import.rs:303-376 | crates/perry-hir/src/dynamic_import.rs:381-426 | crates/perry-hir/src/dynamic_import.rs:440-537 | crates/perry-hir/src/lower/shared_mutable_capture.rs:1128-1137 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/split_regions_facts.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc76dd4e0975841505f9a97c1f9a3c0a0a98d0b6ac66e1d44a72c90030dac2e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): scripts/component_async_acceptance.py:15-83 | scripts/component_async_guest_cancellation_acceptance.py:15-77 | scripts/component_async_guest_exports_acceptance.py:14-107 | scripts/component_persistent_acceptance.py:15-74 | scripts/component_producer_acceptance.py:15-86 | scripts/component_reader_acceptance.py:15-84 | scripts/component_scheduler_wake_acceptance.py:13-70 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/component_async_acceptance.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"debd91f447661ba05b4ba28414fa3355e007fea678253eed85f48745a3a0cbf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/perry-codegen/src/codegen/closure.rs:474-1650 | crates/perry-codegen/src/codegen/entry.rs:133-1502 | crates/perry-codegen/src/codegen/entry/module_init.rs:33-709 | crates/perry-codegen/src/codegen/function.rs:634-1852 | crates/perry-codegen/src/codegen/method.rs:163-1755 | crates/perry-codegen/src/codegen/method_static.rs:34-586 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e8e12bd03439953a80b080f8be1dbfb4261eee264d61b8c614ba8e5632b670"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/perry-codegen/src/collectors/escape_arrays.rs:74-170 | crates/perry-codegen/src/collectors/escape_arrays.rs:219-317 | crates/perry-codegen/src/collectors/hot_callees.rs:358-434 | crates/perry-codegen/src/collectors/hot_callees.rs:625-708 | crates/perry-codegen/src/collectors/not_bigint_locals.rs:304-393 | crates/perry-codegen/src/layout_families.rs:325-400 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/escape_arrays.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb64af0a7d115d6a3a095393bd6d8800a10ff0cf6e63684162a33af02ec067e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/perry-codegen/src/collectors/integer_locals.rs:595-686 | crates/perry-codegen/src/collectors/proven_args.rs:224-311 | crates/perry-codegen/src/collectors/ptr_numarray.rs:585-673 | crates/perry-codegen/src/collectors/ptr_shape.rs:1202-1397 | crates/perry-codegen/src/collectors/ptr_shape_elements.rs:781-905 | crates/perry-codegen/src/collectors/sealed_buffers.rs:452-549 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/integer_locals.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a0eb8b532261f43bb4079dae9a0163724387612a9975a46ae73abe4d049ed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/perry-codegen/src/expr/calls/crypto_hash.rs:350-378 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:180-225 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:456-495 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:502-548 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:594-621 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:682-708 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/calls/crypto_hash.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"163727d9c4d0c82e9774e7c858c2d9fd39b10d40f9a1fd4a0b17f0db309c5f8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/perry-codegen/src/expr/calls/crypto_kdf.rs:14-32 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:64-94 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:180-225 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:269-301 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:308-338 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:628-646 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/calls/crypto_kdf.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec58f6474d2ab2a2fda6a791bc167325a55bce10cc74c3c2a88041f93e6dc127"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): scripts/component_async_acceptance.py:15-83 | scripts/component_http_acceptance.py:25-160 | scripts/component_p3_command_acceptance.py:44-93 | scripts/component_persistent_acceptance.py:15-74 | scripts/component_producer_acceptance.py:15-86 | scripts/component_reader_acceptance.py:15-84 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/component_async_acceptance.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"7509a6a4fc766a6bbf9d7700edd4216373ff20d9a93fab2f03097ddf15ef41cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/perry-codegen/src/collectors/all_pointer_arrays.rs:199-242 | crates/perry-codegen/src/collectors/hoisted_callback_calls.rs:36-119 | crates/perry-codegen/src/collectors/ptr_shape_elements.rs:1262-1305 | crates/perry-codegen/src/collectors/ptr_shape_returns.rs:769-812 | crates/perry-codegen/src/layout_desc.rs:574-642 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/all_pointer_arrays.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc51fcf748df8540c29d460e0d1b4b59aa71eb5318af75d3b87b84c4bc0d15b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/perry-codegen/src/lower_call/early_branches.rs:382-1225 | crates/perry-codegen/src/lower_call/func_ref.rs:832-1472 | crates/perry-codegen/src/lower_call/method_override.rs:783-1914 | crates/perry-codegen/src/lower_call/scalar_method.rs:858-1003 | crates/perry-codegen/src/lower_call/scalar_method.rs:1009-1224 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/early_branches.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"689a1f05476339860d6dc35118942612a23616a4a4b1a510f7e084cb8b4c3951"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/perry-codegen/src/lower_call/property_get.rs:58-148 | crates/perry-codegen/src/lower_call/property_get.rs:235-289 | crates/perry-codegen/src/lower_call/property_get/completed_object.rs:16-229 | crates/perry-codegen/src/lower_call/property_get/imported_object.rs:80-218 | crates/perry-codegen/src/lower_call/property_get/imported_object.rs:231-382 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/property_get.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b2b491458fdaa3e34f2131fd2faef54be9e3b80cde7d73fa61cac827b455c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/perry-hir/src/audit.rs:99-188 | crates/perry-hir/src/capability.rs:138-226 | crates/perry-hir/src/egress.rs:130-218 | crates/perry-hir/src/lockdown.rs:87-175 | crates/perry-hir/src/lower/expr_function.rs:1653-1760 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/audit.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"3933774621d58d8933ab28cb87185a7574ab5db161a74ef61a7f89c8c429d736"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): scripts/addr_class_inventory.py:324-350 | scripts/addr_class_inventory.py:684-712 | scripts/gc_store_site_inventory.py:254-280 | scripts/sso_unbox_inventory.py:384-404 | scripts/string_payload_access_inventory.py:243-265 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/addr_class_inventory.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3ef54a4728e15f78d10783d1848539b862e8086c7b8cfad232727aadbe4b16"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-codegen-arkts/src/mutations.rs:945-1064 | crates/perry-codegen-arkts/src/widgets/scroll.rs:32-161 | crates/perry-codegen-arkts/src/widgets/scroll.rs:183-313 | crates/perry-codegen-arkts/src/widgets/stack.rs:33-141 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-arkts/src/mutations.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f281707df8ec46b1e18310e00d73e7cbd6485130fdbb9acdb409911fc3ffb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-codegen-arkts/src/widgets/scroll.rs:32-161 | crates/perry-codegen-arkts/src/widgets/scroll.rs:183-313 | crates/perry-codegen-arkts/src/widgets/stack.rs:33-141 | crates/perry-codegen-arkts/src/widgets/structure.rs:25-124 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-arkts/src/widgets/scroll.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79a96dbd36508e4721bd6e805ea941b3b90f8e299c78d55196301c59365d17c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-codegen-glance/src/emit.rs:111-132 | crates/perry-codegen-glance/src/emit.rs:135-276 | crates/perry-codegen-glance/src/emit_glue.rs:9-163 | crates/perry-codegen-wear-tiles/src/emit_glue.rs:10-105 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-glance/src/emit.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2257991c58d77dd018ab3a2acf1a49902132f67f54d58f7a888ac2c42e4ca543"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-codegen-glance/src/emit.rs:718-727 | crates/perry-codegen-glance/src/emit_glue.rs:165-174 | crates/perry-codegen-wear-tiles/src/emit.rs:478-487 | crates/perry-codegen-wear-tiles/src/emit_glue.rs:107-116 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-glance/src/emit.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"6261c1124b5644e7e224cdd4ba9e6cced7df833722f309452b25a035f9ad8172"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-codegen/src/codegen/closure.rs:235-280 | crates/perry-codegen/src/codegen/closure.rs:288-333 | crates/perry-codegen/src/codegen/closure.rs:341-379 | crates/perry-codegen/src/codegen/closure.rs:387-423 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b6c21e04a4f5d14719dd38189c38dde1b6a582c851a23639aea3ab63d5397d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-codegen/src/codegen/method_trampolines.rs:91-145 | crates/perry-codegen/src/codegen/method_trampolines.rs:152-172 | crates/perry-codegen/src/codegen/method_trampolines.rs:192-389 | crates/perry-codegen/src/codegen/method_trampolines.rs:408-450 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/method_trampolines.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c56b1edc73fe67c2aa6766d729fd8a9b7f9de0927df933c920a30f65bdc6a3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-codegen/src/codegen/method_trampolines.rs:192-389 | crates/perry-codegen/src/expr/arrays_finds.rs:112-215 | crates/perry-codegen/src/expr/class_field_push.rs:14-123 | crates/perry-codegen/src/expr/u8_buffer_read.rs:272-337 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/method_trampolines.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"4947bd58762cda2cb5701d63bc3fc7393c940298b8760601f3e8df900016da17"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-codegen/src/collectors/escape_check.rs:232-1203 | crates/perry-codegen/src/collectors/escape_news.rs:235-939 | crates/perry-codegen/src/collectors/escape_objects.rs:411-718 | crates/perry-codegen/src/collectors/ptr_shape.rs:1417-1743 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/escape_check.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaacd24526a671394f09ab9de3d8060b3099a30bf22a21afa4d4286000f69020"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-codegen/src/collectors/hir_facts.rs:1177-1285 | crates/perry-codegen/src/collectors/shadow_slots.rs:77-157 | crates/perry-codegen/src/expr/closure.rs:28-87 | crates/perry-hir/src/lower/lower_module_fn.rs:25-177 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/hir_facts.rs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"191635aac1e8b937e15ffdc2e1f4653d2ad3aee88098d479c8fdaf0df3cbf7d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-codegen/src/collectors/hoisted_callback_calls.rs:286-415 | crates/perry-codegen/src/collectors/spec_abi_sites.rs:1340-1502 | crates/perry-codegen/src/collectors/straight_line_stores.rs:44-108 | crates/perry-hir/src/enums.rs:47-144 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/hoisted_callback_calls.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b219453cda27c1fe6c85a0272624e11ca6a214ef401eefa72e0b891b2292d3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-codegen/src/collectors/i32_locals.rs:55-150 | crates/perry-codegen/src/collectors/i32_locals.rs:771-783 | crates/perry-codegen/src/collectors/integer_locals.rs:741-833 | crates/perry-codegen/src/collectors/integer_locals.rs:1097-1161 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a01ea8523c790c9fa118db6b18f6b9bccaf57ac49886a704c4e73356039703a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-codegen/src/collectors/proven_args.rs:224-311 | crates/perry-codegen/src/collectors/scalar_method_dispatch.rs:907-982 | crates/perry-codegen/src/collectors/scalar_methods.rs:422-496 | crates/perry-codegen/src/expr/slot_rep.rs:721-972 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/proven_args.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddc9b799ef3758d5b52800675ebddac2dfa07e2db7ab3fc7bf0c94e5c28da5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-codegen/src/collectors/segview.rs:707-742 | crates/perry-codegen/src/collectors/segview.rs:1328-1363 | crates/perry-hir/src/analysis.rs:545-625 | crates/perry-hir/src/lower_decl/class_captures.rs:71-146 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/segview.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"62dfe0e1a73dc690c95505ac3174ede089df3379a12ad7f3d9bb486415245f53"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-codegen/src/collectors/typed_locals.rs:321-455 | crates/perry-codegen/src/stmt/region_loop/plan.rs:721-765 | crates/perry-codegen/src/type_analysis/numeric.rs:178-602 | crates/perry-codegen/src/type_analysis/numeric.rs:667-839 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/typed_locals.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"a249c219b8f02dd165796d4c65aeb1455753b2e47599824180c45cd1034227f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-codegen/src/expr/array_methods.rs:58-461 | crates/perry-codegen/src/expr/instance_misc1.rs:266-1682 | crates/perry-codegen/src/expr/logical_collections.rs:548-1710 | crates/perry-codegen/src/expr/url_main.rs:40-669 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/array_methods.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f742962e238e761925da31c9bcdd724f31e603fe0be364c1f97f4682e3bfc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-codegen/src/expr/array_push.rs:184-234 | crates/perry-codegen/src/expr/array_push.rs:282-336 | crates/perry-codegen/src/expr/write_barrier.rs:492-547 | crates/perry-codegen/src/expr/write_barrier.rs:829-892 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/array_push.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f7e7594875a87e80ac9487f5899320a7eeeca147c0410c7ff55eb88d37a910"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-codegen/src/expr/buffer_access.rs:488-539 | crates/perry-codegen/src/expr/buffer_access.rs:547-598 | crates/perry-codegen/src/expr/buffer_access.rs:655-727 | crates/perry-codegen/src/expr/buffer_access.rs:773-897 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/buffer_access.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94321abf0d19cf72f6c6309be773e759a5da28a4f4a2c999154028acea18fdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-codegen/src/expr/compare.rs:120-158 | crates/perry-codegen/src/expr/compare.rs:468-567 | crates/perry-codegen/src/expr/compare.rs:1083-1169 | crates/perry-codegen/src/expr/suffix_cursor.rs:15-97 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/compare.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a0843566ec32c239e5c22ebde7c7b79e6f3ae22be21c50f32d33c3f53b9903"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-codegen/src/expr/env_clones.rs:15-443 | crates/perry-codegen/src/expr/math_simple.rs:431-1274 | crates/perry-codegen/src/expr/misc_methods.rs:144-1211 | crates/perry-codegen/src/expr/string_regex_proc.rs:18-687 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/env_clones.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1846d0c980dc5ccabd591d870d280d0dce02049c968e1ae92cf8f382b9c20ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs:101-786 | crates/perry-codegen/src/expr/private_resume_frame.rs:26-46 | crates/perry-codegen/src/expr/private_resume_frame.rs:138-219 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:885-1176 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f5bda4c6fdcac526b3454c695af1aa5c5c55fa4b31af375bc5b4726e85fb81"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-codegen/src/expr/range_facts.rs:629-650 | crates/perry-codegen/src/expr/range_facts.rs:972-993 | crates/perry-codegen/src/stmt/loops.rs:8303-8401 | crates/perry-codegen/src/stmt/loops.rs:8408-8489 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/range_facts.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed57841955ae66fc262818d81de6e398a2b1504e3e7fe85854da014972ab908b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-codegen/src/expr/static_method.rs:183-810 | crates/perry-codegen/src/lower_array_method.rs:1116-1238 | crates/perry-codegen/src/lower_call/console_promise.rs:778-792 | crates/perry-codegen/src/lower_call/property_get/builtin_kind_guard.rs:287-334 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/static_method.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f563fbbe3c10668401b8ae0ae970d5e742cd4b0e72d8ed81cf24ade2bb39ea4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-codegen/src/expr/write_barrier.rs:212-241 | crates/perry-codegen/src/expr/write_barrier.rs:297-334 | crates/perry-codegen/src/expr/write_barrier.rs:358-386 | crates/perry-codegen/src/expr/write_barrier.rs:829-892 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/write_barrier.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc08d2fd4d417d83ff8b64f0f6d5f2e976169d457476abf4733b4687b496e3ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-codegen/src/linker.rs:1515-1531 | crates/perry-hir/src/lower/const_fold_fn.rs:115-131 | crates/perry-hir/src/lower/fn_ctor_env.rs:244-269 | crates/perry-runtime-manifest/src/realm_json.rs:35-87 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/linker.rs"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3807d37c7868657deeadab80b2f13096888baa2ee61ea4c939367acf33b1426"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-codegen/src/stmt/loops.rs:3706-4174 | crates/perry-codegen/src/stmt/loops.rs:7185-7793 | crates/perry-codegen/src/stmt/masked_window_region.rs:683-862 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:1541-1823 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":3706}}}],"partialFingerprints":{"codehealthFindingId/v1":"984680a1e7bf10444f53e427877708e90dad8d9d807c66f0b850aba21df9df78"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-codegen/src/stmt/loops.rs:8303-8401 | crates/perry-codegen/src/stmt/loops.rs:8408-8489 | crates/perry-codegen/src/stmt/loops.rs:8525-8569 | crates/perry-codegen/src/stmt/loops.rs:8585-8611 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":8303}}}],"partialFingerprints":{"codehealthFindingId/v1":"003ce0bf87bb13fea27d7517c43ea9f639484c718e696ba028db25949d3d417a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-ext-argon2/src/lib.rs:23-49 | crates/perry-ext-argon2/src/lib.rs:81-112 | crates/perry-ext-bcrypt/src/lib.rs:47-63 | crates/perry-ext-bcrypt/src/lib.rs:74-99 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-argon2/src/lib.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1103d18d32468ae6f949d27048190fddf2528b59e6d63ed1bd16e657ad164fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-ext-http/src/client_events.rs:107-119 | crates/perry-ext-http/src/client_events.rs:261-400 | crates/perry-ext-http/src/client_events.rs:632-726 | crates/perry-ext-http/src/client_events.rs:840-882 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-http/src/client_events.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"413b54fde9ec74c251845c9c54a50f3cb80cbe195421b696fbeed03b3f3f268e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-ext-http/src/server/http2_server/pump.rs:34-119 | crates/perry-ext-http/src/server/https_server.rs:423-512 | crates/perry-ext-http/src/server/request.rs:1016-1033 | crates/perry-ext-http/src/server/server.rs:1231-1386 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-http/src/server/http2_server/pump.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eabfdb418157dd2acaa262ddf7d6ee6df3f43fbf473506ffb8c70f6ccd712c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-ext-net/src/jsvalue.rs:232-260 | crates/perry-ext-net/src/jsvalue.rs:262-275 | crates/perry-ext-net/src/jsvalue.rs:277-310 | crates/perry-ext-net/src/jsvalue.rs:315-342 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-net/src/jsvalue.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b811c1c0956c024721817b3074a203fab5f9c42712ca0e563961d03236af975"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-ext-net/src/payload_abi.rs:318-327 | crates/perry-ext-net/src/payload_abi.rs:333-342 | crates/perry-ext-net/src/payload_abi.rs:374-383 | crates/perry-ext-net/src/payload_abi.rs:389-398 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-net/src/payload_abi.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb93565bcef408a260f65b11cb66cc77b926f0f1f665396c00007e0d0fdeabc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-ext-net/src/payload_events.rs:138-157 | crates/perry-ext-net/src/payload_events.rs:181-199 | crates/perry-ext-net/src/payload_server.rs:337-452 | crates/perry-ext-net/src/payload_socket.rs:911-941 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-net/src/payload_events.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"79701394044844fb4e8db19cbdf44a70ceeac337336972191873b7b67392ba2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-hir/src/audit.rs:62-97 | crates/perry-hir/src/capability.rs:78-129 | crates/perry-hir/src/egress.rs:95-121 | crates/perry-hir/src/lockdown.rs:59-80 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/audit.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ee0e390e33cdd1685aba0fcf0ddac0109ded3002dc057e861e592690251e97"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-hir/src/audit.rs:314-334 | crates/perry-hir/src/capability.rs:308-328 | crates/perry-hir/src/ir/constants.rs:477-498 | crates/perry-hir/src/ir/constants.rs:503-524 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/audit.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"8151ab92f867d952e6e7adec876bb941753e4b9dd2a1edeed41a6550c6a1cf0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-hir/src/dynamic_code.rs:79-91 | crates/perry-hir/src/lower/lower_module_fn.rs:785-803 | crates/perry-hir/src/lower/lower_module_fn.rs:810-828 | crates/perry-hir/src/lower/stmt.rs:129-172 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/dynamic_code.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a5b951afc229638189f2253dbead77ee5cbd37301f4c80a72cc2a45c421393"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-hir/src/lower/closure_analysis.rs:135-373 | crates/perry-hir/src/lower/closure_analysis.rs:464-681 | crates/perry-hir/src/lower/closure_analysis.rs:770-974 | crates/perry-hir/src/lower/closure_analysis.rs:1195-1450 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/closure_analysis.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"53011c8013bb309b3c9a2030c98e707174ff667cb6850da89b684167fa80b2ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-hir/src/lower/const_fold_fn.rs:642-671 | crates/perry-hir/src/lower/const_fold_fn.rs:851-905 | crates/perry-hir/src/lower/expr_call/intrinsics/eval_strict.rs:142-198 | crates/perry-hir/src/lower/fn_ctor_env.rs:149-182 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/const_fold_fn.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e4bcec6c9b58842b424ccf19000296a32779adfeac5349ed43b789ef76abad"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-hir/src/lower/expr_call/array_only_methods.rs:419-1444 | crates/perry-hir/src/lower/expr_call/imported_array_methods.rs:59-313 | crates/perry-hir/src/lower/expr_call/inline_array_methods.rs:16-240 | crates/perry-hir/src/lower/expr_call/local_array_methods.rs:167-1178 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/array_only_methods.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"59af7796faeac62ff8ca39c1b6d4a2cf295a9b0306486fcd91518921f254298c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-hir/src/lower/expr_call/mod.rs:192-205 | crates/perry-hir/src/lower/expr_call/native_module.rs:57-70 | crates/perry-hir/src/lower/expr_call/os.rs:87-100 | crates/perry-hir/src/lower/expr_member.rs:69-82 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/mod.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9e4b26e154cf22bf49d076fb85c67ef8f3372a936dc3b0286332f666ff69b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs:61-71 | crates/perry-hir/src/lower_decl/body_stmt.rs:105-2535 | crates/perry-hir/src/lower_decl/body_stmt/detect.rs:61-71 | crates/perry-hir/src/lower_decl/helpers.rs:15-25 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a799f31bd569c27fb5b68e19370ce1264568811fd2144ef3d41d3e9bece8f03"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs:83-97 | crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs:108-128 | crates/perry-hir/src/lower_decl/body_stmt/detect.rs:83-97 | crates/perry-hir/src/lower_decl/body_stmt/detect.rs:108-128 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85861a243d8ae48a17cc3c6417c38bc799b463d34173d82321e651ddd1661d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:523-566 | android-build/app/src/main/java/com/perry/app/PerryBridge.kt:585-618 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:674-717 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:736-769 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcf405e05b57507be277e5233fb3e64ee8a608a3e5156f1f870a1072c6bec15"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1318-1342 | android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1378-1399 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1897-1920 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1954-1975 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"0960f85e6c740745ddabd832944f464a65447c8b4d939b54cdc707db8229559d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1567-1585 | android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1587-1608 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:2140-2157 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:2159-2180 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1bec71bd4b79119600d8ec2f2282be3ae81ecfbfde0c46725fba62b2d30df0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): scripts/component_async_compound_resources_acceptance.py:15-109 | scripts/component_async_guest_cancellation_acceptance.py:15-77 | scripts/component_async_guest_resources_acceptance.py:19-107 | scripts/component_async_resource_cancel_acceptance.py:15-94 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/component_async_compound_resources_acceptance.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabc6f5411095d8514926c475195e516bf37399349f821d0c5a4957b9964d12e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1243\u20131283 lines \u00D7 2): crates/perry-hir/src/walker/expr_mut.rs:669-1951 | crates/perry-hir/src/walker/expr_ref.rs:670-1912 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/walker/expr_mut.rs\u0060 and \u0060crates/perry-hir/src/walker/expr_ref.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 2017 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/perry-hir/src/walker/expr_mut.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1e976748249b06a8b8adfd7f3c2c017cea2cc9f31df2d6aa326f0df9714963"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u2013559 lines \u00D7 6): crates/perry-codegen/src/collectors/escape_objects.rs:697-699 | crates/perry-hir/src/js_transform/imports.rs:1167-1168 | crates/perry-hir/src/monomorph/driver.rs:705-712 | crates/perry-hir/src/monomorph/update_call_sites.rs:542-549 | crates/perry-hir/src/walker/expr_mut.rs:10-568 | crates/perry-hir/src/walker/expr_ref.rs:11-569 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/monomorph/driver.rs\u0060 and \u0060crates/perry-hir/src/monomorph/update_call_sites.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 578 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/perry-codegen/src/collectors/escape_objects.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"76578ca6af34618554c08f596e050f0f5f04a7c275108363fe3ad2ca9abc72ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (169 lines \u00D7 2): crates/perry-codegen/src/collectors/i32_locals.rs:1590-1758 | crates/perry-codegen/src/collectors/refs.rs:671-839 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/i32_locals.rs\u0060 and \u0060crates/perry-codegen/src/collectors/refs.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 477 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/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e43ee9d75a69798a2fbbb86b389ab8002ea11185e3d93df7c5ac3d70844ebe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (132\u2013153 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/imported_array_methods.rs:117-269 | crates/perry-hir/src/lower/expr_call/inline_array_methods.rs:67-198 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/imported_array_methods.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/inline_array_methods.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 308 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/perry-hir/src/lower/expr_call/imported_array_methods.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26316f912ecd55aba818b4a010287e6b88ae3bbd61a09f739fbbd0e9e1f6038"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (135\u2013136 lines \u00D7 2): crates/perry-codegen/src/collectors/i32_locals.rs:1296-1430 | crates/perry-codegen/src/collectors/refs.rs:259-394 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/i32_locals.rs\u0060 and \u0060crates/perry-codegen/src/collectors/refs.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 477 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/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b33181e23b5d2b041dfc1840cea36c1ad6cd855a91c25f2d74454a04c969421"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (79\u2013117 lines \u00D7 2): crates/perry-hir/src/lower_decl/class_decl.rs:419-535 | crates/perry-hir/src/lower_decl/class_decl/from_ast.rs:214-292 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/class_decl.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/class_decl/from_ast.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 548 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/perry-hir/src/lower_decl/class_decl.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"338e8114c9d8b58daf17dfc4a5066053e652d036110015090221037c2fe8c4a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38\u2013105 lines \u00D7 2): crates/perry-hir/src/lower/expr_member.rs:436-540 | crates/perry-hir/src/lower/expr_member.rs:640-677 \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/perry-hir/src/lower/expr_member.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bdbef1cea60d37d9df2ae4112a797a9239c19768f7d98d77fd21652312b722"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (88\u201389 lines \u00D7 4): crates/perry-hir/src/audit.rs:100-188 | crates/perry-hir/src/capability.rs:139-226 | crates/perry-hir/src/egress.rs:131-218 | crates/perry-hir/src/lockdown.rs:88-175 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/audit.rs\u0060 and \u0060crates/perry-hir/src/capability.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 136 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/perry-hir/src/audit.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f7be2dac64dcaec70e01fe4f90a3bdd161d3b60523aa13863370ba41b07da3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (86\u201387 lines \u00D7 2): crates/perry-codegen-js/src/minify.rs:58-144 | crates/perry-codegen-wasm/src/minify.rs:55-140 \u2014 before extracting anything, compare \u0060crates/perry-codegen-js/src/minify.rs\u0060 and \u0060crates/perry-codegen-wasm/src/minify.rs\u0060 as WHOLE FILES: this scan already matched 5 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/perry-codegen-js/src/minify.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4411aa811f0795e9b4d6343f5643c8b3e26c6e14a843ec1550aba2d6478693"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (70\u201384 lines \u00D7 2): crates/perry-hir/src/lower_decl/class_decl.rs:992-1075 | crates/perry-hir/src/lower_decl/class_decl/from_ast.rs:569-638 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/class_decl.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/class_decl/from_ast.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 548 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/perry-hir/src/lower_decl/class_decl.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"690a50ae50aac1b71eb1e3c9d1bfc635f6ed3df7a7abee7615b9e2e64323b34f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (73 lines \u00D7 2): crates/perry-hir/src/walker/expr_mut.rs:583-655 | crates/perry-hir/src/walker/expr_ref.rs:584-656 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/walker/expr_mut.rs\u0060 and \u0060crates/perry-hir/src/walker/expr_ref.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 2017 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/perry-hir/src/walker/expr_mut.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e70a16c27f51998e3592826b0d72579ad6c121d916c6e38234b7aa0270ad54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (56\u201369 lines \u00D7 2): crates/perry-hir/src/lower_decl/class_decl.rs:829-897 | crates/perry-hir/src/lower_decl/class_decl/from_ast.rs:420-475 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/class_decl.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/class_decl/from_ast.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 548 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/perry-hir/src/lower_decl/class_decl.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"77da528dbf90768d7e639023a9dbc6de4b3c02a78d7619381e07f442e651fbf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (66\u201368 lines \u00D7 2): crates/perry-hir/src/lower_decl/class_decl.rs:264-331 | crates/perry-hir/src/lower_decl/class_decl/from_ast.rs:80-145 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/class_decl.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/class_decl/from_ast.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 548 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/perry-hir/src/lower_decl/class_decl.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd00f2987dd790162ebea52ac5917a451d67d4b3c5ec8d9c94f6f1fe3d0e98a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (64 lines \u00D7 2): crates/perry-codegen-js/src/minify.rs:150-213 | crates/perry-codegen-wasm/src/minify.rs:146-209 \u2014 before extracting anything, compare \u0060crates/perry-codegen-js/src/minify.rs\u0060 and \u0060crates/perry-codegen-wasm/src/minify.rs\u0060 as WHOLE FILES: this scan already matched 5 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/perry-codegen-js/src/minify.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"359f21551e89add19aa370c434a118677052cce4844eba9f5e482b07acfd3dc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (62 lines \u00D7 2): crates/perry-codegen/src/collectors/i32_locals.rs:1465-1526 | crates/perry-codegen/src/collectors/refs.rs:437-498 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/i32_locals.rs\u0060 and \u0060crates/perry-codegen/src/collectors/refs.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 477 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/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b7793691ada5018db6732b96cf402cec5fa4674354780ebcd5efe81666d3cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39\u201358 lines \u00D7 2): crates/perry-codegen/src/expr/this_super_call.rs:1415-1472 | crates/perry-codegen/src/expr/this_super_call.rs:1772-1810 \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/perry-codegen/src/expr/this_super_call.rs"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"08db6f39a47cf0cf0a5d7ed0581254a6738cad6a20981bb7a5bb33708bf78fa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (57\u201358 lines \u00D7 2): crates/perry-hir/src/lower_decl/class_decl.rs:933-990 | crates/perry-hir/src/lower_decl/class_decl/from_ast.rs:511-567 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/class_decl.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/class_decl/from_ast.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 548 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/perry-hir/src/lower_decl/class_decl.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd68c04b83cb7003c3e6c7484d8ca4aa129716aaf1b2581218b96632e6b116a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (57 lines \u00D7 2): crates/perry-codegen/src/dialect/mod.rs:1282-1338 | crates/perry-codegen/src/dialect/mod.rs:1392-1448 \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/perry-codegen/src/dialect/mod.rs"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"89df860ee8749cefe7c162a79c8feff2dc080b64c84b2e2a5084928fc0d926e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (51\u201353 lines \u00D7 6): crates/perry-codegen/src/codegen/closure.rs:1391-1441 | crates/perry-codegen/src/codegen/entry.rs:1001-1053 | crates/perry-codegen/src/codegen/entry/module_init.rs:481-533 | crates/perry-codegen/src/codegen/function.rs:1500-1550 | crates/perry-codegen/src/codegen/method.rs:782-832 | crates/perry-codegen/src/codegen/method_static.rs:457-507 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/entry.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 221 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c906a61ced4fc71bd2bf8b69021eae01059719ff1ac1107332c526a7f12d63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201351 lines \u00D7 2): crates/perry-hir/src/lower_decl/class_decl.rs:372-422 | crates/perry-hir/src/lower_decl/class_decl/from_ast.rs:185-205 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/class_decl.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/class_decl/from_ast.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 548 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/perry-hir/src/lower_decl/class_decl.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a39c21de92661125be1a954f1fc3335b24739c9ee2069d541a3268d096c873"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46\u201349 lines \u00D7 2): crates/perry-codegen/src/expr/arrays_finds.rs:1119-1167 | crates/perry-codegen/src/expr/arrays_finds.rs:1217-1262 \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/perry-codegen/src/expr/arrays_finds.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a75dd271a352aa725a2f73e6587c99192ecadc5280169b495796ebe2563bb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48\u201349 lines \u00D7 2): crates/perry-codegen/src/stmt/region_loop/plan.rs:898-946 | crates/perry-codegen/src/stmt/region_loop/plan.rs:1012-1059 \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/perry-codegen/src/stmt/region_loop/plan.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f77f4927d4a1a95b03675f611a6197c2ac01c4547db6d9b1659fd00509cbeed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/crypto.rs:42-90 | crates/perry-hir/src/lower/expr_call/crypto.rs:161-209 \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/perry-hir/src/lower/expr_call/crypto.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7848fc4a663db10b344881715c276f98da56d994cdbf33441b46ec17471246"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44\u201349 lines \u00D7 2): crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs:168-216 | crates/perry-hir/src/lower_decl/fn_decl.rs:283-326 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/fn_decl.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 126 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/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd14ba79698e9828083b09e643b58777060082a0740a8a69a7668b04972c9b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43\u201347 lines \u00D7 2): crates/perry-codegen/src/lower_string_method.rs:37-79 | crates/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs:294-340 \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/perry-codegen/src/lower_string_method.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ad08ce4bcb3aeb19282c469f89258580794c18c152abcf1a2de21077a4b6f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42\u201346 lines \u00D7 2): crates/perry-codegen-js/src/minify.rs:11-56 | crates/perry-codegen-wasm/src/minify.rs:11-52 \u2014 before extracting anything, compare \u0060crates/perry-codegen-js/src/minify.rs\u0060 and \u0060crates/perry-codegen-wasm/src/minify.rs\u0060 as WHOLE FILES: this scan already matched 5 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/perry-codegen-js/src/minify.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca086e0a47552cf7a9bfb93616ecd7db144f9eb92fe18cbc5ca410ba41d9905"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2): crates/perry-codegen/src/codegen/entry.rs:835-880 | crates/perry-codegen/src/codegen/entry/module_init.rs:315-360 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/entry.rs\u0060 and \u0060crates/perry-codegen/src/codegen/entry/module_init.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 473 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/perry-codegen/src/codegen/entry.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca724fe2bcf64efbc536b30d8f8e002fbc7e1cb267f4dad9c520a5d8280f6c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/globals.rs:695-740 | crates/perry-hir/src/lower/expr_call/module_static.rs:268-313 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/globals.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/module_static.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 296 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/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"7897c9333dc21bb6134101fc51fdd81f353de41699d239f553426a08d38a04a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45\u201346 lines \u00D7 2): crates/perry-hir/src/lower/expr_object.rs:1345-1389 | crates/perry-hir/src/lower/expr_object.rs:1608-1653 \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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dca486bdd4679e2ddea77dccd56afd8bfc686f72838410920cc8454f3d43667"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41\u201346 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:1693-1738 | crates/perry-hir/src/lower_decl/body_stmt.rs:2179-2219 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"847e3547a363aa8e03307912cf4c976c6ba3c5c13f066c6de1c3c6f3dc93e83f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40\u201344 lines \u00D7 2): crates/perry-codegen-swiftui/src/emit.rs:351-394 | crates/perry-codegen-swiftui/src/emit.rs:461-500 \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/perry-codegen-swiftui/src/emit.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e706bdcf89175cfa3e2b76fbfefa95b0680b8788ef942c2f20aba34948a640"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 3): crates/perry-codegen/src/collectors/all_pointer_arrays.rs:200-242 | crates/perry-codegen/src/collectors/ptr_shape_elements.rs:1263-1305 | crates/perry-codegen/src/collectors/ptr_shape_returns.rs:770-812 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/all_pointer_arrays.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7d6b290bdb2950342afce0d6ac34ce96ed8dfa87e3c489d34592ef9520628a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201343 lines \u00D7 2): crates/perry-hir/src/destructuring/pattern_binding.rs:492-528 | crates/perry-hir/src/destructuring/pattern_binding.rs:787-829 \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/perry-hir/src/destructuring/pattern_binding.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6a61a7c0d84ed49bf224cdd556a708f1c2a6a47871afb2fb391550da97e286"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40\u201341 lines \u00D7 2): crates/perry-codegen-arkts/src/widgets/scroll.rs:39-79 | crates/perry-codegen-arkts/src/widgets/structure.rs:33-72 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-arkts/src/widgets/scroll.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11ebbb840d2de9037a4503b32a92a6e031731fb1b1b566112c30a0bdf56eabb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:1279-1319 | crates/perry-hir/src/lower_decl/body_stmt.rs:1772-1812 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8a8986b73dc8801342461734a8603700a5f7014b467ea01b37caeb4c989296"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): crates/perry-codegen/src/collectors/param_ranges.rs:152-191 | crates/perry-codegen/src/layout_families.rs:334-373 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/param_ranges.rs\u0060 and \u0060crates/perry-codegen/src/layout_families.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 67 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/perry-codegen/src/collectors/param_ranges.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"291cb84a5b5c4b5a0273d4c4b3452722e68b042539cd4a4df2e8806ac3c633dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): crates/perry-codegen/src/collectors/sealed_buffers.rs:189-228 | crates/perry-hir/src/lexical_frames.rs:349-388 \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/perry-codegen/src/collectors/sealed_buffers.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c4b09f0ea2cfb66184dc2cb0ab4dd3ba5b281dbd29160b551c1a67420c07d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): crates/perry-ext-http/src/server/turnloop_serve/wire.rs:149-188 | crates/perry-http-server/src/wire.rs:155-194 \u2014 before extracting anything, compare \u0060crates/perry-ext-http/src/server/turnloop_serve/wire.rs\u0060 and \u0060crates/perry-http-server/src/wire.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 115 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/perry-ext-http/src/server/turnloop_serve/wire.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"59df7196d06ce6951f1b04f82e09c1874502ce033490884d35279d4495504fe9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201340 lines \u00D7 2): crates/perry-hir/src/lower/stmt.rs:935-974 | crates/perry-hir/src/lower_decl/body_stmt.rs:301-332 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 308 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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3937a56b9a422c8712c163e0215db14a3d076fd406bfb9b098b1e86f73bc01a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): crates/perry-codegen/src/collectors/i32_locals.rs:1549-1586 | crates/perry-codegen/src/collectors/refs.rs:558-595 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/i32_locals.rs\u0060 and \u0060crates/perry-codegen/src/collectors/refs.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 477 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/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbd6597b0e3686a22b478647db31cd055ed90eaa53d6f133b76eaf5a54e65c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201338 lines \u00D7 2): crates/perry-hir/src/lower/module_decl.rs:1339-1371 | crates/perry-hir/src/lower/module_decl.rs:1851-1888 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/module_decl.rs"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"8831782026862841ee397563d740e7d266ca0cb312a1f59a8dcec436db96f894"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36\u201337 lines \u00D7 2): crates/perry-codegen/src/collectors/escape_check.rs:496-531 | crates/perry-codegen/src/collectors/escape_news.rs:332-368 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/escape_check.rs\u0060 and \u0060crates/perry-codegen/src/collectors/escape_news.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 73 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/perry-codegen/src/collectors/escape_check.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"71982f5259ca430066e35531ee28f9434a117313cf322897a1eaaee8c2158c4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34\u201337 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:1027-1063 | crates/perry-hir/src/lower_decl/body_stmt.rs:1279-1312 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03976897461530a3b3fb70662a3f55822783c9e9f0e3b942cf9f75e1a41f2f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201336 lines \u00D7 2): crates/perry-codegen/src/expr/v8_interop.rs:80-108 | crates/perry-codegen/src/expr/v8_interop.rs:174-209 \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/perry-codegen/src/expr/v8_interop.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07f95b7e44936479dbe86855a8ea1748465d7ba0343f9d436dc89481e9a9bbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:594-629 | crates/perry-hir/src/lower_decl/body_stmt/for_await.rs:37-72 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt/for_await.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 72 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"985d519b7164c9f3f5012ffb5f7b8897b10a2b374fdba22de3c1be1bb99425e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201336 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:706-741 | crates/perry-hir/src/lower_decl/body_stmt.rs:1449-1480 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba9ac38ebcbc493cc582c5d27049ff5c1bfca822b5679789969d15151429e31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34\u201335 lines \u00D7 6): crates/perry-codegen/src/codegen/closure.rs:1298-1332 | crates/perry-codegen/src/codegen/entry.rs:904-937 | crates/perry-codegen/src/codegen/entry/module_init.rs:384-417 | crates/perry-codegen/src/codegen/function.rs:1404-1438 | crates/perry-codegen/src/codegen/method.rs:689-723 | crates/perry-codegen/src/codegen/method_static.rs:364-398 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/entry.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 221 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"0249764d11645bcd5689a6477a4a25b1bb740b80976d4520bf725faa8bcec719"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201335 lines \u00D7 2): crates/perry-hir/src/lower_decl/class_members.rs:622-656 | crates/perry-hir/src/lower_decl/private_members.rs:181-212 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/class_members.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/private_members.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 210 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/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e18fa5f1b8e3d7f0ddf03c58e814e5d376406debc35f04028882aeed4d055d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): crates/perry-hir/src/monomorph/infer.rs:265-299 | crates/perry-hir/src/monomorph/infer.rs:374-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":"crates/perry-hir/src/monomorph/infer.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cf137fd03c5136af7db5c404a2ff3def35ab4544337fd2cf7e7c9d1993fcb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201334 lines \u00D7 3): crates/perry-hir/src/lower/expr_function.rs:661-694 | crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs:105-133 | crates/perry-hir/src/lower_decl/private_members.rs:126-150 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_function.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 137 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/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b00bfe45697a51a66ddb5da8e584fa71be3855d33023918f48aa13430d0892c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): crates/perry-codegen/src/expr/helpers.rs:442-475 | crates/perry-hir/src/analysis/builtins.rs:47-80 \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/perry-codegen/src/expr/helpers.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c8fb237ff95caee6486ce36bd918b44666cf4b1a5d230db9dcd7c8cb4e8d32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201334 lines \u00D7 2): crates/perry-hir/src/lower/expr_assign.rs:1258-1287 | crates/perry-hir/src/lower/expr_assign.rs:1459-1492 \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/perry-hir/src/lower/expr_assign.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b597e2feb03ebd19ab998c051bed112ae2e3cddbcd631d78921a07b3d6226a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201334 lines \u00D7 2): crates/perry-hir/src/lower/stmt.rs:1282-1310 | crates/perry-hir/src/lower_decl/body_stmt.rs:812-845 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 308 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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"78cb57964dd65cf57565f63faabf66610a0006172a3883411758044b86ecf276"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201333 lines \u00D7 4): crates/perry-codegen/src/lower_call/native/mod.rs:395-427 | crates/perry-codegen/src/lower_call/native/mod.rs:450-482 | crates/perry-codegen/src/lower_call/native/mod.rs:520-551 | crates/perry-codegen/src/lower_call/native/mod.rs:573-604 \u2014 all 4 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/perry-codegen/src/lower_call/native/mod.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b49394411cb3c30abcad061e54fbb22114a56f9e4460e72bf18771e1785215"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): crates/perry-codegen/src/boxed_vars.rs:1159-1191 | crates/perry-codegen/src/boxed_vars.rs:1372-1404 \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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"b463e9cb1d3fba51224f9d42c73b0ef8dfde0c3bb6013bcd563609158f55b113"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:5211-5243 | crates/perry-codegen/src/stmt/loops.rs:5263-5295 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":5211}}}],"partialFingerprints":{"codehealthFindingId/v1":"9755aa25b8a192407d65119a2f70944a2609a5a530cc7db8677cf432d727ef26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201333 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/array_only_methods.rs:1208-1240 | crates/perry-hir/src/lower/expr_call/array_only_methods.rs:1250-1276 \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/perry-hir/src/lower/expr_call/array_only_methods.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f4b464079590e60c756407b3b0c07bdc40252aeada19de30bd33546ae9fcf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/imported_array_methods.rs:276-308 | crates/perry-hir/src/lower/expr_call/inline_array_methods.rs:205-237 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/imported_array_methods.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/inline_array_methods.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 308 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/perry-hir/src/lower/expr_call/imported_array_methods.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"758a1735aea6cea9171632dce2efd3b4bdaaf78d6fd17bdcf9345f5d1b28d495"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/globals.rs:766-797 | crates/perry-hir/src/lower/expr_call/module_static.rs:343-374 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/globals.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/module_static.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 296 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/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2925f1b3b60bfc883605ec17952b058bfb9aa4430e3d66d01c1e247d84bc46e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201332 lines \u00D7 2): crates/perry-hir/src/lower/expr_function.rs:302-333 | crates/perry-hir/src/lower_decl/fn_decl.rs:169-194 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_function.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/fn_decl.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 94 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/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"059e24d882a6049d7ff2e4f4b06a87c94bcd37882a9f9596fdf01376b71371c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201332 lines \u00D7 2): crates/perry-hir/src/lower/stmt.rs:1394-1424 | crates/perry-hir/src/lower_decl/body_stmt.rs:928-959 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 308 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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b1fae225489494db350254e1ba0f1b839deb1d3684abd97c0b3834d1456c3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201332 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:857-888 | crates/perry-hir/src/lower_decl/body_stmt.rs:1579-1605 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3388a483004c76cd105d5cd5d4987d37fefcac3a3cca83a7fcac6181a68190"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201332 lines \u00D7 2): crates/perry-hir/src/lower_decl/class_members.rs:949-980 | crates/perry-hir/src/lower_decl/private_members.rs:342-372 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/class_members.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/private_members.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 210 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/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4acb2edf1706e02f0d997508fc4535b8dbda62400c35dfae165e893a01f4a55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201332 lines \u00D7 2): crates/perry-hir/src/lower_patterns.rs:1147-1176 | crates/perry-hir/src/lower_patterns.rs:1221-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_patterns.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5367757d9dbc0974c39950ecd8e37c8339bd6b35ce648422dc8b4e828be6c74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201331 lines \u00D7 2): crates/perry-codegen-arkts/src/widgets/stack.rs:84-114 | crates/perry-codegen-arkts/src/widgets/structure.rs:66-92 \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/perry-codegen-arkts/src/widgets/stack.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fe6778c8f83b7dd0e0c0ef646dbf2063ad9c9addb00c9e4fde84f1eb210e99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201331 lines \u00D7 2): crates/perry-codegen/src/expr/logical_collections.rs:1385-1406 | crates/perry-codegen/src/expr/logical_collections.rs:1422-1452 \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/perry-codegen/src/expr/logical_collections.rs"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d58ebf717b463028d37650240faad0891c726d89bf2efe3c498a5c2c7db28e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201331 lines \u00D7 2): crates/perry-ext-http/src/client_events.rs:370-400 | crates/perry-ext-http/src/client_events.rs:698-726 \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/perry-ext-http/src/client_events.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1fe48360485c8de30fec7bdac9fa77483d7625ca53ed83d739b87d7046e88e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201331 lines \u00D7 2): crates/perry-hir/src/lower/expr_object.rs:1433-1453 | crates/perry-hir/src/lower/expr_object.rs:1652-1682 \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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc51499bdc64fa6d0d8362af84660490c3a1fa9f30a610dd46aeedfdc72513e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): crates/perry-hir/src/monomorph/update_call_sites.rs:580-610 | crates/perry-hir/src/monomorph/update_call_sites.rs:638-668 \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/perry-hir/src/monomorph/update_call_sites.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"1506f5f866bd6657868313bb50d9e99759e084fa56168ab96b002dbc97f7b7f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/perry-codegen/src/codegen/class_artifacts.rs:313-342 | crates/perry-codegen/src/codegen/class_artifacts.rs:444-473 \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/perry-codegen/src/codegen/class_artifacts.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"484409f08df1be6cda57218ac480330ee9af5cadff6e201dd46d4383913b7f35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 4): crates/perry-codegen/src/lower_call/early_branches.rs:817-845 | crates/perry-codegen/src/lower_call/early_branches.rs:918-946 | crates/perry-codegen/src/lower_call/early_branches.rs:1022-1050 | crates/perry-codegen/src/lower_call/early_branches.rs:1129-1157 \u2014 all 4 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/perry-codegen/src/lower_call/early_branches.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"07aaaaa6f87a556ae6c9fc6a850a7a5b9fb5f64f99d7358855e18968cbc2dbd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): crates/perry-codegen/src/codegen/entry.rs:964-992 | crates/perry-codegen/src/codegen/entry/module_init.rs:444-472 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/entry.rs\u0060 and \u0060crates/perry-codegen/src/codegen/entry/module_init.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 473 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/perry-codegen/src/codegen/entry.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9dafc9fabbb1b5b2e2f34a4314d9edeab6d26576208330f127128d1267496d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): crates/perry-codegen/src/expr/bigint_set.rs:988-1016 | crates/perry-codegen/src/expr/bigint_set.rs:1244-1272 \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/perry-codegen/src/expr/bigint_set.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"43391bd751677400a0a18228e71fd3d7c391614ce72e89754641ea47bea95f83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): crates/perry-codegen/src/expr/binary.rs:1114-1142 | crates/perry-codegen/src/expr/mod.rs:4039-4067 \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/perry-codegen/src/expr/binary.rs"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a478fa35090efcbbf66543bbef8450650295647a583b54336b0a2d254219f31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201329 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:1356-1384 | crates/perry-hir/src/lower_decl/body_stmt.rs:1828-1854 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b207b4fea31a579cd5f0d1187d1070b5aaadfff515eac9c431b06cef6f7e0d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 3): crates/perry-codegen/src/codegen/split_regions_facts.rs:60-86 | crates/perry-codegen/src/scope_env/analysis.rs:314-340 | crates/perry-hir/src/lower/shared_mutable_capture.rs:1314-1341 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/split_regions_facts.rs\u0060 and \u0060crates/perry-hir/src/lower/shared_mutable_capture.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/split_regions_facts.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"65af69b05e2b5cfefa6855c5181a3b9027ab42a25b74df6f5a27933d9ab154b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/perry-codegen/src/codegen/entry.rs:1180-1207 | crates/perry-codegen/src/codegen/entry/module_init.rs:648-675 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/entry.rs\u0060 and \u0060crates/perry-codegen/src/codegen/entry/module_init.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 473 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/perry-codegen/src/codegen/entry.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"401d79c76009ef02a26d521fc80e205626293123e97218784a7a227ec38cd8be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201328 lines \u00D7 2): crates/perry-codegen/src/collectors/hot_callees.rs:126-153 | crates/perry-codegen/src/collectors/hot_callees.rs:225-246 \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/perry-codegen/src/collectors/hot_callees.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"773f7f26a990012a532ca966e2869bad8a559494de87fb213c523c81fcde52f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201328 lines \u00D7 2): crates/perry-codegen/src/expr/static_method.rs:617-644 | crates/perry-codegen/src/lower_call/namespace_call.rs:315-327 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/static_method.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/namespace_call.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 80 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/perry-codegen/src/expr/static_method.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1b6508577300de0b724a6d62e8c8355ef6d4381d676ab4454e30fdf9221c1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201328 lines \u00D7 2): crates/perry-codegen/src/expr/static_method.rs:692-706 | crates/perry-codegen/src/lower_call/namespace_call.rs:382-409 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/static_method.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/namespace_call.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 80 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/perry-codegen/src/expr/static_method.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f48a545d85bbc861365de8e9544dd877fcf4a40302af26177a781c338b3d044"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201328 lines \u00D7 2): crates/perry-codegen/src/module.rs:1001-1020 | crates/perry-codegen/src/module.rs:1043-1070 \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/perry-codegen/src/module.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c873612547311590fa486510cbb2e19fc07ec3be2b4f0975d4289a4b06e80b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201328 lines \u00D7 2): crates/perry-hir/src/lower/module_decl.rs:672-699 | crates/perry-hir/src/lower/module_decl.rs:751-772 \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/perry-hir/src/lower/module_decl.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dbd64dbdde690b772fc3c485dfb45e012d3c0a61276c0c55f44a548221d302"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/perry-codegen/src/codegen/method_entries.rs:45-71 | crates/perry-codegen/src/codegen/method_entries.rs:145-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/method_entries.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"df778bd0da32224fd44131fbbe84084cd03a045b06ecacab0efc02a53114c401"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201327 lines \u00D7 2): crates/perry-codegen/src/stmt/let_stmt.rs:1506-1532 | crates/perry-codegen/src/stmt/let_stmt.rs:1533-1554 \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/perry-codegen/src/stmt/let_stmt.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f1c86cfaac0b6954685407b7de338cb28f5b3b3b7a0385921c3272d5811fc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201327 lines \u00D7 2): crates/perry-codegen/src/typed_shape.rs:173-186 | crates/perry-codegen/src/typed_shape.rs:204-230 \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/perry-codegen/src/typed_shape.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4300f43d6e566338a9c348f621506c47a88db753a005c2e401205d897c42d4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/perry-ext-http/src/server/handle_dispatch.rs:504-530 | crates/perry-ext-http/src/server/handle_dispatch.rs:535-561 \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/perry-ext-http/src/server/handle_dispatch.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ea84d17cf2975730f725ff0e610f141239300a3dd7e1f2124a7dc94afe0a69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201327 lines \u00D7 2): crates/perry-ext-http/src/server/server.rs:1313-1329 | crates/perry-ext-http/src/server/server.rs:1359-1385 \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/perry-ext-http/src/server/server.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a031e2b4323d65da10c236fdfaa3e3e65fbb63f228515264631e5b050782526"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/perry-ext-http/src/server/turnloop_serve/wire.rs:75-101 | crates/perry-http-server/src/wire.rs:87-113 \u2014 before extracting anything, compare \u0060crates/perry-ext-http/src/server/turnloop_serve/wire.rs\u0060 and \u0060crates/perry-http-server/src/wire.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 115 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/perry-ext-http/src/server/turnloop_serve/wire.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"009c1383d40ed167457042ac1c195d1e4bba3c01d734d74988f820f4ba2d02e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/module_static.rs:165-191 | crates/perry-hir/src/lower/expr_call/module_static.rs:619-645 \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/perry-hir/src/lower/expr_call/module_static.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e8983b851dba7fa8f92ba59c8b8cd07eb9fb14bd327c3c5994f5f57a6fa42a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/stream.rs:18-44 | crates/perry-hir/src/lower/expr_member/native_dispatch.rs:176-202 \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/perry-hir/src/lower/expr_call/stream.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"955246a11e6da8902316ef8151543fe65e88ef6a8d7e3b88268fad8ba98901ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/perry-hir/src/lower/lower_expr/reactive_text.rs:169-195 | crates/perry-hir/src/lower/widget_decl/reactive_animate.rs:247-273 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/lower_expr/reactive_text.rs\u0060 and \u0060crates/perry-hir/src/lower/widget_decl/reactive_animate.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 87 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/perry-hir/src/lower/lower_expr/reactive_text.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6479c50e5f3f182dc804777652c469106945a17ef43f315bfbef2a8f7433a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:1498-1524 | crates/perry-hir/src/lower_decl/body_stmt.rs:1983-2008 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa90c44c56bf3a67041b9eaa4f7a480fe73fa12654d7fa70ef7175136f15e25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201327 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:1527-1551 | crates/perry-hir/src/lower_decl/body_stmt.rs:2011-2037 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":1527}}}],"partialFingerprints":{"codehealthFindingId/v1":"5586e2eb39f5e9bd36da4f0c49b8d1d1eacb5473fe7d8d23426eccd35adf23e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201326 lines \u00D7 4): crates/perry-hir/src/monomorph/infer.rs:287-312 | crates/perry-hir/src/monomorph/infer.rs:396-421 | crates/perry-hir/src/monomorph/update_call_sites.rs:600-621 | crates/perry-hir/src/monomorph/update_call_sites.rs:658-679 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/monomorph/infer.rs\u0060 and \u0060crates/perry-hir/src/monomorph/update_call_sites.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 128 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/perry-hir/src/monomorph/infer.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f99fdb8069f367d0b522c20be96283e64fde74ec7adf6ce3e3858281b1878d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201326 lines \u00D7 3): crates/perry-codegen/src/lower_call/early_branches.rs:452-477 | crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:444-450 | crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:1100-1106 \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/perry-codegen/src/lower_call/early_branches.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cedcf2812d5dd1755b7c0ae06cb18c3a57cd9c8144123c3215a77e513185ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201326 lines \u00D7 2): crates/perry-codegen-glance/src/emit.rs:552-577 | crates/perry-codegen-wear-tiles/src/emit.rs:374-397 \u2014 before extracting anything, compare \u0060crates/perry-codegen-glance/src/emit.rs\u0060 and \u0060crates/perry-codegen-wear-tiles/src/emit.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 144 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/perry-codegen-glance/src/emit.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"3563595cd8c2f194b33f741b01276ba8174bda593926d4131ec9a7aec906c58b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201326 lines \u00D7 2): crates/perry-codegen/src/dialect/mod.rs:1106-1128 | crates/perry-codegen/src/dialect/mod.rs:1645-1670 \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/perry-codegen/src/dialect/mod.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"50dea64ffd14220b8eab302c0a7b456d4e774c16fb8d21988da856b7f75df817"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201326 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:8526-8551 | crates/perry-codegen/src/stmt/loops.rs:8586-8601 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":8526}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae7edd2412875aaa6047a03bbd8ffb0d3ecf3f9f948c2768c3468ce18063a44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201326 lines \u00D7 2): crates/perry-component-host/src/async_values/reader.rs:39-64 | crates/perry-component-host/src/async_values/writer.rs:31-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-component-host/src/async_values/reader.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"883b84172f46de353160b18bd8de5a3035abfad3c52b5ea047c48ff088f8ea7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/perry-ext-http/src/server/http2_server/controls.rs:131-156 | crates/perry-ext-http/src/server/http2_server/controls.rs:198-223 \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/perry-ext-http/src/server/http2_server/controls.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecec98d02bbd6bd8b6c7e30e6858386b901a18df92a37f1949026ae116c1e23d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201326 lines \u00D7 2): crates/perry-hir/src/destructuring/assignment_expr.rs:108-133 | crates/perry-hir/src/destructuring/assignment_expr.rs:203-226 \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/perry-hir/src/destructuring/assignment_expr.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f822c5e18c6641b5dddb76f79802f27f16b696e48238ddc592e0ee511f100c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201326 lines \u00D7 2): crates/perry-hir/src/lower/expr_function.rs:1379-1398 | crates/perry-hir/src/lower/expr_object.rs:344-369 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_function.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_object.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 63 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/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1920b9154fe445b665e0993c9a3149f876f683a1fe01494cabf2d104bf0110f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 5): crates/perry-codegen/src/lower_call/method_override.rs:1277-1301 | crates/perry-codegen/src/lower_call/method_override.rs:1362-1386 | crates/perry-codegen/src/lower_call/method_override.rs:1447-1471 | crates/perry-codegen/src/lower_call/method_override.rs:1534-1558 | crates/perry-codegen/src/lower_call/method_override.rs:1622-1646 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/method_override.rs"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f008160ff1c759d251b05872660c5ef3ab4899d036e6c6767abe0697123257"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 4): crates/perry-codegen/src/collectors/refs.rs:609-633 | crates/perry-hir/src/js_transform/imports.rs:1248-1272 | crates/perry-hir/src/walker/expr_mut.rs:1879-1903 | crates/perry-hir/src/walker/expr_ref.rs:1850-1874 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/walker/expr_mut.rs\u0060 and \u0060crates/perry-hir/src/walker/expr_ref.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 2017 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/perry-codegen/src/collectors/refs.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd58d42cfc1bf70e28a079739846a5b28c07e8b2216e38957dc34407932e862"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 3): crates/perry-codegen/src/codegen/closure.rs:1170-1193 | crates/perry-codegen/src/codegen/function.rs:1317-1341 | crates/perry-codegen/src/codegen/method.rs:605-629 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/function.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 320 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"5daf7b196080eba8589a442179d48d8fda3e4f8d8a09b3dc91020915ddefa096"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/perry-codegen-arkts/src/mutations.rs:499-523 | crates/perry-codegen-arkts/src/mutations.rs:530-554 \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/perry-codegen-arkts/src/mutations.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f5cabf90ef812c5c56ab7086c5d601682062ff3581875ffa55fa9423a898af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/perry-codegen/src/collectors/i32_locals.rs:1438-1462 | crates/perry-codegen/src/collectors/refs.rs:410-434 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/i32_locals.rs\u0060 and \u0060crates/perry-codegen/src/collectors/refs.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 477 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/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8c723a0b57725ecc0cb319a3b9bd173a52a67c3a8ae95d2dade271d0a542b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/perry-codegen/src/collectors/ptr_numarray.rs:619-643 | crates/perry-codegen/src/collectors/ptr_shape.rs:1343-1367 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/ptr_numarray.rs\u0060 and \u0060crates/perry-codegen/src/collectors/ptr_shape.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 165 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/perry-codegen/src/collectors/ptr_numarray.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b367597e15ac3756aa77bff928ac100202aaabb96c5e729be32377beb592977"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201325 lines \u00D7 2): crates/perry-codegen/src/expr/url_main.rs:502-526 | crates/perry-codegen/src/expr/url_main.rs:596-607 \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/perry-codegen/src/expr/url_main.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2740d3cc3e546c6a0b4d40fab91147c78c28bff1ac01537ad6dd1ac3b6767c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201325 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:5518-5538 | crates/perry-codegen/src/stmt/loops.rs:5590-5614 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":5518}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8641dc22eba462cedb78601a99e62356a962990aa06594e53aec8099ef123a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201325 lines \u00D7 2): crates/perry-ext-http/src/server/turnloop_serve/conn.rs:1115-1139 | crates/perry-http-server/src/conn.rs:898-917 \u2014 before extracting anything, compare \u0060crates/perry-ext-http/src/server/turnloop_serve/conn.rs\u0060 and \u0060crates/perry-http-server/src/conn.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 65 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/perry-ext-http/src/server/turnloop_serve/conn.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0b6ef2267ff603da96d663c05c6d18d7cbf631ac2b687cc2c37d223a7d62d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201325 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs:146-170 | crates/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs:468-488 \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/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"673985b5d98d018957f4460e257ed15333db2f6b9f19a1d91ce7eb2cc7044bd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): crates/perry-hir/src/lower/expr_function.rs:339-361 | crates/perry-hir/src/lower_decl/fn_decl.rs:196-220 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_function.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/fn_decl.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 94 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/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f20fe7c4e62ba20a7f3a186eb9118c370e8c2a9d3b270f92991fc1640f1d1ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/perry-hir/src/lower/lower_expr/reactive_text.rs:210-234 | crates/perry-hir/src/lower/widget_decl/reactive_animate.rs:288-312 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/lower_expr/reactive_text.rs\u0060 and \u0060crates/perry-hir/src/lower/widget_decl/reactive_animate.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 87 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/perry-hir/src/lower/lower_expr/reactive_text.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cb3fb4332b246e0af1a3f9977d4405d85d8b4a915de80055f0f9439a7a6fcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3): crates/perry-hir/src/lower_decl/class_captures.rs:723-746 | crates/perry-hir/src/lower_decl/class_captures.rs:770-793 | crates/perry-hir/src/lower_decl/class_captures.rs:821-844 \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/perry-hir/src/lower_decl/class_captures.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff65e110a6d0b3eb27e70378fd889c8b0d3e59add2a0a6040e174114ebeead1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): crates/perry-codegen/src/codegen/method.rs:365-388 | crates/perry-codegen/src/codegen/method_static.rs:82-104 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/method.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method_static.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 341 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/perry-codegen/src/codegen/method.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"d323b1d7de0a8f546e536bfe386d85afc904e00ce441c758c84454ad87b7fd9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201324 lines \u00D7 2): crates/perry-codegen/src/codegen/mod.rs:1464-1481 | crates/perry-codegen/src/codegen/mod.rs:1648-1671 \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/perry-codegen/src/codegen/mod.rs"},"region":{"startLine":1464}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26630a189bf449ab5fb79473576e127dc975ab9fa2921f123843bd1db305f50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): crates/perry-codegen/src/collectors/escape_check.rs:301-324 | crates/perry-codegen/src/collectors/escape_check.rs:339-360 \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/perry-codegen/src/collectors/escape_check.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"8585ece2c2c7e91c7a55fb613e69aeb8e20b63ba5dc77766fbf672eb5f4ff627"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201324 lines \u00D7 2): crates/perry-codegen/src/lower_call/extern_func.rs:1518-1531 | crates/perry-codegen/src/lower_call/func_ref.rs:990-1013 \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/perry-codegen/src/lower_call/extern_func.rs"},"region":{"startLine":1518}}}],"partialFingerprints":{"codehealthFindingId/v1":"873a6ac99573af7edbd11d8a2aaaa2af885441ec5a446ac18e6250c16977d27e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:8346-8369 | crates/perry-codegen/src/stmt/loops.rs:8433-8456 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":8346}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c258a278854df693f1cff4ead4cc2bfd624b37a2bf4ddf4461962bfcea8389"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): crates/perry-codegen/src/type_analysis/strings.rs:390-413 | crates/perry-codegen/src/type_analysis/strings.rs:578-600 \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/perry-codegen/src/type_analysis/strings.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc45a18c8e1e76384e7d97eecb223dfe9f4b1e0233f827377cb591563f0aae1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201324 lines \u00D7 2): crates/perry-hir/src/lower/expr_assign.rs:1021-1039 | crates/perry-hir/src/lower/expr_member/member_tail.rs:901-924 \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/perry-hir/src/lower/expr_assign.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6518045553628f59554a320b3cf1a00ab78fdb5db4116946b8c2467e483ed0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201324 lines \u00D7 2): crates/perry-hir/src/lower/expr_function.rs:625-648 | crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs:83-97 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_function.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 137 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/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ff65adea4e656b8744eb2f4274543e447c93a9da21e1cc029560f1c1206a7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201324 lines \u00D7 2): crates/perry-hir/src/lower_decl/class_decl.rs:762-785 | crates/perry-hir/src/lower_decl/class_decl/from_ast.rs:360-376 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/class_decl.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/class_decl/from_ast.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 548 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/perry-hir/src/lower_decl/class_decl.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ba72b4c4e7cabbf0f117ffa7a204f2f64abc06fcfb2bdde264867f8615c012"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 4): crates/perry-codegen/src/collectors/typed_locals.rs:346-368 | crates/perry-codegen/src/stmt/region_loop/plan.rs:736-757 | crates/perry-codegen/src/type_analysis/numeric.rs:293-314 | crates/perry-codegen/src/type_analysis/numeric.rs:813-835 \u2014 there are 4 copies across 3 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/typed_locals.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"c570bd51b6b9e36fe8ea7da262435cf9edeb3e9492292a560908587b20121992"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): crates/perry-codegen/src/codegen/entry.rs:820-842 | crates/perry-codegen/src/codegen/entry/module_init.rs:300-322 | crates/perry-codegen/src/codegen/method_static.rs:279-301 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/entry.rs\u0060 and \u0060crates/perry-codegen/src/codegen/entry/module_init.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 473 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/perry-codegen/src/codegen/entry.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"6142a24f59d3fd5fbd1331c9d1d41d16962793344d7c6aad0e0e60eca97b9705"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): crates/perry-codegen/src/codegen/ordinary_method_artifacts.rs:155-177 | crates/perry-codegen/src/codegen/ordinary_method_artifacts.rs:243-265 | crates/perry-codegen/src/codegen/ordinary_method_artifacts.rs:329-351 \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/perry-codegen/src/codegen/ordinary_method_artifacts.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8dc10eafe52614809316b2b98cc284b2e2052363419ee4f252c728a4b85074"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/perry-codegen/src/codegen/class_artifacts.rs:289-311 | crates/perry-codegen/src/codegen/class_artifacts.rs:420-442 \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/perry-codegen/src/codegen/class_artifacts.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa211fd62c88b3456c284fc14f5ba3fc6322255208d95ba1fe39aea79e831d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): crates/perry-codegen/src/codegen/mod.rs:1545-1567 | crates/perry-codegen/src/codegen/mod.rs:1691-1711 \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/perry-codegen/src/codegen/mod.rs"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb6a12f9f04e04dd5c222d9bec5e5394208d6800dba520422bcc36590eadcf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): crates/perry-codegen/src/dialect/mod.rs:1140-1161 | crates/perry-codegen/src/dialect/mod.rs:1686-1708 \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/perry-codegen/src/dialect/mod.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"4adbf08616b495bcb1f1730a5d2de5069d79e02d5f8136155961f88265dc857d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201323 lines \u00D7 2): crates/perry-codegen/src/expr/this_super_call.rs:484-506 | crates/perry-codegen/src/expr/this_super_call.rs:517-535 \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/perry-codegen/src/expr/this_super_call.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7414a744b6e375cee00f35182843a145001ccfb4d055390f821d5ca61d7f7c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/perry-codegen/src/expr/this_super_call.rs:1747-1769 | crates/perry-codegen/src/lower_call/new_error_init.rs:48-70 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/this_super_call.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/new_error_init.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 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/perry-codegen/src/expr/this_super_call.rs"},"region":{"startLine":1747}}}],"partialFingerprints":{"codehealthFindingId/v1":"29920aabd7d5b05dd2c2dfd681bf3ed468282ec61dc931002fc09a8f8360e797"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/perry-codegen/src/lower_call/scalar_method.rs:918-940 | crates/perry-codegen/src/lower_call/scalar_method.rs:1135-1157 \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/perry-codegen/src/lower_call/scalar_method.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ebb83abdfcb454e16ca5ec2b1c707efe1f003e6eed1905f3df3c68399ceb99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/perry-codegen/src/lower_string_method.rs:566-588 | crates/perry-codegen/src/lower_string_method.rs:754-776 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_string_method.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3ddcb0efa88e8ea8bae2f35d4e812b63b01ec47d6914db11036f1d1a809346"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201323 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/globals.rs:744-762 | crates/perry-hir/src/lower/expr_call/module_static.rs:317-339 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/globals.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/module_static.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 296 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/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d79787d4a9d1c53fd9f9b1bdcd72c127ce857da80abdc8ef522a8e16b71e17e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/nested_namespace.rs:277-299 | crates/perry-hir/src/lower/expr_call/nested_namespace.rs:352-374 \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/perry-hir/src/lower/expr_call/nested_namespace.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a3153a1281f5ee12e8301cb4d7b099ed1e453d409f9349d86450dbc029013a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201323 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:767-789 | crates/perry-hir/src/lower_decl/body_stmt.rs:1503-1518 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a260199c22ad2a89400effea48616b3583d3c4603b973e8e6d7ed4706c3a286"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201322 lines \u00D7 4): crates/perry-codegen/src/codegen/closure.rs:1593-1609 | crates/perry-codegen/src/codegen/entry.rs:1477-1493 | crates/perry-codegen/src/codegen/entry/module_init.rs:686-707 | crates/perry-codegen/src/codegen/function.rs:1819-1835 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/entry.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 221 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"19bac154eba4dd0d8d7097d642ff249b28b80f67d67ac00e7812c872f079230c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 4): crates/perry-codegen/src/codegen/typed_abi.rs:946-967 | crates/perry-codegen/src/codegen/typed_abi.rs:1012-1033 | crates/perry-codegen/src/codegen/typed_abi.rs:1070-1091 | crates/perry-codegen/src/codegen/typed_abi.rs:1141-1162 \u2014 all 4 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/perry-codegen/src/codegen/typed_abi.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"27de922a330ede18e36e2060dd5d7a4811e07167cc536e46cbe565fe5bdfbc2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 4): crates/perry-codegen/src/collectors/integer_locals.rs:623-644 | crates/perry-codegen/src/collectors/ptr_numarray.rs:607-628 | crates/perry-codegen/src/collectors/ptr_shape.rs:1331-1352 | crates/perry-codegen/src/collectors/sealed_buffers.rs:487-508 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/integer_locals.rs\u0060 and \u0060crates/perry-codegen/src/collectors/ptr_numarray.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 90 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/perry-codegen/src/collectors/integer_locals.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3a9674ad4da482efb82a574a5c801780889eb5c07fd2fbcc746c2badb51afa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/perry-codegen-swiftui/src/emit.rs:286-307 | crates/perry-codegen-swiftui/src/emit.rs:327-348 \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/perry-codegen-swiftui/src/emit.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddcef123919f9a43df703831a71783ddd5adfdbe86dc643c7cad748279f7678"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): crates/perry-codegen/src/codegen/ordinary_method_artifacts.rs:64-85 | crates/perry-codegen/src/codegen/ordinary_method_artifacts.rs:203-223 \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/perry-codegen/src/codegen/ordinary_method_artifacts.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd3ccb7f5559d3e3a642d90d0d0c8272308cdebd7aff22ba789446443f380f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/perry-codegen/src/codegen/param_guard.rs:872-893 | crates/perry-codegen/src/codegen/param_guard.rs:1052-1073 \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/perry-codegen/src/codegen/param_guard.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05fda19158ca05c9583daa70e0c1704501273b8ae9c9977d2885b6497a2ba66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/perry-codegen/src/codegen/typed_abi/lower.rs:244-265 | crates/perry-codegen/src/codegen/typed_abi/lower.rs:530-551 \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/perry-codegen/src/codegen/typed_abi/lower.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b7b916b4af970ddd396dfcce07061f2036059b6b84450072b24e321fd5e387"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/perry-codegen/src/collectors/clamp_detect.rs:25-46 | crates/perry-codegen/src/collectors/clamp_detect.rs:52-73 \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/perry-codegen/src/collectors/clamp_detect.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee16f3743e561005b16d8eca2a543c41a7d0fc2fe2e87e495a8d241ac737447"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/perry-codegen/src/collectors/clamp_detect.rs:101-122 | crates/perry-codegen/src/collectors/clamp_detect.rs:127-148 \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/perry-codegen/src/collectors/clamp_detect.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f67ada1a558c487521e462fc39fc64a477704e75e99770e2172f15b81148f95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/perry-codegen/src/collectors/int_valued_i64_locals.rs:431-452 | crates/perry-codegen/src/expr/slot_rep.rs:893-914 \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/perry-codegen/src/collectors/int_valued_i64_locals.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d293e31b71251551e687521f90a77532fdaad06db4a5b30a4b617f5dce4b4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): crates/perry-codegen/src/type_analysis/strings.rs:366-387 | crates/perry-codegen/src/type_analysis/strings.rs:552-572 \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/perry-codegen/src/type_analysis/strings.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"10aebb74aa2c685f0ffa0e4320a3cbf3369c9a2433e8aa89364fa4c7470599be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201322 lines \u00D7 2): crates/perry-codegen/src/type_analysis/strings.rs:402-419 | crates/perry-codegen/src/type_analysis/strings.rs:798-819 \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/perry-codegen/src/type_analysis/strings.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5567f9e3155c8639d7e32517a391a75b85edbb9ee8a2f331a6699f8e44fce6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/perry-ext-http/src/server/https_server.rs:452-473 | crates/perry-ext-http/src/server/server.rs:1296-1317 \u2014 before extracting anything, compare \u0060crates/perry-ext-http/src/server/https_server.rs\u0060 and \u0060crates/perry-ext-http/src/server/server.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 67 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/perry-ext-http/src/server/https_server.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"071b9422e844c7bf1bd04b2637d918ed497c2610dac2c01832afa92eb308bb3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/perry-hir/src/destructuring/pattern_binding.rs:678-699 | crates/perry-hir/src/destructuring/pattern_binding.rs:702-723 \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/perry-hir/src/destructuring/pattern_binding.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bdb0b925a6822c1d72cf49106aecb5b7c23711d515694f03ce538b92db710f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/perry-hir/src/lower/expr_assign.rs:113-134 | crates/perry-hir/src/lower_patterns.rs:556-577 \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/perry-hir/src/lower/expr_assign.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"6839087de57b2826902531a5b64ce978d84c71558ff3d3dd07ce582206ad4e4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/globals.rs:670-691 | crates/perry-hir/src/lower/expr_call/module_static.rs:1460-1481 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/globals.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/module_static.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 296 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/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f75cf9542aa421045e1cd2d35ee4e29667ea245f7b84ed37f921d890d87987"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201322 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/globals.rs:855-869 | crates/perry-hir/src/lower/expr_call/module_static.rs:239-260 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/globals.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/module_static.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 296 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/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceeff63ad7bdd685f1ce463cc2a3601420e574774fd3a3bc0eeec2290dfdc377"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/module_static.rs:1559-1580 | crates/perry-hir/src/lower/expr_call/native_module/imported_module_dispatch.rs:45-66 \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/perry-hir/src/lower/expr_call/module_static.rs"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ce72f37c19ed34042cdf1788d4c5ff3df0d3ad43355a0e36517bb739a28eaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): crates/perry-hir/src/lower/module_decl.rs:726-746 | crates/perry-hir/src/lower/module_decl.rs:787-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/module_decl.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66794e8ed8c1a0321194ec2f76a262fde725fa89622a686acff1a56d6b77b01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs:149-170 | crates/perry-hir/src/lower_decl/body_stmt/detect.rs:151-172 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt/detect.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 133 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/perry-hir/src/lower/stmt_loops/for_await_targets.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d6f8ae9fb43b7da0379aac0eff9013e385150a9df8857aa0bddd0540b501db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): crates/perry-hir/src/walker/expr_mut.rs:1953-1974 | crates/perry-hir/src/walker/expr_ref.rs:1914-1934 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/walker/expr_mut.rs\u0060 and \u0060crates/perry-hir/src/walker/expr_ref.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 2017 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/perry-hir/src/walker/expr_mut.rs"},"region":{"startLine":1953}}}],"partialFingerprints":{"codehealthFindingId/v1":"892d328432b7b8f586913be86f1d00e5a8d7d4060c066d756cd408094526e06a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201321 lines \u00D7 8): crates/perry-codegen/src/expr/binary.rs:1068-1076 | crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs:374-382 | crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs:392-398 | crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs:725-745 | crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs:761-770 | crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs:845-852 | crates/perry-codegen/src/expr/ta_element_read.rs:327-334 | crates/perry-codegen/src/expr/ta_param_f64_read.rs:337-346 \u2014 there are 8 copies across 4 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 8 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/binary.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1956ae4759a78df192eeac56971e3c0e6c9c34ad2768e6ce342560a752998b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 5): crates/perry-codegen/src/collectors/integer_locals.rs:623-643 | crates/perry-codegen/src/collectors/ptr_numarray.rs:607-627 | crates/perry-codegen/src/collectors/ptr_shape.rs:1331-1351 | crates/perry-codegen/src/collectors/ptr_shape_elements.rs:831-851 | crates/perry-codegen/src/collectors/sealed_buffers.rs:487-507 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/integer_locals.rs\u0060 and \u0060crates/perry-codegen/src/collectors/ptr_numarray.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 90 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/perry-codegen/src/collectors/integer_locals.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"d480468a9e8ad4ef2535956130eee749a090d684a7ba2f16221f8587e2d08f82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201321 lines \u00D7 4): crates/perry-codegen/src/expr/this_super_call.rs:1179-1199 | crates/perry-codegen/src/expr/this_super_call.rs:1218-1232 | crates/perry-codegen/src/expr/this_super_call.rs:1252-1266 | crates/perry-codegen/src/expr/this_super_call.rs:1285-1301 \u2014 all 4 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/perry-codegen/src/expr/this_super_call.rs"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ab1de38f3d3e8606bb9c51cd022a10ff9ee60ba1b60f743b96272e8b3298d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): crates/perry-codegen/src/codegen/entry.rs:882-902 | crates/perry-codegen/src/codegen/entry/module_init.rs:362-382 | crates/perry-codegen/src/codegen/method_static.rs:341-361 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/entry.rs\u0060 and \u0060crates/perry-codegen/src/codegen/entry/module_init.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 473 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/perry-codegen/src/codegen/entry.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ee56d602be0e8e2e8edfd4113f7a84b36bd198338043f0d36e92334da95250"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201321 lines \u00D7 3): crates/perry-codegen/src/expr/this_super_call.rs:929-945 | crates/perry-codegen/src/expr/this_super_call.rs:953-969 | crates/perry-codegen/src/expr/this_super_call.rs:979-999 \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/perry-codegen/src/expr/this_super_call.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"9912d1bd8b3f06f1a23ecefa14bfefe1da55ddfaa9089c76a9bae0ecba6bbf7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201321 lines \u00D7 3): crates/perry-codegen/src/type_analysis/strings.rs:402-417 | crates/perry-codegen/src/type_analysis/strings.rs:589-600 | crates/perry-codegen/src/type_analysis/strings.rs:797-817 \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/perry-codegen/src/type_analysis/strings.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2bbca5bc74c9d28a740bda7943fc0925ed91fb4178de55fe93935320d181ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 3): crates/perry-ext-http/src/server/http2_server/pump.rs:60-78 | crates/perry-ext-http/src/server/https_server.rs:482-500 | crates/perry-ext-http/src/server/server.rs:1342-1362 \u2014 before extracting anything, compare \u0060crates/perry-ext-http/src/server/http2_server/pump.rs\u0060 and \u0060crates/perry-ext-http/src/server/https_server.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 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/perry-ext-http/src/server/http2_server/pump.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e64c599be1a8973b0d2d829f482f31a369596c4bb9aadc8ce2e869cdecdfa65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/perry-codegen/src/codegen/entry.rs:792-812 | crates/perry-codegen/src/codegen/entry/module_init.rs:275-295 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/entry.rs\u0060 and \u0060crates/perry-codegen/src/codegen/entry/module_init.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 473 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/perry-codegen/src/codegen/entry.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a7cd0a8df578f74c27d548777ddcbe5294b9fc02488ac1c81f2dc271d42532"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/perry-codegen/src/codegen/indexed_method_artifacts.rs:100-120 | crates/perry-codegen/src/codegen/indexed_method_artifacts.rs:145-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/indexed_method_artifacts.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bb472a3b40375137793504eed21b455d38d48b372da8aa0b1430c08658545b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): crates/perry-codegen/src/dialect/mod.rs:1181-1201 | crates/perry-codegen/src/dialect/mod.rs:1508-1526 \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/perry-codegen/src/dialect/mod.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"02aedf4f92bb1860ef9cfd3a8f9581a27677ff0153d34c752796b12e975fa171"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201321 lines \u00D7 2): crates/perry-codegen/src/expr/index_get.rs:1018-1038 | crates/perry-codegen/src/expr/index_get.rs:1063-1075 \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/perry-codegen/src/expr/index_get.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"157a788b6292c7116144c7ce9cca5f8047c6ddb1545c5a9a8c3e50ce6905c01a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201321 lines \u00D7 2): crates/perry-codegen/src/expr/logical_collections.rs:1172-1192 | crates/perry-codegen/src/expr/logical_collections.rs:1223-1238 \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/perry-codegen/src/expr/logical_collections.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49f0890f27f0d0a09a342ab032a6917d25534199516f91ccfcf4662dad74aa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/perry-codegen/src/expr/write_barrier.rs:221-241 | crates/perry-codegen/src/expr/write_barrier.rs:314-334 \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/perry-codegen/src/expr/write_barrier.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"2861e29d0b8d57c476e24075f328df23ecb14492062e86b652329d698b5db8e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/perry-codegen/src/layout_families.rs:803-823 | crates/perry-codegen/src/stmt/class_first_loop.rs:334-354 \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/perry-codegen/src/layout_families.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d90010f4ea1eb10e71c4186bceeb8a14f4163b63f2a390fe897e0259c279fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 2): crates/perry-codegen/src/lower_call/new.rs:1660-1680 | crates/perry-codegen/src/lower_call/new.rs:1702-1719 \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/perry-codegen/src/lower_call/new.rs"},"region":{"startLine":1660}}}],"partialFingerprints":{"codehealthFindingId/v1":"8615084dc842b95f71a1c863a2a7227034cb06c8848f5d8da89d746375b37b86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/perry-codegen/src/opt_report/mod.rs:971-991 | crates/perry-codegen/src/opt_report/mod.rs:1081-1101 \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/perry-codegen/src/opt_report/mod.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0b495b78d368e24944c31e82d4416c1dc111942b0510c997ad79c44dcbd11d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/perry-codegen/src/stmt/stable_packed_loop.rs:924-944 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:1497-1517 \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/perry-codegen/src/stmt/stable_packed_loop.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4dca68e5ccb9d0c77b4988ff5ad959654a16f99d0598511566e183585c99c29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): crates/perry-codegen/src/type_analysis/strings.rs:380-400 | crates/perry-codegen/src/type_analysis/strings.rs:747-766 \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/perry-codegen/src/type_analysis/strings.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a09d98580c0deab9c87b3a0c27ee8edebe23d89c1f5b7ea96d233ec078f14b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/perry-hir/src/js_transform/local_natives.rs:1095-1115 | crates/perry-hir/src/js_transform/local_natives.rs:1120-1140 \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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c8d96570ed9416d29f5b9363f026cc87037f159b4e6a9f9fef5cb9505b7f6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/module_static.rs:1284-1304 | crates/perry-hir/src/lower/expr_call/native_module/buffer_statics.rs:144-161 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/module_static.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/native_module/buffer_statics.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 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/perry-hir/src/lower/expr_call/module_static.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d6d5f5490186a733304f9a9b42c17c02ec7554c07a720e5119f0c55180e5ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:572-592 | crates/perry-hir/src/lower_decl/body_stmt/for_await.rs:15-35 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt/for_await.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 72 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"696c2aedfabaec2ca078ba8359333f1b93b91102194ba2f220f1dab2cdfa36b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:909-929 | crates/perry-hir/src/lower_decl/body_stmt.rs:1625-1643 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f540d4bcdcf32d2e53fff31e3cb66c515e053ef929dc9691791bc9da389b10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): crates/perry-hir/src/lower_decl/class_decl.rs:709-729 | crates/perry-hir/src/lower_decl/class_decl.rs:1086-1105 \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/perry-hir/src/lower_decl/class_decl.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"e170987a3a08ab695c65b89f4463ce47d8f5018bd95b8ff0cd01ebb2fd611a9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/perry-hir/src/lower_decl/class_decl.rs:911-931 | crates/perry-hir/src/lower_decl/class_decl/from_ast.rs:489-509 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/class_decl.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/class_decl/from_ast.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 548 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/perry-hir/src/lower_decl/class_decl.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d770985d040cddf542eaa76af1e918df7410dbfaebc3882ff29b776f8d83bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/perry-hir/src/lower_decl/class_decl/member_helpers.rs:102-122 | crates/perry-hir/src/lower_decl/class_decl/member_registration.rs:14-34 \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/perry-hir/src/lower_decl/class_decl/member_helpers.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"293f4eeeda5551d88308532699171b42b52ae282b2e2f86714b3592b6042a771"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/perry-hir/src/lower_decl/class_members.rs:1141-1161 | crates/perry-hir/src/lower_decl/private_members.rs:438-458 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/class_members.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/private_members.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 210 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/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"882b19ff9aaf14290c89ad2a9c8d6621274ecb5f1230144dd9fb301dbad3c2ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201320 lines \u00D7 6): crates/perry-hir/src/lower/stmt.rs:1355-1373 | crates/perry-hir/src/lower/stmt.rs:1426-1441 | crates/perry-hir/src/lower/stmt.rs:1476-1493 | crates/perry-hir/src/lower_decl/body_stmt.rs:889-908 | crates/perry-hir/src/lower_decl/body_stmt.rs:960-976 | crates/perry-hir/src/lower_decl/body_stmt.rs:1012-1030 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 308 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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecf330ee56ecf51fca59f2b3e486049ce4d6f5c460ec395ab43448daa109fc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): crates/perry-codegen/src/collectors/ptr_numarray.rs:654-673 | crates/perry-codegen/src/collectors/ptr_shape.rs:1378-1397 | crates/perry-codegen/src/collectors/ptr_shape_elements.rs:886-905 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/ptr_numarray.rs\u0060 and \u0060crates/perry-codegen/src/collectors/ptr_shape.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 165 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/perry-codegen/src/collectors/ptr_numarray.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4a2dd8185a19236da8eafb66bb5a8bdd1b9a74890e70452778012512a0539f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/perry-codegen-glance/src/emit_glue.rs:144-163 | crates/perry-codegen-wear-tiles/src/emit_glue.rs:87-105 \u2014 before extracting anything, compare \u0060crates/perry-codegen-glance/src/emit_glue.rs\u0060 and \u0060crates/perry-codegen-wear-tiles/src/emit_glue.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 111 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/perry-codegen-glance/src/emit_glue.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"133e2d2497b253924971f6d02216044919bf17ac34155999debc37b445a0596d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201320 lines \u00D7 2): crates/perry-codegen/src/codegen/closure_collect.rs:676-695 | crates/perry-codegen/src/codegen/closure_collect.rs:704-717 \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/perry-codegen/src/codegen/closure_collect.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"44100448b4c3af537a0e7ec24b32064a9584aa5251add2cbf1c204c942aa1e24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/perry-codegen/src/codegen/mod.rs:4103-4122 | crates/perry-codegen/src/codegen/mod.rs:4146-4165 \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/perry-codegen/src/codegen/mod.rs"},"region":{"startLine":4103}}}],"partialFingerprints":{"codehealthFindingId/v1":"163206db2c39d99261bc7e71e4842851feb9e93d81332a12f97bb4e1a9eb49a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): crates/perry-codegen/src/codegen/string_pool.rs:1099-1118 | crates/perry-codegen/src/codegen/string_pool.rs:1176-1192 \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/perry-codegen/src/codegen/string_pool.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0977e5ef8bc9d732c81fb409abf99b5b9632f872b64d3b83a43974a0b5bb78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/perry-codegen/src/collectors/hot_callees.rs:406-425 | crates/perry-codegen/src/collectors/loop_bounded_i32.rs:904-923 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/hot_callees.rs\u0060 and \u0060crates/perry-codegen/src/collectors/loop_bounded_i32.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 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/perry-codegen/src/collectors/hot_callees.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc9b4028478d976f31504950735c4bb78ebbd4ef1873992d7d3da43bfbae8bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/perry-codegen/src/collectors/scalar_methods.rs:309-328 | crates/perry-codegen/src/collectors/scalar_methods.rs:343-362 \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/perry-codegen/src/collectors/scalar_methods.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"88094b988d67d3daa6249df622db46ab688ac4a222dd0f7eed7d94c8c9b8caf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/perry-codegen/src/dialect/mod.rs:1249-1268 | crates/perry-codegen/src/dialect/mod.rs:1369-1388 \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/perry-codegen/src/dialect/mod.rs"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2425ed32be43962a384d2795949f44fb63b63a9e286438367b00ca56460447"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/perry-codegen/src/expr/env_clones.rs:247-266 | crates/perry-codegen/src/expr/env_clones.rs:364-383 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/env_clones.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"891b66214288953efaa7c512a5563b1ace11230ddd9161012468942d1d109b3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/perry-codegen/src/expr/i32_fast_path.rs:685-704 | crates/perry-codegen/src/expr/ta_param_f64_read.rs:268-287 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/i32_fast_path.rs\u0060 and \u0060crates/perry-codegen/src/expr/ta_param_f64_read.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 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/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"37dd91f765da34c8d08312fd8bd7fc482f9b59372e09e296bdf3af7f6cd33e9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/perry-codegen/src/expr/i32_fast_path.rs:1059-1078 | crates/perry-codegen/src/expr/i32_fast_path.rs:1471-1490 \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/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fa2e9a038d11d170945a0260e4097e97e1e310050e5c10912e16da922b9300"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/perry-codegen/src/expr/index_set_packed_loop.rs:126-145 | crates/perry-codegen/src/expr/index_set_packed_loop.rs:243-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/index_set_packed_loop.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74223a510290a70aa3bcaa24d4137795582346eda015b5a34af5ac525379679"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201320 lines \u00D7 2): crates/perry-codegen/src/expr/pod_record.rs:314-329 | crates/perry-codegen/src/expr/pod_record.rs:422-441 \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/perry-codegen/src/expr/pod_record.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e92a9dfffde1c480b6629ba4488d4b250c2356d081eb91efeb3ab4adb5490dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): crates/perry-codegen/src/expr/v8_interop.rs:109-128 | crates/perry-codegen/src/expr/v8_interop.rs:212-228 \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/perry-codegen/src/expr/v8_interop.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd706d67a6716fe26cf1f37e2e8ede3072ee3e1908cbd65866b7aeac64979941"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): crates/perry-codegen/src/lower_call/early_branches.rs:556-573 | crates/perry-codegen/src/lower_call/early_branches.rs:1195-1214 \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/perry-codegen/src/lower_call/early_branches.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"425a13f91158dfb60d641eb02d15cf0545c30d995a20e08c38dc1e8625bd7ba8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): crates/perry-ext-pdf/src/lib.rs:581-600 | crates/perry-ext-pdf/src/lib.rs:601-617 \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/perry-ext-pdf/src/lib.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"300527a8378d1d087fc020f134e0d0493883be192642a39e4688edceffc29af7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201320 lines \u00D7 2): crates/perry-hir/src/destructuring/var_decl.rs:187-206 | crates/perry-hir/src/destructuring/var_decl.rs:528-537 \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/perry-hir/src/destructuring/var_decl.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"d619c8f993095350c7e1ad3bded7a742bd910e04227d0b4df0d87dec65096626"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/perry-hir/src/js_transform/local_natives.rs:977-996 | crates/perry-hir/src/js_transform/local_natives.rs:1002-1021 \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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e125878ebca072f2e19365c6a6e6affc87a01f0e0a4482e118985edc0d1273"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/perry-hir/src/js_transform/local_natives.rs:988-1007 | crates/perry-hir/src/js_transform/local_natives.rs:1107-1126 \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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ef74652fc6bb6c5d1c61d6e0ebd139c968f515045e0614ff4a982aa8cec0cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/perry-hir/src/lower/expr_member/member_tail.rs:985-1003 | crates/perry-hir/src/lower_patterns.rs:248-267 \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/perry-hir/src/lower/expr_member/member_tail.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"200dd2d565ca3c57a8b6b4e288756b75705699d925c8af6cb03f8b0eaf8b0b6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/perry-hir/src/lower/expr_object.rs:298-316 | crates/perry-hir/src/lower_decl/fn_decl.rs:147-166 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_object.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/fn_decl.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 102 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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"07667b1caf5e37478f828c57d0b40b46f9e0b653898f15ddae7c79135b15f353"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/perry-hir/src/lower/stmt.rs:1615-1633 | crates/perry-hir/src/lower_decl/body_stmt.rs:1142-1161 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 308 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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd81753cc2b7591ccdeea962196d44ef22a72c7a0aeade506699441cf621e3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201320 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:1440-1459 | crates/perry-hir/src/lower_decl/body_stmt.rs:1937-1951 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b7d435d8f3399f819ccd1f3620956012ccbe06fa927ce943b93d5dc490aab2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): crates/perry-hir/src/lower_decl/class_members.rs:699-718 | crates/perry-hir/src/lower_decl/private_members.rs:224-240 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/class_members.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/private_members.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 210 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/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd07c2f0b37e3a9bee29629ef55dd8a580903d079a93ff37b745340ce76edba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 5): crates/perry-codegen/src/collectors/integer_locals.rs:655-673 | crates/perry-codegen/src/collectors/proven_args.rs:275-293 | crates/perry-codegen/src/collectors/ptr_numarray.rs:639-657 | crates/perry-codegen/src/collectors/ptr_shape.rs:1363-1381 | crates/perry-codegen/src/collectors/ptr_shape_elements.rs:871-889 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/integer_locals.rs\u0060 and \u0060crates/perry-codegen/src/collectors/ptr_numarray.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 90 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/perry-codegen/src/collectors/integer_locals.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f06fd8abc32c20e0e8c8a37560ef66f97b5628310283448791f664f5adf031"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): crates/perry-codegen-arkts/src/widgets/scroll.rs:38-56 | crates/perry-codegen-arkts/src/widgets/scroll.rs:269-287 | crates/perry-codegen-arkts/src/widgets/structure.rs:32-50 \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/perry-codegen-arkts/src/widgets/scroll.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff226707bb8bba02f21ca43857bb96e67afb853048793cd2594547c1cf3e407"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): crates/perry-hir/src/capability.rs:111-129 | crates/perry-hir/src/egress.rs:103-121 | crates/perry-hir/src/lockdown.rs:62-80 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/capability.rs\u0060 and \u0060crates/perry-hir/src/egress.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 138 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/perry-hir/src/capability.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"14bb30b127c8a8b0bf1ffd4035764fa89f632ca23842d04e59886a8fcdbfe9ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201319 lines \u00D7 3): crates/perry-hir/src/lower/module_decl.rs:593-607 | crates/perry-hir/src/lower/module_decl.rs:1715-1733 | crates/perry-hir/src/lower/module_decl.rs:1794-1812 \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/perry-hir/src/lower/module_decl.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"af27d94037806e4f96f1636781edd7967a1192fd053aba7c91e966661607899b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201319 lines \u00D7 3): crates/perry-hir/src/monomorph/infer.rs:254-272 | crates/perry-hir/src/monomorph/infer.rs:364-381 | crates/perry-hir/src/monomorph/update_call_sites.rs:573-587 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/monomorph/infer.rs\u0060 and \u0060crates/perry-hir/src/monomorph/update_call_sites.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 128 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/perry-hir/src/monomorph/infer.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad7d0c9886f9f24955a2fd4f6df60404ead6f1866de5f0abdd51250a6f87e17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/perry-codegen-arkts/src/widgets/calendar.rs:22-40 | crates/perry-codegen-arkts/src/widgets/date_picker.rs:21-39 \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/perry-codegen-arkts/src/widgets/calendar.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f2e3d66dc828d2482f0e88189db9ecd90290c02e45bd9d44f54c6df5126bad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201319 lines \u00D7 2): crates/perry-codegen-glance/src/emit_glue.rs:30-48 | crates/perry-codegen-wear-tiles/src/emit_glue.rs:27-41 \u2014 before extracting anything, compare \u0060crates/perry-codegen-glance/src/emit_glue.rs\u0060 and \u0060crates/perry-codegen-wear-tiles/src/emit_glue.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 111 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/perry-codegen-glance/src/emit_glue.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a14f869d8b63cf52a8ab03d95438833372576fc4b3fe645b5170d239394474"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): crates/perry-codegen/src/codegen/function.rs:1263-1281 | crates/perry-codegen/src/codegen/method_static.rs:229-245 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/function.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method_static.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 268 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/perry-codegen/src/codegen/function.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22fc71a017749d8cd48e46b62892c471b40848815f5c4793cf3174fb5851510"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/perry-codegen/src/codegen/method_entries.rs:98-116 | crates/perry-codegen/src/codegen/method_entries.rs:204-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/method_entries.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"332c3fc902cda2e538b6731e1021b24e5e2fb88565334e05bd5aa50bd8c95fae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/perry-codegen/src/collectors/hoisted_callback_calls.rs:86-104 | crates/perry-codegen/src/layout_desc.rs:614-632 \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/perry-codegen/src/collectors/hoisted_callback_calls.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a114ae993901bd4b70c6a0b4d089d83984a44733921aa0be1372641f9d56823e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): crates/perry-codegen/src/collectors/ptr_shape.rs:1453-1471 | crates/perry-codegen/src/collectors/ptr_shape.rs:1504-1519 \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/perry-codegen/src/collectors/ptr_shape.rs"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b8207b0002c3528f238ec4a093a10d1652aa249b011e9fe45b66f7b5d0d59e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/perry-codegen/src/expr/family_slot.rs:226-244 | crates/perry-codegen/src/layout_desc/create_families.rs:1328-1346 \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/perry-codegen/src/expr/family_slot.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58b42a3e85df543f2ce887409cee4a025f934d20655c75b1e48ea76cd9daf92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:7668-7686 | crates/perry-codegen/src/stmt/loops.rs:9931-9947 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":7668}}}],"partialFingerprints":{"codehealthFindingId/v1":"97415400a177d45059eb48bd0bbf775df7df8b3b38a99243e38b143872e3a2b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/perry-hir/src/egress.rs:259-277 | crates/perry-hir/src/egress.rs:287-305 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/egress.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac0575679dfe666ed7757b500232bbe40f3ac4659bf8ca82a06a27c51a8e57b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/local_array_methods.rs:1140-1158 | crates/perry-hir/src/lower/expr_call/textencoder.rs:99-117 \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/perry-hir/src/lower/expr_call/local_array_methods.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d367856a4670c7d3e6721eac2eb62c5341ade7b6ce0c4b581842abc29102818a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/native_module/imported_module_dispatch.rs:295-313 | crates/perry-hir/src/lower/expr_call/native_module/process_module.rs:372-390 \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/perry-hir/src/lower/expr_call/native_module/imported_module_dispatch.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"e948849c04ff015ca6dc73ecc5579a39217986b76a5736ddfc104c25d2904cde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/perry-hir/src/lower/lower_expr/arm_optchain.rs:230-247 | crates/perry-hir/src/lower/lower_expr/arm_optchain.rs:361-379 \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/perry-hir/src/lower/lower_expr/arm_optchain.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50c29fb65fc566d8d6936d8566c7ecc9cc89d4fff00aa6ceb3c18813ab27e2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201319 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:670-688 | crates/perry-hir/src/lower_decl/body_stmt.rs:1420-1431 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ca52167113707be8c9831b7471062374329263ee908350af250302b1de6105"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 5): crates/perry-codegen/src/codegen/closure.rs:1266-1283 | crates/perry-codegen/src/codegen/entry.rs:873-890 | crates/perry-codegen/src/codegen/entry/module_init.rs:353-370 | crates/perry-codegen/src/codegen/method.rs:657-674 | crates/perry-codegen/src/codegen/method_static.rs:332-349 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/entry.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 221 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b8d8502ce0cfb3a6c9d853a7cb57282696eef0a5a5ecfa7a5186a3893225fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 5): crates/perry-codegen/src/lower_call/native/mod.rs:408-425 | crates/perry-codegen/src/lower_call/native/mod.rs:463-480 | crates/perry-codegen/src/lower_call/native/mod.rs:533-549 | crates/perry-codegen/src/lower_call/native/mod.rs:586-602 | crates/perry-codegen/src/lower_call/web_storage.rs:53-70 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/native/mod.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/web_storage.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 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/perry-codegen/src/lower_call/native/mod.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"90546ca02d832e5987bc2a1fcd7efba9963172892aed84058c1b2bb4bb4d5822"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): crates/perry-codegen/src/collectors/integer_locals.rs:215-232 | crates/perry-codegen/src/collectors/segview.rs:545-562 | crates/perry-hir/src/lower/shared_mutable_capture.rs:1287-1304 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/segview.rs\u0060 and \u0060crates/perry-hir/src/lower/shared_mutable_capture.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 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/perry-codegen/src/collectors/integer_locals.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f39a6840f1619184bba068b2e0a9af35fdd018da8a297811ca4d9159c60701"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 3): crates/perry-codegen/src/stmt/let_stmt.rs:1018-1034 | crates/perry-codegen/src/stmt/let_stmt.rs:1174-1191 | crates/perry-codegen/src/stmt/let_stmt.rs:1365-1381 \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/perry-codegen/src/stmt/let_stmt.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5de7a4ae62b46f1350d917c3b633f40627ab1e75d237a3c1d61b8c25e75aed4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/perry-codegen-arkts/src/util.rs:46-63 | crates/perry-codegen-arkts/src/widgets/image.rs:60-76 \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/perry-codegen-arkts/src/util.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"242a4d0a478bd117aa8056b4f234bc8e0db26420c1438501016117a3a8aa3666"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/perry-codegen-glance/src/emit.rs:663-680 | crates/perry-codegen-wear-tiles/src/emit.rs:448-465 \u2014 before extracting anything, compare \u0060crates/perry-codegen-glance/src/emit.rs\u0060 and \u0060crates/perry-codegen-wear-tiles/src/emit.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 144 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/perry-codegen-glance/src/emit.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc971b87247973c43655128b915040fefdae814941284e9e93f4bccd5b64db07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/perry-codegen-glance/src/emit_glue.rs:52-69 | crates/perry-codegen-wear-tiles/src/emit_glue.rs:43-59 \u2014 before extracting anything, compare \u0060crates/perry-codegen-glance/src/emit_glue.rs\u0060 and \u0060crates/perry-codegen-wear-tiles/src/emit_glue.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 111 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/perry-codegen-glance/src/emit_glue.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75326bc1dd6a5dbf910853183d69c77070d001752d09b894a0fdc1d5adb64d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): crates/perry-codegen-wasm/src/emit/locals.rs:328-345 | crates/perry-codegen-wasm/src/emit/locals.rs:452-467 \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/perry-codegen-wasm/src/emit/locals.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb256f8f44dc4522044313952bacbd9587f22a3efc6dae1cf5dea0c3eaae7a2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/perry-codegen/src/codegen/closure.rs:936-953 | crates/perry-codegen/src/codegen/method.rs:482-499 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 341 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"773f240d91da765bb30bcf5962bc13c3d146b05bda78108502a5f50312044da3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/perry-codegen/src/codegen/closure.rs:1361-1378 | crates/perry-codegen/src/codegen/method.rs:752-769 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 341 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"6290450b6cc992bbdd527996d36cd25f60eeb86ee24c00285f7dd67c5a1a1ea3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/perry-codegen/src/codegen/entry.rs:1064-1081 | crates/perry-codegen/src/codegen/entry/module_init.rs:544-561 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/entry.rs\u0060 and \u0060crates/perry-codegen/src/codegen/entry/module_init.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 473 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/perry-codegen/src/codegen/entry.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"379e3348194befb8db0c8860b0a789e597f38931fc4de7f1ca2ac7cd8b4d883b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201318 lines \u00D7 2): crates/perry-codegen/src/codegen/export_value_wrappers.rs:259-276 | crates/perry-codegen/src/codegen/export_value_wrappers.rs:365-372 \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/perry-codegen/src/codegen/export_value_wrappers.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef88c5d4dd9664d1962555d6ba6533506c80e31bd0a24715fcc165b0efc5a43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/perry-codegen/src/codegen/spec_return_proof.rs:236-253 | crates/perry-codegen/src/lower_call/func_ref.rs:681-698 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/spec_return_proof.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/func_ref.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/perry-codegen/src/codegen/spec_return_proof.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1be26f4116a664a8fa437bcef4e6272a76b68e2c9a1224907ca605ab1b92801"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/perry-codegen/src/codegen/string_pool.rs:1596-1613 | crates/perry-codegen/src/codegen/string_pool.rs:1669-1686 \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/perry-codegen/src/codegen/string_pool.rs"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de02225657a177f5eaa332c57cf9736487e049a88b2508a8a98120ed99c540f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/perry-codegen/src/collectors/hoisted_callback_calls.rs:37-54 | crates/perry-codegen/src/stmt/stable_packed_accumulator.rs:228-245 \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/perry-codegen/src/collectors/hoisted_callback_calls.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0413565eeb176e45b05b04786f5593ae2c12e24bc0ce6988c469b2a5277e45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/perry-codegen/src/collectors/int_valued_i64_locals.rs:470-487 | crates/perry-codegen/src/expr/slot_rep.rs:936-953 \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/perry-codegen/src/collectors/int_valued_i64_locals.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a5c2a67c9d5751a8b49e836e271263a3286b61a47fbb843131c97ea4261593"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/perry-codegen/src/collectors/segview.rs:711-728 | crates/perry-codegen/src/collectors/segview.rs:1332-1349 \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/perry-codegen/src/collectors/segview.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d6473ea9a1479c1bfc94112d66e9eefdb11b8f75ed496ac1fa7a3a2e8409fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/perry-codegen/src/expr/bigint_set.rs:385-402 | crates/perry-codegen/src/expr/math_simple.rs:122-139 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/bigint_set.rs\u0060 and \u0060crates/perry-codegen/src/expr/math_simple.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 205 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/perry-codegen/src/expr/bigint_set.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fcf2e973ea08e1f7144194562e01cefd043371223b51580c41f5b6194a0f38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/perry-codegen/src/expr/mod.rs:3537-3554 | crates/perry-codegen/src/expr/mod.rs:3604-3621 \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/perry-codegen/src/expr/mod.rs"},"region":{"startLine":3537}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a01b5c4783c5c56bc2e0408603ca9407a9cb1c0f6b6808ab0d25a2cc8655b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/perry-codegen/src/expr/new_dynamic.rs:143-160 | crates/perry-codegen/src/expr/proxy_reflect.rs:1186-1203 \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/perry-codegen/src/expr/new_dynamic.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb941a2a3a3d478b3827c5fd380a51e717365739421a99a671b9328c02e6268"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): crates/perry-codegen/src/expr/ta_element_read.rs:314-331 | crates/perry-codegen/src/expr/typed_element.rs:392-407 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/ta_element_read.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dcc6f3ec8516eaece052638d5d9e7471a8a93f3e61458e000aa1c9128065622"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/perry-codegen/src/expr/this_super_call.rs:902-919 | crates/perry-codegen/src/expr/this_super_call.rs:969-986 \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/perry-codegen/src/expr/this_super_call.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2caa46ebf49076e639fd413e7e275314cc11d6fbc28a82d313454adedd6dee9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/perry-codegen/src/lower_call/scalar_method.rs:331-348 | crates/perry-codegen/src/lower_call/scalar_method.rs:435-452 \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/perry-codegen/src/lower_call/scalar_method.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"653e34c9599740c8f7f1cb8fedf301fc87e51a31abb7726a572f48ee3c5e9a40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:421-438 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:495-511 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/stmt/loops.rs\u0060 and \u0060crates/perry-codegen/src/stmt/stable_packed_loop.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 79 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9488da81faa70ab68f4daac2bf459e82b6d234010ad97c8c53492e083ffdde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): crates/perry-codegen/src/type_analysis/refine.rs:564-581 | crates/perry-codegen/src/type_analysis/strings.rs:776-791 \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/perry-codegen/src/type_analysis/refine.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2bfeb21162eb7b834af67345025f0f53ddcbf5fdb6f587f4374b975b005d8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/perry-component-host/src/sync_wasi/sockets.rs:53-70 | crates/perry-component-io/src/embedding.rs:97-114 \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/perry-component-host/src/sync_wasi/sockets.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fa072a65c7b1a6ba0ecabe1df74c47b9569a15b1502f596b78946e3fbbedb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/perry-ext-http/src/lib.rs:1084-1101 | crates/perry-ext-http/src/lib.rs:1224-1241 \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/perry-ext-http/src/lib.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f34bd92760ef557240771d02cc089938a19be5af3d9ac217e2d407f00fd0b8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): crates/perry-hir/src/destructuring/pattern_binding.rs:314-329 | crates/perry-hir/src/destructuring/pattern_binding.rs:596-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/destructuring/pattern_binding.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"93037916e897b7118b9b67628fd63fffc9538224d7ec238b70cf723391e1d30b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/perry-hir/src/lower/context.rs:1778-1795 | crates/perry-hir/src/lower/context.rs:1841-1857 \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/perry-hir/src/lower/context.rs"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1235114f3dbfe0fed8d8c42958b5df4f9bbe8d6225b1983ffbdf34346f7e5d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/perry-hir/src/lower/expr_assign.rs:1225-1241 | crates/perry-hir/src/lower/expr_assign.rs:1331-1348 \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/perry-hir/src/lower/expr_assign.rs"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"251d8bef5afceeb9714c62bfecaac5c6c80f6bd875441b4014fac8289df98dfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/post_args_dispatch.rs:168-185 | crates/perry-hir/src/lower/expr_call/post_args_dispatch.rs:238-255 \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/perry-hir/src/lower/expr_call/post_args_dispatch.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"25affb251d24fd3c134bc752ac63fc6d811afe04243df5e3b80f2feb3e0c8480"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201318 lines \u00D7 2): crates/perry-hir/src/lower/expr_object.rs:210-227 | crates/perry-hir/src/lower/expr_object.rs:542-554 \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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c37693f0fa89a9fba42b5ad4490b2daf9521cde3e4dbbbd7f392d91224c58db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201318 lines \u00D7 2): crates/perry-hir/src/lower/expr_object.rs:241-258 | crates/perry-hir/src/lower_decl/fn_decl.rs:113-121 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_object.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/fn_decl.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 102 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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50b82cb065c371eb676d6ad393bce1b50f2b9757946c05d0570dc5393d26770"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/perry-hir/src/lower/stmt.rs:1506-1523 | crates/perry-hir/src/lower_decl/body_stmt.rs:1047-1064 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 308 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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ac45e3dc666a48dac7410afecb8d715db13c15c282006add02dacb5b54bd3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs:42-59 | crates/perry-hir/src/lower_decl/body_stmt/detect.rs:42-59 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt/detect.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 133 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/perry-hir/src/lower/stmt_loops/for_await_targets.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d82901ac42ef003f1ebf4fcf2435e95e9f5bafd351ce6d44954d6ad00b173c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): crates/perry-hir/src/monomorph/infer.rs:41-58 | crates/perry-hir/src/monomorph/update_call_sites.rs:711-726 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/monomorph/infer.rs\u0060 and \u0060crates/perry-hir/src/monomorph/update_call_sites.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 128 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/perry-hir/src/monomorph/infer.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e789b01469ffd4f4cafbb80582569a9430351cacba75623370fbf32153c583b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201317 lines \u00D7 6): crates/perry-hir/src/lower/expr_function.rs:665-681 | crates/perry-hir/src/lower/expr_object.rs:267-280 | crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs:109-122 | crates/perry-hir/src/lower_decl/class_members.rs:541-552 | crates/perry-hir/src/lower_decl/fn_decl.rs:132-142 | crates/perry-hir/src/lower_decl/private_members.rs:130-139 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_function.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_object.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 63 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/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cb74ad2fee46c25c693e1797d748df651d3e6c326a0fa0314288d171028459"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): crates/perry-codegen/src/codegen/closure.rs:1365-1381 | crates/perry-codegen/src/codegen/method.rs:756-772 | crates/perry-codegen/src/codegen/method_static.rs:431-447 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 341 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d682b3e7b82247907c774696bd7e07120cd6d714035b8ede674b10a879b8a6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201317 lines \u00D7 3): crates/perry-codegen/src/codegen/entry.rs:961-977 | crates/perry-codegen/src/codegen/entry/module_init.rs:441-457 | crates/perry-codegen/src/codegen/method_static.rs:424-433 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/entry.rs\u0060 and \u0060crates/perry-codegen/src/codegen/entry/module_init.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 473 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/perry-codegen/src/codegen/entry.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5375a0109e402dd06fdc595bd193e690d3ac250d7fcb9acd29cc96719ebd56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201317 lines \u00D7 3): crates/perry-codegen/src/collectors/ptr_shape_this_flow.rs:334-342 | crates/perry-codegen/src/collectors/ptr_shape_this_flow.rs:414-430 | crates/perry-codegen/src/collectors/ptr_shape_this_flow.rs:451-459 \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/perry-codegen/src/collectors/ptr_shape_this_flow.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d3c30735939db8a79fe9c4a769b87633496c38d695e94f00c8b0abb5e31a78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201317 lines \u00D7 3): crates/perry-codegen/src/stmt/loops.rs:7699-7715 | crates/perry-codegen/src/stmt/loops.rs:9877-9886 | crates/perry-codegen/src/stmt/loops.rs:9948-9957 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":7699}}}],"partialFingerprints":{"codehealthFindingId/v1":"459b5a7889a6eddf0a77f2f14b4b1671cb9f2bb38f370a06bf045fe576b5b55a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u201317 lines \u00D7 4): crates/perry-hir/src/audit.rs:318-334 | crates/perry-hir/src/capability.rs:312-328 | crates/perry-hir/src/ir/constants.rs:482-498 | crates/perry-hir/src/ir/constants.rs:505-509 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/audit.rs\u0060 and \u0060crates/perry-hir/src/capability.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 136 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/perry-hir/src/audit.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea8246dd18942bf71803be140d90b4f291ed6c6d15de5a8486c19dbacd62066"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): crates/perry-hir/src/destructuring/var_decl_sources.rs:189-205 | crates/perry-hir/src/destructuring/var_decl_sources.rs:236-252 | crates/perry-hir/src/destructuring/var_decl_sources.rs:285-301 \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/perry-hir/src/destructuring/var_decl_sources.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a343878e173e689c22997a0a5dca8c6dddc680c3cf81283942b38594b7c188"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): crates/perry-codegen-arkts/src/app_extract.rs:59-75 | crates/perry-codegen-arkts/src/app_extract.rs:85-99 \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/perry-codegen-arkts/src/app_extract.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ee61c73c339cee3f41d18c6ee4d0a45e6d21cace6fa1bd1d25cf01a2cbf3d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/perry-codegen/src/codegen/function.rs:94-110 | crates/perry-codegen/src/codegen/method_typed.rs:37-53 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/function.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method_typed.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 110 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/perry-codegen/src/codegen/function.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1ed0a73329be0eb46e85ba8c20f76cda559e2cbdc285c66745c371fd060326"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/perry-codegen/src/codegen/function.rs:128-144 | crates/perry-codegen/src/codegen/method_typed.rs:170-186 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/function.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method_typed.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 110 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/perry-codegen/src/codegen/function.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6abc687a2c72a6dbb65fa03fe580add9b145c480165239fd0c82f05e63cc61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/perry-codegen/src/codegen/function.rs:163-179 | crates/perry-codegen/src/codegen/method_typed.rs:124-140 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/function.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method_typed.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 110 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/perry-codegen/src/codegen/function.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9996acfd238431149b3e14da9777da28165c46826b989f9e764a97b98cc6405"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/perry-codegen/src/codegen/function.rs:201-217 | crates/perry-codegen/src/codegen/method_typed.rs:216-232 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/function.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method_typed.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 110 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/perry-codegen/src/codegen/function.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb6458e4615be59bd34f3c345dc9630a179a8553231aa79d209de15c78c7741"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201317 lines \u00D7 2): crates/perry-codegen/src/codegen/method.rs:444-454 | crates/perry-codegen/src/codegen/method_static.rs:162-178 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/method.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method_static.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 341 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/perry-codegen/src/codegen/method.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b834e297f6db80181b023adad3286762ef1cf7af69655a0436e484fceb08ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/perry-codegen/src/codegen/tdz_names.rs:108-124 | crates/perry-codegen/src/collectors/int_valued_i64_locals.rs:463-479 \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/perry-codegen/src/codegen/tdz_names.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b281aafb6f42169ab51cd53456de0fab71e5e4f751d4ef25a189ba2330c965d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/perry-codegen/src/collectors/byte_read_key.rs:107-123 | crates/perry-codegen/src/expr/closure.rs:54-70 \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/perry-codegen/src/collectors/byte_read_key.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4453baeb3fc5ef442c997ef1c4cef7dbed053f902dc757612cd733b8886a211"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/perry-codegen/src/collectors/not_bigint_locals.rs:194-210 | crates/perry-codegen/src/type_analysis/numeric.rs:923-939 \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/perry-codegen/src/collectors/not_bigint_locals.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ecb9b97bb104db60bce99b4c27f1bbb5b9d46e4ebab91642743b2a39ce4797"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/perry-codegen/src/collectors/pointer_locals.rs:507-523 | crates/perry-codegen/src/collectors/pointer_locals.rs:734-750 \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/perry-codegen/src/collectors/pointer_locals.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"d503e11d4d9db2bdf2872033d1b38bf18bfc9216287e7532616a870e9788fe50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/perry-codegen/src/expr/array_push.rs:185-201 | crates/perry-codegen/src/expr/array_push.rs:283-299 \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/perry-codegen/src/expr/array_push.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"959507c8d97fde61ece4b031b99f01f85832936d610272e29fad12a0bc4563e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 2): crates/perry-codegen/src/expr/folded_builtin_override.rs:716-728 | crates/perry-codegen/src/lower_call/property_get/own_override_guard.rs:331-347 \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/perry-codegen/src/expr/folded_builtin_override.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"4afa41bb1c55d0678338b580ff3cdcf0e4f10d714fe4efb3f815a50b4c127761"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/perry-codegen/src/expr/i32_fast_path.rs:132-148 | crates/perry-codegen/src/expr/i32_fast_path.rs:149-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"800540ec216b50eea93052fe9e55f6ca07aa45c241c84c549b41ccc159ae4f82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:4074-4089 | crates/perry-codegen/src/stmt/loops.rs:4130-4146 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":4074}}}],"partialFingerprints":{"codehealthFindingId/v1":"705851a3944d1fa669e27a07ce4a8bef6cee5a234b2286df67bd7dee7dbafe24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:8304-8320 | crates/perry-codegen/src/stmt/loops.rs:8409-8425 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":8304}}}],"partialFingerprints":{"codehealthFindingId/v1":"766edf65f84edb668bea1353b2ef069ecdd4c1f54c452e44fe855559dbf691f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/perry-codegen/src/strings.rs:185-201 | crates/perry-codegen/src/strings.rs:228-244 \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/perry-codegen/src/strings.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"783073762aa37cdd2d2dea527484aef2df81f991ef4345c2c4f436918f8a55d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/perry-codegen/src/testing/temp_slots.rs:102-118 | crates/perry-codegen/src/testing/temp_slots.rs:156-172 \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/perry-codegen/src/testing/temp_slots.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"47433889aa1af50b4ce6eeb1d9075301f9efac16c61660bd12faf035c29d55e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 2): crates/perry-container-compose/src/compose.rs:1134-1150 | crates/perry-container-compose/src/compose.rs:1189-1201 \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/perry-container-compose/src/compose.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9ada012b14e44f6686c4cfd1fb61ed217028adb1f2f08d6579005adc963b85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/perry-ext-ethers/src/lib.rs:72-88 | crates/perry-ext-nodemailer/src/lib.rs:173-189 \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/perry-ext-ethers/src/lib.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0febdcce73ff1ba42196f175f650817a9f1abb11e92e080e671dc3aedb2ccdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 2): crates/perry-ext-net/src/payload_closed.rs:132-144 | crates/perry-ext-net/src/payload_server.rs:705-721 \u2014 before extracting anything, compare \u0060crates/perry-ext-net/src/payload_closed.rs\u0060 and \u0060crates/perry-ext-net/src/payload_server.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 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/perry-ext-net/src/payload_closed.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"82791ddd13e71812105d36d0cbf66a9a3db56bff200f29d21ad7e9f346738b70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/perry-ext-parcel-watcher/src/lib.rs:848-864 | crates/perry-ext-parcel-watcher/src/lib.rs:889-905 \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/perry-ext-parcel-watcher/src/lib.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee138d8e71ef0d476ebf9e61b97fb7aba3e31006abb6cc42c5c37e9a45519070"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 2): crates/perry-hir/src/js_transform/local_natives.rs:108-124 | crates/perry-hir/src/js_transform/local_natives.rs:130-142 \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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7f676843a1cb82e78d9c7fbd916b69fe6099890da00d6454353899ad41250a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/intrinsics/require.rs:34-50 | crates/perry-hir/src/lower/expr_call/intrinsics/require.rs:128-144 \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/perry-hir/src/lower/expr_call/intrinsics/require.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da449f4ceb2c25dc8c962314b29012d47c84245c232fd45a92829639bfd75bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/local_array_methods.rs:635-651 | crates/perry-hir/src/lower/expr_call/local_array_methods.rs:820-833 \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/perry-hir/src/lower/expr_call/local_array_methods.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"957ca5849cd77f7187df01cbd98ce353c514743472cb43ad2cd314f989c7f87b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/perry-hir/src/lower/expr_function.rs:1555-1571 | crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs:253-269 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_function.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 137 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/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d40442d3f49262430e894353a369df2158a0be279afa6298d1bba610a7ec0f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/perry-hir/src/lower/stmt.rs:1581-1597 | crates/perry-hir/src/lower_decl/body_stmt.rs:1122-1138 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 308 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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9bdaa4023f0aa2c9e9ede6305f8e1b499527a78e62f36b7033936d2afe7e82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/perry-hir/src/lower/stmt.rs:1647-1663 | crates/perry-hir/src/lower_decl/body_stmt.rs:1175-1191 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 308 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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":1647}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e3e15328e3c35f56736ebfcbb4494d81be4609569224f187c54291e606983f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/perry-hir/src/lower_patterns.rs:454-470 | crates/perry-hir/src/lower_patterns.rs:511-527 \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/perry-hir/src/lower_patterns.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5af2c8a3fc786073efb38b7a6e1ea6a01c2b3453b58402c885e72510ab3fa3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): crates/perry-hir/src/lower_patterns.rs:1057-1073 | crates/perry-hir/src/lower_patterns.rs:1288-1301 \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/perry-hir/src/lower_patterns.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"80903cf36a14d2a51de89b396f2f4be65ef59865ae0e7f8b48987160e2680337"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 5): crates/perry-codegen/src/collectors/integer_locals.rs:664-679 | crates/perry-codegen/src/collectors/ptr_numarray.rs:648-663 | crates/perry-codegen/src/collectors/ptr_shape.rs:1372-1387 | crates/perry-codegen/src/collectors/ptr_shape_elements.rs:880-895 | crates/perry-codegen/src/collectors/sealed_buffers.rs:532-547 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/integer_locals.rs\u0060 and \u0060crates/perry-codegen/src/collectors/ptr_numarray.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 90 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/perry-codegen/src/collectors/integer_locals.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b9a976cb5a3d227c19eb175e40269f2675198901613371b8fe94c2031e34de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 4): crates/perry-codegen/src/lower_call/early_branches.rs:768-782 | crates/perry-codegen/src/lower_call/early_branches.rs:868-882 | crates/perry-codegen/src/lower_call/early_branches.rs:970-984 | crates/perry-codegen/src/lower_call/early_branches.rs:1077-1092 \u2014 all 4 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/perry-codegen/src/lower_call/early_branches.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e7c14775f605f3c81ea2a413052ad945bd6ea4a789197133176bb5c328808c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): crates/perry-codegen-arkts/src/widgets/scroll.rs:136-151 | crates/perry-codegen-arkts/src/widgets/scroll.rs:290-304 | crates/perry-codegen-arkts/src/widgets/stack.rs:119-134 \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/perry-codegen-arkts/src/widgets/scroll.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d861ea90a2e911572eb86c2e46a602422f64ed4ba54bcb0606d9f34521804bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): crates/perry-codegen/src/codegen/closure.rs:1276-1290 | crates/perry-codegen/src/codegen/function.rs:1381-1396 | crates/perry-codegen/src/codegen/method.rs:667-681 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/function.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 320 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48000cfbf736b694b6e77aa9e829d21f15adee59a3d881f92d17ccb6569b002"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/perry-codegen/src/collectors/int_valued_i64_locals.rs:421-436 | crates/perry-codegen/src/scope_env/pass.rs:201-216 | crates/perry-hir/src/lexical_frames.rs:339-354 \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/perry-codegen/src/collectors/int_valued_i64_locals.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14ae209aa0559700dd0c77a39f05005440790883a5a2d8edc5c754009c320a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201316 lines \u00D7 3): crates/perry-codegen/src/expr/static_method.rs:649-656 | crates/perry-codegen/src/lower_call/extern_func.rs:1420-1427 | crates/perry-codegen/src/lower_call/namespace_call.rs:334-349 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/static_method.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/namespace_call.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 80 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/perry-codegen/src/expr/static_method.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"11833d2b5443d1480f8f6cc69d047883a85177b6c8b07257a974dfcd40ce96a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): crates/perry-api-manifest/src/entries.rs:540-553 | crates/perry-codegen/src/lower_call/native_table/node_core.rs:45-60 \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/perry-api-manifest/src/entries.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a41c7996190546e55ca65d31fb0a0c278651e185a8f7943cb89ea6341f7115"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): crates/perry-codegen-arkts/src/widgets/inputs.rs:175-190 | crates/perry-codegen-arkts/src/widgets/inputs.rs:201-214 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-arkts/src/widgets/inputs.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b2c506071282602e511e77b7dace4996f5d0e82fa4edf3244977e8c0a282ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/perry-codegen/src/codegen/closure.rs:996-1011 | crates/perry-codegen/src/codegen/method.rs:533-548 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 341 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"34736a4ee09c24c04807ce37ec2a818ac75fb2734263619b22df00f9704258a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/perry-codegen/src/codegen/entry.rs:943-958 | crates/perry-codegen/src/codegen/entry/module_init.rs:423-438 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/entry.rs\u0060 and \u0060crates/perry-codegen/src/codegen/entry/module_init.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 473 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/perry-codegen/src/codegen/entry.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"f847b567362b838e7cc92d730941689fcdc0f2bcbe84133b07e83f9367ff94b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): crates/perry-codegen/src/codegen/string_pool.rs:1474-1486 | crates/perry-codegen/src/codegen/string_pool.rs:1554-1569 \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/perry-codegen/src/codegen/string_pool.rs"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cb979c9e9691cd5759fa00a3fefc107ffb6af0875bd668ff4e208a4ffc41d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/perry-codegen/src/collectors/typed_locals.rs:757-772 | crates/perry-codegen/src/collectors/typed_locals.rs:855-870 \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/perry-codegen/src/collectors/typed_locals.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51e4e014173055834db67e223d4001951d399ea0c75e9e042f814a436aec8aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/perry-codegen/src/expr/native_memory.rs:246-261 | crates/perry-codegen/src/expr/proven_view_access.rs:259-274 \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/perry-codegen/src/expr/native_memory.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"688b7ed42fdc991386209f5262b078f8267523bdbe29a94408156044eb85ba60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/perry-codegen/src/expr/property_get/helpers.rs:233-248 | crates/perry-codegen/src/expr/property_get/helpers.rs:309-324 \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/perry-codegen/src/expr/property_get/helpers.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"4035c92644379630d96c1881297b801c9439fc8a7be73ea7409ca2be2368755a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201316 lines \u00D7 2): crates/perry-codegen/src/expr/proven_view_access.rs:324-333 | crates/perry-codegen/src/expr/ta_param_f64_read.rs:304-319 \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/perry-codegen/src/expr/proven_view_access.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af14a1af6f248cf8738b52ccabed4add633b3bc1a73d1bd4eca4b128f03bfe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/perry-codegen/src/expr/static_method.rs:518-533 | crates/perry-codegen/src/lower_call/buffer_intrinsic.rs:503-518 \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/perry-codegen/src/expr/static_method.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8296d28e655b378e8ad6f94c7b173d03ca0951b247bdd513f7547f354396e79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): crates/perry-codegen/src/module.rs:329-344 | crates/perry-codegen/src/module.rs:386-398 \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/perry-codegen/src/module.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eddb45eebd2f6ec948173d4d432ee8e5e0a8d3c4c576ce9375ca0616169d896"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201316 lines \u00D7 4): crates/perry-container-compose/src/backend/apple.rs:72-87 | crates/perry-container-compose/src/backend/apple.rs:143-153 | crates/perry-container-compose/src/backend/docker.rs:93-95 | crates/perry-container-compose/src/backend/docker.rs:161-163 \u2014 before extracting anything, compare \u0060crates/perry-container-compose/src/backend/apple.rs\u0060 and \u0060crates/perry-container-compose/src/backend/docker.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 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/perry-container-compose/src/backend/apple.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b195c767b5c085480fad103c4b28f09324ae45546180aff61a283615a87a3c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): crates/perry-container-compose/src/compose.rs:156-171 | crates/perry-container-compose/src/compose.rs:178-190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-container-compose/src/compose.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"68623d4e9bb25d7e75667caec9e7c6c4fa7bf3ba0e861dedfb97f39c05e00130"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/perry-ext-net/src/payload_server.rs:512-527 | crates/perry-ext-net/src/payload_socket.rs:1705-1720 \u2014 before extracting anything, compare \u0060crates/perry-ext-net/src/payload_server.rs\u0060 and \u0060crates/perry-ext-net/src/payload_socket.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. 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/perry-ext-net/src/payload_server.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"258316ae30ae123fcfaa19d0d01b71c5db786001a076d1183d70368ac1502e71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/perry-ext-net/src/payload_socket.rs:111-126 | crates/perry-ext-net/src/payload_socket.rs:519-534 \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/perry-ext-net/src/payload_socket.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"014fb40bf4086128074703f2e86e442b7de2e63d8173d6b695a633482b6e4fa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/perry-ffi/src/turnloop_net.rs:933-948 | crates/perry-ffi/src/turnloop_net.rs:1587-1602 \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/perry-ffi/src/turnloop_net.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed27eb55e54d299c07da0f3007ba9538b4b767cf8838068d9b3169b260e1713d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/perry-gc-effects/src/instructions.rs:462-477 | crates/perry-gc-effects/src/instructions.rs:522-537 \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/perry-gc-effects/src/instructions.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5dd9fda35ffee3ec11566ba325523cf146272da70d50ad24930ee00cca24867"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/inline_array_methods.rs:47-61 | crates/perry-hir/src/lower/expr_call/local_array_methods.rs:417-432 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/inline_array_methods.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/local_array_methods.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 68 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/perry-hir/src/lower/expr_call/inline_array_methods.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2b9948aa256061b46960b93a5bb973b68e2c028de4f315f15125bf75ce449b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/perry-hir/src/lower/stmt.rs:1528-1543 | crates/perry-hir/src/lower_decl/body_stmt.rs:1067-1082 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 308 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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbc0dfc52bfda4684c629ca0509f17f96c6613bafb294a673c896ffedddfaa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:1749-1764 | crates/perry-hir/src/lower_decl/body_stmt.rs:2230-2245 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0c7d6ec39471dfa3b768ac55bd4c83ac63508c62756e5150b48e126a3488dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs:113-128 | crates/perry-hir/src/lower_decl/body_stmt/detect.rs:113-128 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt/detect.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 133 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/perry-hir/src/lower/stmt_loops/for_await_targets.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"caff72c2ac2441a66776f1b34044a6a284ee496e8452b5e6ffbe641dff3c1b9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201316 lines \u00D7 2): crates/perry-hir/src/lower_decl/body_stmt.rs:988-998 | crates/perry-hir/src/lower_decl/body_stmt.rs:1036-1051 \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/perry-hir/src/lower_decl/body_stmt.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"982150439aab5a1b345549c9112c9f96038e6eed771d07a76c92505181b9d332"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/perry-hir/src/lower_decl/class_members.rs:667-682 | crates/perry-hir/src/lower_decl/fn_decl.rs:355-370 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/class_members.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/fn_decl.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 54 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/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2415954530eba50e45f66e542e8f05982a5a83a2c056b030109d338f965261"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 2): crates/perry-hir/src/lower_types.rs:484-495 | crates/perry-hir/src/lower_types.rs:499-514 \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/perry-hir/src/lower_types.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"982db25b13e4dd5e8826b5740a3b5e4e0b42a41dfb8cebce8cfd0f683379e706"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/perry-hir/src/walker/expr_mut.rs:570-585 | crates/perry-hir/src/walker/expr_ref.rs:567-582 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/walker/expr_mut.rs\u0060 and \u0060crates/perry-hir/src/walker/expr_ref.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 2017 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/perry-hir/src/walker/expr_mut.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"4106aef6645edc1aee752bd84df6adbf66f564bb4abc20747e4b88dec1ef39af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 5): crates/perry-codegen/src/collectors/all_pointer_arrays.rs:220-232 | crates/perry-codegen/src/collectors/hoisted_callback_calls.rs:86-100 | crates/perry-codegen/src/collectors/ptr_shape_elements.rs:1283-1295 | crates/perry-codegen/src/collectors/ptr_shape_returns.rs:790-802 | crates/perry-codegen/src/layout_desc.rs:614-628 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/all_pointer_arrays.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07d2f000abee93746d84603f35a9460f5fb5b5d5fb6e33ca0f2321d65a1578f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): crates/perry-codegen/src/lower_call/func_ref.rs:237-251 | crates/perry-codegen/src/lower_call/func_ref.rs:1161-1175 | crates/perry-codegen/src/lower_call/func_ref.rs:1236-1250 | crates/perry-codegen/src/lower_call/func_ref.rs:1314-1328 | crates/perry-codegen/src/lower_call/func_ref.rs:1405-1419 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/func_ref.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d68f4687000095c4777e6d73fdb2046b4313a215494c750c157525e86a3e76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): crates/perry-hir/src/audit.rs:132-146 | crates/perry-hir/src/capability.rs:171-185 | crates/perry-hir/src/egress.rs:163-177 | crates/perry-hir/src/lockdown.rs:120-134 | crates/perry-hir/src/lower/expr_function.rs:1710-1724 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/audit.rs\u0060 and \u0060crates/perry-hir/src/capability.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 136 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/perry-hir/src/audit.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"52046102a435385bcbaa8525f5cecc3e8343be06a866747f5189a4ee622143e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): crates/perry-codegen/src/codegen/closure.rs:1367-1381 | crates/perry-codegen/src/codegen/function.rs:1476-1490 | crates/perry-codegen/src/codegen/method.rs:758-772 | crates/perry-codegen/src/codegen/method_static.rs:433-447 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/function.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 320 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed643facde63bda53add78bed650419ef8bd26f19a527736c2fb09edf0d9b16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): crates/perry-codegen/src/expr/bigint_set.rs:240-254 | crates/perry-codegen/src/expr/bigint_set.rs:309-323 | crates/perry-codegen/src/expr/logical_collections.rs:532-546 | crates/perry-codegen/src/expr/math_simple.rs:415-429 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/bigint_set.rs\u0060 and \u0060crates/perry-codegen/src/expr/logical_collections.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 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/perry-codegen/src/expr/bigint_set.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"e686d39abca7e26833d9119007883a9f24a173345b57bbcd77eb04018588606c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): crates/perry-codegen/src/expr/property_get.rs:968-982 | crates/perry-codegen/src/expr/property_get.rs:1058-1072 | crates/perry-codegen/src/expr/property_set.rs:651-665 | crates/perry-codegen/src/expr/property_set.rs:788-802 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/property_get.rs\u0060 and \u0060crates/perry-codegen/src/expr/property_set.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 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/perry-codegen/src/expr/property_get.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b210781371071bef1a4e9b8e3c8ee68bc44d60c260e16147afa15989293e0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): crates/perry-container-compose/src/backend/apple.rs:110-124 | crates/perry-container-compose/src/backend/apple.rs:169-183 | crates/perry-container-compose/src/backend/docker.rs:130-144 | crates/perry-container-compose/src/backend/docker.rs:183-197 \u2014 before extracting anything, compare \u0060crates/perry-container-compose/src/backend/apple.rs\u0060 and \u0060crates/perry-container-compose/src/backend/docker.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 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/perry-container-compose/src/backend/apple.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a589ad775c1d2af7e74d1dfc4d45a3d144fb41288ba08757b6b1b9da5aedeae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/perry-codegen/src/codegen/static_fields.rs:479-493 | crates/perry-codegen/src/collectors/hoisted_callback_calls.rs:68-82 | crates/perry-codegen/src/stmt/stable_packed_accumulator.rs:267-281 \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/perry-codegen/src/codegen/static_fields.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee7b0f6d8c116b3f6cc71c0d1cd8fb748fea41eb0165b5c88e83cda3f69a0d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 3): crates/perry-codegen/src/collectors/byte_read_key.rs:105-117 | crates/perry-codegen/src/collectors/loop_bounded_i32.rs:441-455 | crates/perry-codegen/src/expr/closure.rs:52-64 \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/perry-codegen/src/collectors/byte_read_key.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bfa0b32bbe571186024d0f5ad68ce4594600ffbeae71db2799a64e94ad1ed4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 3): crates/perry-codegen/src/collectors/hot_callees.rs:401-415 | crates/perry-codegen/src/collectors/loop_bounded_i32.rs:899-913 | crates/perry-hir/src/analysis/fn_infer.rs:798-810 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/hot_callees.rs\u0060 and \u0060crates/perry-codegen/src/collectors/loop_bounded_i32.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 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/perry-codegen/src/collectors/hot_callees.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"9480e256bb34a0579aebd2530a1e297461b359d516548ad03bc5ac86d6789441"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/perry-codegen/src/collectors/param_ranges.rs:167-181 | crates/perry-codegen/src/layout_families.rs:349-363 | crates/perry-hir/src/lower/type_widening.rs:172-186 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/param_ranges.rs\u0060 and \u0060crates/perry-codegen/src/layout_families.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 67 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/perry-codegen/src/collectors/param_ranges.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"29cb9ad1294c7b788aa08293b354648d81bea671ee454ff835a116b3aeea7584"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/perry-codegen/src/collectors/sealed_buffers.rs:204-218 | crates/perry-codegen/src/scope_env/pass.rs:226-240 | crates/perry-hir/src/lexical_frames.rs:364-378 \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/perry-codegen/src/collectors/sealed_buffers.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"935ad2d72af7034f190df859bb0262a1062399baf1bd9d4e0758a8062658cac6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 3): crates/perry-codegen/src/expr/bigint_set.rs:1227-1240 | crates/perry-codegen/src/expr/bigint_set.rs:1485-1498 | crates/perry-codegen/src/expr/math_simple.rs:1023-1037 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/bigint_set.rs\u0060 and \u0060crates/perry-codegen/src/expr/math_simple.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 205 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/perry-codegen/src/expr/bigint_set.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c67cee431e3387559c871030b21c26713b09b0123cc2a5fec1154e08d418246"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 3): crates/perry-codegen/src/expr/this_super_call.rs:1417-1431 | crates/perry-codegen/src/expr/this_super_call.rs:1774-1785 | crates/perry-codegen/src/lower_call/new_error_init.rs:73-86 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/this_super_call.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/new_error_init.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 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/perry-codegen/src/expr/this_super_call.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd90a3b100315e755ecff742986f706858eb3346b3ffa64d153ed7c4bd1084d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/perry-codegen/src/expr/url_main.rs:76-90 | crates/perry-codegen/src/expr/url_main.rs:237-251 | crates/perry-codegen/src/expr/url_main.rs:296-310 \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/perry-codegen/src/expr/url_main.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"be55f61168a2d368253fc695edae4ea2affc1226e2c76f952b625d9d93944658"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/perry-codegen/src/lower_call/property_get/number_string.rs:89-103 | crates/perry-codegen/src/lower_call/property_get/number_string.rs:152-166 | crates/perry-codegen/src/lower_call/property_get/number_string.rs:203-217 \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/perry-codegen/src/lower_call/property_get/number_string.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78757b10f63db3e969f57abaf2a3f2d5c5f35eb964577967d351e3d430f786d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 3): crates/perry-hir/src/lower/expr_object.rs:363-375 | crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs:210-222 | crates/perry-hir/src/lower_decl/fn_decl.rs:320-334 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_object.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 95 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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8504e2bbd75be995e34d437e13b0f816c52565c3e44b3ebfad4c31455d6b54a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 3): crates/perry-hir/src/lower/stmt_loops.rs:577-587 | crates/perry-hir/src/lower/stmt_loops.rs:827-841 | crates/perry-hir/src/lower_decl/body_stmt/for_await.rs:20-30 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt/for_await.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 72 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c490c12c9b0922d3e8a49cb3be81cc96e3ed5099d275b9210e82cd2e460fca6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/perry-codegen/src/codegen/function.rs:1366-1379 | crates/perry-codegen/src/codegen/method_static.rs:325-339 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/function.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method_static.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 268 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/perry-codegen/src/codegen/function.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"cace7e98c13372c57ee87fb8691c45b943d250055f73ac82c609f2f4a1341563"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-codegen/src/collectors/definite_init.rs:271-285 | crates/perry-hir/src/analysis/fn_infer.rs:694-708 \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/perry-codegen/src/collectors/definite_init.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad889e548b38689c9c9043cd3fb7af05c086d4cbcf5e5cd7b532fadbc55be3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-codegen/src/collectors/int_valued_ta_locals.rs:1360-1374 | crates/perry-codegen/src/collectors/int_valued_ta_locals.rs:1600-1614 \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/perry-codegen/src/collectors/int_valued_ta_locals.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefae55df0b88d6ef190484492eca56f97133a2d22d2c871f2091aa949cdee3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/perry-codegen/src/collectors/segview.rs:1295-1307 | crates/perry-hir/src/lower/shared_mutable_capture.rs:1487-1501 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/segview.rs\u0060 and \u0060crates/perry-hir/src/lower/shared_mutable_capture.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 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/perry-codegen/src/collectors/segview.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4abdd157d6a881963fe086c5aabcaf7d8546315e3f503cebf281601087a41c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-codegen/src/dialect/mod.rs:1735-1749 | crates/perry-codegen/src/dialect/mod.rs:1800-1814 \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/perry-codegen/src/dialect/mod.rs"},"region":{"startLine":1735}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf3c17da5549318188c0d3cfdb19765088611ce4e69dc3f5fcb6ba50502b0e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-codegen/src/expr/array_literal.rs:457-471 | crates/perry-codegen/src/expr/array_literal.rs:515-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/array_literal.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2ea583052ae52cc645dd1af22d70cbb43015d6aa3878e99217477f75c00faf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201315 lines \u00D7 2): crates/perry-codegen/src/expr/array_methods.rs:137-151 | crates/perry-codegen/src/expr/instance_misc1.rs:1323-1330 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/array_methods.rs\u0060 and \u0060crates/perry-codegen/src/expr/instance_misc1.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 67 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/perry-codegen/src/expr/array_methods.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a000969380cd2ff4d5079dfadbfd25a36d3859e53b7d4945eb46d945da655ce0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-codegen/src/expr/bigint_set.rs:128-142 | crates/perry-codegen/src/expr/math_simple.rs:253-267 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/bigint_set.rs\u0060 and \u0060crates/perry-codegen/src/expr/math_simple.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 205 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/perry-codegen/src/expr/bigint_set.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d7c7a21a0dd4ae6464da73adf873f74975d1d67d645ae475df3154ef666915"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-codegen/src/expr/byte_cell.rs:245-259 | crates/perry-codegen/src/expr/byte_cell.rs:471-485 \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/perry-codegen/src/expr/byte_cell.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04aa4114519dc846725e9a0eff6198826d68e52842f4cfefa10ba67fec4de70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u201315 lines \u00D7 3): crates/perry-codegen/src/expr/compare.rs:288-292 | crates/perry-codegen/src/expr/compare.rs:971-985 | crates/perry-codegen/src/expr/compare_short_string.rs:27-40 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/compare.rs\u0060 and \u0060crates/perry-codegen/src/expr/compare_short_string.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 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/perry-codegen/src/expr/compare.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"01dc0e08d23f513e3fe14e8b20f2a64ceeb8ebc9e48fb478214a0459b950f163"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/perry-codegen/src/expr/misc_methods.rs:666-679 | crates/perry-codegen/src/expr/misc_methods.rs:702-716 \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/perry-codegen/src/expr/misc_methods.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0265b1eaa491ce62b8c6f28302181109585654c977f9e89f07ab10fc98644f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-codegen/src/expr/url_main.rs:443-457 | crates/perry-codegen/src/expr/url_main.rs:472-486 \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/perry-codegen/src/expr/url_main.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"3753312c55b456a687fe85f8748189dc1e126868b1281e9614dc551a19a57b78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/perry-codegen/src/loop_purity.rs:142-155 | crates/perry-codegen/src/loop_purity.rs:697-711 \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/perry-codegen/src/loop_purity.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa246f88cdd8a2a672a73f41379988af4935d027b73ae20f0ca99a6efa8188f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): crates/perry-codegen/src/lower_call/property_get/completed_object.rs:49-60 | crates/perry-codegen/src/lower_call/property_get/completed_object.rs:145-159 \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/perry-codegen/src/lower_call/property_get/completed_object.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"308f44930f749a23f5df28c2d229d74b6b08b13e2b62a567a9e44ad8932835fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:506-518 | crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:1850-1864 \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/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53e1b3ddc27e1b50b0f3de3853ac74cd417d84e064a164ae64ca403106c59cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-codegen/src/native_value/verify/abi.rs:304-318 | crates/perry-codegen/src/native_value/verify/abi.rs:368-382 \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/perry-codegen/src/native_value/verify/abi.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"d534bd947a9a33caa0da63f842522a8beb7ae54cb8c58da2718e22adfbaa102e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/perry-codegen/src/stmt/class_first_loop.rs:472-486 | crates/perry-hir/src/lower/shared_mutable_capture.rs:799-811 \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/perry-codegen/src/stmt/class_first_loop.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"485085da6cc21ca7cdd90c3377342d0d3e02723d0b1dfe31c97f91531fa2b79b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:3381-3394 | crates/perry-codegen/src/stmt/loops.rs:3489-3503 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":3381}}}],"partialFingerprints":{"codehealthFindingId/v1":"903b6ca3cc0adefa39cfb64e2825492b977bee5d7fb9a523d7834d860a9efe5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-codegen/src/stmt/region_loop/bare.rs:130-144 | crates/perry-codegen/src/stmt/region_loop/verify.rs:62-76 \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/perry-codegen/src/stmt/region_loop/bare.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8da88d745d3a629c23d410dadde1a6899e7a949c8d081fcfd54594d1ecc4f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/perry-ext-http/src/client_events.rs:315-329 | crates/perry-ext-http/src/client_events.rs:548-560 \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/perry-ext-http/src/client_events.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3dee62ee6fbb3bf0eaedb4905f8965b989b3e1ffcdb957b9355d4c56739e3ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-ext-http/src/client_events.rs:738-752 | crates/perry-ext-http/src/client_events.rs:770-784 \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/perry-ext-http/src/client_events.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"e305a3f96ce167fe190e5e82da696556fe5d3313141a5626af50a74d8af27575"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-ext-http/src/client_turnloop/native_client.rs:577-591 | crates/perry-ext-http/src/server/turnloop_serve/conn.rs:273-287 \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/perry-ext-http/src/client_turnloop/native_client.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"33980959f48c92fd549b8d3f86f1ccf406b1ae44f580319ea67312e3b7d3f457"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-ext-http/src/server/http2_server/dispatch.rs:376-390 | crates/perry-ext-http/src/server/https_server.rs:523-537 \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/perry-ext-http/src/server/http2_server/dispatch.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ea002d6ccce730543e4db3d4c2f5bc8e4d97385846a67a689d6bfdf51a74d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 2): crates/perry-ext-http/src/server/https_server.rs:469-479 | crates/perry-ext-http/src/server/https_server.rs:497-511 \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/perry-ext-http/src/server/https_server.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5807bea0534f198cb8bf7d428128f1c92bb884a4894fb3a27f3ca921823407"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-ext-http/src/server/turnloop_serve/wire.rs:206-220 | crates/perry-http-server/src/wire.rs:206-220 \u2014 before extracting anything, compare \u0060crates/perry-ext-http/src/server/turnloop_serve/wire.rs\u0060 and \u0060crates/perry-http-server/src/wire.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 115 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/perry-ext-http/src/server/turnloop_serve/wire.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb727f0fa1fc9974112b40dddd6bbf6c27c84fe1b0a6c6dbb408a8dd00d618ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-hir/src/analysis.rs:550-564 | crates/perry-hir/src/lower_decl/class_captures.rs:75-89 \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/perry-hir/src/analysis.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"2518d421dfe8dff542b53a7cdcb5aa001aabe3ccfadf257f9ab27994bfba49e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-hir/src/destructuring/pattern_binding.rs:237-251 | crates/perry-hir/src/destructuring/pattern_binding.rs:292-306 \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/perry-hir/src/destructuring/pattern_binding.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed81ecadac0de65a88b9395291486d8a7236144916b6b99a495c118a0194c24b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/globals.rs:831-845 | crates/perry-hir/src/lower/expr_call/module_static.rs:224-238 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/globals.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/module_static.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 296 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/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f100ffd2709c7d40b3c9ab11ef39ffd7dd599908e5ffc5cb28d3aa8f416329"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/inline_array_methods.rs:20-35 | crates/perry-hir/src/lower/expr_call/local_array_methods.rs:172-186 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/inline_array_methods.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/local_array_methods.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 68 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/perry-hir/src/lower/expr_call/inline_array_methods.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d68080bcba20c4cbbc227f3529d280800d22e42049564071095e146089c873"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/module_class_static.rs:70-84 | crates/perry-hir/src/lower/expr_call/native_module/imported_module_dispatch.rs:209-223 \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/perry-hir/src/lower/expr_call/module_class_static.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0333411299de4c83505675151adddc849c4cb132bc93364ca22d6a2c7a973f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-hir/src/lower/expr_object.rs:1454-1468 | crates/perry-hir/src/lower/expr_object.rs:1684-1698 \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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff637e32618240a195532b041d840931bc02d119227c178f0ce606ab638efad1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-hir/src/lower/module_decl.rs:1434-1448 | crates/perry-hir/src/lower/module_decl.rs:1556-1570 \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/perry-hir/src/lower/module_decl.rs"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb321fad5763591f98b4f495ddfe30caca74bf3bb0b51c0e4bd83314a5e264bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-hir/src/lower/stmt.rs:888-902 | crates/perry-hir/src/lower/stmt.rs:905-919 \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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d2099b40139557114f2a3770a7af8fd58e938c5d31d42f009d5599a9e7684a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:690-704 | crates/perry-hir/src/lower_decl/body_stmt.rs:1433-1447 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce7556af909748da0e8b66c4b4a4c99dfbdae9b764d78f1d3d60c82ff15fac4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:1819-1833 | crates/perry-hir/src/lower_decl/body_stmt.rs:2299-2313 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":1819}}}],"partialFingerprints":{"codehealthFindingId/v1":"2302792d29bc503d1aec44c931fd0ec9afe8759173f9a50d7e53555b604f2465"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): crates/perry-hir/src/monomorph/infer.rs:23-37 | crates/perry-hir/src/monomorph/update_call_sites.rs:698-709 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/monomorph/infer.rs\u0060 and \u0060crates/perry-hir/src/monomorph/update_call_sites.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 128 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/perry-hir/src/monomorph/infer.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d55eced06ab69d3b17f8a43f77d54bb7b0fa1856b4f3dadba4c8c8076a702ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 6): crates/perry-codegen/src/codegen/closure.rs:1178-1191 | crates/perry-codegen/src/codegen/entry.rs:826-839 | crates/perry-codegen/src/codegen/entry/module_init.rs:306-319 | crates/perry-codegen/src/codegen/function.rs:1326-1339 | crates/perry-codegen/src/codegen/method.rs:614-627 | crates/perry-codegen/src/codegen/method_static.rs:285-298 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/entry.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 221 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d8e33d8e9a1ac7e51f45df52a5f2a3e535e88d4be1b945b58d6ff7fa4d7ef6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 6): crates/perry-codegen/src/codegen/closure.rs:1471-1484 | crates/perry-codegen/src/codegen/entry.rs:1076-1089 | crates/perry-codegen/src/codegen/entry/module_init.rs:556-569 | crates/perry-codegen/src/codegen/function.rs:1573-1586 | crates/perry-codegen/src/codegen/method.rs:866-879 | crates/perry-codegen/src/codegen/method_static.rs:530-543 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/entry.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 221 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58999059be47a85139556b966f6f6bab18e3d84fcd8abec094f2a5cb79ec90a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 5): crates/perry-ext-http/src/server/http2_server/pump.rs:71-83 | crates/perry-ext-http/src/server/https_server.rs:465-478 | crates/perry-ext-http/src/server/https_server.rs:493-505 | crates/perry-ext-http/src/server/server.rs:1309-1322 | crates/perry-ext-http/src/server/server.rs:1355-1367 \u2014 before extracting anything, compare \u0060crates/perry-ext-http/src/server/http2_server/pump.rs\u0060 and \u0060crates/perry-ext-http/src/server/https_server.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 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/perry-ext-http/src/server/http2_server/pump.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2403d6a98b56e93090b75a2213891c052067f106b52dfb60721ed4af8f08027d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 4): crates/perry-codegen/src/collectors/segview.rs:708-719 | crates/perry-codegen/src/collectors/segview.rs:1329-1340 | crates/perry-hir/src/analysis.rs:547-560 | crates/perry-hir/src/lower_decl/class_captures.rs:72-85 \u2014 there are 4 copies across 3 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/segview.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"153ef2d0a2aaac0c4bb9b5679c0601a3a8f919064857c3f2afb74b77edf6b442"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): crates/perry-codegen/src/collectors/typed_locals.rs:761-774 | crates/perry-codegen/src/collectors/typed_locals.rs:788-801 | crates/perry-codegen/src/collectors/typed_locals.rs:820-833 | crates/perry-codegen/src/collectors/typed_locals.rs:859-872 \u2014 all 4 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/perry-codegen/src/collectors/typed_locals.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"0268eab42a196c365a5ecf072dd6769e11d17e06a0e65cb50ae3d007dd34c377"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 4): crates/perry-ext-net/src/jsvalue.rs:233-246 | crates/perry-ext-net/src/jsvalue.rs:263-272 | crates/perry-ext-net/src/jsvalue.rs:278-291 | crates/perry-ext-net/src/jsvalue.rs:316-329 \u2014 all 4 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/perry-ext-net/src/jsvalue.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63c05e25ce56ac051a659e9b485a6f0be9a68395eafce9307646bb6ca43bab7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): crates/perry-hir/src/lower/lower_expr/reactive_text.rs:164-177 | crates/perry-hir/src/lower/lower_expr/reactive_text.rs:205-218 | crates/perry-hir/src/lower/widget_decl/reactive_animate.rs:242-255 | crates/perry-hir/src/lower/widget_decl/reactive_animate.rs:283-296 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/lower_expr/reactive_text.rs\u0060 and \u0060crates/perry-hir/src/lower/widget_decl/reactive_animate.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 87 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/perry-hir/src/lower/lower_expr/reactive_text.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"784249bdf92385856e64a47e44ce9d5e052a17bdd6ce2f4d565f52930eb9e50e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/perry-codegen/src/codegen/entry.rs:847-860 | crates/perry-codegen/src/codegen/entry/module_init.rs:327-340 | crates/perry-codegen/src/codegen/function.rs:1350-1363 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/entry.rs\u0060 and \u0060crates/perry-codegen/src/codegen/entry/module_init.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 473 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/perry-codegen/src/codegen/entry.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"5deec86d54d0dd3e01fa6a765aa002699177787e635f745dc1a7365c8867162c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/perry-codegen/src/codegen/mod.rs:1554-1567 | crates/perry-codegen/src/codegen/mod.rs:1697-1710 | crates/perry-codegen/src/lower_call/new_alloc.rs:961-974 \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/perry-codegen/src/codegen/mod.rs"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"2414dc39cd49d755749474ccb7d40c17e78edb44b310204b33702140671f9bbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 3): crates/perry-codegen/src/collectors/receiver_regions.rs:991-1004 | crates/perry-codegen/src/loop_purity.rs:142-153 | crates/perry-codegen/src/loop_purity.rs:697-709 \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/perry-codegen/src/collectors/receiver_regions.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db393636a40c76aefab754deeba268247196ee0ba989222fd5fa4fe6ba4bd38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/perry-codegen/src/expr/folded_builtin_override.rs:872-885 | crates/perry-codegen/src/lower_call/property_get.rs:276-289 | crates/perry-codegen/src/lower_call/property_get/builtin_kind_guard.rs:465-478 \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/perry-codegen/src/expr/folded_builtin_override.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"863adce8ee73e94bbd20b00866be037b3e24a56a3f9beaf1c73ed28a2fa48760"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201314 lines \u00D7 3): crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs:488-501 | crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs:518-526 | crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs:534-543 \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/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f4955b80072a6f4bbcf83621c455724f1e399288a15e536cda27a78a584b46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/perry-codegen/src/lower_call/early_branches.rs:799-812 | crates/perry-codegen/src/lower_call/early_branches.rs:899-912 | crates/perry-codegen/src/lower_call/early_branches.rs:1001-1014 \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/perry-codegen/src/lower_call/early_branches.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"957af24d7587d9e55a5ec2b853d2b642c36e221a31880051ade4343d4e32ecef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/perry-codegen/src/lower_call/options/notification.rs:125-138 | crates/perry-codegen/src/lower_call/options/notification.rs:164-177 | crates/perry-codegen/src/lower_call/options/notification.rs:206-219 \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/perry-codegen/src/lower_call/options/notification.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a0dbd64ac28ca83c3ad5e7a694d08db02cfd7c2aafb9f1fd873a477c2d93e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/array_only_methods.rs:1326-1339 | crates/perry-hir/src/lower/expr_call/imported_array_methods.rs:271-284 | crates/perry-hir/src/lower/expr_call/inline_array_methods.rs:200-213 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/array_only_methods.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/imported_array_methods.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 97 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/perry-hir/src/lower/expr_call/array_only_methods.rs"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8d33f122820e33043e55499bd2cb2e56c73a01353c8cd5034e9a3d8ff7f725"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/module_class_static.rs:121-133 | crates/perry-hir/src/lower/expr_call/nested_namespace.rs:274-287 | crates/perry-hir/src/lower/expr_call/nested_namespace.rs:349-362 \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/perry-hir/src/lower/expr_call/module_class_static.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc75ea188fe567bb7726088a954a97f50f1d4c5f12b81be93a102ae5ca3acc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-codegen-glance/src/emit.rs:464-477 | crates/perry-codegen-swiftui/src/emit.rs:904-917 \u2014 before extracting anything, compare \u0060crates/perry-codegen-glance/src/emit.rs\u0060 and \u0060crates/perry-codegen-swiftui/src/emit.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 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/perry-codegen-glance/src/emit.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ecbfb2691d8429385105d92dd26a6b41a8290a9879b0db3a5d7f1ba02b3af6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-codegen-glance/src/emit.rs:582-595 | crates/perry-codegen-wear-tiles/src/emit.rs:402-415 \u2014 before extracting anything, compare \u0060crates/perry-codegen-glance/src/emit.rs\u0060 and \u0060crates/perry-codegen-wear-tiles/src/emit.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 144 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/perry-codegen-glance/src/emit.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"725281fb128796ee5cf3abd2dc884bbac5756b77cc8bdca1f238d9c1217e057a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-codegen-js/src/minify.rs:217-230 | crates/perry-codegen-wasm/src/minify.rs:213-226 \u2014 before extracting anything, compare \u0060crates/perry-codegen-js/src/minify.rs\u0060 and \u0060crates/perry-codegen-wasm/src/minify.rs\u0060 as WHOLE FILES: this scan already matched 5 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/perry-codegen-js/src/minify.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bc223095e1898ee267d10a624eb5dd003dbf0c4451b07d6f141f6445cfb4db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-codegen/src/codegen/class_artifacts.rs:356-370 | crates/perry-codegen/src/codegen/class_artifacts.rs:579-592 \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/perry-codegen/src/codegen/class_artifacts.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50a86b693f4c12d50b20321e3be8edb878b17460e90a612002245d3d686a29b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-codegen/src/codegen/closure.rs:1343-1356 | crates/perry-codegen/src/codegen/method.rs:734-747 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 341 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe090b93d921edf257ad11b1cc763c9eab004b1360d147204f4debfbc5ef0d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-codegen/src/codegen/function.rs:261-274 | crates/perry-codegen/src/codegen/method_trampolines.rs:60-73 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/function.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method_trampolines.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 96 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/perry-codegen/src/codegen/function.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9e348c9e7cf0bb4cf52fd02899b6814ee83cd733ad9cd46901c55543551a9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-codegen/src/codegen/method.rs:639-652 | crates/perry-codegen/src/codegen/method_static.rs:314-327 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/method.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method_static.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 341 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/perry-codegen/src/codegen/method.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f874fcf593b52366a4ad78ce3789a9f583a820a29228fafe1b5db9af0226f78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-codegen/src/codegen/split_regions_facts.rs:12-25 | crates/perry-hir/src/lower/shared_mutable_capture.rs:780-793 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/split_regions_facts.rs\u0060 and \u0060crates/perry-hir/src/lower/shared_mutable_capture.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/split_regions_facts.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e33d159b8ca0f20be723eb1bc7f99109c4610f09829f0aaf446327cb4814fb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-codegen/src/codegen/string_pool.rs:902-915 | crates/perry-codegen/src/codegen/string_pool.rs:936-949 \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/perry-codegen/src/codegen/string_pool.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"686ca9bae396b91bacfc1900701e0ffe146a8c15540ed2d4d25e3a9486d27713"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201314 lines \u00D7 3): crates/perry-codegen/src/collectors/escape_arrays.rs:802-815 | crates/perry-codegen/src/collectors/escape_check.rs:1164-1173 | crates/perry-codegen/src/collectors/escape_objects.rs:663-670 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/escape_arrays.rs\u0060 and \u0060crates/perry-codegen/src/collectors/escape_objects.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 46 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/perry-codegen/src/collectors/escape_arrays.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"24cabbd88fc3c25dbd5abe542ccb0b2236155c576ba35ed435cb968d4a9157be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-codegen/src/collectors/escape_check.rs:662-675 | crates/perry-codegen/src/collectors/escape_news.rs:525-538 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/escape_check.rs\u0060 and \u0060crates/perry-codegen/src/collectors/escape_news.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 73 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/perry-codegen/src/collectors/escape_check.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd89b13c3847595a2f7a40eee696161a7c0487d93ecbcedafb92e98d2f7d97d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u201314 lines \u00D7 3): crates/perry-codegen/src/expr/array_literal.rs:304-317 | crates/perry-codegen/src/expr/inline_birth/shared.rs:135-144 | crates/perry-codegen/src/lower_call/new_alloc.rs:787-791 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/array_literal.rs\u0060 and \u0060crates/perry-codegen/src/expr/inline_birth/shared.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 67 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/perry-codegen/src/expr/array_literal.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"306715a07e57ae9569cf5ab90ec455194a977ed6fa9b35ffca630089e56d4846"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/perry-codegen/src/expr/array_literal.rs:689-702 | crates/perry-codegen/src/expr/instance_misc1.rs:1607-1619 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/array_literal.rs\u0060 and \u0060crates/perry-codegen/src/expr/instance_misc1.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 62 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/perry-codegen/src/expr/array_literal.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb4fea06ce1b4357f2ee12d350ddac0a248e39e53b0be96a2592aa471eba629"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-codegen/src/expr/arrays_finds.rs:1181-1194 | crates/perry-codegen/src/expr/arrays_finds.rs:1276-1289 \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/perry-codegen/src/expr/arrays_finds.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a2b8e87cb13122d175467b532c5280c618b5fa701e8672fbb375fed50dcae9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/perry-codegen/src/expr/index_set_packed_loop.rs:187-200 | crates/perry-codegen/src/expr/index_set_packed_loop.rs:358-370 \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/perry-codegen/src/expr/index_set_packed_loop.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d09b0fb411b9a6d53fed277dc0bc44fb17b90f0010c67a49a23a1e594670be2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-codegen/src/expr/member_update.rs:167-180 | crates/perry-codegen/src/expr/member_update.rs:186-199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/member_update.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01e1e97341e2b89b7fcdabe96f47d50ccf379df8ed2fbcba931ba688cd08554"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): crates/perry-codegen/src/expr/misc_methods.rs:102-115 | crates/perry-codegen/src/lower_call/method_override.rs:56-66 \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/perry-codegen/src/expr/misc_methods.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e14168c5902056e217084134e8d2c552c4c38aaa9e5d4f66fd8020af133fdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/perry-codegen/src/expr/misc_methods.rs:399-411 | crates/perry-codegen/src/expr/misc_methods.rs:556-569 \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/perry-codegen/src/expr/misc_methods.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e35d23dfd90a914456ec6b4e4defff402ee093a9bfec5410c5678be45e50fd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-codegen/src/expr/property_get/helpers.rs:217-230 | crates/perry-codegen/src/expr/property_get/helpers.rs:293-306 \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/perry-codegen/src/expr/property_get/helpers.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd80687f9d52eb9308a6ac292bedff6fd9109308518c498b2c587f99d8e0d2a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-codegen/src/expr/proven_view_access.rs:350-363 | crates/perry-codegen/src/expr/proven_view_access.rs:649-662 \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/perry-codegen/src/expr/proven_view_access.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10cf8e18e55563bf3f7d5bc5cd1f6be90284c4492a1c749733a5b140fb67674"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-codegen/src/expr/u8_buffer_read.rs:149-162 | crates/perry-codegen/src/expr/u8_buffer_read.rs:361-374 \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/perry-codegen/src/expr/u8_buffer_read.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da35791125694f403379e5a4ae8b454c39be3370dc774ccddce9ae522a84165"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-codegen/src/native_value/verify/abi.rs:328-341 | crates/perry-codegen/src/native_value/verify/abi.rs:392-405 \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/perry-codegen/src/native_value/verify/abi.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5bee5d2ec46bb90d8d963f6fdc3b6f799a5b1c742748317cd78750b29bac7db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-codegen/src/type_analysis/predicates.rs:562-575 | crates/perry-codegen/src/type_analysis/refine.rs:602-615 \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/perry-codegen/src/type_analysis/predicates.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01bf159bbfb83648782dd5e31652276b4f40a4710f404e10642dff65c000179"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-component-host/src/async_values/compose.rs:153-166 | crates/perry-component-host/src/async_values/compose.rs:193-206 \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/perry-component-host/src/async_values/compose.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d044c0fb9a29994117e746c6dac7b91e7b20940906b9def9f65b273e37d3fca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/perry-component-host/src/driver/async_values.rs:58-71 | crates/perry-component-host/src/driver/writers.rs:21-32 \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/perry-component-host/src/driver/async_values.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"076396402b3674070dd300b91a1b830fcf2e5648726dc7dac63d97a75b84de51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): crates/perry-ext-http/src/server/response_end.rs:47-57 | crates/perry-ext-http/src/server/response_end.rs:108-121 \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/perry-ext-http/src/server/response_end.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc3a980917836aa6e98d202d9dd2cf41a7ebb241862273dcb2ce2d419603769"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-ext-ws/src/lib.rs:1630-1643 | crates/perry-ext-ws/src/lib.rs:1722-1735 \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/perry-ext-ws/src/lib.rs"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"339e665d6e8ec9672428b57bcf7259e85b0d15d74d11abb45d458dfeda34e348"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-hir/src/destructuring/assignment_stmt.rs:272-285 | crates/perry-hir/src/destructuring/pattern_binding.rs:160-173 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/destructuring/assignment_stmt.rs\u0060 and \u0060crates/perry-hir/src/destructuring/pattern_binding.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 53 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/perry-hir/src/destructuring/assignment_stmt.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"1982c47cc36c3af862cf14fadd96a5434f422a25d25db4c3e69e40da4016189e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/globals.rs:290-303 | crates/perry-hir/src/lower/expr_call/globals.rs:393-406 \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/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"0026942aec41118e7853096a98efca4a851fa5346c169701223083380155cee5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-hir/src/lower/expr_function.rs:1324-1337 | crates/perry-hir/src/lower_decl/block.rs:841-854 \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/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a5a846f5aaa2e7e892f812cc4e4993e3db0709e4a785a5c33f68bace02382c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-hir/src/lower/expr_member.rs:553-566 | crates/perry-hir/src/lower/expr_member.rs:679-692 \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/perry-hir/src/lower/expr_member.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebd31f88323e81c6ccc44514e228e8ced2b18d062d5efb09f925a5bc8656560"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): crates/perry-hir/src/lower/expr_member/member_tail.rs:709-722 | crates/perry-hir/src/lower/expr_member/member_tail.rs:738-748 \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/perry-hir/src/lower/expr_member/member_tail.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fe7479d0103cb437b8256437c3987a528ddd497a3373f34142e540de34730c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/perry-hir/src/lower/lower_expr.rs:288-301 | crates/perry-hir/src/lower/template.rs:27-39 \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/perry-hir/src/lower/lower_expr.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d037d4c77573c7dfa3be0ba843f6f93eb38de336fcd0b79790d8a177bae392"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201314 lines \u00D7 3): crates/perry-hir/src/lower/module_decl.rs:580-591 | crates/perry-hir/src/lower/module_decl.rs:1700-1713 | crates/perry-hir/src/lower/module_decl.rs:1791-1792 \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/perry-hir/src/lower/module_decl.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"65bfe0c0c528af1f3e3f16a9d707a792212f4d465cc7b74ac5a5ce70cb9ec6e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): crates/perry-hir/src/lower/stmt.rs:1343-1353 | crates/perry-hir/src/lower_decl/body_stmt.rs:875-888 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 308 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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"027caf43c15a2392d0fa4f36d1175679cc7d583462f5f4f85f85e602acb5cad9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs:26-39 | crates/perry-hir/src/lower_decl/body_stmt/detect.rs:26-39 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt/detect.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 133 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/perry-hir/src/lower/stmt_loops/for_await_targets.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d887c124436fc9d460569e8478f94c56c202b1a5d3872a48d0b9376cd2d92bb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): crates/perry-hir/src/lower_decl/class_decl.rs:606-619 | crates/perry-hir/src/lower_decl/class_decl/from_ast.rs:301-310 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/class_decl.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/class_decl/from_ast.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 548 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/perry-hir/src/lower_decl/class_decl.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bff8691c43fa7f4a559afe8477a5336520dfff7462a5b34912a5a9a6cda7b83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/perry-hir/src/lower_decl/fn_decl.rs:67-80 | crates/perry-hir/src/lower_decl/private_members.rs:89-101 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/fn_decl.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/private_members.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 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/perry-hir/src/lower_decl/fn_decl.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbcc53b5cab07defa07505fface7fdd9e6d6f7593748dce56c48997635421c54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): crates/perry-hir/src/lower_patterns.rs:1180-1190 | crates/perry-hir/src/lower_patterns.rs:1255-1268 \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/perry-hir/src/lower_patterns.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1a253380abd8684d3daa8600fdeb932fba04a92f4fe0f89b9c2addd4a69322"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-hir/src/monomorph/constraints.rs:192-205 | crates/perry-hir/src/monomorph/constraints.rs:219-232 \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/perry-hir/src/monomorph/constraints.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"019c6d08229bba35d4b680d9a73e4b422a00d71eda1854ab6ba2708d1333f7aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): crates/perry-hir/src/monomorph/infer.rs:87-100 | crates/perry-hir/src/monomorph/update_call_sites.rs:742-751 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/monomorph/infer.rs\u0060 and \u0060crates/perry-hir/src/monomorph/update_call_sites.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 128 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/perry-hir/src/monomorph/infer.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"53176a75c02c2350f036980ca34c964fd0de10c64831788b96724a4452d33864"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/perry-hir/src/monomorph/infer.rs:126-139 | crates/perry-hir/src/monomorph/update_call_sites.rs:760-772 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/monomorph/infer.rs\u0060 and \u0060crates/perry-hir/src/monomorph/update_call_sites.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 128 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/perry-hir/src/monomorph/infer.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"228128abb86b88678fc63835343068c1c81011f8ce9c45649328e828bddc4489"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201313 lines \u00D7 10): crates/perry-codegen/src/expr/element_shape_reads.rs:185-194 | crates/perry-codegen/src/expr/property_get.rs:537-544 | crates/perry-codegen/src/expr/property_get/composed_ics.rs:65-70 | crates/perry-codegen/src/expr/property_get/generic_dispatch.rs:701-710 | crates/perry-codegen/src/expr/typed_array_rmw.rs:297-304 | crates/perry-codegen/src/lower_call/property_get/completed_object.rs:134-139 | crates/perry-codegen/src/lower_conditional.rs:109-115 | crates/perry-codegen/src/lower_string_method/char_code_at.rs:216-228 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:718-725 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:1057-1063 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/property_get.rs\u0060 and \u0060crates/perry-codegen/src/expr/property_get/generic_dispatch.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 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/perry-codegen/src/expr/element_shape_reads.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"3facfdd204f93a7961d38a15ee508fa30f6f6c52f5c7d331f62a02cac24db8d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 9): crates/perry-codegen/src/lower_call/early_branches.rs:831-843 | crates/perry-codegen/src/lower_call/early_branches.rs:932-944 | crates/perry-codegen/src/lower_call/early_branches.rs:1036-1048 | crates/perry-codegen/src/lower_call/early_branches.rs:1143-1155 | crates/perry-codegen/src/lower_call/func_ref.rs:237-249 | crates/perry-codegen/src/lower_call/func_ref.rs:1161-1173 | crates/perry-codegen/src/lower_call/func_ref.rs:1236-1248 | crates/perry-codegen/src/lower_call/func_ref.rs:1314-1326 | crates/perry-codegen/src/lower_call/func_ref.rs:1405-1417 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/early_branches.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/func_ref.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 122 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/perry-codegen/src/lower_call/early_branches.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3f66bc7f278b364c37c26752e03b6c31f2ba49a3a0447767b925fa0cfb5c2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): crates/perry-codegen/src/codegen/closure.rs:42-54 | crates/perry-codegen/src/codegen/closure.rs:59-71 | crates/perry-codegen/src/codegen/closure.rs:76-88 | crates/perry-codegen/src/codegen/closure.rs:94-106 \u2014 all 4 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22e14fe396128c06bfc60b3f3c38a1000feeecb677a65b8fc79d065200e2525"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201313 lines \u00D7 4): crates/perry-codegen/src/codegen/string_pool.rs:1107-1119 | crates/perry-codegen/src/codegen/string_pool.rs:1184-1193 | crates/perry-codegen/src/codegen/string_pool.rs:1474-1481 | crates/perry-codegen/src/codegen/string_pool.rs:1554-1561 \u2014 all 4 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/perry-codegen/src/codegen/string_pool.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a1db75a4bf86860825bdc72874374e9d502251079ff0aab1965f2c8e6897c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): crates/perry-codegen/src/collectors/param_ranges.rs:144-156 | crates/perry-codegen/src/collectors/pointer_locals.rs:510-522 | crates/perry-codegen/src/collectors/pointer_locals.rs:737-749 | crates/perry-hir/src/analysis/value_types.rs:449-461 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/pointer_locals.rs\u0060 and \u0060crates/perry-hir/src/analysis/value_types.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 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/perry-codegen/src/collectors/param_ranges.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d868d7b40a8bf223c1313ef1f8780b3d1a75b2c6934ece4f301074b3c8203f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 4): crates/perry-codegen/src/collectors/typed_locals.rs:332-343 | crates/perry-codegen/src/stmt/region_loop/plan.rs:723-735 | crates/perry-codegen/src/type_analysis/numeric.rs:278-290 | crates/perry-codegen/src/type_analysis/numeric.rs:798-810 \u2014 there are 4 copies across 3 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/typed_locals.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a10124a8914a7ada609c17398448d1e54a6c72cb59d709b3229fb75cc22793"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 4): crates/perry-codegen/src/expr/array_pop.rs:79-91 | crates/perry-codegen/src/expr/array_pop.rs:138-148 | crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs:244-254 | crates/perry-codegen/src/stmt/loops.rs:3317-3326 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/array_pop.rs\u0060 and \u0060crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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/perry-codegen/src/expr/array_pop.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed8c8887de85dc101cecab00d99312933f848f205c56465292fad62771de58a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 4): crates/perry-codegen/src/expr/folded_builtin_override.rs:872-883 | crates/perry-codegen/src/expr/static_method.rs:528-536 | crates/perry-codegen/src/lower_call/property_get.rs:276-287 | crates/perry-codegen/src/lower_call/property_get/builtin_kind_guard.rs:464-476 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/folded_builtin_override.rs\u0060 and \u0060crates/perry-codegen/src/expr/static_method.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 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/perry-codegen/src/expr/folded_builtin_override.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"23894a9edf073d9e806de666fa2c33447f997aa26b6b658bc4e0f8a8864859d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/perry-codegen/src/collectors/definite_init.rs:249-261 | crates/perry-codegen/src/stmt/class_first_loop.rs:432-444 | crates/perry-hir/src/iterator_record.rs:557-569 \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/perry-codegen/src/collectors/definite_init.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fded9925e318009b0df04f392e7e871e666eb168954dae14905106919de2a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/perry-codegen/src/expr/agent_ptr.rs:137-149 | crates/perry-codegen/src/expr/agent_ptr.rs:181-193 | crates/perry-codegen/src/expr/agent_ptr.rs:291-303 \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/perry-codegen/src/expr/agent_ptr.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e94061dd7b0ea14901b80dde0ae5c1f37a68672d2a52f0a339c51e6701ad356"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/perry-codegen/src/expr/js_runtime.rs:70-82 | crates/perry-codegen/src/expr/js_runtime.rs:102-114 | crates/perry-codegen/src/expr/js_runtime.rs:199-211 \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/perry-codegen/src/expr/js_runtime.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a21a9de04765be71f479acd98545e6752d289eab2bc03a217effa943c048f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 3): crates/perry-codegen/src/expr/this_super_call.rs:1437-1449 | crates/perry-codegen/src/expr/this_super_call.rs:1790-1799 | crates/perry-codegen/src/lower_call/new_error_init.rs:90-100 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/this_super_call.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/new_error_init.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 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/perry-codegen/src/expr/this_super_call.rs"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f52979cc00df172997e9cccf72639dca8c90c1e6becb0eb945452af1563219f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/perry-codegen/src/lower_call/early_branches.rs:559-571 | crates/perry-codegen/src/lower_call/early_branches.rs:1198-1212 | crates/perry-codegen/src/lower_call/property_get/imported_object.rs:182-194 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/early_branches.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/property_get/imported_object.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 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/perry-codegen/src/lower_call/early_branches.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fbedc401739fde4613372873c174dc412ede317094a9ede34126168bab62fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 3): crates/perry-hir/src/js_transform/local_natives.rs:999-1009 | crates/perry-hir/src/js_transform/local_natives.rs:1091-1103 | crates/perry-hir/src/js_transform/local_natives.rs:1118-1128 \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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2588db449dd87d6a3d6cb088f3fdfd78f9bc4d01cf5c6d72e4b9aa1f40d8f4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/local_array_methods.rs:1146-1157 | crates/perry-hir/src/lower/expr_call/textencoder.rs:68-80 | crates/perry-hir/src/lower/expr_call/textencoder.rs:105-116 \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/perry-hir/src/lower/expr_call/local_array_methods.rs"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbe1ce0457490b999e205e0f5450f87b418917281a58253a9af61d8852a73e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/perry-hir/src/lower_decl/class_members.rs:315-327 | crates/perry-hir/src/lower_decl/class_members.rs:1027-1039 | crates/perry-hir/src/lower_decl/private_members.rs:382-394 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/class_members.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/private_members.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 210 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/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c4a759004bd61fbe41b7bd3f71e1b709e24a4704aae97882b45202b07b42b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen-wasm/src/emit/stmt.rs:150-162 | crates/perry-codegen-wasm/src/emit/stmt.rs:235-247 \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/perry-codegen-wasm/src/emit/stmt.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fef0500367b44b8ad66b7a10156cdf8e6975610167d86022adbf1e99010433"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen/src/codegen/function.rs:233-245 | crates/perry-codegen/src/codegen/method_trampolines.rs:32-44 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/function.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method_trampolines.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 96 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/perry-codegen/src/codegen/function.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e1d5178059c7bf167fcfbb2b1ffb9301658432cb23173624117c0bdae13eef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen/src/codegen/function.rs:247-259 | crates/perry-codegen/src/codegen/method_trampolines.rs:46-58 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/function.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method_trampolines.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 96 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/perry-codegen/src/codegen/function.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"828c1808e6c33d0b00104a62370db194bae40819fb845d63cb6a604fc51e80e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/perry-codegen/src/collectors/escape_arrays.rs:654-666 | crates/perry-codegen/src/collectors/escape_objects.rs:496-507 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/escape_arrays.rs\u0060 and \u0060crates/perry-codegen/src/collectors/escape_objects.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 46 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/perry-codegen/src/collectors/escape_arrays.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87a1df340e4626748b01989afc8a270eacdab6b261c9b66daefa7c5ec1215ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen/src/collectors/i32_locals.rs:1277-1289 | crates/perry-codegen/src/collectors/refs.rs:240-252 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/i32_locals.rs\u0060 and \u0060crates/perry-codegen/src/collectors/refs.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 477 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/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5b639cb5c5cab39259ed4593155da3d5c5deefd3311b2babd93c2899e227e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/perry-codegen/src/collectors/loop_bounded_i32.rs:146-158 | crates/perry-codegen/src/collectors/loop_bounded_i32.rs:262-273 \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/perry-codegen/src/collectors/loop_bounded_i32.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbca98390e78255ebef14adcb13b502af6bd76c3594ed4bddbc02e07c0576ab1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/perry-codegen/src/collectors/ptr_numarray.rs:704-716 | crates/perry-codegen/src/collectors/ptr_numarray.rs:731-742 \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/perry-codegen/src/collectors/ptr_numarray.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e7d14bdbc11d9e3fc754794ba4ae57acc26a8cbfb4b27e34b91ca9c2ec64c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 2): crates/perry-codegen/src/dialect/mod.rs:1130-1138 | crates/perry-codegen/src/dialect/mod.rs:1672-1684 \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/perry-codegen/src/dialect/mod.rs"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadfb0c79ccd3b8b47b70993c4dfe73c71911f20174c4619cea8e71412c16b7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen/src/expr/array_push.rs:302-314 | crates/perry-codegen/src/expr/write_barrier.rs:850-862 \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/perry-codegen/src/expr/array_push.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c25da0b7b600731b2f635ea5f6142067940a36a910814178f2206da1e18b196"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen/src/expr/binary.rs:1673-1685 | crates/perry-codegen/src/expr/binary.rs:1705-1717 \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/perry-codegen/src/expr/binary.rs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b8a17ed275ab0123e82229fe3216412240fba25452b8bbf3a7c230b6002bb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen/src/expr/byte_cell.rs:42-54 | crates/perry-codegen/src/expr/byte_cell.rs:515-527 \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/perry-codegen/src/expr/byte_cell.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b9a20976d9e5f0fda7c94668d6918b926be0cda192a1a89a7a1b731e661f3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen/src/expr/calls/fs.rs:89-101 | crates/perry-codegen/src/expr/calls/fs.rs:160-172 \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/perry-codegen/src/expr/calls/fs.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b736a3374ed4c6fe3fa3ba1a88666cea1fb79ad5f1fe220e29894f5e4dc6b01d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen/src/expr/class_field_push.rs:44-56 | crates/perry-codegen/src/stmt/loops.rs:3310-3322 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/class_field_push.rs\u0060 and \u0060crates/perry-codegen/src/stmt/loops.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 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/perry-codegen/src/expr/class_field_push.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece338e8cdd264e390ef88c39b34cc986e52f82f400cc28f3a57f8f1b8ef4f8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/perry-codegen/src/expr/dyn_extern_i18n.rs:1072-1083 | crates/perry-codegen/src/expr/property_get.rs:1313-1325 \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/perry-codegen/src/expr/dyn_extern_i18n.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"1942cb74702a1f2e44e480e9b2b42f167ca8b5d855bcf7e4aac0b98d8cd02298"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/perry-codegen/src/expr/helpers.rs:19-31 | crates/perry-codegen/src/type_analysis/pod.rs:434-445 \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/perry-codegen/src/expr/helpers.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38a32115e95ddfa8cd095ad714db9622219e952a4f9dc180ef685424bdec756"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen/src/expr/i32_fast_path.rs:672-684 | crates/perry-codegen/src/expr/ta_param_f64_read.rs:254-266 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/i32_fast_path.rs\u0060 and \u0060crates/perry-codegen/src/expr/ta_param_f64_read.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 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/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b527ad650cadd0813fdfbe60b80711f773ab5126b0aa337c1d4b44db09eb064"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen/src/expr/i32_fast_path.rs:1161-1173 | crates/perry-codegen/src/expr/i32_fast_path.rs:1224-1236 \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/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"190d9168d001ae53031e232b1c5ed648f76f7cd82b2cd5069a7cbf9259fcd242"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 2): crates/perry-codegen/src/expr/index_get.rs:89-101 | crates/perry-codegen/src/expr/index_set.rs:130-138 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/index_get.rs\u0060 and \u0060crates/perry-codegen/src/expr/index_set.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 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/perry-codegen/src/expr/index_get.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fdd67692f15757b7777430bf2691260adc719b019f963cc73eab8f7723e1d43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen/src/expr/index_get.rs:367-379 | crates/perry-codegen/src/expr/index_get.rs:460-472 \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/perry-codegen/src/expr/index_get.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3284195917a22bd32dbd7c95201eec00d4f550c3342d112bd6f52f68755ee2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen/src/expr/instance_misc1.rs:268-280 | crates/perry-codegen/src/expr/instance_misc1.rs:728-740 \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/perry-codegen/src/expr/instance_misc1.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"5590463a5debc94f97993e74f2697e3fcab6e75b2fa1a355ca3a5b6363cfda8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): crates/perry-codegen/src/expr/instance_misc1.rs:1005-1017 | crates/perry-codegen/src/expr/logical_collections.rs:1331-1340 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/instance_misc1.rs\u0060 and \u0060crates/perry-codegen/src/expr/logical_collections.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 88 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/perry-codegen/src/expr/instance_misc1.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"c481f1f27d46c0e47c60cccdc2bfe1abc0ccd2c0659d50fd620c199702ff506b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen/src/expr/math_simple.rs:904-916 | crates/perry-codegen/src/expr/math_simple.rs:972-984 \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/perry-codegen/src/expr/math_simple.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a4e28fe5472675e34a5e3b55088832313c9e6a47d238f5a3d81c0d4b65c505"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen/src/expr/write_barrier.rs:214-226 | crates/perry-codegen/src/expr/write_barrier.rs:360-372 \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/perry-codegen/src/expr/write_barrier.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee314005193e55479304456960778379f3dc5727a3203568fcb869eb94a73ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen/src/layout_families.rs:367-379 | crates/perry-codegen/src/lower_call/new_alloc.rs:315-327 \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/perry-codegen/src/layout_families.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ea564347bfa5b0e8dda24fc37cf36feb184592e15ac54b36a64eb86ef83ed7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/perry-codegen/src/lower_call/new_alloc.rs:720-732 | crates/perry-codegen/src/lower_call/scalar_method.rs:603-614 \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/perry-codegen/src/lower_call/new_alloc.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef2e98887a41b838ebee45fdee62202e4d7a8b43d64712234f1ef8e0ac0d8a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:583-593 | crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:1897-1909 \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/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"a273d3b8dbbe975fae50709e07c83f6e996322ea87fe33943815ead8bacdc6d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen/src/lower_call/scalar_method.rs:859-871 | crates/perry-codegen/src/lower_call/scalar_method.rs:1080-1092 \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/perry-codegen/src/lower_call/scalar_method.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6c91840cfd1f54300a7e8a51ecd294848f1a30ad968d49793f9a9662a115a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/perry-codegen/src/lower_string_method/char_code_at.rs:250-262 | crates/perry-codegen/src/lower_string_method/char_code_at.rs:302-312 \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/perry-codegen/src/lower_string_method/char_code_at.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3e8fb307c2b9046025610aa6facf3478144b01858eedaddf0164fce6c7e83f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen/src/native_value/materialize.rs:332-344 | crates/perry-codegen/src/native_value/materialize.rs:546-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/native_value/materialize.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06e3791432b021fed7f7033e9adca05545737eac17d4ab37ffa7f254d6520c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:8182-8194 | crates/perry-codegen/src/stmt/loops.rs:8769-8781 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":8182}}}],"partialFingerprints":{"codehealthFindingId/v1":"df650ac819c35611af9e4a641e874a3326e2bf87958f863bf96350600760e112"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen/src/stmt/region_loop/bare.rs:357-369 | crates/perry-codegen/src/stmt/region_loop/plan.rs:47-59 \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/perry-codegen/src/stmt/region_loop/bare.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"03fe92bd67b8b9af50b12bab76a5419bf95665f0f5128d3018752ee2f5890548"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-container-compose/src/backend/apple.rs:254-266 | crates/perry-container-compose/src/backend/docker.rs:264-276 \u2014 before extracting anything, compare \u0060crates/perry-container-compose/src/backend/apple.rs\u0060 and \u0060crates/perry-container-compose/src/backend/docker.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 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/perry-container-compose/src/backend/apple.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b10b71eca9bdd962cb14088f7ee32c1f930f19cd906c9515f2fe0f3d2b08c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-ext-better-sqlite3/src/lib.rs:379-391 | crates/perry-ext-better-sqlite3/src/lib.rs:459-471 \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/perry-ext-better-sqlite3/src/lib.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd3ae150d167eb0cd87af7485affdf0a9fef94b1cd83afd514ea3406b1c72a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-ext-http/src/server/turnloop_h2/conn.rs:1146-1158 | crates/perry-ext-http/src/server/turnloop_h2/conn.rs:1256-1268 \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/perry-ext-http/src/server/turnloop_h2/conn.rs"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"5992ad2c8d393d556dc10c06bd1f3c2880acee825e2c1e9c14524829d4363c09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-ext-http/src/server/types.rs:297-309 | crates/perry-ext-net/src/jsvalue.rs:97-109 \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/perry-ext-http/src/server/types.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f501db7df772c54b8c8c394017522c71c8f0699797b2c9d9c6018b8acb3af3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-ext-net/src/payload_abi.rs:1021-1033 | crates/perry-ext-net/src/payload_abi.rs:1294-1306 \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/perry-ext-net/src/payload_abi.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb0c396114408a979bda45efa4cc6f361f1917366ca4877c9d2b616fd9901b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-ext-ws/src/lib.rs:1660-1672 | crates/perry-ext-ws/src/lib.rs:1676-1688 \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/perry-ext-ws/src/lib.rs"},"region":{"startLine":1660}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50c951bbed53664281a8daf9a5d6a33970d651df85db7c07a36f8ca7b35809a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-hir/src/destructuring/assignment_stmt.rs:287-299 | crates/perry-hir/src/destructuring/pattern_binding.rs:176-188 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/destructuring/assignment_stmt.rs\u0060 and \u0060crates/perry-hir/src/destructuring/pattern_binding.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 53 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/perry-hir/src/destructuring/assignment_stmt.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb8bc03049ef5f3411f5b96c5b6d31e5329f2eff432d6fec45b449a14cb9541"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/globals.rs:588-600 | crates/perry-hir/src/lower/expr_call/module_static.rs:1378-1390 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/globals.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/module_static.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 296 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/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11c45419861068e77d416c301631884a5781a88fea78617c525eecaff130c04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/module_static.rs:1206-1218 | crates/perry-hir/src/lower/expr_call/native_module/buffer_statics.rs:64-76 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/module_static.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/native_module/buffer_statics.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 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/perry-hir/src/lower/expr_call/module_static.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1ba74ae76fd261404c1252c52546bfe221e451bafeb2843c8311f0e34d6156"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/perry-hir/src/lower/expr_function.rs:455-467 | crates/perry-hir/src/lower/expr_function.rs:1422-1433 \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/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d12c5ad5038f73076c4094109531de4600075e9642a87a44c1cf7631e25640"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/perry-hir/src/lower/lower_module_fn.rs:1366-1378 | crates/perry-hir/src/lower/lower_module_fn.rs:1694-1704 \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/perry-hir/src/lower/lower_module_fn.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"e002ca756e3245075ca9e38edd793feea0c2a4f0c2af0f2f9009634fbcbd9a89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): crates/perry-hir/src/lower/stmt.rs:1673-1682 | crates/perry-hir/src/lower_decl/body_stmt.rs:1202-1214 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 308 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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf322affd8aff59772979b74481b4b5672a682828be49c7b36c6d9678df3943"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:1250-1262 | crates/perry-hir/src/lower_decl/body_stmt.rs:1760-1772 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"531d286d3687a0ce7f0947bab714ede0cb39e74f2d1ef84619b505e4cec14893"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:1767-1777 | crates/perry-hir/src/lower_decl/body_stmt.rs:2251-2263 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"00520677c30cbaf15aef1656eb8b99f97bd6f12d857ac3ea60f766a6fa2ea3bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:1779-1791 | crates/perry-hir/src/lower_decl/body_stmt.rs:2265-2277 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":1779}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d02de3447cb60fd76b182e2c2ed560dece597d12bf59d53480c4112a52a39a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs:4-16 | crates/perry-hir/src/lower_decl/fn_decl.rs:13-25 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/fn_decl.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 126 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/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b0a02e1d33894ca1553bd7a77f5e98b10743bcb48015fd31b590491d794f7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-hir/src/lower_decl/class_members.rs:831-843 | crates/perry-hir/src/lower_decl/class_members.rs:1014-1026 \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/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c28fe4b8529a81f05067d4c637d53081d095870f99afc11ce7ee0b9c3f42ef6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-hir/src/lower_decl/class_members.rs:844-856 | crates/perry-hir/src/lower_decl/private_members.rs:294-306 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/class_members.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/private_members.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 210 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/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"5654bd4ff5777115ed3d46e5392a77dafd909af26b37016a89190d642206fd78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-hir/src/monomorph/constraints.rs:307-319 | crates/perry-hir/src/monomorph/constraints.rs:331-343 \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/perry-hir/src/monomorph/constraints.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ac7c89c5d1c7f3f63e8e1b98239315e1781e1c4fc0e90617a356faeee25fb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 12): crates/perry-codegen/src/expr/env_clones.rs:110-117 | crates/perry-codegen/src/expr/misc_methods.rs:378-385 | crates/perry-codegen/src/expr/misc_methods.rs:427-434 | crates/perry-codegen/src/expr/misc_methods.rs:489-496 | crates/perry-codegen/src/expr/misc_methods.rs:510-517 | crates/perry-codegen/src/expr/misc_methods.rs:531-538 | crates/perry-codegen/src/expr/misc_methods.rs:630-641 | crates/perry-codegen/src/expr/os_uri_dates.rs:214-221 | crates/perry-codegen/src/expr/os_uri_dates.rs:279-286 | crates/perry-codegen/src/expr/os_uri_dates.rs:339-346 | crates/perry-codegen/src/expr/string_regex_proc.rs:515-526 | crates/perry-codegen/src/expr/super_method.rs:92-99 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/env_clones.rs\u0060 and \u0060crates/perry-codegen/src/expr/misc_methods.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 55 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/perry-codegen/src/expr/env_clones.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac5298be0ef1e4fd7db93463973a5b8057bd489051372f2a708efd0faf11dff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 12): crates/perry-codegen/src/lower_call/early_branches.rs:559-570 | crates/perry-codegen/src/lower_call/early_branches.rs:831-842 | crates/perry-codegen/src/lower_call/early_branches.rs:932-943 | crates/perry-codegen/src/lower_call/early_branches.rs:1036-1047 | crates/perry-codegen/src/lower_call/early_branches.rs:1143-1154 | crates/perry-codegen/src/lower_call/early_branches.rs:1198-1209 | crates/perry-codegen/src/lower_call/func_ref.rs:237-248 | crates/perry-codegen/src/lower_call/func_ref.rs:1161-1172 | crates/perry-codegen/src/lower_call/func_ref.rs:1236-1247 | crates/perry-codegen/src/lower_call/func_ref.rs:1314-1325 | crates/perry-codegen/src/lower_call/func_ref.rs:1405-1416 | crates/perry-codegen/src/lower_call/property_get/imported_object.rs:182-193 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/early_branches.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/func_ref.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 122 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/perry-codegen/src/lower_call/early_branches.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac3ef3a6897690e5c2d20baa447490a34125738acc92f3feca0a0f8592c2c8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6): crates/perry-codegen/src/codegen/closure.rs:1263-1274 | crates/perry-codegen/src/codegen/entry.rs:870-881 | crates/perry-codegen/src/codegen/entry/module_init.rs:350-361 | crates/perry-codegen/src/codegen/function.rs:1369-1380 | crates/perry-codegen/src/codegen/method.rs:654-665 | crates/perry-codegen/src/codegen/method_static.rs:329-340 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/entry.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 221 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"252a12660ddb97774c38eef584b4bc6d2198fdb97dd273921e6b7e9ae54e3294"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6): crates/perry-codegen/src/collectors/integer_locals.rs:662-673 | crates/perry-codegen/src/collectors/proven_args.rs:282-293 | crates/perry-codegen/src/collectors/ptr_numarray.rs:646-657 | crates/perry-codegen/src/collectors/ptr_shape.rs:1370-1381 | crates/perry-codegen/src/collectors/ptr_shape_elements.rs:878-889 | crates/perry-codegen/src/collectors/sealed_buffers.rs:530-541 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/integer_locals.rs\u0060 and \u0060crates/perry-codegen/src/collectors/ptr_numarray.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 90 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/perry-codegen/src/collectors/integer_locals.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a8d57484d7fb02900184ef913840350d2072564a916f40ecc05d067fc24c98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 6): crates/perry-ext-ws/src/lib.rs:1584-1595 | crates/perry-ext-ws/src/lib.rs:1662-1671 | crates/perry-ext-ws/src/lib.rs:1678-1687 | crates/perry-ext-ws/src/lib.rs:1731-1742 | crates/perry-ext-ws/src/lib.rs:1753-1761 | crates/perry-ext-ws/src/lib.rs:1768-1776 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-ws/src/lib.rs"},"region":{"startLine":1584}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b79f53196ad7e5559445b01ce9eaab91553f7944766cb75d610eab0677d38c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/perry-codegen-arkts/src/mutations.rs:1015-1026 | crates/perry-codegen-arkts/src/widgets/scroll.rs:138-149 | crates/perry-codegen-arkts/src/widgets/scroll.rs:292-303 | crates/perry-codegen-arkts/src/widgets/stack.rs:121-132 \u2014 there are 4 copies across 3 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-arkts/src/mutations.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e958826aa7b2d612f5825668a863fae6af44846ce8feb754a182c4b45f85fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/perry-codegen/src/collectors/escape_check.rs:492-503 | crates/perry-codegen/src/collectors/escape_news.rs:328-339 | crates/perry-codegen/src/collectors/i32_locals.rs:1292-1303 | crates/perry-codegen/src/collectors/refs.rs:255-266 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/escape_check.rs\u0060 and \u0060crates/perry-codegen/src/collectors/escape_news.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 73 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/perry-codegen/src/collectors/escape_check.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2d1d8f04b2a0828b94913aab11d6876adbcf6dca8055daad50f8b486ce652d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 4): crates/perry-codegen/src/expr/array_literal.rs:311-322 | crates/perry-codegen/src/expr/inline_birth/fixed_alloc.rs:49-57 | crates/perry-codegen/src/expr/inline_birth/shared.rs:141-149 | crates/perry-codegen/src/lower_call/new_alloc.rs:886-894 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/array_literal.rs\u0060 and \u0060crates/perry-codegen/src/expr/inline_birth/fixed_alloc.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 53 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/perry-codegen/src/expr/array_literal.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2e9202deaaf8f8a58b0b719b76fff8b8408ade41e7bf6ea7391424a5440604"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/perry-codegen/src/lower_call/method_override.rs:1316-1327 | crates/perry-codegen/src/lower_call/method_override.rs:1400-1411 | crates/perry-codegen/src/lower_call/method_override.rs:1486-1497 | crates/perry-codegen/src/lower_call/method_override.rs:1573-1584 \u2014 all 4 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/perry-codegen/src/lower_call/method_override.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"670a29d21cc3c885716a48fce738f47288543ca1da2c2b4abab561add2ae8830"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 4): crates/perry-hir/src/js_transform/local_natives.rs:945-954 | crates/perry-hir/src/js_transform/local_natives.rs:976-987 | crates/perry-hir/src/js_transform/local_natives.rs:1001-1012 | crates/perry-hir/src/js_transform/local_natives.rs:1047-1056 \u2014 all 4 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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e06dc54a094d6ba51fe7cf25c167fa69da8ee4fc8f3004d7dcea7263bdeff0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 4): crates/perry-hir/src/lower/expr_object.rs:332-342 | crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs:173-183 | crates/perry-hir/src/lower_decl/class_members.rs:615-626 | crates/perry-hir/src/lower_decl/fn_decl.rs:290-300 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_object.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 95 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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b58292515e0deca435b90d1f96c66c8bf67521df0f67659b30f0959c496ecb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs:84-95 | crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs:109-120 | crates/perry-hir/src/lower_decl/body_stmt/detect.rs:84-95 | crates/perry-hir/src/lower_decl/body_stmt/detect.rs:109-120 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt/detect.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 133 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/perry-hir/src/lower/stmt_loops/for_await_targets.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3aaca15194a18b109828051191087d93abbbdf05f711b183ba562edfa516546"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/perry-codegen-swiftui/src/emit.rs:287-298 | crates/perry-codegen-swiftui/src/emit.rs:328-339 | crates/perry-codegen-swiftui/src/emit.rs:420-431 \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/perry-codegen-swiftui/src/emit.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"064bae17d39f7526840a12e0d8fc6161afba7a9be12b52c78529f688c938ee4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/perry-codegen/src/collectors/escape_check.rs:1060-1071 | crates/perry-codegen/src/collectors/escape_check.rs:1073-1084 | crates/perry-codegen/src/collectors/escape_check.rs:1103-1114 \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/perry-codegen/src/collectors/escape_check.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bae4af56da7e03f77be2405257f14f3aefa7c40bc3b58954c35736b1388f16b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/perry-codegen/src/collectors/escape_news.rs:780-791 | crates/perry-codegen/src/collectors/escape_news.rs:793-804 | crates/perry-codegen/src/collectors/escape_news.rs:823-834 \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/perry-codegen/src/collectors/escape_news.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c270c6756c1bd3dc2493dd5c10196e81f725bcedf3340a3bd941d9c8225bed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 4): crates/perry-codegen/src/lower_call/func_ref.rs:1065-1076 | crates/perry-codegen/src/lower_call/func_ref.rs:1078-1089 | crates/perry-codegen/src/lower_call/func_ref.rs:1091-1102 | crates/perry-codegen/src/lower_call/func_ref.rs:1103-1113 \u2014 all 4 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/perry-codegen/src/lower_call/func_ref.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37e0f098430ce03265f04437b5fe4419c57c8dac7ce98e3085e499c16b45ec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201312 lines \u00D7 3): crates/perry-codegen/src/stmt/loops.rs:3380-3386 | crates/perry-codegen/src/stmt/loops.rs:3484-3495 | crates/perry-codegen/src/stmt/masked_window_region.rs:974-985 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/stmt/loops.rs\u0060 and \u0060crates/perry-codegen/src/stmt/masked_window_region.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":3380}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bdd7ac2ef061b5fdaae0644feb8f74f2503c395667c58af75e7442fbadf7cf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/perry-codegen/src/stmt/loops.rs:4010-4021 | crates/perry-codegen/src/stmt/loops.rs:4056-4067 | crates/perry-codegen/src/stmt/loops.rs:4112-4123 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":4010}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b222ade3b8a9f7ef3e7b38aad8242301d3db1de1effd356665fab9b4829d83b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/perry-container-compose/src/backend/detect.rs:33-44 | crates/perry-container-compose/src/backend/detect.rs:55-66 | crates/perry-container-compose/src/backend/detect.rs:96-107 \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/perry-container-compose/src/backend/detect.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3133648246ff1a94cbd206eea5621333f388e7fa04cf6015deacc04c4f3705"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201312 lines \u00D7 4): crates/perry-hir/src/dynamic_import.rs:322-333 | crates/perry-hir/src/dynamic_import.rs:394-405 | crates/perry-hir/src/dynamic_import.rs:453-464 | crates/perry-hir/src/lower/shared_mutable_capture.rs:1132-1133 \u2014 there are 4 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/dynamic_import.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61da2b2327fa72291866f6f163e070cf565c1b92139416c8f5adff529707500"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs:147-158 | crates/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs:469-477 | crates/perry-hir/src/lower/expr_call/intrinsics/namespace_static.rs:248-255 \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/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"761d5694accd941482cc553769fd8ebbfcfafee69cf31e299dbe8df334e79401"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/perry-codegen-arkts/src/mutations.rs:1037-1048 | crates/perry-codegen-arkts/src/widgets/structure.rs:103-113 \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/perry-codegen-arkts/src/mutations.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea68ae51222d0c7beec7a6b04f4b9a97f3292d1c59a4393f277c61430653752"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/perry-codegen-glance/src/emit.rs:54-63 | crates/perry-codegen-wear-tiles/src/emit.rs:59-70 \u2014 before extracting anything, compare \u0060crates/perry-codegen-glance/src/emit.rs\u0060 and \u0060crates/perry-codegen-wear-tiles/src/emit.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 144 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/perry-codegen-glance/src/emit.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2b06b33d6fc9541ca40f72c91077ca21eec49ab1bf973e577010d84ec38e1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen-glance/src/emit.rs:598-609 | crates/perry-codegen-wear-tiles/src/emit.rs:418-429 \u2014 before extracting anything, compare \u0060crates/perry-codegen-glance/src/emit.rs\u0060 and \u0060crates/perry-codegen-wear-tiles/src/emit.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 144 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/perry-codegen-glance/src/emit.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba40ef4c4db570414e726d4192cf87bc5d97631b4e9f4cc45227dad34c74d18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen-glance/src/lib.rs:71-82 | crates/perry-codegen-swiftui/src/lib.rs:147-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/perry-codegen-glance/src/lib.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"74081acf5914960c2d8dafd65b2fbaa20e90b439c149ed9aa7867790f269e52d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen-js/src/minify.rs:236-247 | crates/perry-codegen-wasm/src/minify.rs:232-243 \u2014 before extracting anything, compare \u0060crates/perry-codegen-js/src/minify.rs\u0060 and \u0060crates/perry-codegen-wasm/src/minify.rs\u0060 as WHOLE FILES: this scan already matched 5 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/perry-codegen-js/src/minify.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a3949c571965b7615019b588feb83288ce663a3fa5c7b9adbffb8c27691a9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201312 lines \u00D7 2): crates/perry-codegen/src/block.rs:1712-1723 | crates/perry-codegen/src/block.rs:1762-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/block.rs"},"region":{"startLine":1712}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60d143032d555f3ac7fcbdc1d5c2f3701cfa159ccab9702b6074ab9a422c178"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/codegen/arguments.rs:294-305 | crates/perry-codegen/src/codegen/arguments.rs:323-334 \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/perry-codegen/src/codegen/arguments.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"33261dc2529ed0bb7004586b9c1d5c79b7b896e5bd2312c489378b92bcce18ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/perry-codegen/src/codegen/function.rs:315-325 | crates/perry-codegen/src/codegen/method_trampolines.rs:117-128 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/function.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method_trampolines.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 96 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/perry-codegen/src/codegen/function.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f06da9576e3260e9bbc90c6d2727c453d7144987df09ba7cee6308d9807e47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/codegen/string_pool.rs:295-306 | crates/perry-codegen/src/codegen/string_pool.rs:309-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/perry-codegen/src/codegen/string_pool.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"8797b5f9ddf778c7558a3379fb10fbedf46ef27da254bed7407debb92cff0b19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/collectors/clamp_detect.rs:21-32 | crates/perry-codegen/src/collectors/clamp_detect.rs:97-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/clamp_detect.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"137a70fb31acb0c9407d44e2d2ed796766b3462b6ae5ca72c0bc49231d1f4fb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/collectors/clamp_detect.rs:48-59 | crates/perry-codegen/src/collectors/clamp_detect.rs:123-134 \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/perry-codegen/src/collectors/clamp_detect.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17d04cdc6038558feca28b6009af9f456a5d7e68517ad7bc01460e478a69554"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/collectors/escape_check.rs:874-885 | crates/perry-codegen/src/collectors/escape_check.rs:993-1004 \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/perry-codegen/src/collectors/escape_check.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ad3ff77c9dc7344a31c276eb5b70ed72c115651d0024ffc93eecfc7b119713"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/collectors/escape_check.rs:940-951 | crates/perry-codegen/src/collectors/escape_check.rs:1024-1035 \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/perry-codegen/src/collectors/escape_check.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2dc96362f4a62a3bd3e65d2cb241b69a693448543a8d6aef6dd21a273ecc03e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/collectors/escape_news.rs:663-674 | crates/perry-codegen/src/collectors/escape_news.rs:747-758 \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/perry-codegen/src/collectors/escape_news.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fb65cc99d56e2ccb171401e32f7cdad1e2eac73bc0f7f3017ff62fba651c05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/collectors/i32_locals.rs:1536-1547 | crates/perry-codegen/src/collectors/refs.rs:542-553 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/i32_locals.rs\u0060 and \u0060crates/perry-codegen/src/collectors/refs.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 477 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/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d58b00392ba0e946f080f609087510d2e21b5e48aed45d933c4de4290b6b163"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/collectors/param_ranges.rs:195-206 | crates/perry-codegen/src/layout_families.rs:374-385 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/param_ranges.rs\u0060 and \u0060crates/perry-codegen/src/layout_families.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 67 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/perry-codegen/src/collectors/param_ranges.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a8c670b42547f7181a6c61e6606c366a41ff18269ec14871f7e034724fd0d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/collectors/ptr_shape_this_flow.rs:352-363 | crates/perry-codegen/src/collectors/ptr_shape_this_flow.rs:389-400 \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/perry-codegen/src/collectors/ptr_shape_this_flow.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5b831410ea7b3ead49c9c2a58eefdfdf201559d12a2f33878168d9faa8e99b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/perry-codegen/src/collectors/receiver_regions.rs:1067-1077 | crates/perry-codegen/src/collectors/safepoint_sites.rs:56-67 \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/perry-codegen/src/collectors/receiver_regions.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc5d26649a887cedec994bafa284b1d76dde49de0ab8040f2ddbf66c3c618a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/collectors/sealed_buffers.rs:600-611 | crates/perry-codegen/src/collectors/sealed_buffers.rs:659-670 \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/perry-codegen/src/collectors/sealed_buffers.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20b9d01a1a6ecd7ec81abfa633cf53192040ff42ec8c364c2989c531159e56e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/perry-codegen/src/expr/array_push.rs:214-225 | crates/perry-codegen/src/expr/array_push.rs:307-317 \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/perry-codegen/src/expr/array_push.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"4612c172607fa46e0129d04d21119d1fafbfe44001516e7160db2dc5600058bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/perry-codegen/src/expr/dispatch.rs:378-389 | crates/perry-codegen/src/providers.rs:333-343 \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/perry-codegen/src/expr/dispatch.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d4198812362119cb0e7dbc064d9b6f9087d6f89419753f83bc8f581c220491"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/expr/i32_fast_path.rs:1082-1093 | crates/perry-codegen/src/expr/i32_fast_path.rs:1494-1505 \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/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a3c42dbac5b5ee40b1d2961b1e445ec229936e2f87c1208bd8840a4eb6f693"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/perry-codegen/src/expr/ic_fast_split.rs:39-48 | crates/perry-codegen/src/expr/property_get/generic_dispatch.rs:899-910 \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/perry-codegen/src/expr/ic_fast_split.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"940bf1393ebb311d92f11ea94080894ce4a700c3b1b91e28b5c25c0d8d550ada"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/expr/index_get.rs:1274-1285 | crates/perry-codegen/src/expr/index_set.rs:844-856 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/index_get.rs\u0060 and \u0060crates/perry-codegen/src/expr/index_set.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 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/perry-codegen/src/expr/index_get.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c1007fe82077ffbbd95173e86aecac4338877772902d9fea8a683523a6f363"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/expr/index_get/guarded_array.rs:868-879 | crates/perry-codegen/src/expr/index_get/guarded_array.rs:945-956 \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/perry-codegen/src/expr/index_get/guarded_array.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ef026962390572bc392e6b46378d7e292485e199e1154f103188c7378b77b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs:671-682 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:741-751 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs\u0060 and \u0060crates/perry-codegen/src/stmt/stable_packed_loop.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 51 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/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"5983467f59ae593ada8878681c5dbd76e3781a6db5996d9efac90b2aceccaba4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/expr/instance_misc1.rs:989-1000 | crates/perry-codegen/src/expr/misc_methods.rs:1195-1206 \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/perry-codegen/src/expr/instance_misc1.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"161fcc16935295f3a2d4cbb045c680b45fb956d8aecbde3d1023056f7727f2dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/expr/layout_read.rs:170-181 | crates/perry-codegen/src/expr/layout_read.rs:307-318 \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/perry-codegen/src/expr/layout_read.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"805e96641d307ba10d755caf106a63312faf4a4788b5c7f9af97c83708c0f5ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/expr/layout_read.rs:199-210 | crates/perry-codegen/src/expr/layout_read.rs:868-879 \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/perry-codegen/src/expr/layout_read.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f2a87c700d6f197d77665c09d8e6eca8b2632c337736813a3c60f4c29216ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/expr/layout_read.rs:318-329 | crates/perry-codegen/src/expr/layout_read.rs:835-846 \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/perry-codegen/src/expr/layout_read.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"8215e932a8f76b342503f9a7104c05ce1b1a9e9c4d175992d302d598e9503300"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/perry-codegen/src/expr/method_site.rs:131-140 | crates/perry-codegen/src/expr/method_site.rs:632-643 \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/perry-codegen/src/expr/method_site.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"538d24c93f1ef987cf51c202ca333a722e3de87e6eeab00660e2821b46d93e5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/expr/pod_record.rs:264-275 | crates/perry-codegen/src/expr/pod_record.rs:337-348 \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/perry-codegen/src/expr/pod_record.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39efaff5358c74fafd6fce98afeae9ecd17e62221720cb20aba7c87178044cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/expr/property_get/helpers.rs:202-213 | crates/perry-codegen/src/expr/property_set.rs:598-609 \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/perry-codegen/src/expr/property_get/helpers.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbd2031ddcae9aafa30bdb00c3bf7233caaf3e01a589d4bcf97152301b757f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/expr/proven_view_access.rs:373-384 | crates/perry-codegen/src/expr/proven_view_access.rs:494-505 \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/perry-codegen/src/expr/proven_view_access.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c1c2d204d9c25dc53f739694de38609404b9e19238894b77cde6595fd56a04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/expr/proxy_reflect.rs:421-432 | crates/perry-codegen/src/expr/proxy_reflect.rs:440-451 \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/perry-codegen/src/expr/proxy_reflect.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"a375934e6030392fc7a158b686991133a8f53c6a9d19bc8f4b70d2fdf44b5c0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/perry-codegen/src/expr/this_super_call.rs:1024-1035 | crates/perry-codegen/src/expr/this_super_call.rs:1103-1113 \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/perry-codegen/src/expr/this_super_call.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b48423918fe756372b75d470806067e457cf994ee6533eb7e5e622f29d6818e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201312 lines \u00D7 3): crates/perry-codegen/src/lower_call/direct_method_guard.rs:80-91 | crates/perry-codegen/src/lower_call/method_override.rs:292-294 | crates/perry-codegen/src/lower_call/method_override.rs:416-423 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/direct_method_guard.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/method_override.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 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/perry-codegen/src/lower_call/direct_method_guard.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"6854fde9f8befc7960ee7dad73ea239c75cdc5bea5de93cd0fdfd52f2593f337"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:1750-1758 | crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:1886-1897 \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/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs"},"region":{"startLine":1750}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08110304504a192d0655c8756bd622e83c7df3bafd5be28335f8b436397e2b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/perry-codegen/src/lower_call/property_get/static_dispatch.rs:472-482 | crates/perry-codegen/src/lower_call/web_storage.rs:47-58 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/property_get/static_dispatch.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/web_storage.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 46 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/perry-codegen/src/lower_call/property_get/static_dispatch.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"404ee739f654e3feff7e1bc22712eb155350ba2bd4b766acbffaf0b621e77224"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/perry-codegen/src/lower_call/proven_call.rs:77-87 | crates/perry-codegen/src/lower_call/proven_call.rs:151-162 \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/perry-codegen/src/lower_call/proven_call.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae358fc9083218c9cfb55c507bd79a7568a7e41de26fd7765db4d75b38846457"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/lower_call/scalar_method.rs:963-974 | crates/perry-codegen/src/lower_call/scalar_method.rs:1184-1195 \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/perry-codegen/src/lower_call/scalar_method.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a40726d194ffb85d8f3c2a43076ea8d2f3c80251efbf3abc6aa14495a7df65f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/stmt/masked_window_region.rs:950-961 | crates/perry-codegen/src/stmt/masked_window_region.rs:982-993 \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/perry-codegen/src/stmt/masked_window_region.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e83b4990b440fd0993373f380aa0849d7c778d0ae90cb459524fe2cfc3164f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/type_analysis/strings.rs:189-200 | crates/perry-codegen/src/type_analysis/strings.rs:321-332 \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/perry-codegen/src/type_analysis/strings.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"262502f1f4b413d2dcc70b83e4215d34781ffb8a7a483213226442edd2bc454d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/perry-codegen/src/type_analysis/strings.rs:359-369 | crates/perry-codegen/src/type_analysis/strings.rs:733-744 \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/perry-codegen/src/type_analysis/strings.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"795ee9b188e60c78c4af3c2230391509cb087f2976d2c11fd5316fb8431fe07f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-component-host/src/asynchronous.rs:176-187 | crates/perry-component-host/src/lib.rs:503-514 \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/perry-component-host/src/asynchronous.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c67f0966f5130a35c2ec3f16d2e75dcb9c494883ba794070a28641be8d9a67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/perry-container-compose/src/compose.rs:1116-1127 | crates/perry-container-compose/src/compose.rs:1177-1187 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-container-compose/src/compose.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bff841abd9694603fd232218e5383163c3173f441f430d0187f27d49aa6697d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 2): crates/perry-ext-better-sqlite3/src/lib.rs:367-374 | crates/perry-ext-better-sqlite3/src/lib.rs:441-452 \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/perry-ext-better-sqlite3/src/lib.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84d803d3def728dde7f6d0cfde301171368c03c1ada0013657724c939765caf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-ext-http/src/server/handle_dispatch.rs:463-474 | crates/perry-ext-http/src/server/handle_dispatch.rs:477-488 \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/perry-ext-http/src/server/handle_dispatch.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b370c42762ec96abcfdde0b07daf9206350f3547ff072b67b97c3f2ca6c11d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-ext-http/src/server/response.rs:1351-1362 | crates/perry-ext-http/src/server/response.rs:1405-1416 \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/perry-ext-http/src/server/response.rs"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"0052167403fc118e710b74f0ad10b682cb80ccb0bc3515baac787a56e795bada"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-ext-http/src/server/types.rs:360-371 | crates/perry-ext-net/src/jsvalue.rs:149-160 \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/perry-ext-http/src/server/types.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"429e2b44a94647cb7fb2e60a1624defb43a62cd496fe995fba2d2f390bbcbdce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-ext-net/src/classes_prototype.rs:56-67 | crates/perry-ext-net/src/classes_prototype.rs:68-79 \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/perry-ext-net/src/classes_prototype.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab7fe1dcb74d49c0c3003835cf68e8e480c42b0f3b92573429615f06fe6fda4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-ext-ws/src/lib.rs:1137-1148 | crates/perry-ext-ws/src/lib.rs:1344-1355 \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/perry-ext-ws/src/lib.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"8639f1852213d79eaeccadee85f3d4e4311043032545cfab15684fc39425ef67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 2): crates/perry-hir/src/destructuring/pattern_binding.rs:579-590 | crates/perry-hir/src/lower/stmt.rs:357-364 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/destructuring/pattern_binding.rs\u0060 and \u0060crates/perry-hir/src/lower/stmt.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 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/perry-hir/src/destructuring/pattern_binding.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d0cf8d52950fd1126fffa3f46b226d7bb22c9b92c83ed8a6b50a79a38f1c0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-hir/src/destructuring/var_decl_sources.rs:26-37 | crates/perry-hir/src/lower_types/hoisted_text_codec.rs:21-32 \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/perry-hir/src/destructuring/var_decl_sources.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34223ab40f630f0917ecf69a2e94283043d1f6d044806f4ba804215f9f588af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/globals.rs:313-324 | crates/perry-hir/src/lower/expr_call/globals.rs:359-370 \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/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4aeb341a44fc49f1ed622b4a957f073c2038bd368f2d27e29d605c7895b3d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/globals.rs:646-657 | crates/perry-hir/src/lower/expr_call/module_static.rs:1436-1447 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/globals.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/module_static.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 296 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/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d0c948895a8f83c278c9cb8bf4e4231bcfb4b7d7ed12dbb6b5414ccbd9a321"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs:244-255 | crates/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs:280-291 \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/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8729adf7bc309539cb5908977b890af613a02e4faf010a9b3e30b56cbd908f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/module_static.rs:1258-1269 | crates/perry-hir/src/lower/expr_call/native_module/buffer_statics.rs:118-129 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/module_static.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/native_module/buffer_statics.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 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/perry-hir/src/lower/expr_call/module_static.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5602f1cd66691434c932ffef3fac7c82c4b793c1b3f1ab4f2ca82e2facc443e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-hir/src/lower/expr_member.rs:421-432 | crates/perry-hir/src/lower/expr_member.rs:628-639 \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/perry-hir/src/lower/expr_member.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc82adfaf7f452d1570fe760e849b4214b0f6417f6ed4fdec2a084aa566a5835"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-hir/src/lower/expr_object.rs:286-297 | crates/perry-hir/src/lower_decl/class_members.rs:903-914 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_object.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/class_members.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 61 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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6370b06a007efed8dd2acdb28fdd081f5d6da4b7d40509c4809e7580f7ab126"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/perry-hir/src/lower/expr_object.rs:620-630 | crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs:263-274 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_object.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 95 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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c0dbce0dbb1dc64d1c07b34e88fdca3050a76ecd84e748b2b61847920fc7cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-hir/src/lower/expr_object.rs:1044-1055 | crates/perry-hir/src/lower/expr_object.rs:1581-1592 \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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d20f85493ea1def50b9ea24412191db1adfc8f4812adaa0e77d147a453c945c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-hir/src/lower/global_eval_hoist.rs:105-116 | crates/perry-hir/src/lower/global_eval_hoist.rs:144-155 \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/perry-hir/src/lower/global_eval_hoist.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a2974d3c5d0570bd68f1b541b84aad9410c96bb5594bf25d93a18d7ac711f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-hir/src/lower/stmt.rs:1202-1213 | crates/perry-hir/src/lower_decl/body_stmt.rs:203-214 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 308 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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b0aa05ca1364aa472de4aa2fcc80e860635dbb0da8cc078ad5d1629a71e258"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/perry-hir/src/lower/stmt.rs:1382-1392 | crates/perry-hir/src/lower_decl/body_stmt.rs:916-927 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 308 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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e18849309fa70e0f5ae4e9f6aac2d38d60e806963078a3d7e57513b04c12a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/perry-hir/src/lower/stmt.rs:1464-1474 | crates/perry-hir/src/lower_decl/body_stmt.rs:1000-1011 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 308 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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":1464}}}],"partialFingerprints":{"codehealthFindingId/v1":"968fdc244085e256bcc1b9e91e47fe0f6946b70dbe06e3bab2e716602394ee02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:32-43 | crates/perry-hir/src/lower_decl/helpers.rs:38-49 \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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"770bd963ac8fea5ffaf4bd4518652f2abc725956a79b8f794091fbbb3817e009"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:809-820 | crates/perry-hir/src/lower_decl/body_stmt.rs:1536-1546 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"b760a2fed1bd576dff852ba9c18349277ccdb73f2766d92aaf0ed9b9cfa4e855"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:1630-1641 | crates/perry-hir/src/lower_decl/body_stmt.rs:2112-2122 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9ce9ca704198d6f25d21a98af21f0811f53ad624d908265c00754970f4114e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs:12-23 | crates/perry-hir/src/lower_decl/body_stmt/detect.rs:12-23 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt/detect.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 133 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/perry-hir/src/lower/stmt_loops/for_await_targets.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f58a226a3dd1d21a067de7b6b4b176d7b383f08c854f2f3f111fcd20e73f6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-hir/src/lower_decl/class_decl.rs:740-751 | crates/perry-hir/src/lower_decl/class_decl/from_ast.rs:339-350 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/class_decl.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/class_decl/from_ast.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 548 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/perry-hir/src/lower_decl/class_decl.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"4757bed1ce424ebb14f34e6a80cd450dd30039130e5a5c0ffcc61b443d285747"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/perry-hir/src/lower_decl/class_members.rs:505-516 | crates/perry-hir/src/lower_decl/private_members.rs:105-115 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/class_members.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/private_members.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 210 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/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad40bedb3cc12b2b89b36b7761d677745cee1f5cde408c1abd335a0b55a7b5a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-hir/src/monomorph/constraints.rs:158-169 | crates/perry-hir/src/monomorph/constraints.rs:172-183 \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/perry-hir/src/monomorph/constraints.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3238bb419080fe49b361e4f9c7f53a7471040e93acfbb569997e400ad308f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-hir/src/monomorph/infer.rs:73-84 | crates/perry-hir/src/monomorph/update_call_sites.rs:728-739 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/monomorph/infer.rs\u0060 and \u0060crates/perry-hir/src/monomorph/update_call_sites.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 128 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/perry-hir/src/monomorph/infer.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ada097a652b829df1522e42b8942c0a77a3b11c5a94cef90b3ba27053225d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-hir/src/monomorph/specialize.rs:170-181 | crates/perry-hir/src/monomorph/specialize.rs:210-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/monomorph/specialize.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d831b58575abf0dab0944841e68ee93b17ceffde4978ac6ed803c8ceaae7ed2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 15): crates/perry-codegen/src/lower_call/early_branches.rs:787-797 | crates/perry-codegen/src/lower_call/early_branches.rs:887-897 | crates/perry-codegen/src/lower_call/early_branches.rs:989-999 | crates/perry-codegen/src/lower_call/early_branches.rs:1097-1107 | crates/perry-codegen/src/lower_call/func_ref.rs:1129-1138 | crates/perry-codegen/src/lower_call/func_ref.rs:1203-1212 | crates/perry-codegen/src/lower_call/func_ref.rs:1279-1288 | crates/perry-codegen/src/lower_call/func_ref.rs:1357-1366 | crates/perry-codegen/src/lower_call/method_override.rs:1248-1257 | crates/perry-codegen/src/lower_call/method_override.rs:1338-1347 | crates/perry-codegen/src/lower_call/method_override.rs:1422-1431 | crates/perry-codegen/src/lower_call/method_override.rs:1508-1517 | crates/perry-codegen/src/lower_call/method_override.rs:1595-1604 | crates/perry-codegen/src/lower_call/scalar_method.rs:927-936 | crates/perry-codegen/src/lower_call/scalar_method.rs:1144-1153 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/early_branches.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/func_ref.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 122 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/perry-codegen/src/lower_call/early_branches.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82f30261953f50923095bc0b70957773dd5aca380045849adf98bdd1f959edd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 7): crates/perry-codegen/src/lower_call/func_ref.rs:1140-1150 | crates/perry-codegen/src/lower_call/func_ref.rs:1214-1224 | crates/perry-codegen/src/lower_call/func_ref.rs:1290-1300 | crates/perry-codegen/src/lower_call/method_override.rs:1349-1359 | crates/perry-codegen/src/lower_call/method_override.rs:1433-1443 | crates/perry-codegen/src/lower_call/method_override.rs:1519-1529 | crates/perry-codegen/src/lower_call/method_override.rs:1606-1616 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/func_ref.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/method_override.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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/perry-codegen/src/lower_call/func_ref.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed4179a17aa44a453ed8575f5232a2e0a0d17f0ac96e623575c93a77bddc7e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/perry-codegen/src/codegen/closure.rs:1375-1385 | crates/perry-codegen/src/codegen/entry.rs:985-995 | crates/perry-codegen/src/codegen/entry/module_init.rs:465-475 | crates/perry-codegen/src/codegen/method_static.rs:441-451 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/entry.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 221 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"a534afa5f9ca739458bae18e4eb507a2303b31e171b0fa55b5aa4dd2ae9b0285"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/perry-codegen/src/codegen/mod.rs:3572-3582 | crates/perry-codegen/src/codegen/mod.rs:3602-3612 | crates/perry-codegen/src/codegen/mod.rs:3632-3642 | crates/perry-codegen/src/codegen/mod.rs:3664-3674 \u2014 all 4 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/perry-codegen/src/codegen/mod.rs"},"region":{"startLine":3572}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4632921c53316ab1aa12efd8deafd2c201207566b1accb359aff1838766ee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/perry-codegen/src/collectors/escape_check.rs:1060-1070 | crates/perry-codegen/src/collectors/escape_check.rs:1073-1083 | crates/perry-codegen/src/collectors/escape_check.rs:1087-1097 | crates/perry-codegen/src/collectors/escape_check.rs:1103-1113 \u2014 all 4 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/perry-codegen/src/collectors/escape_check.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"21540c9fbc081669b95ac4fb255a35791c73a98066f91ca6f25bde335ce96a53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/perry-codegen/src/lower_call/early_branches.rs:805-815 | crates/perry-codegen/src/lower_call/early_branches.rs:905-915 | crates/perry-codegen/src/lower_call/early_branches.rs:1007-1017 | crates/perry-codegen/src/lower_call/early_branches.rs:1115-1125 \u2014 all 4 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/perry-codegen/src/lower_call/early_branches.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b328f3b15d53624ecb638808dbeb18ec36d037190ab20a049f9867566e67fb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 4): crates/perry-hir/src/lower/expr_call/array_only_methods.rs:1322-1332 | crates/perry-hir/src/lower/expr_call/imported_array_methods.rs:267-276 | crates/perry-hir/src/lower/expr_call/inline_array_methods.rs:196-205 | crates/perry-hir/src/lower/expr_call/local_array_methods.rs:789-798 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/array_only_methods.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/imported_array_methods.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 97 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/perry-hir/src/lower/expr_call/array_only_methods.rs"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1cf55f5dc92150ed93e2c45e2bd1aadcab9ee5c6d9a0118550f7f348f08d29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/perry-hir/src/lower/expr_function.rs:1391-1401 | crates/perry-hir/src/lower/expr_object.rs:362-372 | crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs:209-219 | crates/perry-hir/src/lower_decl/fn_decl.rs:319-329 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_function.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_object.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 63 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/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"585b2d3bed9fe94355039b2877a6090639cb32e5180778f1df29d0d956ebade7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/perry-codegen/src/codegen/closure.rs:88-98 | crates/perry-codegen/src/codegen/function.rs:265-274 | crates/perry-codegen/src/codegen/method_trampolines.rs:64-73 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/function.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 320 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3b54d118736bb982417c6e401ab0bc43097b10fd323b7775e1a7f608a86296"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/perry-codegen/src/codegen/closure.rs:1338-1348 | crates/perry-codegen/src/codegen/method.rs:729-739 | crates/perry-codegen/src/codegen/method_static.rs:404-414 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 341 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"0057f3f31c289cda3623ecca03eb90f4db3b737d4e843f67ff77e202020d85da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/perry-codegen/src/codegen/function.rs:1315-1324 | crates/perry-codegen/src/codegen/method.rs:602-612 | crates/perry-codegen/src/codegen/method_static.rs:274-283 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/function.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 253 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/perry-codegen/src/codegen/function.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51d84f492addb6890b3ca96b5f699b75b65483d0bcc525b0473b758c27c34a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/perry-codegen/src/collectors/escape_arrays.rs:691-701 | crates/perry-codegen/src/collectors/escape_check.rs:464-474 | crates/perry-codegen/src/collectors/escape_objects.rs:532-542 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/escape_arrays.rs\u0060 and \u0060crates/perry-codegen/src/collectors/escape_objects.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 46 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/perry-codegen/src/collectors/escape_arrays.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"19115dd95050c548b58877b072cb5bf13a45f89acfb8d2eeb7a977706e7131cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/perry-codegen/src/collectors/hir_facts.rs:1274-1283 | crates/perry-codegen/src/collectors/shadow_slots.rs:146-156 | crates/perry-hir/src/lower/lower_module_fn.rs:152-161 \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/perry-codegen/src/collectors/hir_facts.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69f549ea13508e10aafd93f0fa30497a8ee1aa81d50f796159f9f6412a02639"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/perry-codegen/src/collectors/integer_locals.rs:197-207 | crates/perry-codegen/src/collectors/segview.rs:526-536 | crates/perry-hir/src/lower/shared_mutable_capture.rs:1268-1278 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/segview.rs\u0060 and \u0060crates/perry-hir/src/lower/shared_mutable_capture.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 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/perry-codegen/src/collectors/integer_locals.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"9070465894d86c17263b3d9cccb879c9955202662267aff002c5bc2fc2104d67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 3): crates/perry-codegen/src/expr/calls/fs.rs:370-378 | crates/perry-codegen/src/lower_call/options/fetch.rs:556-564 | crates/perry-codegen/src/lower_call/options/fetch.rs:838-848 \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/perry-codegen/src/expr/calls/fs.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"408b53c3ed9739400e91a3ecc68c94c452827dc09054e981a88ebcadcfed6bac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/perry-codegen/src/expr/i32_fast_path.rs:1069-1079 | crates/perry-codegen/src/expr/i32_fast_path.rs:1481-1491 | crates/perry-codegen/src/lower_call/func_ref.rs:880-890 \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/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd66d2968a16b5b38f7c889e2fed8079f80290f0b6c33e9733e8d2579af1505"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/perry-codegen/src/lower_call/builtin.rs:450-460 | crates/perry-codegen/src/lower_call/builtin.rs:922-932 | crates/perry-codegen/src/lower_call/builtin.rs:1110-1120 \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/perry-codegen/src/lower_call/builtin.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf4a75e62954df74454689b4ce2c0046bc517ca8cfa583229ce032a37054e4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/perry-codegen/src/stmt/loops.rs:7673-7683 | crates/perry-codegen/src/stmt/loops.rs:9855-9865 | crates/perry-codegen/src/stmt/loops.rs:9935-9945 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":7673}}}],"partialFingerprints":{"codehealthFindingId/v1":"871be17d3e962f630391e0d3430feef90e621949c3eca88ca15345e399577464"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/perry-codegen/src/stmt/region_loop/plan.rs:549-559 | crates/perry-hir/src/walker/expr_mut.rs:22-32 | crates/perry-hir/src/walker/expr_ref.rs:23-33 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/walker/expr_mut.rs\u0060 and \u0060crates/perry-hir/src/walker/expr_ref.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 2017 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/perry-codegen/src/stmt/region_loop/plan.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"feccee72b8058227e82e32841ea6782243dea5e01593816fe482e3bc0ecd6491"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/perry-ext-http/src/client_events.rs:736-746 | crates/perry-ext-http/src/client_events.rs:768-778 | crates/perry-ext-http/src/client_events.rs:806-816 \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/perry-ext-http/src/client_events.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07e83356bf2b959f1db0f25c61a3981104a68448494917e102167f76f66e987"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 3): crates/perry-hir/src/lower/expr_function.rs:1560-1567 | crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs:258-265 | crates/perry-hir/src/lower_decl/class_members.rs:406-416 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_function.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 137 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/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":1560}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a0061fbcf4ced76ce8973eb0679d165e960d17b52e9152cc762a0400016440"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/perry-hir/src/lower/expr_object.rs:368-377 | crates/perry-hir/src/lower/expr_object.rs:595-604 | crates/perry-hir/src/lower_decl/class_members.rs:295-305 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_object.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/class_members.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 61 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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe005c475ca6c47c9b278d457986db15f543e4f43e8785d2256cc1eed3cd9d8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/perry-hir/src/lower/expr_object.rs:1368-1378 | crates/perry-hir/src/lower/expr_object.rs:1396-1406 | crates/perry-hir/src/lower/expr_object.rs:1631-1641 \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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ae2f2add790ed49cd377c0d2a84ac28c554d624600feabbbda5069d131cea1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201311 lines \u00D7 2): crates/perry-codegen-arkts/src/widgets/inputs.rs:121-126 | crates/perry-codegen-arkts/src/widgets/inputs.rs:281-291 \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/perry-codegen-arkts/src/widgets/inputs.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5e6b33ecfc13f58ab5f4b83c72a32da94a737c7c3167ffd4199fdbd78feeb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen-glance/src/emit.rs:479-489 | crates/perry-codegen-swiftui/src/emit.rs:919-929 \u2014 before extracting anything, compare \u0060crates/perry-codegen-glance/src/emit.rs\u0060 and \u0060crates/perry-codegen-swiftui/src/emit.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 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/perry-codegen-glance/src/emit.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f42f3dc128f067b511da89a29307accaa946efc6f49e98b311e77240fe6cbed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen-wasm/src/emit/stmt.rs:95-105 | crates/perry-codegen-wasm/src/emit/stmt.rs:143-153 \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/perry-codegen-wasm/src/emit/stmt.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22fe63c8df8df95fc9ed4094f165853f83fc3ef5697f79dcb0753274dab293e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen-wasm/src/emit/stmt.rs:123-133 | crates/perry-codegen-wasm/src/emit/stmt.rs:169-179 \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/perry-codegen-wasm/src/emit/stmt.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"9338a7b2f73e3fd5b87ec4904e1fbcf7e5d2dc833667394e4e0d9c8426cc68be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/array_record_stack.rs:34-44 | crates/perry-codegen/src/lower_conditional_array_record.rs:147-157 \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/perry-codegen/src/array_record_stack.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fda3c7601d488def0c1fcf0711198e2bc31d1e57d008fc584ebf79a570ee992"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/codegen/method.rs:578-588 | crates/perry-codegen/src/codegen/method_static.rs:250-260 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/method.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method_static.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 341 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/perry-codegen/src/codegen/method.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"9689b3e935a11c30add29e41f4499c5e0f458306fff7b335a13ad8e4b6215204"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/codegen/method_entries.rs:86-96 | crates/perry-codegen/src/codegen/method_entries.rs:190-200 \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/perry-codegen/src/codegen/method_entries.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3390e41c4cd26437870641027cc7cb7430aff9228ef811858136a6756a7f465"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 2): crates/perry-codegen/src/codegen/mod.rs:1537-1543 | crates/perry-codegen/src/codegen/mod.rs:1674-1684 \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/perry-codegen/src/codegen/mod.rs"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"615eeb6d952e1beee125c9d7ef3addc6fdf60eb9daa4ad1db5f7267ee2e50622"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/codegen/param_guard.rs:452-462 | crates/perry-codegen/src/collectors/hot_callees.rs:806-816 \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/perry-codegen/src/codegen/param_guard.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8f1a4c6acacffafccbdf606aa7f1f8813cbf4bf48b1974607efea1ccaa2155"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/collectors/escape_objects.rs:180-190 | crates/perry-codegen/src/collectors/escape_objects.rs:192-202 \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/perry-codegen/src/collectors/escape_objects.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"82976fe0c630f866f2140f9dc9b0f41e84dc651a0ee652382897913f4ad163d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/collectors/escape_objects.rs:434-444 | crates/perry-codegen/src/collectors/escape_objects.rs:459-469 \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/perry-codegen/src/collectors/escape_objects.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb36ce049a7b8b48be08f506adc9ee7b4c19e26d7717fc38d59fbb3b1f49f6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/collectors/hot_callees.rs:365-375 | crates/perry-codegen/src/collectors/loop_bounded_i32.rs:856-866 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/hot_callees.rs\u0060 and \u0060crates/perry-codegen/src/collectors/loop_bounded_i32.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 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/perry-codegen/src/collectors/hot_callees.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc16af05c41e5cbc5f85d7b1c98779983d191e4c152cf600d1ddb3a959182b3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/collectors/int_valued_ta_locals.rs:786-796 | crates/perry-codegen/src/collectors/int_valued_ta_locals.rs:868-878 \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/perry-codegen/src/collectors/int_valued_ta_locals.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f6ca6f71f32f1926a8c17b60353fdf2bae4b6c3b14b9890ddfa259df45d823"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/collectors/proven_args.rs:233-243 | crates/perry-codegen/src/collectors/ptr_shape_elements.rs:831-841 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/proven_args.rs\u0060 and \u0060crates/perry-codegen/src/collectors/ptr_shape_elements.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 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/perry-codegen/src/collectors/proven_args.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"b879ed7c0c16126ec764971f8f24240654fc62c2d05f443228e26fb931eadd6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/perry-codegen/src/concat_site_cache.rs:209-219 | crates/perry-codegen/src/expr/number_to_string_inline.rs:50-59 \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/perry-codegen/src/concat_site_cache.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"686eba0c864f60c4626a7e9d5f7a974180ae5aee3cebeae0da480e70dda0f2dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/perry-codegen/src/concat_site_cache.rs:234-243 | crates/perry-codegen/src/concat_site_cache.rs:249-259 \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/perry-codegen/src/concat_site_cache.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"da00d39e572311ff81e67981bea7795dc22c56d0a868e7facb0f61259d9f8a35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/expr/bigint_set.rs:422-432 | crates/perry-codegen/src/expr/math_simple.rs:159-169 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/bigint_set.rs\u0060 and \u0060crates/perry-codegen/src/expr/math_simple.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 205 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/perry-codegen/src/expr/bigint_set.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"6267db57e0b8b29161bb5b5d40d1b8fdc9b8434b954467d83cad833f9b410549"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/expr/binary.rs:1346-1356 | crates/perry-codegen/src/expr/binary.rs:1358-1368 \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/perry-codegen/src/expr/binary.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a21b7678438bb5256100ab0ab56f2ae586dda5c90b03813dce6ba4a825498d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/expr/buffer_access.rs:455-465 | crates/perry-codegen/src/lower_call/buffer_intrinsic.rs:573-583 \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/perry-codegen/src/expr/buffer_access.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5ec45845cf0ebe3a6db960c59410b022311b7cde9a59b548f175e802347a1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/expr/call_spread.rs:274-284 | crates/perry-codegen/src/expr/call_spread.rs:309-319 \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/perry-codegen/src/expr/call_spread.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb4813142d75bf958c333fd021f14fb32fe15fa45ddb008e90a6e29c79fdcf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/expr/dyn_extern_i18n.rs:1093-1103 | crates/perry-codegen/src/expr/static_field_meta.rs:884-894 \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/perry-codegen/src/expr/dyn_extern_i18n.rs"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"2048632e6f5fdd133795071bfc4e9fee8a156c0109ac62e8437b3eeacd068747"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/expr/i32_fast_path.rs:753-763 | crates/perry-codegen/src/expr/i32_fast_path.rs:770-780 \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/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c71472626d4553d175661eeb5936ee3584b3027de545ebd0edfacdd922c67e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/expr/index_get.rs:139-149 | crates/perry-codegen/src/expr/index_set.rs:191-201 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/index_get.rs\u0060 and \u0060crates/perry-codegen/src/expr/index_set.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 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/perry-codegen/src/expr/index_get.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0c74810f8de32a4d4c40b335dfdb9062f8860e225989a4642cd9abc8c3f4b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/expr/index_get.rs:1395-1405 | crates/perry-codegen/src/expr/index_get.rs:1419-1429 \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/perry-codegen/src/expr/index_get.rs"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab8587e43279b8b8062bdce9e04691178c3f59d71a9bb56dcc633d12f1f1522"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs:362-372 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:1068-1078 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs\u0060 and \u0060crates/perry-codegen/src/stmt/stable_packed_loop.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 51 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/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"67411b8ace84f9051d6533153db7b843833b18c5285fc1aa50a24be90c675869"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/perry-codegen/src/expr/index_set_guarded.rs:306-316 | crates/perry-codegen/src/expr/property_get/generic_dispatch.rs:196-204 \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/perry-codegen/src/expr/index_set_guarded.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"016133137cb8f5f2dafe6f02ac0fc854431c8a782301802d3723979d1fe208fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/expr/instance_misc1.rs:1355-1365 | crates/perry-codegen/src/expr/logical_collections.rs:1088-1098 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/instance_misc1.rs\u0060 and \u0060crates/perry-codegen/src/expr/logical_collections.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 88 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/perry-codegen/src/expr/instance_misc1.rs"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"36854891f4fa772028aa5d900f6e8016eab35cecbe4d2bfd49428b91b6083b41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/perry-codegen/src/expr/literals_vars.rs:132-142 | crates/perry-codegen/src/scope_env/access.rs:86-94 \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/perry-codegen/src/expr/literals_vars.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91046c14c2fda7a643cefe2ee2252970f172c904034e8f64642eb21860312e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/expr/misc_methods.rs:459-469 | crates/perry-codegen/src/expr/misc_methods.rs:596-606 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/misc_methods.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a9e2dbd2352a35a1537001951437d01da6c138764728406e731527192d3257"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/expr/mod.rs:3119-3129 | crates/perry-codegen/src/expr/mod.rs:3162-3172 \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/perry-codegen/src/expr/mod.rs"},"region":{"startLine":3119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2089a6ca05b13b6a288a465d5274ed424b0f2ec35054fa124b7dff1eed2c52e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/perry-codegen/src/expr/proven_view_access.rs:310-320 | crates/perry-codegen/src/expr/proven_view_access.rs:629-638 \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/perry-codegen/src/expr/proven_view_access.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94274ee18282c4a69c552a61bebf424ae256fe3dcb02d6323c81c81ebc8c950"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/expr/this_super_call.rs:119-129 | crates/perry-codegen/src/expr/this_super_call.rs:178-188 \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/perry-codegen/src/expr/this_super_call.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"27eef40e02717456f99837be1ac8772e9da236a58b24c7fa9d94b320fb2c3e3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201311 lines \u00D7 2): crates/perry-codegen/src/expr/this_super_call.rs:635-640 | crates/perry-codegen/src/lower_call/new.rs:1538-1548 \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/perry-codegen/src/expr/this_super_call.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1768a1fc051763fc3896821522de80b1e821c66a747db7bb045d27c6c9e949"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/expr/typed_array_rmw.rs:364-378 | crates/perry-codegen/src/expr/typed_array_rmw.rs:380-390 \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/perry-codegen/src/expr/typed_array_rmw.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a7d9aef09a9a90ff1583697c392e896a17b576fae6ce6646e4d8e250a172b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/expr/url_main.rs:215-225 | crates/perry-codegen/src/expr/url_main.rs:258-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/url_main.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"96dcae5e4071da80926c10e1ba1bd3d46d83915b0e7e7435ccf2b8446a748130"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/perry-codegen/src/linker.rs:973-982 | crates/perry-codegen/src/linker.rs:1042-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/linker.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"376573fe67df6aa1e282ecf7e6fb0f3406a39d6b58b071d4cc35ec59b4bdfd41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/lower_call/direct_method_guard.rs:90-100 | crates/perry-codegen/src/lower_call/method_override.rs:968-978 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/direct_method_guard.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/method_override.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 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/perry-codegen/src/lower_call/direct_method_guard.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69ff2b0de4adf8a68190586b43a3ead6446cfed4da905420d14f7eb031c9584"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): crates/perry-codegen/src/lower_call/extern_timers.rs:138-145 | crates/perry-codegen/src/lower_call/namespace_call.rs:190-200 \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/perry-codegen/src/lower_call/extern_timers.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c9e5e9934317841b4f61a9364a15fd0833fa3541aaa72324d45e11ec4d98de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/perry-codegen/src/lower_call/field_init.rs:953-963 | crates/perry-codegen/src/lower_call/field_init.rs:1014-1023 \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/perry-codegen/src/lower_call/field_init.rs"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"51cd2f0b7e1e66639a2d45864440bda3b0cb9dd62693087a8c4b492515527484"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/lower_call/new.rs:1681-1691 | crates/perry-codegen/src/lower_call/new.rs:1720-1730 \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/perry-codegen/src/lower_call/new.rs"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"67764620048baf4db008f7f781a54913e9c375254fd6f0b56038f2ce3ff9765a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/perry-codegen/src/lower_call/options/fetch.rs:811-821 | crates/perry-codegen/src/lower_call/options/fetch.rs:1050-1059 \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/perry-codegen/src/lower_call/options/fetch.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd0a4b95cabce05ca6e58ade27ea6572edacc91a24f084d8c595590c206e18f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:531-541 | crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:575-583 \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/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0631ddfd76f344458e2ff64aac23c3c4c957485bd45c3ceace178e73665fd1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/perry-codegen/src/lower_string_method.rs:1259-1268 | crates/perry-codegen/src/lower_string_method.rs:1314-1324 \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/perry-codegen/src/lower_string_method.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58599caf1197b1a5b3851b79464807e6bd36e4b53b9eafa80f8a0b1c7e7959f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/module.rs:1021-1031 | crates/perry-codegen/src/module.rs:1079-1089 \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/perry-codegen/src/module.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb8bd99eabc0fa2c1943028cb855f0d7566130e99dbf524b1e6e5b85115fde9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/native_value/verify/layout.rs:185-195 | crates/perry-codegen/src/native_value/verify/layout.rs:214-224 \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/perry-codegen/src/native_value/verify/layout.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"114bdd81f7fd037473c46f527ea362da1625357ab770d12135610280a9e5bcc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/opt_report/render.rs:292-302 | crates/perry-codegen/src/opt_report/render.rs:398-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":"crates/perry-codegen/src/opt_report/render.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36989b8cb655974255347ebac4b2d6c3f31115130eb7188d3541201b1a7e392"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/stmt/region_loop/guard.rs:660-670 | crates/perry-codegen/src/stmt/region_loop/guard.rs:677-687 \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/perry-codegen/src/stmt/region_loop/guard.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cb8d13dfbfde232c80afdb7ddbab63ca53d0856c801a0c77429b52a9b6a322"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-component-host/src/async_values/compose.rs:139-149 | crates/perry-component-host/src/async_values/compose.rs:183-193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-component-host/src/async_values/compose.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c115ed464eb1cd361be5a38928177a26456f1c79a534bf82fb7d028a4af411"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-container-compose/src/backend/docker.rs:297-307 | crates/perry-container-compose/src/backend/docker.rs:315-325 \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/perry-container-compose/src/backend/docker.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"126a08f3221f34b1ac55b4ebc0ee4da0af6ceb702b502e0ae445dff87badc517"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-diagnostics/src/compat_report.rs:434-444 | crates/perry-diagnostics/src/compat_report.rs:545-555 \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/perry-diagnostics/src/compat_report.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc33b3ebfa2c46560c99051e93d324295590522728abd8bd6fb7b8a633e377be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-ext-http/src/agent.rs:676-686 | crates/perry-ext-http/src/agent.rs:766-776 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-http/src/agent.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"22cc0391a9ab5f9e4007eefee6fd2f63a973cc41990b349ecb4d9a85c2e92536"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-ext-http/src/server/response.rs:1112-1122 | crates/perry-ext-http/src/server/response_end.rs:187-197 \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/perry-ext-http/src/server/response.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"444ca9fd9d837bbd015ff018174af81bad55469843b9d6b390e13cfc95806c7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-ext-http/src/server/turnloop_h2/native_server.rs:296-306 | crates/perry-ext-http/src/server/turnloop_serve/mod.rs:282-292 \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/perry-ext-http/src/server/turnloop_h2/native_server.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f90f56c4430feb7226f40e08866bebd100771631ec570ed48b10edaf5d4a58a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-ext-http/src/server/turnloop_serve/conn.rs:970-980 | crates/perry-http-server/src/conn.rs:744-754 \u2014 before extracting anything, compare \u0060crates/perry-ext-http/src/server/turnloop_serve/conn.rs\u0060 and \u0060crates/perry-http-server/src/conn.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 65 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/perry-ext-http/src/server/turnloop_serve/conn.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"242c31feeef4a09fa8ce4d804a6d6a8867ce5f01727888f3e47c3efd3b0c7421"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-ext-http/src/server/turnloop_serve/wire.rs:127-137 | crates/perry-http-server/src/wire.rs:133-143 \u2014 before extracting anything, compare \u0060crates/perry-ext-http/src/server/turnloop_serve/wire.rs\u0060 and \u0060crates/perry-http-server/src/wire.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 115 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/perry-ext-http/src/server/turnloop_serve/wire.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82ed67e0f727bfbe79639a4b38c1dfdabf6ac97ff1dea3973a170bcee984aed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-ext-http/src/tls_client.rs:345-355 | crates/perry-ext-http/src/tls_client.rs:364-374 \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/perry-ext-http/src/tls_client.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96fb40fd00ef5144efaae726528135a1092756c9feca232eaec1525f1723fc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-ext-net/src/payload_io.rs:387-397 | crates/perry-ext-net/src/payload_socket.rs:1418-1429 \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/perry-ext-net/src/payload_io.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"29685c033295e82198b23e36aebaf1de1ae20b1ccfe97dd579b78c333266b0c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-ext-net/src/payload_server.rs:465-475 | crates/perry-ext-net/src/payload_server.rs:491-501 \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/perry-ext-net/src/payload_server.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8a4247e4a1545f250a4c88bb29d6ff97aa37a6a607649d87412cf9301e4189"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-ext-net/src/payload_server.rs:577-587 | crates/perry-ext-net/src/payload_socket.rs:1454-1464 \u2014 before extracting anything, compare \u0060crates/perry-ext-net/src/payload_server.rs\u0060 and \u0060crates/perry-ext-net/src/payload_socket.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. 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/perry-ext-net/src/payload_server.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cff0e4fb5f7d314ec2358d9be12b2a9656f9e65dab0e11f18a4fa82de522c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-ext-ws/src/handshake.rs:90-100 | crates/perry-http-client/src/ws/mod.rs:131-141 \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/perry-ext-ws/src/handshake.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31fb802a450fabe08b880e75d9d8252d9ad9b4681cee2ca4700472802625e72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-gc-effects/src/archive.rs:170-180 | crates/perry-gc-effects/src/archive.rs:215-225 \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/perry-gc-effects/src/archive.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5122f43a31d2c4d56f8aef213f5ca28d80b620f2970565fac9428a5390a989"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-hir/src/analysis/fn_infer.rs:1365-1375 | crates/perry-hir/src/analysis/fn_infer/layout.rs:269-279 \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/perry-hir/src/analysis/fn_infer.rs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee48ff508b9d67fed1c8fe989c09977894c91fb3e549f801867eb0400ae5366"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-hir/src/destructuring/assignment_expr.rs:42-52 | crates/perry-hir/src/destructuring/assignment_expr.rs:192-202 \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/perry-hir/src/destructuring/assignment_expr.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a641133f687273af94e4a9e2ddb893a403161ae4e8001b6529458e25896ae4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-hir/src/lower/context.rs:1032-1042 | crates/perry-hir/src/lower/context.rs:1109-1119 \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/perry-hir/src/lower/context.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbdb7dba4c170a2896abfdfee90da7747550f01f6f57574f05b9041f505ae734"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-hir/src/lower/expr_assign.rs:663-673 | crates/perry-hir/src/lower/type_widening.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_assign.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57e4edbe8ce26837a04a1461a1a4054439b8417efb32c1a17d4da476b43dff3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/globals.rs:601-611 | crates/perry-hir/src/lower/expr_call/module_static.rs:1391-1401 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/globals.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/module_static.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 296 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/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c415e07d58df7407c738943f0defbc0cca6e95dedcaffbd7c38b0d7fc35502"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/globals.rs:612-622 | crates/perry-hir/src/lower/expr_call/module_static.rs:1402-1412 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/globals.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/module_static.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 296 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/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53647c171ffed8f8297da38d20baea60c9f902b05c2b83749b9c2597ce7131b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/globals.rs:623-633 | crates/perry-hir/src/lower/expr_call/module_static.rs:1413-1423 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/globals.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/module_static.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 296 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/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3bfabb319dcac705e8bfc7554a007b70df1cc89929bd4ca952ebd9381fc18e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/globals.rs:634-644 | crates/perry-hir/src/lower/expr_call/module_static.rs:1424-1434 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/globals.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/module_static.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 296 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/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c96e6aa6f33b90dac9c796d633e8bca89caaba07990709849eaaa78f15af221"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/globals.rs:658-668 | crates/perry-hir/src/lower/expr_call/module_static.rs:1448-1458 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/globals.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/module_static.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 296 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/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"837301fc46fee9d3b3e9a802548bd84ee152eded0c7ecaa424689b8707c77d47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/intrinsics/namespace_static.rs:124-134 | crates/perry-hir/src/lower/expr_call/intrinsics/namespace_static.rs:177-187 \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/perry-hir/src/lower/expr_call/intrinsics/namespace_static.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3a713bb8590b8e318ecce10e6489f72feba5efcbc193aea2fcec728b0b37a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/stream.rs:85-95 | crates/perry-hir/src/lower/expr_call/stream.rs:114-124 \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/perry-hir/src/lower/expr_call/stream.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5b27bfae877a2f5ffef8c949f5c4c9a0c2cd6840b68a7e7919e05c349cb9bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/perry-hir/src/lower/expr_new.rs:1876-1886 | crates/perry-hir/src/lower/expr_new/non_ident.rs:196-205 \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/perry-hir/src/lower/expr_new.rs"},"region":{"startLine":1876}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d0a40e17446fb496706a6409b38a1231975f1e60b6c0b878e90912ca9ea984"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): crates/perry-hir/src/lower/stmt.rs:1454-1461 | crates/perry-hir/src/lower/stmt.rs:1500-1510 \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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc168d249bc47454215b97b450d6da78de1b26c9ac96d9c740c394c4dd7faae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:1663-1672 | crates/perry-hir/src/lower_decl/body_stmt.rs:2141-2151 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d56d0e7015557f842713f83c11c44719bd04e1a3a77ef2ba15b922a6c3cc2ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 2): crates/perry-hir/src/lower_decl/block.rs:162-172 | crates/perry-hir/src/lower_decl/block.rs:358-364 \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/perry-hir/src/lower_decl/block.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade8967dd5beb93ee181b1283301a1d56780e3b3d99ecbe02181b2d85213bf7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201311 lines \u00D7 2): crates/perry-hir/src/lower_decl/block.rs:159-169 | crates/perry-hir/src/lower_decl/block.rs:329-334 \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/perry-hir/src/lower_decl/block.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f83f4c4fb0b2db79ea9bbc8bcf77f145b3348c2ef86507e3b01279993f2b5eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-hir/src/lower_decl/class_decl.rs:641-651 | crates/perry-hir/src/lower_decl/class_decl/from_ast.rs:326-336 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/class_decl.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/class_decl/from_ast.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 548 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/perry-hir/src/lower_decl/class_decl.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2dea71499bf0f1b6273c77dc7f9effe102e9b7be3003773781185eedb95309"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-hir/src/lower_types.rs:1075-1085 | crates/perry-hir/src/lower_types.rs:1108-1118 \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/perry-hir/src/lower_types.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e7352eff25ada0759bdfe39bdf196391fe986dae3490b98546f71202d5edd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-http-server/src/conn.rs:492-502 | crates/perry-http-server/src/conn.rs:530-540 \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/perry-http-server/src/conn.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"2430207eed289f7d02c8be5deea94bc38368d0958f28bd9971685e5e14dfb111"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-parser/src/lib.rs:256-266 | crates/perry-parser/src/lib.rs:565-575 \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/perry-parser/src/lib.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e23bfc53b85ef116b5cf0742bb83ae62eac49e33d486fecf2888e3312cff06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 8): crates/perry-codegen/src/codegen/function.rs:228-237 | crates/perry-codegen/src/codegen/function.rs:241-250 | crates/perry-codegen/src/codegen/function.rs:255-264 | crates/perry-codegen/src/codegen/function.rs:270-279 | crates/perry-codegen/src/codegen/method_trampolines.rs:27-36 | crates/perry-codegen/src/codegen/method_trampolines.rs:40-49 | crates/perry-codegen/src/codegen/method_trampolines.rs:54-63 | crates/perry-codegen/src/codegen/method_trampolines.rs:69-78 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/function.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method_trampolines.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 96 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/perry-codegen/src/codegen/function.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80fb819a6f91c7c6f86afc8018f6aa33f19d1b770105e67fec971dcae6098c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 8): crates/perry-codegen/src/codegen/typed_abi.rs:862-871 | crates/perry-codegen/src/codegen/typed_abi.rs:974-983 | crates/perry-codegen/src/codegen/typed_abi.rs:1040-1049 | crates/perry-codegen/src/codegen/typed_abi.rs:1101-1110 | crates/perry-codegen/src/codegen/typed_abi.rs:1169-1178 | crates/perry-codegen/src/codegen/typed_abi.rs:1212-1221 | crates/perry-codegen/src/codegen/typed_abi.rs:1245-1254 | crates/perry-codegen/src/codegen/typed_abi.rs:1276-1285 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/typed_abi.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ab87f13edb2e332d1002b70433882b9360706f8c195c799c515b1fa77d978c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 7): crates/perry-codegen/src/collectors/escape_news.rs:319-328 | crates/perry-codegen/src/collectors/hot_callees.rs:478-486 | crates/perry-codegen/src/collectors/i32_locals.rs:1283-1292 | crates/perry-codegen/src/collectors/index_uses.rs:182-191 | crates/perry-codegen/src/collectors/index_uses.rs:430-438 | crates/perry-codegen/src/collectors/mutation.rs:526-534 | crates/perry-codegen/src/collectors/refs.rs:246-255 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/i32_locals.rs\u0060 and \u0060crates/perry-codegen/src/collectors/refs.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 477 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/perry-codegen/src/collectors/escape_news.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"730eff505fcd725940146db7d73a89cf858a0f942b48911441c031fcbf9bcb44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201310 lines \u00D7 7): crates/perry-codegen/src/expr/compare.rs:391-397 | crates/perry-codegen/src/expr/compare.rs:688-694 | crates/perry-codegen/src/expr/compare.rs:1149-1155 | crates/perry-codegen/src/expr/layout_read.rs:703-708 | crates/perry-codegen/src/expr/proven_view_access.rs:458-465 | crates/perry-codegen/src/expr/u8_buffer_read.rs:431-436 | crates/perry-codegen/src/lower_string_method/char_code_at.rs:328-337 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/compare.rs\u0060 and \u0060crates/perry-codegen/src/lower_string_method/char_code_at.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 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/perry-codegen/src/expr/compare.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"1504b407dbe8c3d502c2558bfe45b62fd060075d3ae59e197235eb52468eee96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): crates/perry-codegen/src/codegen/closure.rs:1350-1359 | crates/perry-codegen/src/codegen/entry.rs:953-962 | crates/perry-codegen/src/codegen/entry/module_init.rs:433-442 | crates/perry-codegen/src/codegen/function.rs:1454-1463 | crates/perry-codegen/src/codegen/method.rs:741-750 | crates/perry-codegen/src/codegen/method_static.rs:416-425 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/entry.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 221 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15c42cce3694e2a2c0514a7c9dd69fea2ac4715ea11aab62f3b555ad3bd15b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): crates/perry-codegen/src/codegen/closure.rs:1456-1465 | crates/perry-codegen/src/codegen/entry.rs:1061-1070 | crates/perry-codegen/src/codegen/entry/module_init.rs:541-550 | crates/perry-codegen/src/codegen/function.rs:1558-1567 | crates/perry-codegen/src/codegen/method.rs:851-860 | crates/perry-codegen/src/codegen/method_static.rs:515-524 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/entry.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 221 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c3fefcbb54f6bf4fefe8e2891064233ca5cbfcdfa398265e5a528e3fde8646"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 6): crates/perry-hir/src/lower/expr_object.rs:1438-1447 | crates/perry-hir/src/lower/expr_object.rs:1657-1666 | crates/perry-hir/src/lower/lower_expr/reactive_text.rs:161-169 | crates/perry-hir/src/lower/lower_expr/reactive_text.rs:202-210 | crates/perry-hir/src/lower/widget_decl/reactive_animate.rs:239-247 | crates/perry-hir/src/lower/widget_decl/reactive_animate.rs:280-288 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/lower_expr/reactive_text.rs\u0060 and \u0060crates/perry-hir/src/lower/widget_decl/reactive_animate.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 87 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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47fe4411fa1bcfd949a84b6e23b890e411ab281f890a18da8100dc9031fa989"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/perry-codegen/src/collectors/escape_arrays.rs:161-170 | crates/perry-codegen/src/collectors/escape_arrays.rs:308-317 | crates/perry-codegen/src/collectors/hot_callees.rs:699-708 | crates/perry-codegen/src/collectors/not_bigint_locals.rs:384-393 \u2014 there are 4 copies across 3 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/escape_arrays.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"85189b6449a6f407bfb0b8ee2680d65ca16582c4eadc97ccf4543dcb2acd1e3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/perry-codegen/src/collectors/escape_check.rs:328-337 | crates/perry-codegen/src/collectors/escape_news.rs:277-286 | crates/perry-codegen/src/collectors/escape_objects.rs:448-457 | crates/perry-codegen/src/collectors/ptr_shape.rs:1493-1502 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/escape_check.rs\u0060 and \u0060crates/perry-codegen/src/collectors/escape_news.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 73 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/perry-codegen/src/collectors/escape_check.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f31c7f62f2472620019019ac6f85738c2d1d19007cb1a9ae5d5e07b13484315"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/perry-codegen/src/collectors/hoisted_callback_calls.rs:392-401 | crates/perry-codegen/src/collectors/spec_abi_sites.rs:1451-1460 | crates/perry-codegen/src/collectors/straight_line_stores.rs:99-108 | crates/perry-hir/src/enums.rs:134-143 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/hoisted_callback_calls.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"068e9824841e6c75254ae0015440ef0c3361189ca5fcd718e559e4a7f422ec1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/perry-codegen/src/expr/logical_collections.rs:530-539 | crates/perry-codegen/src/expr/math_simple.rs:251-260 | crates/perry-codegen/src/expr/math_simple.rs:346-355 | crates/perry-codegen/src/expr/math_simple.rs:413-422 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/logical_collections.rs\u0060 and \u0060crates/perry-codegen/src/expr/math_simple.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 117 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/perry-codegen/src/expr/logical_collections.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5b24c8331e67a8afdc38d18d85ae7dd93d54cb6d40ad34969068e029f0af23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:1190-1199 | crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:1205-1214 | crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:1220-1229 | crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:1236-1246 \u2014 all 4 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/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d36e3d3c386ad4ce9dbf125bcc2fa5584106695de6d857cce92da0de4be27ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/perry-hir/src/audit.rs:67-81 | crates/perry-hir/src/capability.rs:112-121 | crates/perry-hir/src/egress.rs:104-113 | crates/perry-hir/src/lockdown.rs:63-72 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/audit.rs\u0060 and \u0060crates/perry-hir/src/capability.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 136 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/perry-hir/src/audit.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9b48ec67a40bc399034f2aea78747995641584fec4e8f27ced7a640e3cdca9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 4): crates/perry-hir/src/lower/expr_new.rs:1008-1016 | crates/perry-hir/src/lower/expr_new.rs:1379-1388 | crates/perry-hir/src/lower/expr_new.rs:1494-1502 | crates/perry-hir/src/lower/expr_new.rs:1519-1527 \u2014 all 4 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/perry-hir/src/lower/expr_new.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbe4a2ccaa4e71acb8e29143b001bbafae6ee1e5ca3fa05dcab0fff7af5d750"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/perry-hir/src/lower/module_decl.rs:225-234 | crates/perry-hir/src/lower/module_decl.rs:242-251 | crates/perry-hir/src/lower/module_decl.rs:1443-1452 | crates/perry-hir/src/lower/module_decl.rs:1565-1574 \u2014 all 4 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/perry-hir/src/lower/module_decl.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f43f3e1121633d6368ede5a9f0e4f36f66aaee40963aad869757bc2af1faea2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/perry-hir/src/monomorph/infer.rs:274-283 | crates/perry-hir/src/monomorph/infer.rs:383-392 | crates/perry-hir/src/monomorph/update_call_sites.rs:589-598 | crates/perry-hir/src/monomorph/update_call_sites.rs:647-656 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/monomorph/infer.rs\u0060 and \u0060crates/perry-hir/src/monomorph/update_call_sites.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 128 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/perry-hir/src/monomorph/infer.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3eade9968347ff31aa57b60aad669211e22325aa18f5932640fcc5e9b402b63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/perry-codegen-wasm/src/emit/stmt.rs:101-110 | crates/perry-codegen-wasm/src/emit/stmt.rs:149-158 | crates/perry-codegen-wasm/src/emit/stmt.rs:234-243 \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/perry-codegen-wasm/src/emit/stmt.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"478d03eeb1fed32693c688ff4362acf64f7dbb4a8814476244d531615d51cb6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): crates/perry-codegen/src/codegen/closure.rs:71-80 | crates/perry-codegen/src/codegen/function.rs:251-259 | crates/perry-codegen/src/codegen/method_trampolines.rs:50-58 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/function.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 320 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"97429f51f871688ec8d8e66439287a32663bb7ece48e40d39297ff36c14fef23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/perry-codegen/src/collectors/hir_facts.rs:1719-1728 | crates/perry-hir/src/walker/expr_mut.rs:1637-1646 | crates/perry-hir/src/walker/expr_ref.rs:1612-1621 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/walker/expr_mut.rs\u0060 and \u0060crates/perry-hir/src/walker/expr_ref.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 2017 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/perry-codegen/src/collectors/hir_facts.rs"},"region":{"startLine":1719}}}],"partialFingerprints":{"codehealthFindingId/v1":"14dfdcbf57dce75da45f719431fd0f34caba1e898624a8e49b2ea9b447fd19d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/perry-codegen/src/collectors/proven_args.rs:302-311 | crates/perry-codegen/src/collectors/scalar_method_dispatch.rs:973-982 | crates/perry-codegen/src/expr/slot_rep.rs:955-964 \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/perry-codegen/src/collectors/proven_args.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d87f973567fe46cd83a9eb06d6c44b9021fb7ceb5f4c643d3b1ae2033d3d47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/perry-codegen/src/expr/bigint_set.rs:126-135 | crates/perry-codegen/src/expr/bigint_set.rs:238-247 | crates/perry-codegen/src/expr/bigint_set.rs:307-316 \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/perry-codegen/src/expr/bigint_set.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"793a684bff86d41e53c3eb96450c050ba21e980f27f7f49b68945340941c0211"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/perry-codegen/src/expr/buffer_access.rs:502-511 | crates/perry-codegen/src/expr/buffer_access.rs:580-589 | crates/perry-codegen/src/expr/buffer_access.rs:880-889 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/buffer_access.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e8fde83f38f7f0d59627419776ceb6f5014d24e7b111997f4e1104e07dd148"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 3): crates/perry-codegen/src/expr/method_site.rs:750-756 | crates/perry-codegen/src/lower_call/property_get/completed_object.rs:54-60 | crates/perry-codegen/src/lower_call/property_get/completed_object.rs:150-159 \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/perry-codegen/src/expr/method_site.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb8cf8a86e7f407aae1dd4655a40d24df236c8dce259e563c56b6e12ed54ccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/perry-codegen/src/expr/this_super_call.rs:912-921 | crates/perry-codegen/src/expr/this_super_call.rs:953-968 | crates/perry-codegen/src/expr/this_super_call.rs:979-988 \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/perry-codegen/src/expr/this_super_call.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb29721fd5ec529d44d65c77b6eee8eb004f5ab806bb213a726b7bb9e110b9d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): crates/perry-codegen/src/stmt/loops.rs:4038-4046 | crates/perry-codegen/src/stmt/loops.rs:4084-4091 | crates/perry-codegen/src/stmt/loops.rs:4140-4149 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":4038}}}],"partialFingerprints":{"codehealthFindingId/v1":"576555f24b1edc825d7b41c1b04f5625fe82b658fa1d80fa053fd395a9dd30e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/perry-codegen/src/temp_root_coverage/call_callee.rs:69-78 | crates/perry-codegen/src/testing/temp_slots.rs:221-230 | crates/perry-codegen/src/testing/temp_slots.rs:409-418 \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/perry-codegen/src/temp_root_coverage/call_callee.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec876107ff43ba8cc48c81feca9c2d26a0482d4848fc6bb5e8109761b45e5e88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/perry-ext-net/src/payload_abi.rs:477-486 | crates/perry-ext-net/src/payload_abi.rs:714-723 | crates/perry-ext-net/src/payload_abi.rs:1062-1071 \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/perry-ext-net/src/payload_abi.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f258f40f616dc131a3a572986bdac62de5572b13bc5247cbb3cd5ebc6ab890"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/perry-ext-net/src/payload_abi.rs:543-552 | crates/perry-ext-net/src/payload_abi.rs:780-789 | crates/perry-ext-net/src/payload_abi.rs:1084-1093 \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/perry-ext-net/src/payload_abi.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"130b75dc30872b198701820aa710e26d21fc2571eecbff93097c0a920fa16277"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/perry-ext-net/src/payload_abi.rs:559-568 | crates/perry-ext-net/src/payload_abi.rs:796-805 | crates/perry-ext-net/src/payload_abi.rs:1103-1112 \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/perry-ext-net/src/payload_abi.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86e6432ec17f17957df469847c616c9ec40c41b825d3bb8cf0a943ddb358e02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/perry-ext-net/src/payload_abi.rs:649-658 | crates/perry-ext-net/src/payload_abi.rs:665-674 | crates/perry-ext-net/src/payload_abi.rs:842-851 \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/perry-ext-net/src/payload_abi.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c74601e5d264d3edad468ec45ee926d108cda67f247f8584b25e99644e14e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): crates/perry-ext-net/src/payload_tls.rs:215-224 | crates/perry-ext-net/src/payload_tls.rs:291-298 | crates/perry-ext-net/src/payload_tls.rs:329-336 \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/perry-ext-net/src/payload_tls.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2839177f24861d75bffc171ea16b82a1db0c2e3b45e230010c10fda6a48f0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/array_only_methods.rs:1133-1142 | crates/perry-hir/src/lower/expr_call/imported_array_methods.rs:215-223 | crates/perry-hir/src/lower/expr_call/inline_array_methods.rs:144-152 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/array_only_methods.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/imported_array_methods.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 97 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/perry-hir/src/lower/expr_call/array_only_methods.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"576a8340da4561a771a980398c5f74621310b16b90d2ffe6adbfaa13f7c87c1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/intrinsics/require.rs:39-48 | crates/perry-hir/src/lower/expr_call/intrinsics/require.rs:133-142 | crates/perry-hir/src/lower/expr_call/native_module.rs:81-88 \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/perry-hir/src/lower/expr_call/intrinsics/require.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4222bab3f5433ddf9ba2ef739c2fb9b222136455742c4881aff5024cc7644a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/local_array_methods.rs:642-651 | crates/perry-hir/src/lower/expr_call/local_array_methods.rs:824-833 | crates/perry-hir/src/lower/expr_call/local_array_methods.rs:868-877 \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/perry-hir/src/lower/expr_call/local_array_methods.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6498b3a35b33fd192feb5700bc053688f30d3ce18647d4a03bc63b527b228c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/perry-hir/src/lower/expr_object.rs:472-481 | crates/perry-hir/src/lower/expr_object.rs:625-634 | crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs:269-278 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_object.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 95 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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"80724abd375d71fd2d1c11e29a18c866d0b5311cd993fbef0e14a9f99e42c67c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs:62-71 | crates/perry-hir/src/lower_decl/body_stmt/detect.rs:62-71 | crates/perry-hir/src/lower_decl/helpers.rs:16-25 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt/detect.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 133 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/perry-hir/src/lower/stmt_loops/for_await_targets.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"29acd921f586f08d109afa455dcea9cf1ab1ae3b90498d010d53fc7005b09934"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/perry-audio-miniaudio/src/lib.rs:826-835 | crates/perry-audio-miniaudio/src/lib.rs:892-900 \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/perry-audio-miniaudio/src/lib.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"386f1254afcd17e926293f4a7ad3451743f66e3064e35dfd7e7d97f8d0e6fb01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/builtin_proto.rs:244-253 | crates/perry-codegen/src/lower_call/scalar_method.rs:991-1003 \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/perry-codegen/src/builtin_proto.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"caeab596c9b637398e9ce20001620c72d42d8395aa55c2429d2355459870612c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/codegen/class_declarations.rs:99-108 | crates/perry-codegen/src/codegen/class_declarations.rs:118-127 \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/perry-codegen/src/codegen/class_declarations.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"5998877bc973eea7cd4fff2b386abf4a309deeb9c8364cad34aa914d67af2d94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/perry-codegen/src/codegen/entry.rs:709-718 | crates/perry-codegen/src/codegen/entry/module_init.rs:194-202 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/entry.rs\u0060 and \u0060crates/perry-codegen/src/codegen/entry/module_init.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 473 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/perry-codegen/src/codegen/entry.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df8c1b372655c2674cc1e501f1afa7e2fc27a1cf9dace587067159fcfe3c2be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/codegen/function.rs:1289-1298 | crates/perry-codegen/src/codegen/method_static.rs:245-254 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/function.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method_static.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 268 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/perry-codegen/src/codegen/function.rs"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"58bfe05b81dd166adcf6bdc98166c0b3b9870e175df591b9cd133c052c5083d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/codegen/helpers.rs:707-716 | crates/perry-codegen/src/lower_call/new_helpers.rs:774-783 \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/perry-codegen/src/codegen/helpers.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bba1bad45d34f84331a71f560e4716c7b82b53033f1d2aa10e38a7466b9145"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/codegen/reach_report.rs:270-279 | crates/perry-codegen/src/codegen/source_need/flow.rs:418-427 \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/perry-codegen/src/codegen/reach_report.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"3793959b551f62c03002dcc918b4179937dc558e6bd89e95278f01fda1092511"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/codegen/reach_report.rs:1212-1221 | crates/perry-codegen/src/codegen/reach_report.rs:1228-1237 \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/perry-codegen/src/codegen/reach_report.rs"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02a621314d5dca817d9cb74df2ca18ad19193f6abc5d41038dbea68fd879ee0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/codegen/source_need/flow.rs:920-929 | crates/perry-codegen/src/codegen/source_need/flow.rs:937-946 \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/perry-codegen/src/codegen/source_need/flow.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3adc5d50e80f6166c95fd72b5485ccd4c4d44c1a6ffa6bc4c7c79a0a8d73d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/perry-codegen/src/codegen/spec_return_proof.rs:56-65 | crates/perry-codegen/src/lower_call/func_ref.rs:410-417 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/spec_return_proof.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/func_ref.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/perry-codegen/src/codegen/spec_return_proof.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b53af9b3435e57821f919edc448deab6a10eb2c3fe9366a6462236743b385a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/codegen/typed_abi.rs:1592-1601 | crates/perry-codegen/src/codegen/typed_abi.rs:1620-1629 \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/perry-codegen/src/codegen/typed_abi.rs"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"2202a44b127553df856770f25b6299da7aeb56d002cd60294600c5e6d604a4a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/collectors/escape_arrays.rs:179-188 | crates/perry-codegen/src/collectors/escape_arrays.rs:195-204 \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/perry-codegen/src/collectors/escape_arrays.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"5929b4a7b6532c2f1a2b6f0f40ae7b28bef5a5e17b187a912b16e20dd88bf023"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): crates/perry-codegen/src/collectors/escape_check.rs:599-605 | crates/perry-codegen/src/collectors/escape_objects.rs:591-600 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/escape_check.rs\u0060 and \u0060crates/perry-codegen/src/collectors/escape_objects.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 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/perry-codegen/src/collectors/escape_check.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"107715af847ad852c3eb028fee9bad9f40c53a89a3946c4e2f3a99f7d5868661"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/collectors/escape_check.rs:832-841 | crates/perry-codegen/src/collectors/escape_check.rs:1092-1101 \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/perry-codegen/src/collectors/escape_check.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f94c9d7f3ead4df15a898eac19bf5aa6b9ccff5d8e5863c15c593e00097c0b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/collectors/escape_news.rs:812-821 | crates/perry-codegen/src/collectors/escape_news.rs:868-877 \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/perry-codegen/src/collectors/escape_news.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"d040ab9c1f6ed148ea38e49fa013807eefba08956d9e3bc807a7d136c9321f8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/collectors/pointer_locals.rs:220-229 | crates/perry-hir/src/analysis/value_types.rs:987-996 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/pointer_locals.rs\u0060 and \u0060crates/perry-hir/src/analysis/value_types.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 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/perry-codegen/src/collectors/pointer_locals.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68fcf0312cbab25847f3b7863f4a8aa9802b618f424618f29644930ac1de104"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/collectors/repsel_benefit.rs:448-457 | crates/perry-hir/src/type_alias_resolve.rs:507-516 \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/perry-codegen/src/collectors/repsel_benefit.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"484993c0377dd9b046d7815c2faf48bd5bf9257830d3f4bc721d4d0cfdda5d09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/dialect/mod.rs:1358-1367 | crates/perry-codegen/src/dialect/mod.rs:1497-1506 \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/perry-codegen/src/dialect/mod.rs"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"373f58f5dd56111bac42181602d76c55033169b0a6a5d37b6806f309fba3fc6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/perry-codegen/src/expr/arrays_finds.rs:202-210 | crates/perry-codegen/src/expr/u8_buffer_read.rs:244-253 \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/perry-codegen/src/expr/arrays_finds.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9973e39a0f90a378073126a80579288e0d08e04a78c7262463bf46e28e8cd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/buffer_access.rs:656-665 | crates/perry-codegen/src/expr/buffer_access.rs:774-783 \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/perry-codegen/src/expr/buffer_access.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83bc7a8e8925b24f88d32959ad30df9d519c8f89af397532c2d1c83cf49c535"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/buffer_access.rs:716-725 | crates/perry-codegen/src/expr/buffer_access.rs:886-895 \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/perry-codegen/src/expr/buffer_access.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2677c1cf7721fc2c204838edc2593e2d502d70bc4477c0ec0e788f4c3dad32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/call_spread.rs:707-716 | crates/perry-codegen/src/lower_call/early_branches.rs:50-59 \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/perry-codegen/src/expr/call_spread.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe266ae8abc9f02aa6c32428ed4fa10ed06ec642d5c1ca3fa860ca75d664989"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/calls/crypto_keys.rs:17-26 | crates/perry-codegen/src/expr/calls/crypto_keys.rs:105-114 \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/perry-codegen/src/expr/calls/crypto_keys.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5836773d7b0488c22c234396f4614da06a8581e5d6e33066ab870e78964468"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/calls/crypto_misc.rs:463-472 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:510-519 \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/perry-codegen/src/expr/calls/crypto_misc.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4894feda35aaaa6dcb486c63a1e197df569d5b73b010cb2ae276ec96a0addab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/child_proc.rs:405-417 | crates/perry-codegen/src/expr/child_proc.rs:479-488 \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/perry-codegen/src/expr/child_proc.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41ccd3cbb596c7693e926808e975b2ac5d677e0604cb6dab9a3b30b337d051f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/perry-codegen/src/expr/class_env.rs:157-166 | crates/perry-codegen/src/expr/wpfacts_access.rs:224-231 \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/perry-codegen/src/expr/class_env.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab5194c8106f74c88aa9a9a56376fd36a6c15d399fde024c8c1b637ba8a4572"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/perry-codegen/src/expr/closure.rs:71-79 | crates/perry-hir/src/lower/lower_module_fn.rs:150-159 \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/perry-codegen/src/expr/closure.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"469229d3a92144f6432ff661fd6fa90eb7e9bec425e36bb21f4096a9c51ecfd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/perry-codegen/src/expr/compare.rs:608-617 | crates/perry-codegen/src/expr/compare.rs:1097-1105 \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/perry-codegen/src/expr/compare.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd67b258799d207a566da8f093708bfeb1b851769c077b3ce4609df67ab5f5c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/i32_fast_path.rs:1782-1791 | crates/perry-codegen/src/expr/i32_fast_path.rs:1810-1819 \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/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"79294507bdf0ab439066b985bae43d7d23614d55e474a2df16ddb011815ab438"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/index_get/guarded_array.rs:576-585 | crates/perry-codegen/src/expr/index_get/guarded_array.rs:654-663 \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/perry-codegen/src/expr/index_get/guarded_array.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"69dc9214af8999182b811a8c125cff66798b8bccc505c5cb776777a0e07c9558"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/index_set.rs:205-214 | crates/perry-codegen/src/expr/proven_view_access.rs:56-65 \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/perry-codegen/src/expr/index_set.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"0209cb3b66a92df65b69d7dfa134f35648e6b276466122f3ffac786bae854c3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/perry-codegen/src/expr/index_set_guarded.rs:122-130 | crates/perry-codegen/src/expr/index_set_packed_loop.rs:182-191 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/index_set_guarded.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffcd350f9a519c6a3f23309e6f4908bd06be0c035353701f5f51aed8d696a201"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/js_runtime.rs:49-58 | crates/perry-codegen/src/expr/js_runtime.rs:148-157 \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/perry-codegen/src/expr/js_runtime.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9822ea61250af3e7d6aef4140e6b33e0488f5baf8d8f551a473d9837335bec68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/layout_read.rs:151-160 | crates/perry-codegen/src/expr/layout_read.rs:245-254 \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/perry-codegen/src/expr/layout_read.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"2728a7f7f62e4a0fdf4ff38186100f10aeb31439b219f58bb98c3f6efb061405"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/literals_vars.rs:857-866 | crates/perry-codegen/src/expr/literals_vars.rs:1111-1120 \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/perry-codegen/src/expr/literals_vars.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"57390a7d8ab6a12ec3d0b560b2b3f255dc22e17f5e99e5a7a607431b2f1c7f6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/perry-codegen/src/expr/property_get.rs:702-711 | crates/perry-codegen/src/expr/property_get.rs:715-722 \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/perry-codegen/src/expr/property_get.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"103a8aae2f452f0d509b1ece0121b46f5afcf114254faa40e19cb210f4cf226d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/property_get.rs:921-930 | crates/perry-codegen/src/expr/property_get.rs:1542-1551 \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/perry-codegen/src/expr/property_get.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe12d5e84fbf34fe0e0df9398115d04de6bab44c973e4d237d397e94ad502f7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/perry-codegen/src/expr/property_get/generic_dispatch.rs:600-608 | crates/perry-codegen/src/expr/string_length.rs:59-68 \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/perry-codegen/src/expr/property_get/generic_dispatch.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"edbcec518ebc90c62cc7d722311fb1d0899249d070993a91da44219d9a7f262a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/property_get/helpers.rs:427-436 | crates/perry-codegen/src/stmt/element_shape_loop.rs:1810-1819 \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/perry-codegen/src/expr/property_get/helpers.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"4161502efdab7c516e894d949f29d34c4e500cb6a0ce418549f1dd0441124f44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/static_field_meta.rs:1405-1414 | crates/perry-codegen/src/expr/static_field_meta.rs:1420-1429 \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/perry-codegen/src/expr/static_field_meta.rs"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"33814949721db7d4d8ca9e28df150a0a5623332aa7a295137c91b7c8115f83c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/perry-codegen/src/expr/string_regex_proc.rs:62-71 | crates/perry-codegen/src/expr/string_regex_proc.rs:78-86 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/string_regex_proc.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"16938347195e0c89ddd40143d9fab31f6b9383803c6197311be03f536d5feb5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/this_super_call.rs:1357-1366 | crates/perry-codegen/src/lower_call/field_init.rs:963-972 \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/perry-codegen/src/expr/this_super_call.rs"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c8859667700147a9e6a5239fbbe29822b34a24f4c8a7519cb53966bcb4beed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/layout_families/late.rs:795-804 | crates/perry-codegen/src/layout_families/late.rs:931-940 \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/perry-codegen/src/layout_families/late.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66dbdd123dff80de201c54e936e82342ffad24b241e161318145466c72a754c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201310 lines \u00D7 3): crates/perry-codegen/src/lower_call/direct_method_guard.rs:42-51 | crates/perry-codegen/src/lower_call/method_override.rs:264-267 | crates/perry-codegen/src/lower_call/method_override.rs:385-394 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/direct_method_guard.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/method_override.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 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/perry-codegen/src/lower_call/direct_method_guard.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c441ee012b0d9e4b21855a5be9d6301309bd383e84502aa2b3aa97e34300b7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/lower_call/extern_func.rs:1206-1215 | crates/perry-codegen/src/lower_call/extern_func.rs:1222-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/extern_func.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"830ce6cc0456f63603c59daf8485d9825787cfc5fa5a3114b21b3327ecd8973b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/lower_call/new.rs:1519-1528 | crates/perry-codegen/src/lower_call/new.rs:1562-1571 \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/perry-codegen/src/lower_call/new.rs"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"610a34ae07f1f4fd0ce1675b3cc0acbf3341d6692564e1bcf465d91b53a29eb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/lower_call/new_helpers.rs:297-306 | crates/perry-codegen/src/lower_call/new_helpers.rs:398-407 \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/perry-codegen/src/lower_call/new_helpers.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e67a0d9c65df1e81985aad373238e03e96f3381da40ad569487cad8bde6f05b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/perry-codegen/src/lower_conditional.rs:364-371 | crates/perry-codegen/src/stmt/if_stmt.rs:183-192 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_conditional.rs\u0060 and \u0060crates/perry-codegen/src/stmt/if_stmt.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 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/perry-codegen/src/lower_conditional.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6287fa4bfa47d5d475b004cdbec4ba7df88a429ae126332292bb6f2d34bc69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/lower_conditional.rs:377-386 | crates/perry-codegen/src/stmt/if_stmt.rs:204-213 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_conditional.rs\u0060 and \u0060crates/perry-codegen/src/stmt/if_stmt.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 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/perry-codegen/src/lower_conditional.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"431660afaff7072f12233494843441be73582878e5a0ace19400a192ffa1e51a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/perry-codegen/src/stmt/element_shape_loop.rs:1013-1022 | crates/perry-codegen/src/stmt/element_shape_loop.rs:1036-1044 \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/perry-codegen/src/stmt/element_shape_loop.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13d58fc4f2f50c039593e4fa85d9641b3993a7d74bddc244fe61e11e188c693"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/stmt/stable_packed_loop.rs:138-147 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:157-166 \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/perry-codegen/src/stmt/stable_packed_loop.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad353f5e954d55e4a34627c307eaa68194eb79f02fe109eaaf782bd0ba2e28f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/stmt/stable_packed_loop.rs:726-735 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:1100-1109 \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/perry-codegen/src/stmt/stable_packed_loop.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22ca72e5b3e23d692dd65abb5409326a4f28b9ae73953f64f7a2c97d752e1b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/perry-codegen/src/stmt/stable_packed_loop.rs:737-745 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:1111-1120 \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/perry-codegen/src/stmt/stable_packed_loop.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44f8db383ff7f73a784d5a6d064dea3d50515767150a687211dc5faf84e9a9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): crates/perry-codegen/src/stmt/versioned_indexed_loop.rs:273-282 | crates/perry-codegen/src/stmt/versioned_indexed_loop.rs:302-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/versioned_indexed_loop.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20230e3583ed9591b62e7a36ffc8aace12e73e4fd64dd280b92bc1ca14cac0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-component-host/src/sync_wasi/sockets.rs:310-319 | crates/perry-component-host/src/sync_wasi/sockets.rs:360-369 \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/perry-component-host/src/sync_wasi/sockets.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2f3cfbc4457f483d4f3f8ecb67831fad4801f26d6de7a4e07b87ab92b7d934"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-ext-better-sqlite3/src/dispatch_ext.rs:166-175 | crates/perry-ext-typescript/src/bun/dispatch.rs:64-73 \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/perry-ext-better-sqlite3/src/dispatch_ext.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3c3be918791b9c379ac1c142f2e64554285597160ff154f288217c13532404"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-ext-http/src/client_events.rs:614-623 | crates/perry-ext-http/src/client_events.rs:680-689 \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/perry-ext-http/src/client_events.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad276f1ec716a078a4745f4eba30de44eac7df5312c67e0223abe26e80bc54c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-ext-http/src/server/http2_server/dispatch.rs:41-50 | crates/perry-ext-http/src/server/http2_server/dispatch.rs:237-246 \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/perry-ext-http/src/server/http2_server/dispatch.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9e50ebb125d34b6d8d4ec3e5b6e13f367a02da4b91f4bc7cc8e3d77aa21056"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-ext-http/src/server/request.rs:378-387 | crates/perry-ext-http/src/server/request.rs:415-424 \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/perry-ext-http/src/server/request.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b6c7aadef96cf26c2f69066b1f67c5800beb7bc19d8d66f6bdeed65d908e58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-ext-http/src/server/response.rs:1005-1014 | crates/perry-ext-http/src/server/response.rs:1592-1601 \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/perry-ext-http/src/server/response.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf59449888a54deada7bb442c637a8b051e62edba0e9ef0549d21710809029d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-ext-http/src/server/turnloop_serve/conn.rs:1018-1027 | crates/perry-http-server/src/conn.rs:789-798 \u2014 before extracting anything, compare \u0060crates/perry-ext-http/src/server/turnloop_serve/conn.rs\u0060 and \u0060crates/perry-http-server/src/conn.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 65 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/perry-ext-http/src/server/turnloop_serve/conn.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"956fb4e36ffdf0b5bbc94e0d30679aa9b392312548836df4fce4cb95d7902a55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-ext-http/src/server/turnloop_serve/conn.rs:1342-1351 | crates/perry-ext-http/src/server/turnloop_serve/conn.rs:1408-1417 \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/perry-ext-http/src/server/turnloop_serve/conn.rs"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"5daa6c2b018f0b29416483facea4fe243ef6f83241133015daa114c32a3294ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-ext-net/src/payload_abi.rs:499-508 | crates/perry-ext-net/src/payload_abi.rs:736-745 \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/perry-ext-net/src/payload_abi.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f45514bcdae31b1a1e30b02bd01582e31fd2dd89d130abc01842272683d013"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-ext-net/src/payload_abi.rs:521-530 | crates/perry-ext-net/src/payload_abi.rs:758-767 \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/perry-ext-net/src/payload_abi.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9bdba089d27ab39b6319fd802b31a0b9b36f0eb3536a781df05072ca96f733"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-ext-net/src/payload_abi.rs:681-690 | crates/perry-ext-net/src/payload_abi.rs:858-867 \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/perry-ext-net/src/payload_abi.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8921a3c6a610c68c5459ee2d68c4e54fe91c3ccbac99e97a5b67683cf526e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-ext-net/src/payload_server.rs:67-76 | crates/perry-ext-net/src/payload_server.rs:426-435 \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/perry-ext-net/src/payload_server.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5addbbe9698cd60c28799b18f9dd5dfcefa5c46458c797ab6d6def1cf889efd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-ext-net/src/tls.rs:427-436 | crates/perry-ext-net/src/tls.rs:522-531 \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/perry-ext-net/src/tls.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39cb18aa213b59d46ec455c1d3629f2942a07b89d8bb52d878407fb037c4ae5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-ext-zlib/src/stream/deflate_context.rs:25-34 | crates/perry-ext-zlib/src/stream/inflate_context.rs:87-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-zlib/src/stream/deflate_context.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"682527cb0cab7939f5efea044043c832ccc2beb3207c4e09b8ab054e97edf700"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-hir/src/js_transform/imports.rs:469-478 | crates/perry-hir/src/js_transform/imports.rs:504-513 \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/perry-hir/src/js_transform/imports.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb18043a33805943a0dd5239ffb333fe527dbe78cd8ac7a8f6a1db95adcecc7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-hir/src/js_transform/imports.rs:1054-1063 | crates/perry-hir/src/js_transform/imports.rs:1269-1278 \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/perry-hir/src/js_transform/imports.rs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"2271ecccdd6843398ba0e1501e9adc9ae7aca2d25f72d7ed0c0dc02d15bd6da8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): crates/perry-hir/src/js_transform/local_natives.rs:71-77 | crates/perry-hir/src/js_transform/local_natives.rs:93-102 \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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e854bed26f776c8497f1b0db2078d9e28556d62028f50c32ef3703d1b44ae2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-hir/src/jsx.rs:44-53 | crates/perry-hir/src/jsx.rs:142-151 \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/perry-hir/src/jsx.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d795c39ba35ea6e0c556bd1a8d2eb0408f7566b8d803c9e46508c1c7e866932"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/perry-hir/src/lower/builder_fold.rs:600-608 | crates/perry-hir/src/lower/builder_fold_width_hints.rs:353-362 \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/perry-hir/src/lower/builder_fold.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"599a2a5f7f5e6671b122baa31b5b92dc474cfb32dabc17d529fc7399429c5eb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-hir/src/lower/const_fold_fn.rs:862-871 | crates/perry-hir/src/lower/expr_call/intrinsics/eval_strict.rs:153-162 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/const_fold_fn.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/intrinsics/eval_strict.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 43 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/perry-hir/src/lower/const_fold_fn.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"39508037e22cbd3163b53807208f8153e0d640ccaadf078b2f9af03f1003016c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-hir/src/lower/const_fold_fn.rs:1257-1266 | crates/perry-hir/src/lower/expr_call/intrinsics/bare_builtins.rs:151-160 \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/perry-hir/src/lower/const_fold_fn.rs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f52d8688701a17b5f8e0330c263015b4cd1da04019c5c61dba317daaa22a4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/globals.rs:818-827 | crates/perry-hir/src/lower/expr_call/module_static.rs:199-208 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/globals.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/module_static.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 296 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/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"187e494cbcb2855193a957505d5bd8d25faa05e1397396aed0a451084a4bdf53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs:50-59 | crates/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs:375-384 \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/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea482880cc57aaa47ff9dcda0dd206e37ec5c4f3f38f15e781cf59ded470d280"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-hir/src/lower/expr_function.rs:1538-1551 | crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs:242-251 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_function.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 137 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/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50acc43ed51d9df401d1f68269f208810706aadf805d6d726ac04a16854878a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-hir/src/lower/expr_new.rs:1156-1165 | crates/perry-hir/src/lower/expr_new.rs:1254-1263 \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/perry-hir/src/lower/expr_new.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c23e45c026e4a0f9e3304e87eca5af5f4da45c2ff65fc727711e0bd05961783"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-hir/src/lower/expr_object.rs:1325-1334 | crates/perry-hir/src/lower/expr_object.rs:1595-1604 \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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfaf9a191ebe00e8188df105f9e43857b309f539378edd00970ef863f7d63a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-hir/src/lower/lower_module_fn.rs:1007-1016 | crates/perry-hir/src/lower/lower_module_fn.rs:1040-1050 \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/perry-hir/src/lower/lower_module_fn.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad6929a9492587660cea66ce26ca9861bd0999ddf3a0eaf5f0b68be462c514c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-hir/src/lower/shared_mutable_capture.rs:1055-1064 | crates/perry-hir/src/lower/shared_mutable_capture.rs:1248-1257 \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/perry-hir/src/lower/shared_mutable_capture.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56353fc67872a81095c19fb685ed844a77c74b2fa6d046c125385f3cf7bf4d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-hir/src/lower/stmt.rs:296-305 | crates/perry-hir/src/lower/stmt.rs:360-369 \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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44e8f130d22c76057594f9984a77b923e6421b546ad651320d5c41228898aa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:1109-1118 | crates/perry-hir/src/lower_decl/body_stmt.rs:1358-1367 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"a474f6993b4121dbd87bb722f9ac81082cbd1102718db31248b39d4f38a73409"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:1553-1562 | crates/perry-hir/src/lower_decl/body_stmt.rs:2039-2049 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dad09d933528e19f2f51c67eab132181b53fcc47bc2ab584ff100a427120b93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:1592-1601 | crates/perry-hir/src/lower_decl/body_stmt.rs:2077-2086 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"25372e7b13c230338962f6150b9e153bfb2f51af14e35b83b1dc131c90aa4191"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-hir/src/lower/widget_decl.rs:1495-1504 | crates/perry-hir/src/lower/widget_decl.rs:1509-1518 \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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"2deb65204f6a6a92f10f696aef4519ae30502a340a237adc61f5cceb90b7bc86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-hir/src/lower_decl/class_captures.rs:117-126 | crates/perry-hir/src/lower_decl/class_captures.rs:236-245 \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/perry-hir/src/lower_decl/class_captures.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a20089678a27ea46033833b98c16b8d0e503243c85f6ca244dcf3a302a34c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-hir/src/lower_types.rs:894-903 | crates/perry-hir/src/lower_types.rs:950-959 \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/perry-hir/src/lower_types.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3877a0e10e0db697a249a1081bad0451138dd4ed75702f78a82dd8a8dc7153"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-hir/src/monomorph/driver.rs:667-676 | crates/perry-hir/src/monomorph/update_call_sites.rs:504-513 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/monomorph/driver.rs\u0060 and \u0060crates/perry-hir/src/monomorph/update_call_sites.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 578 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/perry-hir/src/monomorph/driver.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"0697a1173f8eb1a767aa8f527186f185a511729d9bb20d1c7d6c6c1ec6a313c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-hir/src/realm_reach.rs:411-420 | crates/perry-hir/src/realm_reach.rs:446-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/realm_reach.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"75170faf0eefc9881cd9e845721c26d1c6ac574bb543cfb673e888cbfde5de55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 16): crates/perry-hir/src/lower/expr_new.rs:159-167 | crates/perry-hir/src/lower/expr_new.rs:735-743 | crates/perry-hir/src/lower/expr_new.rs:980-988 | crates/perry-hir/src/lower/expr_new.rs:1007-1015 | crates/perry-hir/src/lower/expr_new.rs:1033-1041 | crates/perry-hir/src/lower/expr_new.rs:1142-1150 | crates/perry-hir/src/lower/expr_new.rs:1155-1163 | crates/perry-hir/src/lower/expr_new.rs:1176-1184 | crates/perry-hir/src/lower/expr_new.rs:1227-1235 | crates/perry-hir/src/lower/expr_new.rs:1253-1261 | crates/perry-hir/src/lower/expr_new.rs:1378-1386 | crates/perry-hir/src/lower/expr_new.rs:1440-1448 | crates/perry-hir/src/lower/expr_new.rs:1458-1466 | crates/perry-hir/src/lower/expr_new.rs:1493-1501 | crates/perry-hir/src/lower/expr_new.rs:1518-1526 | crates/perry-hir/src/lower/expr_new.rs:1554-1562 \u2014 all 16 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/perry-hir/src/lower/expr_new.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4511a91292b5060bb29c1418672acb515fe02f25d62db7879e9b894a661dcb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 14): crates/perry-codegen/src/expr/function_bind.rs:104-111 | crates/perry-codegen/src/lower_call/early_branches.rs:558-566 | crates/perry-codegen/src/lower_call/early_branches.rs:830-838 | crates/perry-codegen/src/lower_call/early_branches.rs:931-939 | crates/perry-codegen/src/lower_call/early_branches.rs:1035-1043 | crates/perry-codegen/src/lower_call/early_branches.rs:1142-1150 | crates/perry-codegen/src/lower_call/early_branches.rs:1197-1205 | crates/perry-codegen/src/lower_call/func_ref.rs:236-244 | crates/perry-codegen/src/lower_call/func_ref.rs:1160-1168 | crates/perry-codegen/src/lower_call/func_ref.rs:1235-1243 | crates/perry-codegen/src/lower_call/func_ref.rs:1313-1321 | crates/perry-codegen/src/lower_call/func_ref.rs:1404-1412 | crates/perry-codegen/src/lower_call/property_get/imported_object.rs:181-189 | crates/perry-codegen/src/lower_conditional.rs:510-518 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/early_branches.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/func_ref.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 122 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/perry-codegen/src/expr/function_bind.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8230b5d372b01d0bdb6347ae7e5dc00e23061e61be0094fbf42fa087cf2c04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 10): crates/perry-ext-net/src/payload_abi.rs:475-483 | crates/perry-ext-net/src/payload_abi.rs:497-505 | crates/perry-ext-net/src/payload_abi.rs:519-527 | crates/perry-ext-net/src/payload_abi.rs:541-549 | crates/perry-ext-net/src/payload_abi.rs:712-720 | crates/perry-ext-net/src/payload_abi.rs:734-742 | crates/perry-ext-net/src/payload_abi.rs:756-764 | crates/perry-ext-net/src/payload_abi.rs:778-786 | crates/perry-ext-net/src/payload_abi.rs:1060-1068 | crates/perry-ext-net/src/payload_abi.rs:1082-1090 \u2014 all 10 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/perry-ext-net/src/payload_abi.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38cecde5960fd598688b6d893a7fb08b707b15840873c418b011a926d2f9d59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 9): crates/perry-codegen/src/expr/helpers.rs:378-386 | crates/perry-codegen/src/expr/this_super_call.rs:821-829 | crates/perry-codegen/src/lower_array_method.rs:1277-1284 | crates/perry-codegen/src/lower_call/method_override.rs:701-708 | crates/perry-codegen/src/lower_call/method_override.rs:1814-1821 | crates/perry-codegen/src/lower_call/new_helpers.rs:266-273 | crates/perry-codegen/src/lower_call/property_get/static_dispatch.rs:470-477 | crates/perry-codegen/src/lower_call/scalar_method.rs:830-837 | crates/perry-codegen/src/lower_call/web_storage.rs:45-52 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/method_override.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/scalar_method.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 38 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/perry-codegen/src/expr/helpers.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb588382422be9abc02445ed6d557bccb6f0d3774a32fddadc9b7e16d647b5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 9): crates/perry-hir/src/lower/expr_function.rs:674-682 | crates/perry-hir/src/lower/expr_object.rs:273-281 | crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs:115-123 | crates/perry-hir/src/lower_decl/class_members.rs:118-126 | crates/perry-hir/src/lower_decl/class_members.rs:545-553 | crates/perry-hir/src/lower_decl/class_members.rs:953-961 | crates/perry-hir/src/lower_decl/fn_decl.rs:135-143 | crates/perry-hir/src/lower_decl/private_members.rs:132-140 | crates/perry-hir/src/lower_decl/private_members.rs:346-354 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_function.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_object.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 63 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/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"54cee39e20a8766317cfe9d402e96c12f57cd7703aefe2907011c668645c955b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 9): crates/perry-hir/src/lower/expr_new/member.rs:152-160 | crates/perry-hir/src/lower/expr_new/member.rs:191-199 | crates/perry-hir/src/lower/expr_new/member.rs:293-301 | crates/perry-hir/src/lower/expr_new/member.rs:319-327 | crates/perry-hir/src/lower/expr_new/member.rs:352-360 | crates/perry-hir/src/lower/expr_new/member.rs:371-379 | crates/perry-hir/src/lower/expr_new/member.rs:394-402 | crates/perry-hir/src/lower/expr_new/member.rs:420-428 | crates/perry-hir/src/lower/expr_new/member.rs:520-528 \u2014 all 9 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/perry-hir/src/lower/expr_new/member.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"20733f6bbd4a5d8d7e915a35176013b848db64d86cd0bb767eddf3d545867c2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7): crates/perry-codegen/src/codegen/string_pool/metadata_constants.rs:25-33 | crates/perry-codegen/src/expr/strings.rs:27-35 | crates/perry-codegen/src/expr/typed_feedback.rs:209-217 | crates/perry-codegen/src/expr/v8_interop.rs:78-86 | crates/perry-codegen/src/expr/v8_interop.rs:172-180 | crates/perry-codegen/src/module.rs:952-960 | crates/perry-codegen/src/strings.rs:335-343 \u2014 there are 7 copies across 6 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 7 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/string_pool/metadata_constants.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ef04bbd8fb429917b79a6a0ab6f51ac2d7846499e5f4ba7a5f191d195a2060"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7): crates/perry-codegen/src/expr/bigint_set.rs:86-94 | crates/perry-codegen/src/expr/bigint_set.rs:198-206 | crates/perry-codegen/src/expr/bigint_set.rs:265-273 | crates/perry-codegen/src/expr/logical_collections.rs:488-496 | crates/perry-codegen/src/expr/math_simple.rs:209-217 | crates/perry-codegen/src/expr/math_simple.rs:304-312 | crates/perry-codegen/src/expr/math_simple.rs:373-381 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/bigint_set.rs\u0060 and \u0060crates/perry-codegen/src/expr/logical_collections.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 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/perry-codegen/src/expr/bigint_set.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9eb294a0da3524679154a54fb405b4c84efaa1d00f46eaecfaeed44351695a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7): crates/perry-hir/src/lower/expr_call/native_module/object_statics.rs:120-128 | crates/perry-hir/src/lower/expr_call/native_module/object_statics.rs:199-207 | crates/perry-hir/src/lower/expr_call/native_module/object_statics.rs:231-239 | crates/perry-hir/src/lower/expr_call/native_module/object_statics.rs:338-346 | crates/perry-hir/src/lower/expr_call/native_module/object_statics.rs:354-362 | crates/perry-hir/src/lower/expr_call/native_module/object_statics.rs:368-376 | crates/perry-hir/src/lower/expr_call/native_module/object_statics.rs:382-390 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/native_module/object_statics.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cabe3d68e902f3c7c956c0e574e14ba2606e19f467b4963e565719d6f70e62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): crates/perry-codegen/src/collectors/escape_arrays.rs:161-169 | crates/perry-codegen/src/collectors/escape_arrays.rs:308-316 | crates/perry-codegen/src/collectors/hot_callees.rs:426-434 | crates/perry-codegen/src/collectors/hot_callees.rs:699-707 | crates/perry-codegen/src/collectors/not_bigint_locals.rs:384-392 | crates/perry-codegen/src/layout_families.rs:392-400 \u2014 there are 6 copies across 4 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 6 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/escape_arrays.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b913cf52eea02af674780b9d0228e9453a98051b5b6d27afd69557f7599eb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): crates/perry-ext-http/src/server/http2_server/pump.rs:70-78 | crates/perry-ext-http/src/server/http2_server/pump.rs:94-103 | crates/perry-ext-http/src/server/https_server.rs:464-473 | crates/perry-ext-http/src/server/https_server.rs:492-500 | crates/perry-ext-http/src/server/server.rs:1308-1317 | crates/perry-ext-http/src/server/server.rs:1354-1362 \u2014 before extracting anything, compare \u0060crates/perry-ext-http/src/server/http2_server/pump.rs\u0060 and \u0060crates/perry-ext-http/src/server/https_server.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 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/perry-ext-http/src/server/http2_server/pump.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf00ad82559fa5668aae62177bcb67e6f182045cba65e03a1e1afb02ac59dfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): crates/perry-hir/src/js_transform/local_natives.rs:945-953 | crates/perry-hir/src/js_transform/local_natives.rs:976-984 | crates/perry-hir/src/js_transform/local_natives.rs:1001-1009 | crates/perry-hir/src/js_transform/local_natives.rs:1047-1055 | crates/perry-hir/src/js_transform/local_natives.rs:1095-1103 | crates/perry-hir/src/js_transform/local_natives.rs:1120-1128 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d14a37c9435c6f8b0022ca5e238b4ab80266a2b0e128ca8f2330da5b3905d39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 5): crates/perry-codegen/src/codegen/closure.rs:1336-1344 | crates/perry-codegen/src/codegen/entry.rs:941-947 | crates/perry-codegen/src/codegen/entry/module_init.rs:421-427 | crates/perry-codegen/src/codegen/method.rs:727-735 | crates/perry-codegen/src/codegen/method_static.rs:402-410 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/entry.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 221 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5c6ffa25346e0bdc4ce5b91db019fad725b3fc450d4f7b43160772a8c05ae2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): crates/perry-codegen/src/codegen/entry.rs:892-900 | crates/perry-codegen/src/codegen/entry/module_init.rs:372-380 | crates/perry-codegen/src/codegen/function.rs:1391-1399 | crates/perry-codegen/src/codegen/method.rs:676-684 | crates/perry-codegen/src/codegen/method_static.rs:351-359 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/entry.rs\u0060 and \u0060crates/perry-codegen/src/codegen/entry/module_init.rs\u0060 as WHOLE FILES: this scan already matched 25 separate duplicated blocks between them, totalling at least 473 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/perry-codegen/src/codegen/entry.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ece6ec98feddef13d5ecd439586fde4c63acbdd81885efde4ef2a316712ee5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): crates/perry-codegen/src/expr/array_methods.rs:135-150 | crates/perry-codegen/src/expr/instance_misc1.rs:1002-1013 | crates/perry-codegen/src/expr/instance_misc1.rs:1321-1329 | crates/perry-codegen/src/expr/url_main.rs:501-525 | crates/perry-codegen/src/expr/url_main.rs:595-606 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/array_methods.rs\u0060 and \u0060crates/perry-codegen/src/expr/instance_misc1.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 67 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/perry-codegen/src/expr/array_methods.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15266e8bc5d8450afc585f9546be1e6a6f1e5d87eb961b33beb7828dadffc1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 5): crates/perry-codegen/src/expr/math_simple.rs:326-334 | crates/perry-codegen/src/lower_call/func_ref.rs:1153-1158 | crates/perry-codegen/src/lower_call/func_ref.rs:1228-1233 | crates/perry-codegen/src/lower_call/func_ref.rs:1306-1311 | crates/perry-codegen/src/lower_call/func_ref.rs:1397-1402 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/math_simple.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/func_ref.rs\u0060 as WHOLE FILES: this scan already matched 4 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/perry-codegen/src/expr/math_simple.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"057121e0d0fcff117a5a2481a9fdfd2694e0fb4e7acefe89df37918541702576"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): crates/perry-hir/src/lower/expr_object.rs:1346-1354 | crates/perry-hir/src/lower/expr_object.rs:1369-1377 | crates/perry-hir/src/lower/expr_object.rs:1397-1405 | crates/perry-hir/src/lower/expr_object.rs:1609-1617 | crates/perry-hir/src/lower/expr_object.rs:1632-1640 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a9e1da0139b14910ff64d08ef7df6b50f3e26f9e2230844676da617f4273b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/perry-codegen-glance/src/emit.rs:719-727 | crates/perry-codegen-glance/src/emit_glue.rs:166-174 | crates/perry-codegen-wear-tiles/src/emit.rs:479-487 | crates/perry-codegen-wear-tiles/src/emit_glue.rs:108-116 \u2014 before extracting anything, compare \u0060crates/perry-codegen-glance/src/emit.rs\u0060 and \u0060crates/perry-codegen-wear-tiles/src/emit.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 144 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/perry-codegen-glance/src/emit.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c5bbccd93d9d52eee44a9213e6487162122e7ce83b2af5ca8a04628b6053c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 4): crates/perry-codegen/src/builtin_proto.rs:243-250 | crates/perry-codegen/src/expr/instance_misc1.rs:303-310 | crates/perry-codegen/src/expr/instance_misc1.rs:773-780 | crates/perry-codegen/src/lower_call/scalar_method.rs:990-998 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/builtin_proto.rs\u0060 and \u0060crates/perry-codegen/src/expr/instance_misc1.rs\u0060 as WHOLE FILES: this scan already matched 4 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/perry-codegen/src/builtin_proto.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"287c7109e0982b457e697c889b9981814fd57cfcb81608fe02ca7a5fc28b2e3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/perry-codegen/src/codegen/method.rs:1359-1367 | crates/perry-codegen/src/codegen/method.rs:1437-1445 | crates/perry-codegen/src/expr/write_barrier.rs:1183-1191 | crates/perry-codegen/src/lower_call/new.rs:1818-1826 \u2014 there are 4 copies across 3 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/method.rs"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcd670b9375d204983d68b98d64328e5161b2c6d146abba83d05344e08276bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/perry-codegen/src/codegen/mod.rs:2074-2082 | crates/perry-codegen/src/codegen/mod.rs:2093-2101 | crates/perry-codegen/src/codegen/mod.rs:2112-2120 | crates/perry-codegen/src/codegen/mod.rs:2131-2139 \u2014 all 4 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/perry-codegen/src/codegen/mod.rs"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e3a5ec0fe78a3c695e5bf4d09b2565df31202e7770dd2c651c9e4f4bcdd9ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/perry-codegen/src/codegen/mod.rs:2276-2284 | crates/perry-codegen/src/codegen/mod.rs:2323-2331 | crates/perry-codegen/src/codegen/mod.rs:2344-2352 | crates/perry-codegen/src/codegen/mod.rs:2365-2373 \u2014 all 4 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/perry-codegen/src/codegen/mod.rs"},"region":{"startLine":2276}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f4ec242a48a8cdcd69512e51053a72aaf9897d2e9c4fbd20358c368f44c840"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/perry-codegen/src/expr/bigint_set.rs:220-228 | crates/perry-codegen/src/expr/bigint_set.rs:287-295 | crates/perry-codegen/src/expr/logical_collections.rs:510-518 | crates/perry-codegen/src/expr/math_simple.rs:395-403 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/bigint_set.rs\u0060 and \u0060crates/perry-codegen/src/expr/logical_collections.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 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/perry-codegen/src/expr/bigint_set.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f258c6eb7a7318caaaa7d1d81447dce202a11b5bbd3717e59359307e1a764b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/perry-codegen/src/lower_call/builtin.rs:779-787 | crates/perry-codegen/src/lower_call/builtin.rs:800-808 | crates/perry-codegen/src/lower_call/builtin.rs:821-829 | crates/perry-codegen/src/lower_call/builtin.rs:927-935 \u2014 all 4 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/perry-codegen/src/lower_call/builtin.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"57245acf0ad8ddc5852f49bed693b0a190b8ca7f626661a5834d8a9a3eb71322"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/perry-hir/src/monomorph/driver.rs:667-675 | crates/perry-hir/src/monomorph/update_call_sites.rs:504-512 | crates/perry-hir/src/walker/expr_mut.rs:181-189 | crates/perry-hir/src/walker/expr_ref.rs:182-190 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/monomorph/driver.rs\u0060 and \u0060crates/perry-hir/src/monomorph/update_call_sites.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 578 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/perry-hir/src/monomorph/driver.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"704d0fc501e07b5cafc4d10d393da01ce795cf864b26d763c6bbafee178c2d21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/perry-codegen/src/codegen/reach_report.rs:269-277 | crates/perry-codegen/src/codegen/source_need/flow.rs:417-425 | crates/perry-codegen/src/codegen/source_need/flow.rs:501-509 \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/perry-codegen/src/codegen/reach_report.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c98cd7b5bf6619c2e0fe440ab89315e860b34b571b964e19583bddfa383f1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/perry-codegen/src/collectors/i32_locals.rs:775-783 | crates/perry-codegen/src/collectors/integer_locals.rs:825-833 | crates/perry-codegen/src/collectors/integer_locals.rs:1153-1161 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/i32_locals.rs\u0060 and \u0060crates/perry-codegen/src/collectors/integer_locals.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 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/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee1515291040d8af9c1345829650df2fc014f7702160d1912f461a9deffbc4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): crates/perry-codegen/src/expr/array_pop.rs:78-86 | crates/perry-codegen/src/expr/class_field_push.rs:50-57 | crates/perry-codegen/src/stmt/loops.rs:3316-3323 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/array_pop.rs\u0060 and \u0060crates/perry-codegen/src/expr/class_field_push.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 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/perry-codegen/src/expr/array_pop.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1866399c3661c5b86759d79dadb3198ab5bf707c284c2fdc8b8b3de6ae224afa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/perry-codegen/src/expr/array_push.rs:214-223 | crates/perry-codegen/src/expr/array_push.rs:307-315 | crates/perry-codegen/src/expr/write_barrier.rs:523-531 \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/perry-codegen/src/expr/array_push.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d25feb07b4f674fa842dc46e6ccad366ce3a3e9df863a23d8ffab55cc61ba9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 3): crates/perry-codegen/src/expr/class_env.rs:163-171 | crates/perry-codegen/src/expr/inline_birth/fixed_alloc.rs:59-65 | crates/perry-codegen/src/lower_string_method.rs:435-442 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/class_env.rs\u0060 and \u0060crates/perry-codegen/src/expr/inline_birth/fixed_alloc.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 50 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/perry-codegen/src/expr/class_env.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c3b8a432c38cc80655dea6fe65ad9deae54be4ee8e2f39160e20387ef38eca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/perry-codegen/src/expr/env_clones.rs:250-258 | crates/perry-codegen/src/expr/env_clones.rs:367-375 | crates/perry-codegen/src/lower_call/property_get/number_string.rs:113-121 \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/perry-codegen/src/expr/env_clones.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eed554c6f2f32680c460ef8c5182ef1b150817f5197faa80eef789f7abd3caf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 3): crates/perry-codegen/src/expr/method_site.rs:132-138 | crates/perry-codegen/src/expr/method_site.rs:634-641 | crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:1891-1899 \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/perry-codegen/src/expr/method_site.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f27f78f5d428c796dba7f3bd615220da74ca4d6d316b05c6f8a03f3d8b26f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/perry-codegen/src/expr/property_get.rs:923-931 | crates/perry-codegen/src/expr/property_get.rs:1381-1389 | crates/perry-codegen/src/expr/property_get.rs:1544-1552 \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/perry-codegen/src/expr/property_get.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5ed7e617ba9fea096663da967405ddb0bea835dac9b7f75fc0ee70c8bf2d87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/perry-codegen/src/expr/u8_buffer_read.rs:158-166 | crates/perry-codegen/src/expr/u8_buffer_read.rs:214-222 | crates/perry-codegen/src/expr/u8_buffer_read.rs:370-378 \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/perry-codegen/src/expr/u8_buffer_read.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f91a360eddd72337926a323e648d2d3f34bc130c6dfa8e3fbf201983717eb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/perry-codegen/src/expr/url_main.rs:169-177 | crates/perry-hir/src/walker/expr_mut.rs:1166-1174 | crates/perry-hir/src/walker/expr_ref.rs:1153-1161 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/walker/expr_mut.rs\u0060 and \u0060crates/perry-hir/src/walker/expr_ref.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 2017 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/perry-codegen/src/expr/url_main.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b3c4a46f11c65524a4735fb89588549b95d611ae8b84f3db22d86aa9fa1fcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/perry-codegen/src/expr/write_barrier.rs:219-227 | crates/perry-codegen/src/expr/write_barrier.rs:365-373 | crates/perry-codegen/src/expr/write_barrier.rs:875-883 \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/perry-codegen/src/expr/write_barrier.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"777ecf861ca96c5b426fce2b1cb7156354ba0024bb81ad3a89cabefe001e7fcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/perry-codegen/src/layout_desc.rs:415-423 | crates/perry-codegen/src/layout_desc.rs:772-780 | crates/perry-codegen/src/layout_desc.rs:1360-1368 \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/perry-codegen/src/layout_desc.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"8448bce53f496acea513a90e88e56a6b442343eebaeeec5fcada318d94b28be1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/perry-codegen/src/lower_call/extern_func.rs:1207-1215 | crates/perry-codegen/src/lower_call/extern_func.rs:1223-1231 | crates/perry-codegen/src/lower_call/extern_func.rs:1315-1323 \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/perry-codegen/src/lower_call/extern_func.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3421a45b0ed31bbc6f9973af433d0cf22c7cfd5d38adb1120539b54fde61896"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): crates/perry-codegen/src/lower_call/new.rs:1523-1530 | crates/perry-codegen/src/lower_call/new.rs:1543-1551 | crates/perry-codegen/src/lower_call/new.rs:1566-1574 \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/perry-codegen/src/lower_call/new.rs"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3934e443feb5c09953e13a3ddde7cfa011355b9a9bf2e6357d4a7ff5ac0d21c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/perry-codegen/src/lower_call/new.rs:1520-1528 | crates/perry-codegen/src/lower_call/new.rs:1563-1571 | crates/perry-codegen/src/lower_call/new_helpers.rs:422-430 \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/perry-codegen/src/lower_call/new.rs"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"121e4cad1ac73fba26c92883f45ad85fd96489a10e975c9532e0bb61168ca151"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 3): crates/perry-codegen/src/lower_call/property_get/number_string.rs:32-38 | crates/perry-codegen/src/lower_call/property_get/number_string.rs:44-52 | crates/perry-codegen/src/lower_call/property_get/number_string.rs:60-68 \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/perry-codegen/src/lower_call/property_get/number_string.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfaae7093431c7d692f9a32dc63f84e177fd52d56a9124923e640b2402477e32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/perry-ext-net/src/payload_abi.rs:575-583 | crates/perry-ext-net/src/payload_abi.rs:590-598 | crates/perry-ext-net/src/payload_abi.rs:812-820 \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/perry-ext-net/src/payload_abi.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c57103710c79f4397220ac19317c7f1a95585deaf8e3abd7d23f8a4be2b01b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/perry-hir/src/lower/const_fold_fn.rs:644-652 | crates/perry-hir/src/lower/expr_call/intrinsics/eval_strict.rs:144-152 | crates/perry-hir/src/lower/fn_ctor_env.rs:154-162 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/const_fold_fn.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/intrinsics/eval_strict.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 43 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/perry-hir/src/lower/const_fold_fn.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"be715f643ebfb420935c8e1249695baa95491df6e2197d5c175196e4691124af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/perry-hir/src/lower/decorators.rs:420-428 | crates/perry-hir/src/lower/expr_object.rs:1105-1113 | crates/perry-hir/src/lower/expr_object.rs:1512-1520 \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/perry-hir/src/lower/decorators.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9e7b1b1242c480b518854f8ab6c3a1068ec8c9efefc872b6dc6f37947bbf91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/perry-hir/src/lower/eval_super_scan.rs:481-489 | crates/perry-hir/src/lower/eval_super_scan.rs:492-500 | crates/perry-hir/src/lower/eval_super_scan.rs:532-540 \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/perry-hir/src/lower/eval_super_scan.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"8887da2294d01e537e9320a22eb4be29a01766a0cc01139c2233e075975b5376"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/array_only_methods.rs:233-241 | crates/perry-hir/src/lower/expr_call/array_only_methods.rs:267-275 | crates/perry-hir/src/lower_types.rs:81-89 \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/perry-hir/src/lower/expr_call/array_only_methods.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d31402d6cae112b703fdeacf9ea9d6e6f70ab16b54bec92f97f5a263fe4eaa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/array_only_methods.rs:264-272 | crates/perry-hir/src/lower_types.rs:1222-1230 | crates/perry-hir/src/lower_types.rs:1285-1293 \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/perry-hir/src/lower/expr_call/array_only_methods.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef6f89e51e9fd2b587845000d62eb000f16d4fdebbcf8fdf279e31d12f8fa1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/array_only_methods.rs:945-953 | crates/perry-hir/src/lower/expr_call/imported_array_methods.rs:226-234 | crates/perry-hir/src/lower/expr_call/inline_array_methods.rs:155-163 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/array_only_methods.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/imported_array_methods.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 97 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/perry-hir/src/lower/expr_call/array_only_methods.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35fe633510e95f09b93d2110371fe490a21e01fb099960533a4152f64233cb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/array_only_methods.rs:1238-1246 | crates/perry-hir/src/lower/expr_call/imported_array_methods.rs:193-201 | crates/perry-hir/src/lower/expr_call/inline_array_methods.rs:122-130 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/array_only_methods.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/imported_array_methods.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 97 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/perry-hir/src/lower/expr_call/array_only_methods.rs"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b87db74e6daf066e1e6b338606733066f2cf3794f05d1b2877bfa72321294c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/array_only_methods.rs:1274-1282 | crates/perry-hir/src/lower/expr_call/imported_array_methods.rs:204-212 | crates/perry-hir/src/lower/expr_call/inline_array_methods.rs:133-141 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/array_only_methods.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/imported_array_methods.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 97 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/perry-hir/src/lower/expr_call/array_only_methods.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb3a0b0d1a1e1e5f1249ddd00707b9f32411884a0b9909e32e2afe9b74af362"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/array_only_methods.rs:1293-1301 | crates/perry-hir/src/lower/expr_call/imported_array_methods.rs:244-252 | crates/perry-hir/src/lower/expr_call/inline_array_methods.rs:173-181 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/array_only_methods.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/imported_array_methods.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 97 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/perry-hir/src/lower/expr_call/array_only_methods.rs"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d74dec6b37c6c4657442665a378994a66916154cd75b6e6944ebaacfd23e99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/array_only_methods.rs:1369-1377 | crates/perry-hir/src/lower/expr_call/imported_array_methods.rs:285-293 | crates/perry-hir/src/lower/expr_call/inline_array_methods.rs:214-222 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/array_only_methods.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/imported_array_methods.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 97 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/perry-hir/src/lower/expr_call/array_only_methods.rs"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52862aef4dd062869cd876f7d1a4c11ee95952e48aa4be9a893039cb53fadd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/perry-hir/src/lower/expr_new/helpers.rs:299-307 | crates/perry-hir/src/lower/expr_new/non_ident.rs:176-184 | crates/perry-hir/src/lower/expr_new/non_ident.rs:243-251 \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/perry-hir/src/lower/expr_new/helpers.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"056737f5d444560f6593ba816ff75eea632300a8ab046d3478de00c9244b2a47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen-glance/src/emit.rs:652-660 | crates/perry-codegen-wear-tiles/src/emit.rs:437-445 \u2014 before extracting anything, compare \u0060crates/perry-codegen-glance/src/emit.rs\u0060 and \u0060crates/perry-codegen-wear-tiles/src/emit.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 144 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/perry-codegen-glance/src/emit.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1fbbeb05a1e75aa79e2447609106e45a669bcddc55820e8f33e4b424f60a70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/perry-codegen/src/block.rs:1699-1707 | crates/perry-codegen/src/block.rs:1753-1759 \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/perry-codegen/src/block.rs"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba452e5208d067a3ab7f04f74d1548c1024108bf239af3d1de190933334241bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/codegen/class_artifacts.rs:345-353 | crates/perry-codegen/src/codegen/class_artifacts.rs:479-487 \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/perry-codegen/src/codegen/class_artifacts.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"306ea87af5f864b45702cf4060b03fd1fd77d42722f50dac1f01f15552373733"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/codegen/class_artifacts.rs:408-416 | crates/perry-codegen/src/codegen/class_artifacts.rs:522-530 \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/perry-codegen/src/codegen/class_artifacts.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74b7dd6ed187ae3baa7d2de1bef631a55c7ca9462569c24af3036e90e59bccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/codegen/closure.rs:1578-1586 | crates/perry-codegen/src/codegen/function.rs:1803-1811 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/function.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 320 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf06f6947d2339e76950ed7a001fee89399622218bc131f62045cc6cf845ab3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/perry-codegen/src/codegen/export_value_wrappers.rs:251-257 | crates/perry-codegen/src/codegen/export_value_wrappers.rs:356-364 \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/perry-codegen/src/codegen/export_value_wrappers.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"a439fcc131fd3feb8a4fc68bec0888df641d975b655d34fbe831298bd757fbce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/codegen/method.rs:1200-1208 | crates/perry-codegen/src/codegen/method.rs:1287-1295 \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/perry-codegen/src/codegen/method.rs"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2b0c0a3c982732f9f04cf1129ac119ec7caa1ce518969993072b122d311073"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/codegen/method.rs:1420-1428 | crates/perry-codegen/src/codegen/method.rs:1512-1520 \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/perry-codegen/src/codegen/method.rs"},"region":{"startLine":1420}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0034d110b9f4fe6a79a781a63aca1698bb08a261d0aaef235da1be47344897"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/codegen/mod.rs:1952-1960 | crates/perry-codegen/src/codegen/mod.rs:1965-1974 \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/perry-codegen/src/codegen/mod.rs"},"region":{"startLine":1952}}}],"partialFingerprints":{"codehealthFindingId/v1":"47088ed3193e3d888356a04b436ebae63e203b4d429c5c0c39ff96f6c6707c98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/codegen/spec_return_proof.rs:226-234 | crates/perry-codegen/src/lower_call/func_ref.rs:671-679 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/spec_return_proof.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/func_ref.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/perry-codegen/src/codegen/spec_return_proof.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"951ca7ee499e44f6cd71b2594b531648dee35c1acc8c6d8b32d40b9fe3bddb3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/collectors/escape_objects.rs:579-587 | crates/perry-codegen/src/collectors/escape_objects.rs:595-603 \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/perry-codegen/src/collectors/escape_objects.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"7161c741409d2b6de862e96799e0f67117aaac8889bd620c8fb09cee830938a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/collectors/hir_facts.rs:1770-1778 | crates/perry-codegen/src/collectors/hir_facts.rs:1796-1804 \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/perry-codegen/src/collectors/hir_facts.rs"},"region":{"startLine":1770}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d22591284ebedaf2e81df5731599d718776744fc4680ff52dacef5e22889be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/collectors/hot_callees.rs:158-166 | crates/perry-codegen/src/collectors/hot_callees.rs:247-255 \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/perry-codegen/src/collectors/hot_callees.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"3433f21dfbeaea7ed26bf68fd5ef759a3e8af865a96e83e167150051fd0d62ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/collectors/integer_locals.rs:764-772 | crates/perry-codegen/src/collectors/integer_locals.rs:1105-1113 \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/perry-codegen/src/collectors/integer_locals.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df8722a1b6e7229fcd7d4533bc602e033be3424f72a100f357a2233fe4d0345"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/collectors/mutation.rs:424-432 | crates/perry-codegen/src/stmt/region_loop/plan.rs:549-557 \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/perry-codegen/src/collectors/mutation.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3c2f6fc9900db827398ad7096927593c51e00ac688ed0ba5f48e93ebb8b8d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/collectors/receiver_regions.rs:1268-1276 | crates/perry-hir/src/lower_decl/class_captures.rs:1443-1451 \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/perry-codegen/src/collectors/receiver_regions.rs"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"79914d21f5cb89955e13b9fb2daf8123912fd32c2a92bf4326e9db5d72adc448"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/collectors/this_as_value.rs:36-44 | crates/perry-codegen/src/collectors/this_as_value.rs:72-80 \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/perry-codegen/src/collectors/this_as_value.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ded369ed42d532f9cceaac8c3982aeae4cb3054b0593d3ab9a83006832ad7fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/perry-codegen/src/concat_site_cache.rs:222-230 | crates/perry-codegen/src/expr/array_pop.rs:136-143 \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/perry-codegen/src/concat_site_cache.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9e3b9d0dcff7b0077315bb1d76ed424f36643664e31ac027b65179d2d49c75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/expr/array_push.rs:383-391 | crates/perry-codegen/src/lower_array_method.rs:78-86 \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/perry-codegen/src/expr/array_push.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d1fd3155780ad22ee1dd955dbd2b327a8d39ccca55c1e8ebb5ac1980a28028"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/expr/bigint_set.rs:108-116 | crates/perry-codegen/src/expr/math_simple.rs:231-239 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/bigint_set.rs\u0060 and \u0060crates/perry-codegen/src/expr/math_simple.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 205 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/perry-codegen/src/expr/bigint_set.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6793fd61a4bd46db7951e1d9c36541a4b6294b09dc1052acae74e447660e78b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/expr/calls.rs:254-262 | crates/perry-codegen/src/expr/calls.rs:778-786 \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/perry-codegen/src/expr/calls.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"385bbcb173f7a358940af4c98460591a6b33756ac3b9f86d37c67ff4d28f9d6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/expr/calls.rs:674-682 | crates/perry-codegen/src/expr/calls.rs:762-770 \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/perry-codegen/src/expr/calls.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"435fb6f1eea9b512f38bfc6f56abc0c5a25a11faa9ce75b8e9e52fcfb79f33d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/perry-codegen/src/expr/compare.rs:394-401 | crates/perry-codegen/src/expr/property_get/generic_dispatch.rs:952-960 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/compare.rs\u0060 and \u0060crates/perry-codegen/src/expr/property_get/generic_dispatch.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/perry-codegen/src/expr/compare.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f528bcb5c25f7409742a3df50200ea38bccd6e237188583b2b48c57708c3e36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/expr/compare.rs:485-493 | crates/perry-codegen/src/expr/compare.rs:534-542 \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/perry-codegen/src/expr/compare.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"27382483ff1525a31412b57a4e0382cd0ae7543f52c65d6aeedab15bc282cbae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/perry-codegen/src/expr/dyn_extern_i18n.rs:499-506 | crates/perry-codegen/src/expr/dyn_extern_i18n.rs:1353-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/dyn_extern_i18n.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67e15eeb79427ac9ee8a333a7ca47e64a65e5affcfb9a1f88ff95875b4d9745"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/expr/dyn_extern_i18n.rs:978-986 | crates/perry-codegen/src/expr/instance_misc1.rs:423-431 \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/perry-codegen/src/expr/dyn_extern_i18n.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8705aec279dd5b6d5c8ea058c38c996128d9a0e0845063028cbccf896c3c72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/expr/i32_fast_path.rs:1366-1374 | crates/perry-codegen/src/expr/i32_fast_path.rs:1604-1612 \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/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"0513de6cd4ac9af2849219fb61881f43398cc6a56106539b9c56089ff0bc8903"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/perry-codegen/src/expr/index.rs:656-664 | crates/perry-codegen/src/expr/index.rs:689-696 \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/perry-codegen/src/expr/index.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33cee52d8442d2274410b549f1d4e95a9d89dd282a684a9a748a8d473590a95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/perry-codegen/src/expr/index_get.rs:414-422 | crates/perry-codegen/src/expr/index_get.rs:620-627 \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/perry-codegen/src/expr/index_get.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"894e4307f6caaeccf08eeda133d1c990c0b56903adae99068beb493f65309061"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/expr/instance_misc1.rs:1655-1663 | crates/perry-codegen/src/expr/instance_misc1.rs:1669-1677 \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/perry-codegen/src/expr/instance_misc1.rs"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6f6bd22c7102f157c891abbc867fb141fc15f942dbcf6267c1cbd3a1d33f04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/expr/literals_vars.rs:907-915 | crates/perry-codegen/src/expr/literals_vars.rs:1006-1014 \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/perry-codegen/src/expr/literals_vars.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"c275ac639630f7c91f11147db630ea7b13f97e6724c0f6bca30c47206a65196f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/expr/logical_collections.rs:1261-1270 | crates/perry-codegen/src/expr/logical_collections.rs:1280-1288 \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/perry-codegen/src/expr/logical_collections.rs"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccabe70f7266267114fb0d3cbdd71b02921e5a9b090172412d91b3243b8a4078"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/expr/method_site.rs:328-336 | crates/perry-codegen/src/expr/method_site.rs:521-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/method_site.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec2d2fe55a0a0be9abac59ca4d5d7802b9b150eadfb80f9ecfee6e58d627b6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/expr/new_dynamic.rs:307-315 | crates/perry-codegen/src/expr/new_dynamic.rs:323-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/new_dynamic.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5b82d177a742de450f1caea2a98695b237984e9594d57290376c8abb6c075b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/expr/property_set.rs:639-647 | crates/perry-codegen/src/expr/property_set.rs:776-784 \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/perry-codegen/src/expr/property_set.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b3ffb34847e5bc3e2012499ee3f24c6db4add63a3148338b6e224be5a41287"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/lower_call/builtin.rs:1036-1044 | crates/perry-codegen/src/lower_call/builtin.rs:1089-1097 \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/perry-codegen/src/lower_call/builtin.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6b031ecb7f6a255e3dde807efbfa975fd3a52d69b1303179c4456a10eb5e7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20139 lines \u00D7 3): crates/perry-codegen/src/lower_call/direct_method_guard.rs:69-77 | crates/perry-codegen/src/lower_call/method_override.rs:288-291 | crates/perry-codegen/src/lower_call/method_override.rs:406-414 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/direct_method_guard.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/method_override.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 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/perry-codegen/src/lower_call/direct_method_guard.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8b8b266671b4b08e9e6442698c57753d420b559dba221d9db6072920f47fcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/lower_call/early_branches.rs:1019-1027 | crates/perry-codegen/src/lower_call/func_ref.rs:1303-1311 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/early_branches.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/func_ref.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 122 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/perry-codegen/src/lower_call/early_branches.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"2508e13b45807c4e152475a90b6a65ab154733219f7a38cbbbea5aaa2edbe6e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/perry-codegen/src/lower_call/extern_func.rs:1249-1257 | crates/perry-codegen/src/lower_call/extern_func.rs:1284-1291 \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/perry-codegen/src/lower_call/extern_func.rs"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"803d2dfc2bfaefee01959437e732bec5d117a502ee9dd45526424c33ebfff89d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/lower_call/new.rs:1516-1524 | crates/perry-codegen/src/lower_call/new.rs:1532-1540 \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/perry-codegen/src/lower_call/new.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"d241076c4ffc8eae430fa331b2cebb2ea10f90ebcd5af5e4157cafac74bb1eb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/lower_conditional.rs:372-380 | crates/perry-codegen/src/lower_conditional.rs:390-398 \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/perry-codegen/src/lower_conditional.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d69c51f60241397c46da928b91f074778d257ccb948b8ef512dbb0b9c6b2e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/root_reload.rs:1372-1380 | crates/perry-codegen/src/root_reload.rs:1470-1478 \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/perry-codegen/src/root_reload.rs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4007e22eb4f542d9c1855ad45b675940fa0805da777b1bcbd2b7f36f96fc50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/stmt/element_shape_loop.rs:868-876 | crates/perry-codegen/src/stmt/loops.rs:1765-1773 \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/perry-codegen/src/stmt/element_shape_loop.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f873996a57561179be4f4a48839736e06d525f6cc5bfa3b8bf056f632f8baba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/stmt/indexed_owner_loop.rs:1100-1108 | crates/perry-codegen/src/stmt/indexed_owner_loop.rs:1113-1121 \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/perry-codegen/src/stmt/indexed_owner_loop.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd425dc5c964d89379d4f4dfcb5c582327a4cf0b47851fe9dca1dc9fdf712b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:7643-7649 | crates/perry-codegen/src/stmt/loops.rs:7655-7663 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":7643}}}],"partialFingerprints":{"codehealthFindingId/v1":"a580c2950a3d64fa2470ff7f08709ac7d1c115c25dcc0595838ab76f97d9c66e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:9249-9257 | crates/perry-codegen/src/stmt/loops.rs:9707-9715 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":9249}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7cff186d9ec3f755a565adfa6c89acad46e8e0775777eb5f29fa2528d7688b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:9323-9331 | crates/perry-codegen/src/stmt/loops.rs:9782-9790 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":9323}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fed27f36227ef9417a4ae9d6607e7a0d3ffdd1d586fc6721d234d1f294b16e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/perry-container-compose/src/service.rs:4-10 | crates/perry-container-compose/src/service.rs:21-29 \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/perry-container-compose/src/service.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"69657eb7d2ea4dc3f56507f679b66681448142a985f993ddfd9b36e7bdf91b8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-ext-http/src/client_events.rs:338-346 | crates/perry-ext-http/src/client_events.rs:581-589 \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/perry-ext-http/src/client_events.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"b560b92654e2598177469c0c08ae61fd17abb0fe58044bc6d50567352647a7e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/perry-ext-http/src/client_request_surface.rs:39-47 | crates/perry-ext-http/src/server/request.rs:844-851 \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/perry-ext-http/src/client_request_surface.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e2b748ad283ae4fbefe28951fa72054c1963409bbffc4ea76f7dd6a5086e71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-ext-http/src/lib.rs:355-363 | crates/perry-ext-http/src/server/http2_server.rs:320-328 \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/perry-ext-http/src/lib.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ada91f09d9abcce921249ff8c37023dc7024e9308dba57b8450363f75d7365"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-ext-http/src/lib.rs:1061-1069 | crates/perry-ext-http/src/lib.rs:1135-1143 \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/perry-ext-http/src/lib.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe19e7f3f7dec3ce814a7e7128d81bdf0155d17e65e0a908e3e5b4685754a22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-ext-http/src/lib.rs:1083-1091 | crates/perry-ext-http/src/lib.rs:1153-1162 \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/perry-ext-http/src/lib.rs"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"c079e8ae473df7ed909db30c8025560a8d0be4a2f97ef8c2ca222399b2b4b8c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-ext-http/src/server/http2_server/pump.rs:94-103 | crates/perry-ext-http/src/server/request.rs:1020-1028 \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/perry-ext-http/src/server/http2_server/pump.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"024d2577ee3c741f1cd3cd8082edc256ff9fa80772cd09ba9575d2db7d362982"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-ext-http/src/server/response.rs:634-642 | crates/perry-ext-http/src/server/response.rs:715-723 \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/perry-ext-http/src/server/response.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eef324d82b29f66500071f35590f149f11eab05826cd7617eaa4ab58c323197"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-ext-http/src/server/response_header_values.rs:331-339 | crates/perry-ext-http/src/server/response_header_values.rs:363-371 \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/perry-ext-http/src/server/response_header_values.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0cb46bb0d9e01f1be4484c810f50c16f404502499bc02fbe5231885af13ec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-ext-http/src/server/turnloop_serve/wire.rs:189-197 | crates/perry-http-server/src/wire.rs:195-203 \u2014 before extracting anything, compare \u0060crates/perry-ext-http/src/server/turnloop_serve/wire.rs\u0060 and \u0060crates/perry-http-server/src/wire.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 115 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/perry-ext-http/src/server/turnloop_serve/wire.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9ed94ae5811c6e9f1dae340916521d6eacd2f2ce80e95740bc52b994136629"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-ext-net/src/jsvalue.rs:412-420 | crates/perry-ext-net/src/jsvalue.rs:443-451 \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/perry-ext-net/src/jsvalue.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4906fbb1459f2643aeeb735f32171d5fc013904db105ae9e164a29597cf0533"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/perry-ext-parcel-watcher/src/lib.rs:551-559 | crates/perry-ext-parcel-watcher/src/lib.rs:577-583 \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/perry-ext-parcel-watcher/src/lib.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc5378867592627ff4b8bec469996a105ad150454b8e8060243add30758ddb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-ext-ws/src/lib.rs:1780-1788 | crates/perry-ext-ws/src/lib.rs:1806-1814 \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/perry-ext-ws/src/lib.rs"},"region":{"startLine":1780}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd95c7f34c1cea09d6aa7140623a1608b845a2b485e39a38065464bfe72c7e76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-ext-zlib/src/stream/deflate_context.rs:15-23 | crates/perry-ext-zlib/src/stream/inflate_context.rs:77-85 \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/perry-ext-zlib/src/stream/deflate_context.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6513f79c29254aa8c9c8aca48901fc7c6f0cc9e5ce0d6901cfecdc39026be4ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-ext-zlib/src/stream/driver.rs:201-209 | crates/perry-ext-zlib/src/stream/driver.rs:253-261 \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/perry-ext-zlib/src/stream/driver.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a99bd00f2d83a97427e9264d79f160185627cfd7b88c7a49b98199a04ad5ab3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-hir/src/destructuring/assignment_stmt.rs:197-205 | crates/perry-hir/src/destructuring/pattern_binding.rs:376-384 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/destructuring/assignment_stmt.rs\u0060 and \u0060crates/perry-hir/src/destructuring/pattern_binding.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 53 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/perry-hir/src/destructuring/assignment_stmt.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcde71d83ef429e063bc9a21ab6d6e11f5bafc37de81a8cb6a3e7bbc9f66d0e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-hir/src/destructuring/pattern_binding.rs:7-15 | crates/perry-hir/src/destructuring/var_decl_sources.rs:7-15 \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/perry-hir/src/destructuring/pattern_binding.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98986fb2ac5194a4fa53209547a91308ac9c042e7427a9184ebc5b7f7b79415"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/perry-hir/src/destructuring/pattern_binding.rs:586-593 | crates/perry-hir/src/destructuring/pattern_binding.rs:839-847 \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/perry-hir/src/destructuring/pattern_binding.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d8ac6e4179bb745877386344cb19009a7670afc60d9b7f12c9d6985eac2401"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20139 lines \u00D7 7): crates/perry-hir/src/destructuring/var_decl/native_new.rs:68-70 | crates/perry-hir/src/destructuring/var_decl/native_new.rs:198-200 | crates/perry-hir/src/destructuring/var_decl/native_new.rs:233-240 | crates/perry-hir/src/lower/module_decl.rs:813-815 | crates/perry-hir/src/lower/module_decl.rs:985-988 | crates/perry-hir/src/lower/module_decl.rs:1116-1124 | crates/perry-hir/src/lower/stmt.rs:532-534 \u2014 there are 7 copies across 3 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 7 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/destructuring/var_decl/native_new.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"4826391ab032b4db86112c52b6bddae8614309dff0a425f2e1badf0344733200"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/perry-hir/src/destructuring/var_decl/native_new.rs:242-248 | crates/perry-hir/src/lower/module_decl.rs:1127-1135 \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/perry-hir/src/destructuring/var_decl/native_new.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1cc2ed23df634749db189526c489779c08c240ea2aa816006da09a3bb4b4d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/perry-hir/src/js_transform/cross_module_natives.rs:787-794 | crates/perry-hir/src/js_transform/cross_module_natives.rs:907-915 \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/perry-hir/src/js_transform/cross_module_natives.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55c07ef67134e4ae5deec407560ae4456563bd21eeab28a3e342695b4cdd5c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/perry-hir/src/js_transform/imports.rs:554-562 | crates/perry-hir/src/js_transform/imports.rs:631-637 \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/perry-hir/src/js_transform/imports.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbcd582596d2479593cb1968bd61b5c9ee2b6e140aa63e752dc919d6f71b8d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20139 lines \u00D7 3): crates/perry-hir/src/lower/const_fold_fn.rs:549-557 | crates/perry-hir/src/lower/expr_new/helpers.rs:109-112 | crates/perry-hir/src/lower/fn_ctor_env.rs:514-522 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/const_fold_fn.rs\u0060 and \u0060crates/perry-hir/src/lower/fn_ctor_env.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 41 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/perry-hir/src/lower/const_fold_fn.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1d82d9b375f7c94b891169ed2f75d0c8884beed9020b041ebd1438381c289f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-hir/src/lower/const_fold_fn.rs:658-666 | crates/perry-hir/src/lower/expr_call/intrinsics/eval_strict.rs:150-158 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/const_fold_fn.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/intrinsics/eval_strict.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 43 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/perry-hir/src/lower/const_fold_fn.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7d83bb8c1a984cb4e07f051b15208af8e085db3e6aa2b72ac2d39b11a00f72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-hir/src/lower/eval_super_scan.rs:595-603 | crates/perry-hir/src/lower/eval_super_scan.rs:605-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/eval_super_scan.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99d99ab94f4097a972a871165eb110ae016fc53dd213ba5e66f762e50713744"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/array_only_methods.rs:1122-1131 | crates/perry-hir/src/lower/expr_call/array_only_methods.rs:1173-1181 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/array_only_methods.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0812670cbebe03a39d955fef92d64a670fa64b5d3c5f655dcb377e721646f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/globals.rs:846-854 | crates/perry-hir/src/lower/expr_call/module_static.rs:215-223 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/globals.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/module_static.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 296 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/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea7147ff27f6251428b280ddf3bd4bc7383913332bebc8c250f7a8ac078af02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs:220-228 | crates/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs:358-366 \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/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f51e64ce887621860eeddf64ce250514144847ed1c88088b86653b1512ea373"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/intrinsics/native_arena.rs:205-213 | crates/perry-hir/src/lower/widget_decl/reactive_animate.rs:107-115 \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/perry-hir/src/lower/expr_call/intrinsics/native_arena.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f105a2c278245a92d27849fe61fa87c2c043f11d76ff679342aff5f5151c289"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/module_static.rs:159-167 | crates/perry-hir/src/lower/expr_call/module_static.rs:607-615 \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/perry-hir/src/lower/expr_call/module_static.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd126c0ba173aff9f33c329dda7eed116a5820412e6448bff601df451bfda4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/module_static.rs:1248-1256 | crates/perry-hir/src/lower/expr_call/native_module/buffer_statics.rs:108-116 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/module_static.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/native_module/buffer_statics.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 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/perry-hir/src/lower/expr_call/module_static.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca98c6393dae11ba5c6d97a96db508e6979d0f0880bcc25b6a9c61e1d9a1cbdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/native_module.rs:562-570 | crates/perry-hir/src/lower/expr_call/native_module/buffer_statics.rs:176-182 \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/perry-hir/src/lower/expr_call/native_module.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b6146068ded2b641c8c02f603bb23aff9b2ed58c0fd20a58c47fd611dae345"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-hir/src/lower/expr_new/non_ident.rs:48-56 | crates/perry-hir/src/lower/expr_new/non_ident.rs:77-85 \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/perry-hir/src/lower/expr_new/non_ident.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fda0a06a695a4ffe3f9112f61506ce0fd4e6d3647bb004eca1e355376e14bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-hir/src/lower/expr_object.rs:605-613 | crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs:225-233 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_object.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 95 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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea57e48f8cc4cd56b8426dca642992d7223ecb6f552ed530b802044990d12cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20139 lines \u00D7 4): crates/perry-hir/src/dynamic_code.rs:80-84 | crates/perry-hir/src/lower/lower_module_fn.rs:789-797 | crates/perry-hir/src/lower/lower_module_fn.rs:811-819 | crates/perry-hir/src/lower/stmt.rs:137-140 \u2014 there are 4 copies across 3 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/dynamic_code.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c05098cebc33a8b33a62afff68f2f9cf61c1fab40d1b68c71752ef6c84be66e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-hir/src/lower/module_decl.rs:1238-1246 | crates/perry-hir/src/lower/module_decl.rs:1317-1325 \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/perry-hir/src/lower/module_decl.rs"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbb55586b0d828cb00356fb9c64726ba65bf390060bff477d11473468d68cb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-hir/src/lower/native_factory.rs:120-128 | crates/perry-hir/src/lower_types.rs:152-160 \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/perry-hir/src/lower/native_factory.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"a079a6063eefd0ae4988d123c894568a0a8636f1bcba9ed4e24f5fafc725856c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:796-806 | crates/perry-hir/src/lower_decl/body_stmt.rs:1525-1533 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f231d9987e5047799eab679a80dabaae99ac9bcd755df03ac57d89b6fd654e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-hir/src/lower/widget_decl.rs:836-844 | crates/perry-hir/src/lower/widget_decl.rs:1169-1177 \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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47d940f11d80a2157e2154d8f8e5764e11ef48e18de6a596ce97635c5c7f505"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-hir/src/lower/widget_decl.rs:1065-1073 | crates/perry-hir/src/lower/widget_decl.rs:1169-1177 \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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"aadec25280db52f82681c3e9d5bdfae22c5d1518a0d83bf4c838affd045f9af6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/perry-hir/src/lower_decl/block.rs:178-186 | crates/perry-hir/src/lower_decl/block/switch_case_tdz.rs:69-75 \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/perry-hir/src/lower_decl/block.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b22f2e844662de0ca63e3ff6d02fd32f1de9c7c3a99b33b7c4fa4cddcb9c36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/perry-hir/src/native_profile.rs:75-83 | crates/perry-hir/src/native_profile.rs:173-180 \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/perry-hir/src/native_profile.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"19141d83db6dc942eae08decf094fd2b43b6c757b2a859d7e50a5193d69420ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-parser/src/lib.rs:299-307 | crates/perry-parser/src/lib.rs:672-680 \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/perry-parser/src/lib.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e748e47afe77f0a23cd765656744846cbfe59927bc6213d5f208a59bc67c1ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 12): crates/perry-codegen/src/expr/calls/fs.rs:21-28 | crates/perry-codegen/src/expr/calls/fs.rs:39-46 | crates/perry-codegen/src/expr/calls/fs.rs:57-64 | crates/perry-codegen/src/expr/calls/fs.rs:74-81 | crates/perry-codegen/src/expr/calls/fs.rs:145-152 | crates/perry-codegen/src/expr/calls/fs.rs:182-189 | crates/perry-codegen/src/expr/calls/fs.rs:299-306 | crates/perry-codegen/src/expr/calls/fs.rs:316-323 | crates/perry-codegen/src/expr/calls/fs.rs:333-340 | crates/perry-codegen/src/expr/calls/fs.rs:350-357 | crates/perry-codegen/src/expr/calls/fs.rs:413-420 | crates/perry-codegen/src/expr/calls/fs.rs:430-437 \u2014 all 12 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/perry-codegen/src/expr/calls/fs.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7c49643d5f588acacfe37a1f7f5e70516f889fb4777265a0b1d67ec471673e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 11): crates/perry-codegen/src/lower_call/builtin.rs:85-92 | crates/perry-codegen/src/lower_call/builtin.rs:449-456 | crates/perry-codegen/src/lower_call/builtin.rs:731-738 | crates/perry-codegen/src/lower_call/builtin.rs:777-784 | crates/perry-codegen/src/lower_call/builtin.rs:798-805 | crates/perry-codegen/src/lower_call/builtin.rs:819-826 | crates/perry-codegen/src/lower_call/builtin.rs:872-879 | crates/perry-codegen/src/lower_call/builtin.rs:921-928 | crates/perry-codegen/src/lower_call/builtin.rs:1109-1116 | crates/perry-codegen/src/lower_string_method.rs:580-587 | crates/perry-codegen/src/lower_string_method.rs:768-775 \u2014 there are 11 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 11 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/builtin.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"756cff76bd7558fe89bfd59abebe769deacfed8f54c66fcb2cd8689fb9dc35d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 7): crates/perry-codegen/src/expr/bigint_set.rs:108-116 | crates/perry-codegen/src/expr/bigint_set.rs:220-228 | crates/perry-codegen/src/expr/bigint_set.rs:287-294 | crates/perry-codegen/src/expr/logical_collections.rs:510-517 | crates/perry-codegen/src/expr/math_simple.rs:231-238 | crates/perry-codegen/src/expr/math_simple.rs:326-333 | crates/perry-codegen/src/expr/math_simple.rs:395-403 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/bigint_set.rs\u0060 and \u0060crates/perry-codegen/src/expr/logical_collections.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 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/perry-codegen/src/expr/bigint_set.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"582bec889433a7082ebcc580017f9a030bc98a43a5cd9892dc0dca2333b61b1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): crates/perry-codegen/src/codegen/closure.rs:1145-1152 | crates/perry-codegen/src/codegen/entry.rs:790-797 | crates/perry-codegen/src/codegen/entry/module_init.rs:273-280 | crates/perry-codegen/src/codegen/function.rs:1291-1298 | crates/perry-codegen/src/codegen/method.rs:575-582 | crates/perry-codegen/src/codegen/method_static.rs:247-254 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/entry.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 221 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07ba299ebfa7c164ef58c1da8b699e249ab3612b94457dce53a4353f5c49cb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): crates/perry-codegen/src/expr/env_clones.rs:285-292 | crates/perry-codegen/src/expr/misc_methods.rs:661-668 | crates/perry-codegen/src/expr/misc_methods.rs:697-704 | crates/perry-codegen/src/expr/misc_methods.rs:1121-1128 | crates/perry-codegen/src/expr/static_field_meta.rs:564-571 | crates/perry-codegen/src/expr/static_field_meta.rs:828-835 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/env_clones.rs\u0060 and \u0060crates/perry-codegen/src/expr/misc_methods.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 55 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/perry-codegen/src/expr/env_clones.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"673b6012bd6a6d45ec1631e7e20136f716a1feb30a0221c0d4ee85bf0b49c99b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): crates/perry-codegen/src/codegen/function.rs:197-204 | crates/perry-codegen/src/codegen/method_typed.rs:33-40 | crates/perry-codegen/src/codegen/method_typed.rs:120-127 | crates/perry-codegen/src/codegen/method_typed.rs:166-173 | crates/perry-codegen/src/codegen/method_typed.rs:212-219 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/function.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method_typed.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 110 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/perry-codegen/src/codegen/function.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af7fc0b991fb381fd50b112ef035c1882e4720fb68a35b72ff5e1f448b2807a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): crates/perry-codegen/src/lower_call/options/fetch.rs:815-822 | crates/perry-codegen/src/lower_call/options/fetch.rs:1053-1060 | crates/perry-codegen/src/lower_call/options/fetch.rs:1093-1100 | crates/perry-codegen/src/lower_call/options/fetch.rs:1127-1134 | crates/perry-codegen/src/lower_call/options/fetch.rs:1146-1153 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/options/fetch.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ebda6080f3d7a875285bc86badfab9cc56fbd50a6f1ae23eb0759e37e1eb2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/perry-codegen/src/codegen/closure.rs:911-918 | crates/perry-codegen/src/codegen/function.rs:1004-1011 | crates/perry-codegen/src/codegen/method.rs:468-475 | crates/perry-codegen/src/codegen/method_static.rs:189-196 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/function.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 320 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8799f7aa8c4645ffad5bdfaf8760fe454faf31f305e48f4ae641d857003f4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/perry-codegen/src/collectors/proven_args.rs:301-308 | crates/perry-codegen/src/collectors/scalar_method_dispatch.rs:972-979 | crates/perry-codegen/src/collectors/scalar_methods.rs:486-493 | crates/perry-codegen/src/expr/slot_rep.rs:954-961 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/proven_args.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcd799b82d0d984837e8ece5feba9adad22c075aa494496a11466c60aeba55e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/perry-codegen/src/expr/calls/fs.rs:238-245 | crates/perry-codegen/src/expr/calls/fs.rs:257-264 | crates/perry-codegen/src/expr/calls/fs.rs:276-283 | crates/perry-codegen/src/expr/calls/fs.rs:395-402 \u2014 all 4 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/perry-codegen/src/expr/calls/fs.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdead4924f938e25c561b1e7526f85bf05e731a1afc215769e63f1f78864f78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 4): crates/perry-codegen/src/expr/this_super_call.rs:636-641 | crates/perry-codegen/src/lower_call/new.rs:1522-1529 | crates/perry-codegen/src/lower_call/new.rs:1542-1549 | crates/perry-codegen/src/lower_call/new.rs:1565-1572 \u2014 there are 4 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/this_super_call.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"62648e4c4e065f4c7cbc72d382a4457a4a2c8bad4db76daffed781a0136a1e44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/perry-ext-http/src/client_events.rs:111-118 | crates/perry-ext-http/src/client_events.rs:373-380 | crates/perry-ext-http/src/client_events.rs:701-708 | crates/perry-ext-http/src/client_events.rs:867-874 \u2014 all 4 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/perry-ext-http/src/client_events.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97c983fd5b3705c83c79f93eff016c58b1df25a528c75fc56f4161b6c48bf99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/perry-hir/src/lower/closure_analysis.rs:270-277 | crates/perry-hir/src/lower/closure_analysis.rs:583-590 | crates/perry-hir/src/lower/closure_analysis.rs:869-876 | crates/perry-hir/src/lower/closure_analysis.rs:1319-1326 \u2014 all 4 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/perry-hir/src/lower/closure_analysis.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09425e80d46e732e267b70897702a7a3f16e26352963371f056810f08fd8318"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/perry-hir/src/lower/const_fold_fn.rs:643-650 | crates/perry-hir/src/lower/const_fold_fn.rs:852-859 | crates/perry-hir/src/lower/expr_call/intrinsics/eval_strict.rs:143-150 | crates/perry-hir/src/lower/fn_ctor_env.rs:153-160 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/const_fold_fn.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/intrinsics/eval_strict.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 43 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/perry-hir/src/lower/const_fold_fn.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30720f571c57e00381c87434f89cfb4d7bf96cc63694462b737482cffa7e1da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): crates/perry-codegen/src/codegen/artifacts.rs:486-493 | crates/perry-codegen/src/codegen/artifacts.rs:510-516 | crates/perry-codegen/src/codegen/artifacts.rs:534-540 \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/perry-codegen/src/codegen/artifacts.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ecb1978a2c01b0c12b8fc0e2a6301fdd88e47922c022332f8cef4a81ca0bec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/perry-codegen/src/codegen/closure.rs:56-63 | crates/perry-codegen/src/codegen/function.rs:238-245 | crates/perry-codegen/src/codegen/method_trampolines.rs:37-44 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/function.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 320 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0f38e19ef605c6c1544bd66878c238ae00df38c0788628a1fa8a81a75df4bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/perry-codegen/src/codegen/closure_collect.rs:247-254 | crates/perry-codegen/src/codegen/closure_collect.rs:355-362 | crates/perry-codegen/src/codegen/closure_collect.rs:515-522 \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/perry-codegen/src/codegen/closure_collect.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9285b9f0e1c7dc62768db3234e043369488c556376b02948a0ed9c34fd02d78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/perry-codegen/src/collectors/class_accessors.rs:16-23 | crates/perry-codegen/src/collectors/class_accessors.rs:50-57 | crates/perry-codegen/src/collectors/class_accessors.rs:82-89 \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/perry-codegen/src/collectors/class_accessors.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4da58799dc53bb3e6740b120a97213c0b69bfb8b1b159070b14cc53a5de416b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/perry-codegen/src/collectors/int_valued_ta_locals.rs:280-287 | crates/perry-codegen/src/collectors/int_valued_ta_locals.rs:357-364 | crates/perry-codegen/src/collectors/int_valued_ta_locals.rs:414-421 \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/perry-codegen/src/collectors/int_valued_ta_locals.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e80b22cb664aa09b47a03717d494f1eacac83cddd51375ca1c69c5b24005b7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/perry-codegen/src/collectors/scalar_method_dispatch.rs:196-203 | crates/perry-codegen/src/collectors/scalar_methods.rs:309-316 | crates/perry-codegen/src/collectors/scalar_methods.rs:343-350 \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/perry-codegen/src/collectors/scalar_method_dispatch.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60813f981af6f1e34dcf02191cd15535cf1ed2717dae9908bc1317fe0ddf618"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/perry-codegen/src/expr/calls/crypto_keys.rs:17-24 | crates/perry-codegen/src/expr/calls/crypto_keys.rs:105-112 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:296-303 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/calls/crypto_keys.rs\u0060 and \u0060crates/perry-codegen/src/expr/calls/crypto_misc.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 54 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/perry-codegen/src/expr/calls/crypto_keys.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e9be290f7d734eb69e5699d6d48208b6b9476c3297c1b74e8ed72f08e4f26b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/perry-codegen/src/expr/calls/crypto_misc.rs:464-471 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:511-518 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:600-607 \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/perry-codegen/src/expr/calls/crypto_misc.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e28dfba261866245b453bcee1b343766d11de02d5560c417a5f67c2c01caf16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): crates/perry-codegen/src/expr/index_get/guarded_array.rs:666-673 | crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch_select.rs:111-117 | crates/perry-codegen/src/lower_string_method.rs:331-337 \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/perry-codegen/src/expr/index_get/guarded_array.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"2809daef0ca8127451cef1f72bf8adc358f514e97e37d59088b5333b54d8e0b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/perry-codegen/src/expr/literals_vars.rs:1056-1063 | crates/perry-codegen/src/expr/literals_vars.rs:1077-1084 | crates/perry-codegen/src/expr/literals_vars.rs:1166-1173 \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/perry-codegen/src/expr/literals_vars.rs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"0800baf7644c764135f5d782c67fe57fbe96d8bc20c9692889151304f345fee2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/perry-codegen/src/expr/static_field_meta.rs:336-343 | crates/perry-codegen/src/expr/write_barrier.rs:1178-1185 | crates/perry-codegen/src/lower_call/new_helpers.rs:263-270 \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/perry-codegen/src/expr/static_field_meta.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd9e811cf4474ccbafc2e896f42af8a983b0e51dba5d9d070725ccfaf9b6d88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/perry-codegen/src/linker.rs:1516-1523 | crates/perry-hir/src/lower/const_fold_fn.rs:116-123 | crates/perry-hir/src/lower/fn_ctor_env.rs:247-254 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/const_fold_fn.rs\u0060 and \u0060crates/perry-hir/src/lower/fn_ctor_env.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 41 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/perry-codegen/src/linker.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"487cac8977dbd6f7ac45df2bf7baebed96656acf25cb9084167728b931302252"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:599-606 | crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:652-659 | crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:841-848 \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/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b73112e35421313c049d49f02b43ac9d353548e1bba5279a27a2ed55688415"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/perry-ext-http/src/client_turnloop/native_client.rs:577-584 | crates/perry-ext-http/src/server/turnloop_serve/conn.rs:273-280 | crates/perry-ext-ws/src/native_socket.rs:221-228 \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/perry-ext-http/src/client_turnloop/native_client.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"030678da43c9fc408a75f4c9a5742c883326282e5726aa672b9fb0b1880ee724"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/perry-ext-ws/src/lib.rs:1583-1590 | crates/perry-ext-ws/src/lib.rs:1637-1644 | crates/perry-ext-ws/src/lib.rs:1729-1736 \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/perry-ext-ws/src/lib.rs"},"region":{"startLine":1583}}}],"partialFingerprints":{"codehealthFindingId/v1":"421560898b0192f29befc034159231aa4e84700de9efb4c064e2def4bfc3aaa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/perry-ext-ws/src/lib.rs:1780-1787 | crates/perry-ext-ws/src/lib.rs:1792-1799 | crates/perry-ext-ws/src/lib.rs:1806-1813 \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/perry-ext-ws/src/lib.rs"},"region":{"startLine":1780}}}],"partialFingerprints":{"codehealthFindingId/v1":"d619a69a1854ed2cbb1cb9b1f71091bbd96df6e7b4a3063dfdeaab51849cd6f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): crates/perry-hir/src/js_transform/imports.rs:556-563 | crates/perry-hir/src/js_transform/imports.rs:595-602 | crates/perry-hir/src/js_transform/imports.rs:632-638 \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/perry-hir/src/js_transform/imports.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe0e10afb3764f81549dcf451a155df7f97c1efcff884da8be757a7baddbc84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/perry-hir/src/js_transform/imports.rs:569-576 | crates/perry-hir/src/js_transform/imports.rs:608-615 | crates/perry-hir/src/js_transform/imports.rs:649-657 \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/perry-hir/src/js_transform/imports.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a0c3c5d44be17b311b6f4cb5ee1887882b15f7497cfcf3dd560b8dc91f283b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/perry-hir/src/lower_decl/class_decl.rs:685-692 | crates/perry-hir/src/lower_decl/class_members.rs:1096-1103 | crates/perry-hir/src/lower_decl/private_members.rs:408-415 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/class_members.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/private_members.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 210 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/perry-hir/src/lower_decl/class_decl.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e2b38fefc782c7fbc3be5e5bc0c890bf2d1a7e3498a9d8f847626b876d59b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): crates/perry-hir/src/lower_decl/class_members.rs:104-111 | crates/perry-hir/src/lower_decl/class_members.rs:529-535 | crates/perry-hir/src/lower_decl/private_members.rs:118-124 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/class_members.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/private_members.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 210 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/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef62f672d95f676446eb216e208b38cab25f91cd5791d8ecf234006529be472"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/perry-hir/src/lower_decl/class_members.rs:530-537 | crates/perry-hir/src/lower_decl/private_members.rs:119-126 | crates/perry-hir/src/lower_decl/private_members.rs:334-341 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/class_members.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/private_members.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 210 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/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc00f713dfc77c6262476eeaeb8de979d82d8c3e69f2b58891dc6155ae62262d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-audio-miniaudio/src/lib.rs:1000-1007 | crates/perry-audio-miniaudio/src/lib.rs:1022-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-audio-miniaudio/src/lib.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"592ee24bac2f77767aadbae4091dad237ff16023d6b1ba632755a48ae78f7d49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen-arkts/src/widgets/structure.rs:148-155 | crates/perry-codegen-arkts/src/widgets/structure.rs:314-321 \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/perry-codegen-arkts/src/widgets/structure.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f35e108f8e4ee86db6ed697db277a969478c658cedfd7d60e58c4479e4d90be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen-glance/src/emit.rs:86-93 | crates/perry-codegen-wear-tiles/src/emit.rs:103-110 \u2014 before extracting anything, compare \u0060crates/perry-codegen-glance/src/emit.rs\u0060 and \u0060crates/perry-codegen-wear-tiles/src/emit.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 144 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/perry-codegen-glance/src/emit.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"2695e78a7bd624457086317a08e1420a815126a8f382c22f90e7a1c749510a95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen-glance/src/emit_glue.rs:110-117 | crates/perry-codegen-wear-tiles/src/emit_glue.rs:61-68 \u2014 before extracting anything, compare \u0060crates/perry-codegen-glance/src/emit_glue.rs\u0060 and \u0060crates/perry-codegen-wear-tiles/src/emit_glue.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 111 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/perry-codegen-glance/src/emit_glue.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"4431455cdbc3f58b4f3ab82655bd2e79854868f5dbcd6b5eda48740569de0352"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen-wasm/src/emit/locals.rs:67-74 | crates/perry-codegen-wasm/src/emit/locals.rs:229-236 \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/perry-codegen-wasm/src/emit/locals.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac61096efbbf399c9973ada75b44976674fa938178a1615d6a274f757e1d5e5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/closure_births.rs:196-203 | crates/perry-codegen/src/expr/literal_descriptor.rs:330-337 \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/perry-codegen/src/closure_births.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dead8b2f2d46734f8218c4b03fc396c2a44fcd8333fe3bcad73f52f4da89c28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/codegen/artifact_display_names.rs:77-84 | crates/perry-codegen/src/codegen/artifact_display_names.rs:86-93 \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/perry-codegen/src/codegen/artifact_display_names.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c22cee072d3533db71647ac0247ed057613de24b040734e964377edb290e8e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/codegen/closure.rs:315-322 | crates/perry-codegen/src/codegen/closure.rs:361-368 \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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"8317f80cb8bf185fd68e2d6ec234590c6e34054e0f48ee434ecfc57eb55c5081"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/codegen/global_transfer.rs:171-178 | crates/perry-codegen/src/codegen/global_transfer.rs:225-232 \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/perry-codegen/src/codegen/global_transfer.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4047269532f5ebf3f0dceb7aa227c70b67b4b77ecf3251a7e98978a6ea809f9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/codegen/method.rs:1092-1099 | crates/perry-codegen/src/codegen/method.rs:1281-1288 \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/perry-codegen/src/codegen/method.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4fa92aaeb3cc0f2c08695634679b953ea48c2d0b110a5ac587d60cbbd86aa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/codegen/method.rs:1677-1684 | crates/perry-codegen/src/codegen/method_static.rs:576-583 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/method.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method_static.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 341 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/perry-codegen/src/codegen/method.rs"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"a724e88d91d38fa57ab3959ad900346de42ffe50ec815b6329cd457f5ffb827f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/codegen/method_trampolines.rs:160-167 | crates/perry-codegen/src/codegen/method_trampolines.rs:431-438 \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/perry-codegen/src/codegen/method_trampolines.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"9927100aabe35fa59b86a8d1ba52551807de6bb5a6f10a95bae1b3a3976e41d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/codegen/method_trampolines.rs:360-370 | crates/perry-codegen/src/codegen/method_trampolines.rs:438-445 \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/perry-codegen/src/codegen/method_trampolines.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"76dda7d758810d82c7759244a18f472727acc57d0fe227d607f2e9ca39847d9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/codegen/param_guard.rs:1334-1341 | crates/perry-codegen/src/module.rs:904-911 \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/perry-codegen/src/codegen/param_guard.rs"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8abddace5a9ce87fc937960740aebd47879d357ae3a4bd73bed0a616aab075"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/codegen/realm_image.rs:174-181 | crates/perry-codegen/src/codegen/realm_image.rs:301-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/realm_image.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2839dacaf68c67973ee5a2c97742f406cc618c7f06354745420281728e0d1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/codegen/static_prototype.rs:206-213 | crates/perry-codegen/src/codegen/static_prototype.rs:375-382 \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/perry-codegen/src/codegen/static_prototype.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c27222ff17a44803159e86e57b58e6c851b6e6e6a3939653274a940bd19b6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/collectors/definite_init.rs:452-459 | crates/perry-codegen/src/collectors/definite_init.rs:466-473 \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/perry-codegen/src/collectors/definite_init.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb72ab0141d041adde71f473a1fbf73e937082c9aaa0b76925c9fa0fff4a6e48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/collectors/hoisted_callback_calls.rs:340-347 | crates/perry-codegen/src/collectors/spec_abi_sites.rs:1390-1397 \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/perry-codegen/src/collectors/hoisted_callback_calls.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b668982e49225697e3079aa1df6b63312e7ceca57bfdb65f5167bdff46f4867"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/collectors/int_valued_ta_locals.rs:1577-1584 | crates/perry-codegen/src/collectors/int_valued_ta_locals.rs:1586-1593 \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/perry-codegen/src/collectors/int_valued_ta_locals.rs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6af61bd477b92ac32dd456eb0077e08bd968588f02487a2c811849655e50f8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/collectors/pointer_locals.rs:235-242 | crates/perry-hir/src/analysis/value_types.rs:999-1006 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/pointer_locals.rs\u0060 and \u0060crates/perry-hir/src/analysis/value_types.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 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/perry-codegen/src/collectors/pointer_locals.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2444f1ba96a0ba3bf9f8bb8be90f38c4e6ad194f342a123b53952a87aace9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/collectors/ptr_shape_returns.rs:153-160 | crates/perry-codegen/src/collectors/ptr_shape_returns.rs:274-281 \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/perry-codegen/src/collectors/ptr_shape_returns.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc63397f25d6ab6a58221c2bd88e9476dc6237b0f65857d4d8ff0140a822e17d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/collectors/segview.rs:731-738 | crates/perry-codegen/src/collectors/segview.rs:1352-1359 \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/perry-codegen/src/collectors/segview.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"50cacd24229920ea79ea9c7fc821bbe646280af47ac66df7435b4ccbea78e53b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/concat_site_cache.rs:199-206 | crates/perry-codegen/src/expr/number_to_string_inline.rs:38-47 \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/perry-codegen/src/concat_site_cache.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"e074d6ad863193f090acbe11c4186b4adc666eaf3fc6f42d612e003dd1d76565"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/concat_site_cache.rs:198-206 | crates/perry-codegen/src/expr/array_push.rs:1128-1135 \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/perry-codegen/src/concat_site_cache.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fba88e6f126753495834aae34afd8b352aeade0dfb4f60b81db16319b6d7df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): crates/perry-codegen/src/expr/agent_ptr.rs:155-160 | crates/perry-codegen/src/expr/agent_ptr.rs:204-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/agent_ptr.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"941acb7ab8ce0e44e799f66816da2b9bde4710258ce3ed7f6ec324077408db37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/array_literal.rs:292-299 | crates/perry-codegen/src/lower_call/new_alloc.rs:768-782 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/array_literal.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/new_alloc.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 82 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/perry-codegen/src/expr/array_literal.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e8e175b865d9c4a40fcfa10ff6b683997056581bd462401fa1393165cdf5a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/array_literal.rs:434-441 | crates/perry-codegen/src/expr/collection_receiver.rs:67-74 \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/perry-codegen/src/expr/array_literal.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef3d7c6397bb4cd44efb46f2cf73a27721bb6ec95b5047d365b2a4a8e289a2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/perry-codegen/src/expr/array_pop.rs:64-71 | crates/perry-codegen/src/expr/class_field_push.rs:33-39 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/array_pop.rs\u0060 and \u0060crates/perry-codegen/src/expr/class_field_push.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 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/perry-codegen/src/expr/array_pop.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5a9c2803ab2932262539efa05d5a10e8af5eaf5059614b99445032dcf2fd79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/array_pop.rs:163-170 | crates/perry-codegen/src/expr/array_push.rs:1181-1188 \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/perry-codegen/src/expr/array_pop.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"4202619a320ca27c9b71e651452204d53d283f3ba2b2bb84ff2ad2f25e9d0dd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/array_push.rs:1188-1195 | crates/perry-codegen/src/expr/array_push.rs:1452-1459 \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/perry-codegen/src/expr/array_push.rs"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"37951f757082ad33521d6158a32fca48b1faa987ad374fec580cf78f2a0042e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/perry-codegen/src/expr/arrays_finds.rs:178-184 | crates/perry-codegen/src/expr/u8_buffer_read.rs:303-310 \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/perry-codegen/src/expr/arrays_finds.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bb58e68f6962a1d9bc46f2f4b497798c75b8dcd122cc00687eba3682f64fa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/compare.rs:484-491 | crates/perry-codegen/src/expr/compare.rs:911-918 \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/perry-codegen/src/expr/compare.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d3032b77799e10455c9c974b79ec8849cebdfbd5ed2de5b2b1c818b571bd0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/element_shape_reads.rs:168-175 | crates/perry-codegen/src/expr/element_shape_reads.rs:226-233 \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/perry-codegen/src/expr/element_shape_reads.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e096ef103ebc300d46d6884efdb275c7ed177b3e3f17b325fcc7aa28be722b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/index.rs:375-383 | crates/perry-codegen/src/expr/index.rs:635-642 \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/perry-codegen/src/expr/index.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"392956ef84df967ea4f48bfe1fa88f78e8e7521de2e8d47d3ee7f0069ef2d0a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/perry-codegen/src/expr/index.rs:695-701 | crates/perry-codegen/src/expr/index.rs:721-728 \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/perry-codegen/src/expr/index.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6fca9f5f5cbc86a31bfd87a1b90c632bad90fa605710a95dd51ef5cd2c1e8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs:660-667 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:1104-1111 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs\u0060 and \u0060crates/perry-codegen/src/stmt/stable_packed_loop.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 51 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/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e3a443a0618302260af4fc0818c181e3b137e25b93bb17b989f10f25c7adfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/perry-codegen/src/expr/index_set.rs:133-140 | crates/perry-codegen/src/expr/index_set.rs:159-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/index_set.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac56e3fc310573f63e009c0492afa6f9724f0bb42af8bbcf5e16e7515a8bcdbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/instance_misc1.rs:301-308 | crates/perry-codegen/src/lower_conditional.rs:464-471 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/instance_misc1.rs\u0060 and \u0060crates/perry-codegen/src/lower_conditional.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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/perry-codegen/src/expr/instance_misc1.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f87d2f42ac635c12e93fcfe870c11c4cc5fef78c4600d55a337ea2be2e9236a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/literals_vars.rs:1137-1145 | crates/perry-codegen/src/lower_call/property_get/completed_object.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/literals_vars.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ae81d1819a5048ec485880e32d7e2a9986516f07d6601222da11967ad47a94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/logical_collections.rs:1160-1167 | crates/perry-codegen/src/expr/logical_collections.rs:1211-1218 \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/perry-codegen/src/expr/logical_collections.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5794237847e05f9e54f586e46a8739202bafd5494319d522dae9438bde57b30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/method_site.rs:231-238 | crates/perry-codegen/src/expr/property_get/generic_dispatch.rs:625-632 \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/perry-codegen/src/expr/method_site.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"794c717dfadfdff1ebfe9352b4758d1f0fc929dd5a559f2b6e90f7b90a0509f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/os_uri_dates.rs:252-259 | crates/perry-codegen/src/expr/os_uri_dates.rs:287-294 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/os_uri_dates.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb0fcb9b34f3c45a12f9e4e5b81f21b546ce47f0c74183ff431826161d24204"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/static_method.rs:712-719 | crates/perry-codegen/src/lower_call/namespace_call.rs:415-422 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/static_method.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/namespace_call.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 80 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/perry-codegen/src/expr/static_method.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2978cc94c48464ebc61d7a0af949e5b46a61e633905242d0c24899d6c46b74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/static_method.rs:716-723 | crates/perry-codegen/src/expr/static_method.rs:731-738 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/static_method.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"5938b083c402b74c0a279264c459dc63bcc3d879a161cfb7855857b931e8dec6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/typed_element.rs:121-128 | crates/perry-codegen/src/expr/typed_element.rs:166-173 \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/perry-codegen/src/expr/typed_element.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d09dbb392b370445e43654633554d20c61b478c9d8bc7309852b04f7c6cdf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/layout_families/late.rs:867-874 | crates/perry-codegen/src/layout_families/late.rs:890-897 \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/perry-codegen/src/layout_families/late.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"96281ab00763f1a6b0aa5ab02faf87db23a0af999b45f51fa351510d76c8b5dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/lower_call/builtin.rs:223-230 | crates/perry-codegen/src/lower_call/builtin.rs:259-266 \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/perry-codegen/src/lower_call/builtin.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af1115faed8e297cbcd07367c09a90b572a89d619072bc82344409cdc4ee68d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/lower_call/builtin.rs:481-488 | crates/perry-codegen/src/lower_call/builtin.rs:1053-1060 \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/perry-codegen/src/lower_call/builtin.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"1397704c268e70e7d8a724017d54862d5321962048df262bcf30c77d40d6e8c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/lower_call/builtin.rs:1025-1032 | crates/perry-codegen/src/lower_call/builtin.rs:1073-1080 \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/perry-codegen/src/lower_call/builtin.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"223e220447536d88092324612077f41c9698e76899f3401d0a93682a1e41c4d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/lower_call/console_promise.rs:428-435 | crates/perry-codegen/src/lower_call/console_promise.rs:468-475 \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/perry-codegen/src/lower_call/console_promise.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"455fff461390f469e04fbbfd8273478f49165e3a41191f073925a0abf54e8408"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/lower_call/console_promise/util_types.rs:9-16 | crates/perry-codegen/src/lower_call/native/mod.rs:57-64 \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/perry-codegen/src/lower_call/console_promise/util_types.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcc4070c876b7dc5bee0dac8b085dbfabac3d326690ed529bec51177fa7c2da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/lower_call/property_get/promise_chain.rs:157-164 | crates/perry-codegen/src/lower_call/property_get/promise_chain.rs:179-186 \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/perry-codegen/src/lower_call/property_get/promise_chain.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31d648cde1b1dfdd3fd8c93776b04f3b3a54b38008ee416ec6b24b67e3b2dfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/lower_string_method.rs:514-521 | crates/perry-codegen/src/lower_string_method.rs:882-890 \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/perry-codegen/src/lower_string_method.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d55f4890176b609372e34a475ec1d5469185714043478ae204f5c2dab84cbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/stmt/binding_cell.rs:112-119 | crates/perry-codegen/src/stmt/binding_cell.rs:347-354 \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/perry-codegen/src/stmt/binding_cell.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0bea372857db8477c6e454da6de7517a8d9e34aff990e6413961c83c6bc94fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/stmt/element_shape_loop.rs:1784-1793 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:1785-1792 \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/perry-codegen/src/stmt/element_shape_loop.rs"},"region":{"startLine":1784}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d71169d07b175ebdc4b47a01068b0b0b248a33076ad650d01186cc4fdb4d7dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:5541-5548 | crates/perry-codegen/src/stmt/loops.rs:5617-5627 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":5541}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99bef74989c6d0cf17a48058b45602b69db63eae3a2d490d0e0e20e122d0407"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:7355-7362 | crates/perry-codegen/src/stmt/loops.rs:7431-7438 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":7355}}}],"partialFingerprints":{"codehealthFindingId/v1":"12724087d9727d4d3470603a239c877ea5922994898c99882110d81e1701ceaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:9169-9176 | crates/perry-codegen/src/stmt/loops.rs:9623-9630 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":9169}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa491cf158f9a41bc52ec4f9cce0e0ad1a59ea53c03ab4e87e8078c370f1a13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:9288-9295 | crates/perry-codegen/src/stmt/loops.rs:9761-9768 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":9288}}}],"partialFingerprints":{"codehealthFindingId/v1":"94bb4494be1afca15c2001de16a79f79826fec7f0fcf3bf9eaf2963619c89f22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/stmt/region_loop/mod.rs:475-482 | crates/perry-codegen/src/stmt/region_loop/mod.rs:799-806 \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/perry-codegen/src/stmt/region_loop/mod.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3db40e2cbc056d7c94c08642ba79c03d2dcf365ceea6bae2b9579aa43fc163"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/stmt/stable_packed_loop.rs:1404-1411 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:1419-1426 \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/perry-codegen/src/stmt/stable_packed_loop.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ffa7d12c6d354f2ef7f31ff7b27f6be2cf37ace581d901700ef942990981ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/stmt/unused_expr.rs:84-91 | crates/perry-codegen/src/stmt/unused_expr.rs:198-205 \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/perry-codegen/src/stmt/unused_expr.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0e0326903f5a2188397b8e3596c8a31afabd5187c4ea1844fbd1fa171f9381"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/testing/root_slots.rs:60-67 | crates/perry-codegen/src/testing/temp_slots.rs:69-76 \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/perry-codegen/src/testing/root_slots.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b654f256f4a9893f04b8a127f1106df1503d30f8cf1218c27ac0455d056d388"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/type_analysis/strings.rs:19-26 | crates/perry-codegen/src/type_analysis/strings.rs:286-296 \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/perry-codegen/src/type_analysis/strings.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3480173d55bba329c6d5899f1b5f29152da25e19091396ac8a89bb7d8e067454"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-component-host/src/sync_wasi/tcp.rs:149-156 | crates/perry-component-host/src/sync_wasi/tcp.rs:187-194 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-component-host/src/sync_wasi/tcp.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"8745201b505d3edcba2c9207a497506daf51f1296b7aba7eeca1eddc5f8b41fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-container-compose/src/backend/apple.rs:299-306 | crates/perry-container-compose/src/backend/apple.rs:318-325 \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/perry-container-compose/src/backend/apple.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"1618a117da21614c1c2c1d3813d2dcdbcbf2c00a6d88144d12fbc1ea3f981b90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/perry-ext-ads/src/ios_real.rs:90-97 | crates/perry-ext-ads/src/ios_real.rs:139-145 \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/perry-ext-ads/src/ios_real.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4337fb7db4efb5ad19940c951eed08530feccb10efa0a5dbc093d7791b70d5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-ext-argon2/src/lib.rs:124-131 | crates/perry-ext-bcrypt/src/lib.rs:161-168 \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/perry-ext-argon2/src/lib.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f51dae3ccf658e90596d7984764f200170a2246c47b29a121bd8ef8d608029"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-ext-bcrypt/src/lib.rs:48-55 | crates/perry-ext-bcrypt/src/lib.rs:75-82 \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/perry-ext-bcrypt/src/lib.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a42b5a305f7937f5ccd63f188bad909a144ea89b5d1596e7c78ca8fa8ae982"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20138 lines \u00D7 3): crates/perry-ext-better-sqlite3/src/lib.rs:302-304 | crates/perry-ext-better-sqlite3/src/lib.rs:355-362 | crates/perry-ext-better-sqlite3/src/lib.rs:422-429 \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/perry-ext-better-sqlite3/src/lib.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c83e8a2b22ab1373c9edd4feabca9a9d972f4c64ff5cc2f786662e1fb11da0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-ext-http/src/client_request_surface.rs:30-37 | crates/perry-ext-http/src/server/request.rs:835-842 \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/perry-ext-http/src/client_request_surface.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93a092630480509cf684eebb70e377a48c8225e5bfcc994ce37ee15ce053bda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): crates/perry-ext-http/src/server/response.rs:409-416 | crates/perry-ext-http/src/server/response.rs:532-537 \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/perry-ext-http/src/server/response.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b82bb90f504471cdbfd1e5efb9e7b474b6459f3eb2f57b0550320bcec559a41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-ext-http/src/server/server/deferred_events.rs:69-76 | crates/perry-ext-http/src/server/server/deferred_events.rs:129-136 \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/perry-ext-http/src/server/server/deferred_events.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5b7b03c890cd1f87dbe60f2c8c9452624442475f84bd04c0570c7789446371"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-ext-net/src/classes.rs:66-73 | crates/perry-ext-net/src/payload_prototype.rs:12-19 \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/perry-ext-net/src/classes.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08d643ea81c55ee5d9d0fef9244ed81a1564fcc7d5844634dc613a4ec24c815"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-ext-net/src/payload_socket.rs:1147-1154 | crates/perry-ext-net/src/payload_socket.rs:1405-1412 \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/perry-ext-net/src/payload_socket.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6dafb6b8ac09ceb0dbee28cc3c2f659bf7a4228f1e4855273e221361bb7f447"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-hir/src/destructuring/assignment_stmt.rs:391-398 | crates/perry-hir/src/destructuring/pattern_binding.rs:906-913 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/destructuring/assignment_stmt.rs\u0060 and \u0060crates/perry-hir/src/destructuring/pattern_binding.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 53 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/perry-hir/src/destructuring/assignment_stmt.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"4021d0ab1463b0630719590de0f8594bde197a64a4c05874497c163a8f6dd442"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs:379-387 | crates/perry-hir/src/lower/expr_call/intrinsics/native_arena.rs:301-308 \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/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59e0704c67509af9f37716e877fa64cd7400254eb5ab4644e95df85a63376ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/perry-hir/src/lower/expr_member.rs:1064-1071 | crates/perry-hir/src/lower/stmt.rs:523-529 \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/perry-hir/src/lower/expr_member.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"5326b95a21f112d6d30170f251f55ab32e4e2219aef37e8dc668929ecb37ea73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-hir/src/lower/expr_member/member_tail.rs:537-544 | crates/perry-hir/src/lower/expr_member/member_tail.rs:572-579 \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/perry-hir/src/lower/expr_member/member_tail.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b7276b118cbca9046139bcefbf96925a17355a0a9918b678199dc024ebc963"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-hir/src/lower/module_decl.rs:1172-1179 | crates/perry-hir/src/lower_decl/fn_decl.rs:237-244 \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/perry-hir/src/lower/module_decl.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f855e4e48bfc32d1be33113961d96ff5494b04944bfb45e7f4502527499c31d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-hir/src/lower/stmt.rs:870-882 | crates/perry-hir/src/lower_decl/body_stmt.rs:296-303 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 308 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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"4120a5058ed6bac86c652d8a89f01289311f7a32c4e1412d33dfa7d4d487c30a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:900-907 | crates/perry-hir/src/lower_decl/body_stmt.rs:1616-1623 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7175a6236747f1e7038056d79f71f505c8e285ca27f20628457a7e299aabdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:943-950 | crates/perry-hir/src/lower/stmt_loops.rs:1127-1134 \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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"7834036e0047d31f39f3475532ce55a18bab29e77ed140a6470dcde6fa6addd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/perry-hir/src/lower_decl/class_captures.rs:656-663 | crates/perry-hir/src/lower_decl/class_captures.rs:667-674 | crates/perry-hir/src/lower_decl/class_captures.rs:675-684 \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/perry-hir/src/lower_decl/class_captures.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"51737d4aca365bfc6e2c3f3323a36bae1b4ac5116af1ccada279d2b4406e5893"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-hir/src/lower_decl/class_members.rs:495-502 | crates/perry-hir/src/lower_decl/class_members.rs:889-896 \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/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a86edfc0ce81eb8b0190c9b793e402aaf595ec37724b8f246b2fa9a862336b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20138 lines \u00D7 3): crates/perry-hir/src/lower_types.rs:1414-1421 | crates/perry-hir/src/lower_types.rs:1427-1434 | crates/perry-hir/src/lower_types.rs:1439-1443 \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/perry-hir/src/lower_types.rs"},"region":{"startLine":1414}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e05b08b1e6d521f46acb22db6c5e0c22f19d278fa7366de6ce0c6176197de0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-hir/src/monomorph/substitute_expr.rs:389-396 | crates/perry-hir/src/monomorph/substitute_expr.rs:665-672 \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/perry-hir/src/monomorph/substitute_expr.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f60a13851a7555e9630784a11d1a06c97c265c63a9658347381d46a06a98dee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-parser/src/lib.rs:617-624 | crates/perry-parser/src/lib.rs:640-647 \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/perry-parser/src/lib.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f64a4d3164373cf159a378c1b8b5d474b34635e4bec28f5c7e577c64feb58f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 10): crates/perry-codegen/src/lower_call/early_branches.rs:799-806 | crates/perry-codegen/src/lower_call/early_branches.rs:899-906 | crates/perry-codegen/src/lower_call/early_branches.rs:1001-1008 | crates/perry-codegen/src/lower_call/func_ref.rs:1140-1146 | crates/perry-codegen/src/lower_call/func_ref.rs:1214-1220 | crates/perry-codegen/src/lower_call/func_ref.rs:1290-1296 | crates/perry-codegen/src/lower_call/method_override.rs:1349-1355 | crates/perry-codegen/src/lower_call/method_override.rs:1433-1439 | crates/perry-codegen/src/lower_call/method_override.rs:1519-1525 | crates/perry-codegen/src/lower_call/method_override.rs:1606-1612 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/early_branches.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/func_ref.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 122 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/perry-codegen/src/lower_call/early_branches.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"175a452f9ffeac9186ceccf41420d9f70989006237270b6b24696c48a7b034eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 9): crates/perry-codegen/src/codegen/string_pool/metadata_constants.rs:26-32 | crates/perry-codegen/src/expr/array_literal.rs:692-698 | crates/perry-codegen/src/expr/instance_misc1.rs:1610-1616 | crates/perry-codegen/src/expr/strings.rs:28-34 | crates/perry-codegen/src/expr/typed_feedback.rs:210-216 | crates/perry-codegen/src/expr/v8_interop.rs:79-85 | crates/perry-codegen/src/expr/v8_interop.rs:173-179 | crates/perry-codegen/src/module.rs:953-959 | crates/perry-codegen/src/strings.rs:336-342 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/array_literal.rs\u0060 and \u0060crates/perry-codegen/src/expr/instance_misc1.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 62 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/perry-codegen/src/codegen/string_pool/metadata_constants.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"96dca9f1f43bf9d791cf5c2209231ebb4e8f12568e9ba606a765d147158e28d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8): crates/perry-codegen/src/expr/env_clones.rs:286-292 | crates/perry-codegen/src/expr/misc_methods.rs:662-668 | crates/perry-codegen/src/expr/misc_methods.rs:698-704 | crates/perry-codegen/src/expr/misc_methods.rs:1048-1054 | crates/perry-codegen/src/expr/misc_methods.rs:1077-1083 | crates/perry-codegen/src/expr/misc_methods.rs:1122-1128 | crates/perry-codegen/src/expr/static_field_meta.rs:565-571 | crates/perry-codegen/src/expr/static_field_meta.rs:829-835 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/env_clones.rs\u0060 and \u0060crates/perry-codegen/src/expr/misc_methods.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 55 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/perry-codegen/src/expr/env_clones.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0dc4c2a7e3ac806e3ebe9b8c01e3b460b023d58648bbb6d1daf025d3a936f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7): crates/perry-codegen/src/expr/calls/crypto_kdf.rs:276-282 | crates/perry-codegen/src/expr/calls/fs.rs:38-44 | crates/perry-codegen/src/expr/calls/fs.rs:56-62 | crates/perry-codegen/src/expr/calls/fs.rs:237-243 | crates/perry-codegen/src/expr/calls/fs.rs:256-262 | crates/perry-codegen/src/expr/calls/fs.rs:275-281 | crates/perry-codegen/src/expr/calls/fs.rs:367-373 \u2014 there are 7 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 7 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/calls/crypto_kdf.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"215a442472c57750b06fb7824a6b6d6c0b93b931319a5eb1da5f54d559d0bbe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7): crates/perry-hir/src/lower/expr_object.rs:1346-1352 | crates/perry-hir/src/lower/expr_object.rs:1356-1362 | crates/perry-hir/src/lower/expr_object.rs:1369-1375 | crates/perry-hir/src/lower/expr_object.rs:1397-1403 | crates/perry-hir/src/lower/expr_object.rs:1609-1615 | crates/perry-hir/src/lower/expr_object.rs:1619-1625 | crates/perry-hir/src/lower/expr_object.rs:1632-1638 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"32086c3854097aa2e91c6281164119fc1a45f4fdbe3d19dbb5cff838f2b118c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): crates/perry-codegen/src/lower_call/early_branches.rs:816-822 | crates/perry-codegen/src/lower_call/func_ref.rs:1152-1158 | crates/perry-codegen/src/lower_call/func_ref.rs:1159-1165 | crates/perry-codegen/src/lower_call/func_ref.rs:1234-1240 | crates/perry-codegen/src/lower_call/func_ref.rs:1312-1318 | crates/perry-codegen/src/lower_call/func_ref.rs:1403-1409 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/early_branches.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/func_ref.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 122 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/perry-codegen/src/lower_call/early_branches.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"11363378e70092c2de755c88b0cb8dd169ff1c6c4ee4a4371a294d35f413171d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): crates/perry-hir/src/lower/expr_member.rs:1343-1364 | crates/perry-hir/src/lower/expr_member.rs:1374-1385 | crates/perry-hir/src/lower/expr_member.rs:1542-1557 | crates/perry-hir/src/lower/expr_member.rs:1571-1577 | crates/perry-hir/src/lower/expr_member.rs:1581-1587 | crates/perry-hir/src/lower/expr_member.rs:1591-1597 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_member.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b2b3f3c3f4b3619101906dbfbba8958ab2f9921bafc1d0a93bddc8f5696750"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): crates/perry-codegen/src/expr/array_pop.rs:82-91 | crates/perry-codegen/src/expr/array_pop.rs:141-148 | crates/perry-codegen/src/expr/arrays_finds.rs:152-160 | crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs:247-254 | crates/perry-codegen/src/stmt/loops.rs:3320-3326 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/array_pop.rs\u0060 and \u0060crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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/perry-codegen/src/expr/array_pop.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ae7820477cf8a095c45ea6eca407067fa779bc74a08dcc533ecc4778a07452"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20137 lines \u00D7 7): crates/perry-codegen/src/codegen/method.rs:1353-1356 | crates/perry-codegen/src/expr/helpers.rs:376-377 | crates/perry-codegen/src/lower_array_method.rs:1268-1274 | crates/perry-codegen/src/lower_call/method_override.rs:1805-1811 | crates/perry-codegen/src/lower_call/property_get/static_dispatch.rs:461-467 | crates/perry-codegen/src/lower_call/scalar_method.rs:823-828 | crates/perry-codegen/src/lower_call/web_storage.rs:36-42 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/method_override.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/scalar_method.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 38 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/perry-codegen/src/codegen/method.rs"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1178bd5bbd1a8df71244095b466914f69cf33cb30ff9c177bb1228f550e4d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/perry-codegen-glance/src/emit.rs:86-92 | crates/perry-codegen-glance/src/emit_glue.rs:153-159 | crates/perry-codegen-wear-tiles/src/emit.rs:103-109 | crates/perry-codegen-wear-tiles/src/emit_glue.rs:95-101 \u2014 before extracting anything, compare \u0060crates/perry-codegen-glance/src/emit.rs\u0060 and \u0060crates/perry-codegen-wear-tiles/src/emit.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 144 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/perry-codegen-glance/src/emit.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3676b679f6c3ed07ec460c4bb5bfe500ab54d6a91742540fa6c721329420879"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/perry-codegen/src/codegen/closure.rs:255-261 | crates/perry-codegen/src/codegen/closure.rs:307-313 | crates/perry-codegen/src/codegen/closure.rs:353-359 | crates/perry-codegen/src/codegen/closure.rs:399-405 \u2014 all 4 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e95a5d6122140aab356b245d5f5bdd11ceda55df6028939deee8f9f269f70ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/perry-codegen/src/codegen/string_pool/metadata_constants.rs:23-29 | crates/perry-codegen/src/expr/typed_feedback.rs:207-213 | crates/perry-codegen/src/module.rs:901-907 | crates/perry-codegen/src/strings.rs:333-339 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/string_pool/metadata_constants.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0a25e9f84effd52d6bd37b9df1db67fd3b811277a32a007d847c9567e4601e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/perry-codegen/src/expr/array_pop.rs:79-86 | crates/perry-codegen/src/expr/class_field_push.rs:51-57 | crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs:244-251 | crates/perry-codegen/src/stmt/loops.rs:3317-3323 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/array_pop.rs\u0060 and \u0060crates/perry-codegen/src/expr/class_field_push.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 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/perry-codegen/src/expr/array_pop.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9498cfbd1f5ccd6d9d592ab96c9799d668d649b1ca181c7b5238fdc0cc0e0da2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/perry-codegen/src/expr/calls/crypto_kdf.rs:72-78 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:110-116 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:241-247 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:316-322 \u2014 all 4 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/perry-codegen/src/expr/calls/crypto_kdf.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b351ca0015fa9bb0e62832b76e1d2165abd0220022ee59144da11e3a62adaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/perry-codegen/src/expr/range_facts.rs:633-639 | crates/perry-codegen/src/expr/range_facts.rs:976-982 | crates/perry-codegen/src/stmt/loops.rs:8346-8352 | crates/perry-codegen/src/stmt/loops.rs:8433-8439 \u2014 there are 4 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/range_facts.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddde574e741b641c2588be54bdf8a659915aa0ceaf999d93bcad63da4850d768"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/perry-codegen/src/linker.rs:1517-1523 | crates/perry-hir/src/lower/const_fold_fn.rs:117-123 | crates/perry-hir/src/lower/fn_ctor_env.rs:248-254 | crates/perry-runtime-manifest/src/realm_json.rs:38-44 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/const_fold_fn.rs\u0060 and \u0060crates/perry-hir/src/lower/fn_ctor_env.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 41 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/perry-codegen/src/linker.rs"},"region":{"startLine":1517}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7348643f85fbcee9a690ccd3a7b839d65e49aae38fde64d5364da8b4beb695"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/perry-codegen/src/stmt/loops.rs:8306-8312 | crates/perry-codegen/src/stmt/loops.rs:8411-8417 | crates/perry-codegen/src/stmt/loops.rs:8528-8534 | crates/perry-codegen/src/stmt/loops.rs:8588-8594 \u2014 all 4 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":8306}}}],"partialFingerprints":{"codehealthFindingId/v1":"694532b8fb4654157dfa8d0b14a106f36749f2283c9f57171901219f6d5aa85e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/perry-hir/src/lower_decl/class_members.rs:530-536 | crates/perry-hir/src/lower_decl/class_members.rs:941-947 | crates/perry-hir/src/lower_decl/private_members.rs:119-125 | crates/perry-hir/src/lower_decl/private_members.rs:334-340 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/class_members.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/private_members.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 210 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/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"04127b485611717b36e4c11e7cb87737d337938e0c2303f116b369c3fb708f29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-codegen-glance/src/lib.rs:71-77 | crates/perry-codegen-swiftui/src/lib.rs:147-153 | crates/perry-codegen-wear-tiles/src/lib.rs:55-61 \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/perry-codegen-glance/src/lib.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5ff3d114c772335c34cc322feeef29ca51324e4fa6cd22991e471118bee995"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-codegen-wasm/src/emit/stmt.rs:95-101 | crates/perry-codegen-wasm/src/emit/stmt.rs:143-149 | crates/perry-codegen-wasm/src/emit/stmt.rs:214-220 \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/perry-codegen-wasm/src/emit/stmt.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"977e4f3bb6a5b252b905299ec421b0364d40612f1ac474c2a7f26f5cb7f9e4bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-codegen/src/codegen/closure.rs:262-268 | crates/perry-codegen/src/codegen/function.rs:206-212 | crates/perry-codegen/src/codegen/method_typed.rs:221-227 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/function.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 320 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ec842d9b7552055adf2597145e06003bb998b1caa337f1067f93b349426e88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-codegen/src/codegen/closure.rs:314-320 | crates/perry-codegen/src/codegen/function.rs:99-105 | crates/perry-codegen/src/codegen/method_typed.rs:42-48 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/function.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 320 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1600a079699e9c30810797a05b89b245874ef7863eb6eec819855aa9452fdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-codegen/src/codegen/closure.rs:360-366 | crates/perry-codegen/src/codegen/function.rs:168-174 | crates/perry-codegen/src/codegen/method_typed.rs:129-135 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/function.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 320 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd1fbc29d1238a757eef193dd54c934eb91c9b8a25bce7df77beef8f63ccd0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-codegen/src/codegen/closure.rs:406-412 | crates/perry-codegen/src/codegen/function.rs:133-139 | crates/perry-codegen/src/codegen/method_typed.rs:175-181 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/function.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 320 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f48164a47aa792eef7600086cd43e4dfdec81fff733318129e02a286836269"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): crates/perry-codegen/src/codegen/method.rs:1095-1100 | crates/perry-codegen/src/codegen/method.rs:1190-1196 | crates/perry-codegen/src/codegen/method.rs:1284-1289 \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/perry-codegen/src/codegen/method.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"327250eeb23ea436a663b1e031745ae715e73260fff5a80ba7e8e0306168c395"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-codegen/src/codegen/mod.rs:1950-1956 | crates/perry-codegen/src/codegen/mod.rs:1963-1970 | crates/perry-codegen/src/codegen/mod.rs:1994-2000 \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/perry-codegen/src/codegen/mod.rs"},"region":{"startLine":1950}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa07e5ded53a60d743f685859ed77ec040160512ff1923287bc66dc3ea641e7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-codegen/src/codegen/opts/computed_names.rs:234-240 | crates/perry-codegen/src/collectors/anon_key_adds.rs:275-281 | crates/perry-codegen/src/collectors/param_ranges.rs:248-254 \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/perry-codegen/src/codegen/opts/computed_names.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd500b6ecf4ee01bfa174fe9f5e4c8dce8e696e576783c5fd19be25ea44fae6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-codegen/src/collectors/escape_check.rs:600-606 | crates/perry-codegen/src/collectors/escape_objects.rs:579-585 | crates/perry-codegen/src/collectors/escape_objects.rs:595-601 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/escape_check.rs\u0060 and \u0060crates/perry-codegen/src/collectors/escape_objects.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 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/perry-codegen/src/collectors/escape_check.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4e0d2b70435ddd947206125013b7e6a6fe9dad5a2974d6e1af772ab3c48f39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): crates/perry-codegen/src/expr/call_spread_short.rs:421-427 | crates/perry-codegen/src/expr/method_site.rs:135-140 | crates/perry-codegen/src/expr/method_site.rs:637-643 \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/perry-codegen/src/expr/call_spread_short.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"0acd4c15729b02dbc43c7126dcf18dd0e933f9630763fc9251ced0e752f809e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-codegen/src/expr/calls/crypto_kdf.rs:45-51 | crates/perry-codegen/src/expr/calls/crypto_keys.rs:132-138 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:659-665 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/calls/crypto_kdf.rs\u0060 and \u0060crates/perry-codegen/src/expr/calls/crypto_misc.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 47 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/perry-codegen/src/expr/calls/crypto_kdf.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b697e7214b5832c08e107560f8dcf4e6dbabb85a6937ce1d3b882b04cd43777"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-codegen/src/expr/compare.rs:124-130 | crates/perry-codegen/src/expr/compare.rs:503-509 | crates/perry-codegen/src/expr/compare.rs:1107-1113 \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/perry-codegen/src/expr/compare.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5539dcb749ca118272471e885e6b326271c2218cfc3b0a94a78a86671ad902"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-codegen/src/expr/element_shape_reads.rs:186-194 | crates/perry-codegen/src/expr/property_get/generic_dispatch.rs:182-189 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:719-725 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/property_get/generic_dispatch.rs\u0060 and \u0060crates/perry-codegen/src/stmt/stable_packed_loop.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 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/perry-codegen/src/expr/element_shape_reads.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe96e3d26dee505f4f8a4ccb8fbb48d321f22f2e958ce4bb7a50906cbbe5c77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-codegen/src/expr/index_get/guarded_array.rs:669-675 | crates/perry-codegen/src/expr/private_field_site.rs:326-332 | crates/perry-codegen/src/lower_string_method.rs:333-339 \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/perry-codegen/src/expr/index_get/guarded_array.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2ec0da5f4d60d32965ee42369ce10a4b0a0fd682f0e2ff966cb1aec8339f12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-codegen/src/expr/instance_misc1.rs:1010-1016 | crates/perry-codegen/src/expr/logical_collections.rs:1333-1339 | crates/perry-codegen/src/expr/logical_collections.rs:1556-1562 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/instance_misc1.rs\u0060 and \u0060crates/perry-codegen/src/expr/logical_collections.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 88 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/perry-codegen/src/expr/instance_misc1.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6a52e13f3ea281d589cf1773c6a10b8ce327ce6af6530776b04c6124f84004"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-codegen/src/expr/misc_methods.rs:871-877 | crates/perry-codegen/src/expr/misc_methods.rs:889-895 | crates/perry-codegen/src/expr/misc_methods.rs:921-927 \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/perry-codegen/src/expr/misc_methods.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"939cbef19b07946b6d2acfee503375ad365bbe12becb8bbb78fd2750f4ff62c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-codegen/src/expr/static_field_meta.rs:339-345 | crates/perry-codegen/src/lower_call/new_helpers.rs:266-272 | crates/perry-codegen/src/lower_call/scalar_method.rs:830-836 \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/perry-codegen/src/expr/static_field_meta.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1653498f63737b00fbf19e96cd9a0997758feeb861ea9cde8859ed7532b9479"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): crates/perry-codegen/src/expr/this_super_call.rs:813-819 | crates/perry-codegen/src/lower_call/method_override.rs:694-699 | crates/perry-codegen/src/lower_call/new_helpers.rs:259-264 \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/perry-codegen/src/expr/this_super_call.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36aff821f7396ef2cd501a7d23a443dfe0050c5ab4295c3b4f85e3910371b7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-codegen/src/lower_call/builtin.rs:338-344 | crates/perry-codegen/src/lower_call/builtin.rs:383-389 | crates/perry-codegen/src/lower_call/builtin.rs:417-423 \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/perry-codegen/src/lower_call/builtin.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d40254b22d74cc9a4273bc5587730491dfc4b1b2a3ee1e16a6f5fdd5bc4513"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-codegen/src/lower_call/property_get/map_set.rs:346-352 | crates/perry-codegen/src/lower_call/property_get/map_set.rs:373-379 | crates/perry-codegen/src/lower_call/property_get/map_set.rs:407-413 \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/perry-codegen/src/lower_call/property_get/map_set.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c735354bdf8a4042e3099b970e56f8ad83afebff79e7f540aa49d9b13c5ecc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 4): crates/perry-codegen/src/stmt/element_shape_loop.rs:1453-1455 | crates/perry-codegen/src/stmt/loops.rs:3829-3835 | crates/perry-codegen/src/stmt/loops.rs:6792-6798 | crates/perry-codegen/src/stmt/loops.rs:6836-6842 \u2014 there are 4 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/element_shape_loop.rs"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fa7d8592ac6a9307ae81d5eaa27e1077dce57ecbe7bd14a054d1e5142c9c48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-ext-net/src/payload_closed.rs:113-119 | crates/perry-ext-net/src/payload_server.rs:638-646 | crates/perry-ext-net/src/payload_server.rs:691-699 \u2014 before extracting anything, compare \u0060crates/perry-ext-net/src/payload_closed.rs\u0060 and \u0060crates/perry-ext-net/src/payload_server.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 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/perry-ext-net/src/payload_closed.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6983eb4c3b02756e55eddcc20cd6be18810fc288304760eb35ef10f9104bb90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20137 lines \u00D7 5): crates/perry-codegen/src/codegen/split_regions_facts.rs:552-553 | crates/perry-hir/src/dynamic_import.rs:314-320 | crates/perry-hir/src/dynamic_import.rs:386-392 | crates/perry-hir/src/dynamic_import.rs:445-451 | crates/perry-hir/src/lower/shared_mutable_capture.rs:1130-1131 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/split_regions_facts.rs\u0060 and \u0060crates/perry-hir/src/lower/shared_mutable_capture.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/split_regions_facts.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"c611e96a4b20363f9492dfed91c69eaf046b6bb681da3d3c5b5a72d27e27d82f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/imported_array_methods.rs:190-196 | crates/perry-hir/src/lower/expr_call/inline_array_methods.rs:119-125 | crates/perry-hir/src/lower/expr_call/local_array_methods.rs:501-507 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/imported_array_methods.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/inline_array_methods.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 308 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/perry-hir/src/lower/expr_call/imported_array_methods.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e734d03c5c2fc018fc5d1a8b6f6f261ad153e1aeb82511ac8ba8f0fe47282f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/mod.rs:199-205 | crates/perry-hir/src/lower/expr_call/native_module.rs:64-70 | crates/perry-hir/src/lower/expr_member.rs:76-82 \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/perry-hir/src/lower/expr_call/mod.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3bcbc81181b7cbbc578bb9a1b49df84871b4ba47688b021ab2225bfd7d4f2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-audio-miniaudio/src/lib.rs:719-725 | crates/perry-audio-miniaudio/src/lib.rs:741-747 \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/perry-audio-miniaudio/src/lib.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a4cb5cfef22c0763b9a4392a686768eb27b6fe474b9149fa2aa02f7ff23880"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen-glance/src/emit.rs:40-46 | crates/perry-codegen-wear-tiles/src/emit.rs:41-47 \u2014 before extracting anything, compare \u0060crates/perry-codegen-glance/src/emit.rs\u0060 and \u0060crates/perry-codegen-wear-tiles/src/emit.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 144 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/perry-codegen-glance/src/emit.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2495d12b637304cf663924c5762619bcd08ffc3195790b787bb3ab1e0820fbe7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen-js/src/emit/mod.rs:314-320 | crates/perry-codegen-js/src/emit/mod.rs:365-371 \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/perry-codegen-js/src/emit/mod.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"32866d09b4452af88ab9bedea8296106aba19881d22161423d65537c82a16329"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 2): crates/perry-codegen/src/codegen/artifact_source_text.rs:225-231 | crates/perry-codegen/src/codegen/artifacts.rs:1027-1031 \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/perry-codegen/src/codegen/artifact_source_text.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d8e0badca88ca38665804dc62bb4a2bc3b214184f3edac3a32186f2c7611a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/codegen/closure.rs:263-269 | crates/perry-codegen/src/codegen/closure.rs:407-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"22dd10af6631f2a79a846772c28122f63fd2a1fa8805c8f7ee626b3409c2cca8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/codegen/closure.rs:729-735 | crates/perry-codegen/src/codegen/function.rs:905-911 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/function.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 320 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"6860fd460b3fda16aa61d12b64178202c4d802f00b70469ce269dced078795a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/codegen/function.rs:1800-1806 | crates/perry-codegen/src/codegen/method_static.rs:570-576 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/function.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method_static.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 268 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/perry-codegen/src/codegen/function.rs"},"region":{"startLine":1800}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e73ee6b21640c7cf3d65239234df40f6dea4bf8b34b4a76fd79edff0338dc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/codegen/mod.rs:1511-1517 | crates/perry-codegen/src/codegen/mod.rs:1524-1530 \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/perry-codegen/src/codegen/mod.rs"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe7461607ea8dfe64d1b2d81b938db343541d126d55b80e7848692e1177d980"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/codegen/static_constfn.rs:431-437 | crates/perry-codegen/src/layout_desc/array_families.rs:548-554 \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/perry-codegen/src/codegen/static_constfn.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20290c90514135f6dff29ab81543565eaa7543e2eb780ddeda9695719b0a220"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/codegen/static_prototype.rs:193-199 | crates/perry-codegen/src/codegen/static_prototype.rs:360-366 \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/perry-codegen/src/codegen/static_prototype.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f073ee7f616992ba208f3381141a42184be4f36e377b857c5fd62e540cff5cce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/codegen/static_prototype.rs:200-206 | crates/perry-codegen/src/codegen/static_prototype.rs:260-266 \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/perry-codegen/src/codegen/static_prototype.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3fa3c32583044c39b4e708bcd4e05e2c47ade62dcf566e3eab5f1a4404063f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/codegen/typed_abi/lower.rs:233-239 | crates/perry-codegen/src/codegen/typed_abi/lower.rs:508-514 \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/perry-codegen/src/codegen/typed_abi/lower.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b47fdfe094dbdcb8cd86d70f29a6feb4aee7955d205de5b8aaf94768d672d13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/collectors/byte_read_key.rs:168-175 | crates/perry-codegen/src/collectors/pointer_locals.rs:75-81 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/byte_read_key.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d68e0f9ada4f1850a323a9d7b24a1ce4665614141fb49377bb6728ec9f2603b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/collectors/definite_init.rs:531-537 | crates/perry-codegen/src/collectors/definite_init.rs:637-643 \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/perry-codegen/src/collectors/definite_init.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a771ed16cb79e6684f0ac8e8d488400cb63784df8b8e241451171d97cb6be3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/collectors/i32_locals.rs:128-139 | crates/perry-codegen/src/collectors/integer_locals.rs:1147-1153 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/i32_locals.rs\u0060 and \u0060crates/perry-codegen/src/collectors/integer_locals.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 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/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"07536b4fcc1444605694ba9fdc31aefda8203932239a3cb33475ae5239cfa1a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/collectors/ptr_numarray.rs:246-252 | crates/perry-codegen/src/collectors/ptr_shape.rs:226-232 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/ptr_numarray.rs\u0060 and \u0060crates/perry-codegen/src/collectors/ptr_shape.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 165 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/perry-codegen/src/collectors/ptr_numarray.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a91d9c1bc1f2d80b74421b7a91780e4d4acde6c0ee808a45cad347aef66db1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/collectors/ptr_numarray.rs:798-804 | crates/perry-codegen/src/collectors/ptr_shape_elements.rs:1100-1106 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/ptr_numarray.rs\u0060 and \u0060crates/perry-codegen/src/collectors/ptr_shape_elements.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 95 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/perry-codegen/src/collectors/ptr_numarray.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1713209577564807ffc1b5fb669a8f5cf194cc74b940cf0a8f9796724c9e28d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/expr/array_pop.rs:67-73 | crates/perry-codegen/src/expr/ic_fast_split.rs:77-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/array_pop.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69405ee8a56f38cb262835e1a1feb83ccb2a2293266d55387294acedd51b157"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/expr/calls.rs:354-360 | crates/perry-codegen/src/expr/calls.rs:399-405 \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/perry-codegen/src/expr/calls.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"159c36a231f1adea45fb4507f68a2202b787fae1311792b9aa619c92d01437f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/expr/calls/crypto_keys.rs:57-63 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:559-565 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/calls/crypto_keys.rs\u0060 and \u0060crates/perry-codegen/src/expr/calls/crypto_misc.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 54 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/perry-codegen/src/expr/calls/crypto_keys.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"8189d4b9f61337e9ffbc172f8a1da6918a6b97390cb024ab334a4fcaf407fde7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/expr/checked_super.rs:124-130 | crates/perry-codegen/src/expr/checked_super.rs:131-137 \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/perry-codegen/src/expr/checked_super.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"389932cdfcd9db2ab9a551fc552ea4d53f93905e030ed9cac353518cf7215189"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/expr/compare.rs:667-673 | crates/perry-codegen/src/expr/compare.rs:1132-1138 \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/perry-codegen/src/expr/compare.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"b652ba296401a7508065797735cfa1edf70f46fbcb360e3ee165bb45c1701e06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/expr/index_get.rs:125-131 | crates/perry-codegen/src/expr/index_set.rs:178-184 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/index_get.rs\u0060 and \u0060crates/perry-codegen/src/expr/index_set.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 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/perry-codegen/src/expr/index_get.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95d383558bbc93ba7a2aed2f8d640ace78ba48bcf2e3e2aaf411e0de1d42717"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/expr/index_get.rs:956-962 | crates/perry-codegen/src/expr/index_get.rs:1352-1358 \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/perry-codegen/src/expr/index_get.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e668f4bd231e7e49d169b60a9956e41af7ff72adfc2e973273b0be738dd046"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs:321-327 | crates/perry-codegen/src/stmt/versioned_indexed_loop.rs:322-328 \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/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb17271f3dea4bbbd65bec100c4188e9a249a3d634d284ce747112eaedeca9ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/expr/js_runtime.rs:133-139 | crates/perry-codegen/src/expr/js_runtime.rs:231-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/js_runtime.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9ce914d0be04dfc0948c284d2e1da93777240d5937e12e037cb85b84f100b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/expr/member_update.rs:163-169 | crates/perry-codegen/src/expr/property_get.rs:934-940 \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/perry-codegen/src/expr/member_update.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"df18edfd43693f61032b5c09b2a9b6d467267980f68d6f33b6427827c10e94c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/expr/method_site.rs:961-967 | crates/perry-codegen/src/expr/typed_element.rs:408-414 \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/perry-codegen/src/expr/method_site.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"014182f8677caab0d17665f9c19b76cda194d2efa24389dde5b9f2c65d1016f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/expr/property_get.rs:601-607 | crates/perry-codegen/src/expr/property_get.rs:627-633 \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/perry-codegen/src/expr/property_get.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"d515813a829d5d7ce39edbe5655e35b9df14b0794ffd470dd0cc34b4217cc5e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/expr/url_main.rs:282-288 | crates/perry-codegen/src/expr/url_main.rs:317-323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/url_main.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9c80cc666c7a825bc11520af5587aa57350e751b524a19b1c8724b82d201ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/expr/url_main.rs:378-384 | crates/perry-codegen/src/lower_call/options/fetch.rs:173-179 \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/perry-codegen/src/expr/url_main.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c68c02badb413340e25a5ba4e5199ebd70d8996c2e8533f5a9fe299f2b19771"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/expr/write_barrier.rs:514-520 | crates/perry-codegen/src/expr/write_barrier.rs:848-854 \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/perry-codegen/src/expr/write_barrier.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"f332effc00447ee44c5344ef875d876f0cfcb3b79b6ff2e10517bec3f746f69b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/lower_call/builtin.rs:1414-1420 | crates/perry-codegen/src/lower_call/builtin.rs:1440-1446 \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/perry-codegen/src/lower_call/builtin.rs"},"region":{"startLine":1414}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9193eed654eff438ce8beb837a311e952145e5836b67500dd2f8dab4334af20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/lower_call/direct_method_guard.rs:97-108 | crates/perry-codegen/src/lower_call/method_override.rs:429-435 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/direct_method_guard.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/method_override.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 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/perry-codegen/src/lower_call/direct_method_guard.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50a9457b800d45ec372f0326ffc99c9adf79e9fd5e22c0d2bf2e52da0b8d07a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/lower_call/early_branches.rs:1128-1134 | crates/perry-codegen/src/lower_call/func_ref.rs:1396-1402 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/early_branches.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/func_ref.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 122 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/perry-codegen/src/lower_call/early_branches.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c605547755fa19329701145269c6d5906df8b0f37d56e2449de572e6114c56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/lower_call/extern_func.rs:1319-1325 | crates/perry-codegen/src/lower_call/extern_func.rs:1334-1340 \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/perry-codegen/src/lower_call/extern_func.rs"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b53cde9f4427a3f94e8b010e9b76c3f2174910f18b94fa002488c1550d0473"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/lower_call/extern_func.rs:1413-1419 | crates/perry-codegen/src/lower_call/namespace_call.rs:327-333 \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/perry-codegen/src/lower_call/extern_func.rs"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"277fb264a250816b49c7f12e37088b217df70409855238eef29ec8c6fed51c94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:577-583 | crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:1866-1874 \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/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"47870901370feb0662261edfe81e653e0f828c271c12dffeced71327a7443b10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:670-676 | crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:708-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/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"8916594daea06267c50a42ef8178abd6e273b2ca5cac1bcd9cdb7e38e7a0c54d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:1876-1882 | crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:1889-1897 \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/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs"},"region":{"startLine":1876}}}],"partialFingerprints":{"codehealthFindingId/v1":"118da9e822c47164eb468a7e580ec1c596ee3adc10821e100a1692e5d2a85bf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/lower_call/property_get/map_set.rs:139-145 | crates/perry-codegen/src/lower_call/property_get/map_set.rs:223-229 \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/perry-codegen/src/lower_call/property_get/map_set.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed39645a2fa8f8639ba7794cf56d4a7d14e1ba61a22406a4a3eebbf0f2c5168"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/lower_string_method.rs:638-644 | crates/perry-codegen/src/lower_string_method.rs:658-664 \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/perry-codegen/src/lower_string_method.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"8213db5597713da0a5c79b5162b852ab2a3094be4b939454101fea74b147c95b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/lower_string_method.rs:802-808 | crates/perry-codegen/src/lower_string_method.rs:821-827 \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/perry-codegen/src/lower_string_method.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1e6ae663a3c6f2bc09cfe64804c2d45ae0b6e6dbacfb61097f3353d3fa167f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/proto_constants.rs:258-264 | crates/perry-codegen/src/proto_constants.rs:602-608 \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/perry-codegen/src/proto_constants.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b0581f32d92164231f4ac05af09ad924c1862217b0de3aac00405c5d04212d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/proto_constants.rs:1009-1015 | crates/perry-codegen/src/proto_constants.rs:1073-1079 \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/perry-codegen/src/proto_constants.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba25f9436d2833074e50d5fcf611f7a9fae85934be10a39e88040faf4198ba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/stmt/element_shape_carried.rs:142-148 | crates/perry-codegen/src/stmt/loops.rs:9288-9294 \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/perry-codegen/src/stmt/element_shape_carried.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"160f40da09ae4f1c22ad41e5917f9df9767a3f35b623307c8defab5cb9e571b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/stmt/element_shape_loop.rs:426-432 | crates/perry-codegen/src/stmt/loops.rs:6582-6588 \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/perry-codegen/src/stmt/element_shape_loop.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67c00a4db56e1253e60fa47611e3fa1b0e1dae630cacc6c596705e4ca19f919"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:552-558 | crates/perry-codegen/src/stmt/loops.rs:791-797 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"f053379202d76c360d405c3a4386c804d737605cf3ba5d72021cf7c72d8159c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:1141-1147 | crates/perry-codegen/src/stmt/loops.rs:1368-1374 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"16158dd994a0410ce5b70fc966b522131b0c15b8a8458f917f665f65078386ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 3): crates/perry-codegen/src/stmt/loops.rs:7584-7590 | crates/perry-codegen/src/stmt/loops.rs:7602-7608 | crates/perry-codegen/src/stmt/loops.rs:7636-7638 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":7584}}}],"partialFingerprints":{"codehealthFindingId/v1":"8354718a48fd16362c7e47be2ef4d7d7ac21254a43e066f561e2aef30ddabb45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/stmt/stable_packed_loop.rs:45-51 | crates/perry-codegen/src/stmt/stable_packed_typed_array.rs:57-63 \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/perry-codegen/src/stmt/stable_packed_loop.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97eaa7f39e21464479a261513e29787aabf2f5cf2b51c4a21317f21291f7d14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/temp_root_coverage/dispatch_receiver.rs:148-154 | crates/perry-codegen/src/temp_root_coverage/dispatch_receiver.rs:206-212 \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/perry-codegen/src/temp_root_coverage/dispatch_receiver.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a094521a85a1aee020f47f7af0da7c6af103b5ecf36ed19c7aaf4d623f5b71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/type_analysis_class_fields.rs:99-105 | crates/perry-codegen/src/type_analysis_class_fields.rs:192-198 \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/perry-codegen/src/type_analysis_class_fields.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1aa554c43260690075bd92c7a82b4d92dd5fe2b6bcb062106664eb4e90e3448"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/type_analysis_facts.rs:273-279 | crates/perry-codegen/src/type_analysis_facts.rs:342-348 \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/perry-codegen/src/type_analysis_facts.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"e053f572e2c9fd91a3a7278519680c0613fe056b029e21d4d1741fc6cb697926"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-container-compose/src/compose.rs:969-975 | crates/perry-container-compose/src/compose.rs:982-988 \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/perry-container-compose/src/compose.rs"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf3b01edcbb8dfc50f5c585bf5c592b336eca25a98afd7548158bb7272f0b84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-ext-cheerio/src/lib.rs:272-278 | crates/perry-ext-cheerio/src/lib.rs:298-304 \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/perry-ext-cheerio/src/lib.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbe0ecf5a10f92bc8c3eabb96c00399114ef8c8859ba04bf6fd2af813cc50a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-ext-http/src/client_events.rs:597-603 | crates/perry-ext-http/src/client_events.rs:665-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/perry-ext-http/src/client_events.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"baac4a3c2bff1118bf49bdb62ce871d1d5bd5b23b9099c4dab75d90aae977069"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-ext-http/src/server/response_turnloop.rs:55-61 | crates/perry-http-server/src/lib.rs:441-447 \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/perry-ext-http/src/server/response_turnloop.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"deec799e731f576da7bebf0ea0515be49a89f84badc2361634f20597b0ee001e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-ext-http/src/server/turnloop_serve/conn.rs:814-820 | crates/perry-http-server/src/conn.rs:595-601 \u2014 before extracting anything, compare \u0060crates/perry-ext-http/src/server/turnloop_serve/conn.rs\u0060 and \u0060crates/perry-http-server/src/conn.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 65 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/perry-ext-http/src/server/turnloop_serve/conn.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dac21900979a50bc24a83e6f0035c7944345bee11de5d5d6ca2a9231c9ab79a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-ext-http/src/server/turnloop_serve/wire.rs:224-230 | crates/perry-http-server/src/wire.rs:224-230 \u2014 before extracting anything, compare \u0060crates/perry-ext-http/src/server/turnloop_serve/wire.rs\u0060 and \u0060crates/perry-http-server/src/wire.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 115 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/perry-ext-http/src/server/turnloop_serve/wire.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9b77dc97abcf463ff84c31dc477cb0aee42a347d8232d0600a9a4ae2130cba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-ext-net/src/classes_prototype.rs:46-52 | crates/perry-ext-net/src/classes_prototype.rs:94-100 \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/perry-ext-net/src/classes_prototype.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfec23cd1857025c53a04a5b5da7b882faf4a5ee14fcfe17e1b6ae7a5652827a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-ext-net/src/payload_abi.rs:377-383 | crates/perry-ext-net/src/payload_abi.rs:392-398 \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/perry-ext-net/src/payload_abi.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d59230ea553e88b1c415d3fd717a57100b266d0291ead816af46b794a1418f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-ext-net/src/payload_io.rs:408-414 | crates/perry-ext-net/src/payload_socket.rs:1437-1443 \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/perry-ext-net/src/payload_io.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"1806c4932b14d2ccf710b7c8cf05a51c8663e28951fdcc0c6c4e98718bfb9c27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-ext-net/src/payload_tls.rs:55-61 | crates/perry-ext-net/src/payload_tls.rs:94-100 \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/perry-ext-net/src/payload_tls.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c06d69a17c472f24b37bfe852978df25cd84d40186e5b011936f350778461c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-hir/src/analysis/value_types.rs:291-297 | crates/perry-hir/src/analysis/value_types.rs:301-307 \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/perry-hir/src/analysis/value_types.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ac68e19101bc76355a9159b8fbbceaf223f0e7bb0b9f278e8fa26a7cf3deb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-hir/src/lower/const_fold_fn.rs:1257-1263 | crates/perry-hir/src/lower/expr_call/intrinsics/eval_strict.rs:16-22 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/const_fold_fn.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/intrinsics/eval_strict.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 43 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/perry-hir/src/lower/const_fold_fn.rs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e60a60f2a5b0ff638ad2da668f76de96922fa414639ccfe4a5d2623b2385ff2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-hir/src/lower/decorators.rs:38-44 | crates/perry-hir/src/lower/decorators.rs:178-184 \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/perry-hir/src/lower/decorators.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98ea99f668c4019a7eb1ef63c86e69332f4adb310f184a1d4bc606e9176cba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/intrinsics/bare_builtins.rs:167-173 | crates/perry-hir/src/lower/expr_call/intrinsics/eval_strict.rs:47-53 \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/perry-hir/src/lower/expr_call/intrinsics/bare_builtins.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b95c9ff0aa9b077614242dd9bcb38102d68430acc2ff3931128d70b5e514f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/intrinsics/native_arena.rs:89-95 | crates/perry-hir/src/lower/expr_call/intrinsics/native_arena.rs:433-439 \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/perry-hir/src/lower/expr_call/intrinsics/native_arena.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16e82f53d67cf4007666be343b5996e948a29d733f0901b2cd35f43916342d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/textencoder.rs:54-60 | crates/perry-hir/src/lower/expr_call/textencoder.rs:89-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/textencoder.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df126305491b0bce185e577a8e7ad55bcede09f17a4cbe15d410ba7ac1d0d24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-hir/src/lower/expr_member.rs:1264-1272 | crates/perry-hir/src/lower/expr_member.rs:1280-1286 \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/perry-hir/src/lower/expr_member.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad95010a68b8c85ae2680f9e95084412a2c1259801a5e47e3e55320f0569a930"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-hir/src/lower/expr_member.rs:1305-1311 | crates/perry-hir/src/lower/expr_member.rs:1441-1451 \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/perry-hir/src/lower/expr_member.rs"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ad397d9b14daa049f5765ee06e90c6bb49f6eb89b4c0930cf9d8e9fd03cf78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-hir/src/lower/expr_object.rs:415-421 | crates/perry-hir/src/lower/expr_object.rs:609-615 \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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9a56e1e5f6ccb6aa7b6c59e3ad7b92310ecbaed2c61b87f7758137013d1ca0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-hir/src/lower/expr_object.rs:424-430 | crates/perry-hir/src/lower/expr_object.rs:617-623 \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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6b85a65d2e324bb7aba01e6e381e6d722922fd652179f9a47919f24de7ac08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-hir/src/lower/fn_ctor_env.rs:889-895 | crates/perry-hir/src/lower/fn_ctor_env.rs:897-903 \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/perry-hir/src/lower/fn_ctor_env.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7fdd1839281393002ab59f01b690911c2573e35afb19817568aa240711af82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-hir/src/lower/shared_mutable_capture.rs:128-134 | crates/perry-hir/src/lower/shared_mutable_capture.rs:136-142 \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/perry-hir/src/lower/shared_mutable_capture.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"711739083d00bf707e13e3e28886c7e411d03133d4e98f83914ddc58bb3af553"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-hir/src/lower/stmt.rs:1558-1564 | crates/perry-hir/src/lower_decl/body_stmt.rs:1096-1102 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 308 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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":1558}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38289626ff3a547b898171cbbd1b0eba7d541b970fe35a1cecca04b133857fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:1583-1589 | crates/perry-hir/src/lower_decl/body_stmt.rs:2069-2075 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":1583}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd51d61795890b4cb10ce0a64b2866e292f89be82db5abb356af2cf94e708455"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-hir/src/lower_decl/class_captures.rs:564-570 | crates/perry-hir/src/lower_decl/class_captures.rs:943-949 \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/perry-hir/src/lower_decl/class_captures.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee1f49e53f22888ffbf190f7554922765283874bf3e7b488fdfb31eeab2a95b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-hir/src/lower_decl/class_members.rs:198-204 | crates/perry-hir/src/lower_decl/private_members.rs:172-178 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/class_members.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/private_members.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 210 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/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a1db716a3c01251204be207004c80f543b75768b6a2fb7b7af83c0577ae2e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-hir/src/lower_patterns.rs:711-717 | crates/perry-hir/src/lower_patterns.rs:737-743 \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/perry-hir/src/lower_patterns.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c314f239137f41f47ba16b09c0af0ac29eeb8eecb77ae798825949cf5bb2a53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 12): crates/perry-codegen/src/expr/calls/fs.rs:21-26 | crates/perry-codegen/src/expr/calls/fs.rs:74-79 | crates/perry-codegen/src/expr/calls/fs.rs:145-150 | crates/perry-codegen/src/expr/calls/fs.rs:182-187 | crates/perry-codegen/src/expr/calls/fs.rs:205-210 | crates/perry-codegen/src/expr/calls/fs.rs:299-304 | crates/perry-codegen/src/expr/calls/fs.rs:316-321 | crates/perry-codegen/src/expr/calls/fs.rs:333-338 | crates/perry-codegen/src/expr/calls/fs.rs:350-355 | crates/perry-codegen/src/expr/calls/fs.rs:395-400 | crates/perry-codegen/src/expr/calls/fs.rs:413-418 | crates/perry-codegen/src/expr/calls/fs.rs:430-435 \u2014 all 12 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/perry-codegen/src/expr/calls/fs.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebf47b4cf0b2181ca368446c0cb167c9a7efa42aec5d9acd1b80c73b5cb0c76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 10): crates/perry-codegen/src/lower_call/early_branches.rs:558-563 | crates/perry-codegen/src/lower_call/early_branches.rs:1197-1202 | crates/perry-codegen/src/lower_call/func_ref.rs:236-241 | crates/perry-codegen/src/lower_call/func_ref.rs:1153-1158 | crates/perry-codegen/src/lower_call/func_ref.rs:1160-1165 | crates/perry-codegen/src/lower_call/func_ref.rs:1228-1233 | crates/perry-codegen/src/lower_call/func_ref.rs:1235-1240 | crates/perry-codegen/src/lower_call/func_ref.rs:1313-1318 | crates/perry-codegen/src/lower_call/func_ref.rs:1397-1402 | crates/perry-codegen/src/lower_call/func_ref.rs:1404-1409 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/early_branches.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/func_ref.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 122 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/perry-codegen/src/lower_call/early_branches.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"6597059b0d6246fd08fee051e5a3f7efc94e0e8d8bda9082dbfe2b537874607b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 10): crates/perry-codegen/src/lower_call/early_branches.rs:767-772 | crates/perry-codegen/src/lower_call/early_branches.rs:867-872 | crates/perry-codegen/src/lower_call/early_branches.rs:969-974 | crates/perry-codegen/src/lower_call/func_ref.rs:1120-1125 | crates/perry-codegen/src/lower_call/func_ref.rs:1194-1199 | crates/perry-codegen/src/lower_call/func_ref.rs:1270-1275 | crates/perry-codegen/src/lower_call/method_override.rs:1328-1333 | crates/perry-codegen/src/lower_call/method_override.rs:1412-1417 | crates/perry-codegen/src/lower_call/method_override.rs:1498-1503 | crates/perry-codegen/src/lower_call/method_override.rs:1585-1590 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/early_branches.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/func_ref.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 122 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/perry-codegen/src/lower_call/early_branches.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf5972a58f2c6c9e2fbbd438628c6469c75fcc2d14b678e3358cd11e8bb11af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8): crates/perry-codegen/src/codegen/function.rs:93-98 | crates/perry-codegen/src/codegen/function.rs:127-132 | crates/perry-codegen/src/codegen/function.rs:162-167 | crates/perry-codegen/src/codegen/function.rs:200-205 | crates/perry-codegen/src/codegen/method_typed.rs:36-41 | crates/perry-codegen/src/codegen/method_typed.rs:123-128 | crates/perry-codegen/src/codegen/method_typed.rs:169-174 | crates/perry-codegen/src/codegen/method_typed.rs:215-220 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/function.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method_typed.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 110 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/perry-codegen/src/codegen/function.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9cd27a707e7128fd356b1fb719795541da5e109c778d55c08e540aa1a5d2bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 7): crates/perry-codegen/src/codegen/method.rs:1357-1362 | crates/perry-codegen/src/expr/helpers.rs:378-382 | crates/perry-codegen/src/lower_array_method.rs:1277-1281 | crates/perry-codegen/src/lower_call/method_override.rs:701-705 | crates/perry-codegen/src/lower_call/method_override.rs:1814-1818 | crates/perry-codegen/src/lower_call/property_get/static_dispatch.rs:470-474 | crates/perry-codegen/src/lower_call/web_storage.rs:45-49 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/property_get/static_dispatch.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/web_storage.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 46 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/perry-codegen/src/codegen/method.rs"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8badbb4727a699d275d80d55d59ec096bba970c7bc056075ee42a9f56230e2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 7): crates/perry-codegen/src/expr/arrays_finds.rs:1420-1425 | crates/perry-codegen/src/expr/bigint_set.rs:563-568 | crates/perry-codegen/src/expr/misc_methods.rs:733-738 | crates/perry-codegen/src/expr/misc_methods.rs:1052-1057 | crates/perry-codegen/src/expr/misc_methods.rs:1081-1086 | crates/perry-codegen/src/expr/os_uri_dates.rs:380-385 | crates/perry-codegen/src/expr/string_regex_proc.rs:324-329 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/arrays_finds.rs\u0060 and \u0060crates/perry-codegen/src/expr/string_regex_proc.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 30 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/perry-codegen/src/expr/arrays_finds.rs"},"region":{"startLine":1420}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ac4d0fdba64847d6ed81e455b5478ba59ca9441aabf539fe71915eaa5ab125"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): crates/perry-codegen/src/expr/array_pop.rs:65-71 | crates/perry-codegen/src/expr/class_field_push.rs:34-39 | crates/perry-codegen/src/expr/function_bind.rs:40-45 | crates/perry-codegen/src/expr/literals_vars.rs:76-81 | crates/perry-codegen/src/expr/method_site.rs:743-748 | crates/perry-codegen/src/lower_call/property_get/completed_object.rs:47-52 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/array_pop.rs\u0060 and \u0060crates/perry-codegen/src/expr/class_field_push.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 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/perry-codegen/src/expr/array_pop.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f46ab64be909b8ab5f245a5808cb7d77122e4b3b0ea856ff59bd40a619f8c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): crates/perry-codegen/src/expr/env_clones.rs:415-420 | crates/perry-codegen/src/expr/math_simple.rs:464-469 | crates/perry-codegen/src/expr/math_simple.rs:1141-1146 | crates/perry-codegen/src/expr/misc_methods.rs:751-756 | crates/perry-codegen/src/expr/string_regex_proc.rs:168-173 | crates/perry-codegen/src/expr/string_regex_proc.rs:196-201 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/env_clones.rs\u0060 and \u0060crates/perry-codegen/src/expr/misc_methods.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 55 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/perry-codegen/src/expr/env_clones.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f615736dd6a84e7cb7f67137dc00905617d207cfc727ee3a4dc6b6010bdfd32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): crates/perry-codegen/src/lower_call/native/mod.rs:407-413 | crates/perry-codegen/src/lower_call/native/mod.rs:462-468 | crates/perry-codegen/src/lower_call/native/mod.rs:532-537 | crates/perry-codegen/src/lower_call/native/mod.rs:585-590 | crates/perry-codegen/src/lower_call/property_get/static_dispatch.rs:477-482 | crates/perry-codegen/src/lower_call/web_storage.rs:52-58 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/native/mod.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/web_storage.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 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/perry-codegen/src/lower_call/native/mod.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"177c499d9e85dff40bf7621e8817e46b723e8ac92a11df41b8fe355b0c671a9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): crates/perry-codegen/src/codegen/string_pool/metadata_constants.rs:24-29 | crates/perry-codegen/src/expr/typed_feedback.rs:208-213 | crates/perry-codegen/src/module.rs:902-907 | crates/perry-codegen/src/module.rs:951-956 | crates/perry-codegen/src/strings.rs:334-339 \u2014 there are 5 copies across 4 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 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/string_pool/metadata_constants.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e408601e2036c1e1ba7aa2609e99fece6c7fff9072d03628267e551b2ef07b83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): crates/perry-codegen/src/expr/calls/crypto_kdf.rs:15-20 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:65-70 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:181-186 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:270-275 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:309-314 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/calls/crypto_kdf.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e692bdc9a13df2b552ed10abafb78ded3e6d58fd175c08fb81b8d5363a2ea7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 5): crates/perry-codegen/src/expr/env_clones.rs:90-94 | crates/perry-codegen/src/expr/misc_methods.rs:315-320 | crates/perry-codegen/src/expr/misc_methods.rs:363-368 | crates/perry-codegen/src/expr/string_regex_proc.rs:553-558 | crates/perry-codegen/src/expr/string_regex_proc.rs:573-578 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/env_clones.rs\u0060 and \u0060crates/perry-codegen/src/expr/misc_methods.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 55 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/perry-codegen/src/expr/env_clones.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb078add64eb9fb10a9a7bda3899f6476b48f08b4ec67c86dce67f7878dfb70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): crates/perry-codegen/src/expr/js_runtime.rs:53-58 | crates/perry-codegen/src/expr/js_runtime.rs:76-81 | crates/perry-codegen/src/expr/js_runtime.rs:108-113 | crates/perry-codegen/src/expr/js_runtime.rs:152-157 | crates/perry-codegen/src/expr/js_runtime.rs:205-210 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/js_runtime.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ad206b7d68e26b6be00ddd2f4d95a6a9e4b6a1d2cb4a0ec9540956c2d058d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): crates/perry-codegen/src/expr/misc_methods.rs:342-347 | crates/perry-codegen/src/expr/misc_methods.rs:408-413 | crates/perry-codegen/src/expr/misc_methods.rs:469-474 | crates/perry-codegen/src/expr/misc_methods.rs:566-571 | crates/perry-codegen/src/expr/misc_methods.rs:608-613 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/misc_methods.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"26873ff657365e3912aba92c64dd749642e647026f84afe8e11567b724079ce9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/perry-codegen/src/expr/compare.rs:124-129 | crates/perry-codegen/src/expr/compare.rs:503-508 | crates/perry-codegen/src/expr/compare.rs:1107-1112 | crates/perry-codegen/src/expr/suffix_cursor.rs:48-53 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/compare.rs\u0060 and \u0060crates/perry-codegen/src/expr/suffix_cursor.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 47 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/perry-codegen/src/expr/compare.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc8a37ce328b2ad30bdaffdd4e434c31b39ae5351b0bf18463e90f4d953d473"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 5): crates/perry-codegen/src/expr/this_super_call.rs:695-700 | crates/perry-codegen/src/expr/this_super_call.rs:1162-1164 | crates/perry-codegen/src/expr/this_super_call.rs:1211-1216 | crates/perry-codegen/src/expr/this_super_call.rs:1245-1250 | crates/perry-codegen/src/expr/this_super_call.rs:1278-1283 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/this_super_call.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72a3fdc33b61bdd9cdf519d25aaf3f2c0d8216268b08f561ca64a7fb057c966"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/perry-codegen/src/lower_call/early_branches.rs:918-923 | crates/perry-codegen/src/lower_call/early_branches.rs:1129-1134 | crates/perry-codegen/src/lower_call/func_ref.rs:1228-1233 | crates/perry-codegen/src/lower_call/func_ref.rs:1397-1402 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/early_branches.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/func_ref.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 122 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/perry-codegen/src/lower_call/early_branches.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff2da69a80ba004636a80ef8d94e9eda45ce6684b9dcf5294e088ed92487c64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/perry-ext-net/src/payload_abi.rs:319-324 | crates/perry-ext-net/src/payload_abi.rs:334-339 | crates/perry-ext-net/src/payload_abi.rs:375-380 | crates/perry-ext-net/src/payload_abi.rs:390-395 \u2014 all 4 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/perry-ext-net/src/payload_abi.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74cf4bb7600e9e02f7c94291a41d600c391a0a6a6ba0d4e1a9e88b487ceea46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/perry-ext-net/src/payload_events.rs:146-151 | crates/perry-ext-net/src/payload_events.rs:189-194 | crates/perry-ext-net/src/payload_server.rs:359-365 | crates/perry-ext-net/src/payload_socket.rs:929-936 \u2014 before extracting anything, compare \u0060crates/perry-ext-net/src/payload_server.rs\u0060 and \u0060crates/perry-ext-net/src/payload_socket.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. 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/perry-ext-net/src/payload_events.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac8a4e7383e20edf50c5d12bd57352c085e15cb8e89ed506ead938449847878"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/perry-hir/src/lower/expr_call/mod.rs:193-198 | crates/perry-hir/src/lower/expr_call/native_module.rs:58-63 | crates/perry-hir/src/lower/expr_call/os.rs:88-93 | crates/perry-hir/src/lower/expr_member.rs:70-75 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/mod.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3d0998753c607aa41dd546ecc5a85ae29c68794e1bce397ebda667f51246ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/perry-hir/src/lower/expr_object.rs:873-882 | crates/perry-hir/src/lower/expr_object.rs:1100-1107 | crates/perry-hir/src/lower/expr_object.rs:1509-1514 | crates/perry-hir/src/lower/lower_expr/arm_ident.rs:186-191 \u2014 there are 4 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e677fccbe1de1565c471cad0d6b9c978d7f0d51eb7d82737aef3d53d0af3c26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/perry-hir/src/lower/module_decl.rs:593-598 | crates/perry-hir/src/lower/module_decl.rs:1715-1720 | crates/perry-hir/src/lower/module_decl.rs:1794-1799 | crates/perry-hir/src/lower/stmt.rs:438-443 \u2014 there are 4 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/module_decl.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0211b7f3bbbbd6c558b815261316394fdcfe8759ac3a237685e84cbc72eab37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-codegen/src/builtin_proto.rs:212-217 | crates/perry-codegen/src/expr/literals_vars.rs:857-862 | crates/perry-codegen/src/expr/literals_vars.rs:1111-1116 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/builtin_proto.rs\u0060 and \u0060crates/perry-codegen/src/expr/literals_vars.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 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/perry-codegen/src/builtin_proto.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd488164054b03827dc83ac5c42859828f7440b6f24a03c062ce9fd677bf68e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 5): crates/perry-codegen/src/codegen/method.rs:1435-1440 | crates/perry-codegen/src/expr/array_literal.rs:256-258 | crates/perry-codegen/src/expr/this_super_call.rs:1346-1351 | crates/perry-codegen/src/lower_call/property_get/imported_object.rs:27-29 | crates/perry-codegen/src/lower_call/scalar_method.rs:830-834 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/method.rs"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bc7fbdb8047db7074651fe2f1208c97bc259468dde5f77b80c868993c273bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-codegen/src/codegen/method_trampolines.rs:160-165 | crates/perry-codegen/src/codegen/method_trampolines.rs:268-273 | crates/perry-codegen/src/codegen/method_trampolines.rs:431-436 \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/perry-codegen/src/codegen/method_trampolines.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3937a876453114fd2b29557777939195343767f68fae2229462f2ddd60a1a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-codegen/src/collectors/i32_locals.rs:128-139 | crates/perry-codegen/src/collectors/integer_locals.rs:820-825 | crates/perry-codegen/src/collectors/integer_locals.rs:1147-1153 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/i32_locals.rs\u0060 and \u0060crates/perry-codegen/src/collectors/integer_locals.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 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/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7ff9c541db75ea62d2ea87b9702cabf90d6330f3090d890f000617b3b95497"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-codegen/src/expr/calls/crypto_kdf.rs:187-192 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:462-467 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:509-514 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/calls/crypto_kdf.rs\u0060 and \u0060crates/perry-codegen/src/expr/calls/crypto_misc.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 47 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/perry-codegen/src/expr/calls/crypto_kdf.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1225b6385b93a358366ac0ffb1a3be972d71532b418539dfa32412e884aeb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-codegen/src/expr/child_proc.rs:277-282 | crates/perry-codegen/src/expr/child_proc.rs:337-342 | crates/perry-codegen/src/expr/child_proc.rs:360-368 \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/perry-codegen/src/expr/child_proc.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9bfef4394240c28ed0bb4524914901fc299b4bd902a4c21c6db2875f6f573e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-codegen/src/expr/family_slot.rs:279-284 | crates/perry-codegen/src/expr/folded_builtin_override.rs:851-856 | crates/perry-codegen/src/lower_call/early_branches.rs:534-539 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/family_slot.rs\u0060 and \u0060crates/perry-codegen/src/expr/folded_builtin_override.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 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/perry-codegen/src/expr/family_slot.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"3272083fb75f1abc5718a7d7fa5c5d94fa109ee744f8285647d807e514480047"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-codegen/src/expr/i32_fast_path.rs:618-623 | crates/perry-codegen/src/expr/ta_param_f64_read.rs:123-128 | crates/perry-codegen/src/expr/u8_buffer_read.rs:47-52 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/i32_fast_path.rs\u0060 and \u0060crates/perry-codegen/src/expr/ta_param_f64_read.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 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/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d8d22e08976529f0aa942144a410465da48d79f0178e6920984a61136281b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-codegen/src/expr/index_get.rs:334-339 | crates/perry-codegen/src/expr/property_get.rs:1415-1420 | crates/perry-codegen/src/lower_call/property_get/static_dispatch.rs:479-484 \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/perry-codegen/src/expr/index_get.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8dac3ae9e3a64effa4dfec4ce8bc327bd03f2123ca74bed604a73a3b40d5e2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 8): crates/perry-codegen/src/expr/index_get.rs:781-784 | crates/perry-codegen/src/expr/index_set_guarded.rs:368-371 | crates/perry-codegen/src/expr/index_set_packed_loop.rs:120-125 | crates/perry-codegen/src/expr/index_set_packed_loop.rs:235-241 | crates/perry-codegen/src/expr/index_set_packed_loop.rs:429-437 | crates/perry-codegen/src/expr/masked_window.rs:54-57 | crates/perry-codegen/src/expr/masked_window.rs:317-320 | crates/perry-codegen/src/expr/ptr_numarray_access.rs:54-57 \u2014 there are 8 copies across 5 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 8 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/index_get.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c2ac1b3d94775cd03c87a853f26965c8a43c93b8ca1f1ba0b303e87d617769"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-codegen/src/expr/layout_read.rs:801-807 | crates/perry-codegen/src/expr/property_get.rs:536-541 | crates/perry-codegen/src/expr/typed_array_rmw.rs:296-301 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/layout_read.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"61645bb71c1f501043b3586f66631ddbc10d0b0ad714ee62535b20f3ca8926a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-codegen/src/expr/static_field_meta.rs:35-40 | crates/perry-codegen/src/expr/static_field_meta.rs:470-475 | crates/perry-codegen/src/lower_call/scalar_method.rs:670-675 \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/perry-codegen/src/expr/static_field_meta.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1721437b47dcd973d668585635f631c094f344844de98e6dec31d2721ff19468"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-codegen/src/expr/static_method.rs:507-512 | crates/perry-codegen/src/lower_array_method.rs:1212-1217 | crates/perry-codegen/src/lower_call/property_get/builtin_kind_guard.rs:309-314 \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/perry-codegen/src/expr/static_method.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8b3eded9329fa83190ddc6237e4846312a6dc9d2ccb04fb13c2a06dc705fad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-codegen/src/lower_call/builtin.rs:223-228 | crates/perry-codegen/src/lower_call/builtin.rs:259-264 | crates/perry-codegen/src/lower_call/builtin.rs:277-282 \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/perry-codegen/src/lower_call/builtin.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"73eb671086a89258ca2baf24e04a5135d81db8adbed5ebbbb0acc6460f604a97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:302-307 | crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:669-676 | crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:707-715 \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/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"74489b3915644b295735f47d79212afd0e481531d8b9c36c9ec77d03c44f1836"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-ext-http/src/client_events.rs:190-195 | crates/perry-ext-http/src/client_events.rs:614-619 | crates/perry-ext-http/src/client_events.rs:680-685 \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/perry-ext-http/src/client_events.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"2542c2b7542232aba84e6584e017cfce2e83dd0da642ef1c1572b805a245ac59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-ext-http/src/client_events.rs:347-352 | crates/perry-ext-http/src/client_events.rs:596-601 | crates/perry-ext-http/src/client_events.rs:664-669 \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/perry-ext-http/src/client_events.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fefcd6ffad09c6c594f23aeb5f548883b830b3192b92a0e64064c06c1fbc73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-hir/src/destructuring/pattern_binding.rs:586-591 | crates/perry-hir/src/lower/stmt.rs:296-301 | crates/perry-hir/src/lower/stmt.rs:360-365 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/destructuring/pattern_binding.rs\u0060 and \u0060crates/perry-hir/src/lower/stmt.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 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/perry-hir/src/destructuring/pattern_binding.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fe878e2d29429fc97281e69f13880e30d12e29bd3ed44ca3d1ad4b8e347a9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/globals.rs:745-751 | crates/perry-hir/src/lower/expr_call/module_static.rs:322-328 | crates/perry-hir/src/lower/expr_call/nested_namespace.rs:709-714 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/globals.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/module_static.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 296 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/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0fbd039109c058ec1d49e4a30bc1450a9c7cd7eca58badb2b3efecd054c4c47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/imported_array_methods.rs:202-207 | crates/perry-hir/src/lower/expr_call/inline_array_methods.rs:131-136 | crates/perry-hir/src/lower/expr_call/local_array_methods.rs:513-518 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/imported_array_methods.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/inline_array_methods.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 308 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/perry-hir/src/lower/expr_call/imported_array_methods.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"d658114e225ddcf5dd0588c6061681357aaf6271c62c745c540865245a5c2f06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/imported_array_methods.rs:224-229 | crates/perry-hir/src/lower/expr_call/inline_array_methods.rs:153-158 | crates/perry-hir/src/lower/expr_call/local_array_methods.rs:733-738 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/imported_array_methods.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/inline_array_methods.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 308 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/perry-hir/src/lower/expr_call/imported_array_methods.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5f36d631d5a386b378f0c700e6becae4f52e2c9746a5feeea157448cf74193"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/imported_array_methods.rs:242-247 | crates/perry-hir/src/lower/expr_call/inline_array_methods.rs:171-176 | crates/perry-hir/src/lower/expr_call/local_array_methods.rs:763-768 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/imported_array_methods.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/inline_array_methods.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 308 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/perry-hir/src/lower/expr_call/imported_array_methods.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9d00f8e3a47d18c2352436f0e4f2ce176c14f331acf31b0b1c522fda00cf9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs:53-59 | crates/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs:378-384 | crates/perry-hir/src/lower/expr_call/intrinsics/native_arena.rs:300-305 \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/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"037ef6fe3d367419eca0cabd864d1c93ef9147cfa0bdc8694bfa0b525f46c559"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/native_module/object_statics.rs:19-24 | crates/perry-hir/src/lower/expr_member/member_tail.rs:537-542 | crates/perry-hir/src/lower/expr_member/member_tail.rs:572-577 \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/perry-hir/src/lower/expr_call/native_module/object_statics.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1560372b2d61eadfa0dbc76231e2e69da6c667f8738f066c19155058eaa45d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-hir/src/lower/expr_member/member_tail.rs:717-722 | crates/perry-hir/src/lower/expr_member/member_tail.rs:724-729 | crates/perry-hir/src/lower/expr_member/member_tail.rs:731-736 \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/perry-hir/src/lower/expr_member/member_tail.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"9939cd5e67379952c541b22f88a456e18e58c7adac056af808bbf2546c3b9926"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-hir/src/lower/expr_new.rs:1160-1165 | crates/perry-hir/src/lower/expr_new.rs:1258-1263 | crates/perry-hir/src/lower/expr_new/helpers.rs:304-309 \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/perry-hir/src/lower/expr_new.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8088904fee38905f93e978a2975a30c433f5ba616c49d08b426c7b0c7e5cd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen-arkts/src/mutations.rs:565-570 | crates/perry-codegen-arkts/src/mutations.rs:593-598 \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/perry-codegen-arkts/src/mutations.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"619916e3977ffb67e188b3cfbd4310a309106147fdb2b737666ac774a6783ee0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen-arkts/src/widgets/inputs.rs:56-61 | crates/perry-codegen-arkts/src/widgets/inputs.rs:82-87 \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/perry-codegen-arkts/src/widgets/inputs.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"28dc88d7d003dbf3eac471275306f7c845f68aed130dc459e89a2f4f910cfc51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen-glance/src/emit_glue.rs:10-15 | crates/perry-codegen-wear-tiles/src/emit_glue.rs:11-16 \u2014 before extracting anything, compare \u0060crates/perry-codegen-glance/src/emit_glue.rs\u0060 and \u0060crates/perry-codegen-wear-tiles/src/emit_glue.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 111 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/perry-codegen-glance/src/emit_glue.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98102b5fb6d3bc62eed617f38f2d2f34ca4a08244930f7b8ccb97a1a38ea0c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen-glance/src/emit_glue.rs:22-28 | crates/perry-codegen-wear-tiles/src/emit_glue.rs:21-26 \u2014 before extracting anything, compare \u0060crates/perry-codegen-glance/src/emit_glue.rs\u0060 and \u0060crates/perry-codegen-wear-tiles/src/emit_glue.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 111 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/perry-codegen-glance/src/emit_glue.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11c1c4e30eb34ec968c29cabdd9d09ecd8a86e5858f36bfc50b6296ee97845f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/codegen/export_value_wrappers.rs:308-313 | crates/perry-codegen/src/codegen/module_globals_emit.rs:646-651 \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/perry-codegen/src/codegen/export_value_wrappers.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fff56a9323f523d7da6ac7f2be794682fe2b61e22fa6be81f1fecb4d153c0b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 3): crates/perry-codegen/src/codegen/method.rs:1101-1106 | crates/perry-codegen/src/expr/this_super_call.rs:1163-1166 | crates/perry-codegen/src/expr/write_barrier.rs:1137-1143 \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/perry-codegen/src/codegen/method.rs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa1fabdc6298ca2ba0c8962a12559edd3fbde1921dfbdf0681679b1820925c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/codegen/method_trampolines.rs:154-159 | crates/perry-codegen/src/codegen/method_trampolines.rs:411-416 \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/perry-codegen/src/codegen/method_trampolines.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a187026646a656c83fb53e29b064137a27e9b103bcaa702e644b3698e8e153"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/codegen/method_trampolines.rs:331-336 | crates/perry-codegen/src/lower_call/method_override.rs:422-428 \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/perry-codegen/src/codegen/method_trampolines.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ec96313da1cf80df73ed3f4f3be3869d21d048d9f130cc1302ce8cdcc7ddc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/codegen/realm_image.rs:182-187 | crates/perry-codegen/src/codegen/realm_image.rs:309-314 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/realm_image.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f9956cda4db28b4e917b588c32be5e0c7bd873963e7d76e38933fba8c8ad4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 3): crates/perry-codegen/src/codegen/split_regions_facts.rs:550-552 | crates/perry-codegen/src/collectors/definite_init.rs:562-567 | crates/perry-codegen/src/collectors/segview.rs:1410-1415 \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/perry-codegen/src/codegen/split_regions_facts.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"5080af9c78c13a629fa2db6e99271eb2dd87688993e64f396a50743c75347daa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/collectors/escape_arrays.rs:189-194 | crates/perry-codegen/src/expr/property_get.rs:112-118 \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/perry-codegen/src/collectors/escape_arrays.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95d64d51952eb2b775764c3a79a6ba5eca80ff25c3af27b7e0e78ccdd6f3284"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/collectors/literal_method_home.rs:67-72 | crates/perry-codegen/src/collectors/typed_locals.rs:1178-1183 \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/perry-codegen/src/collectors/literal_method_home.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"25acfdf3a3558ba7639d1fa2b2b651cd2ea344023e2c85b950bd4a931e75dbfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/array_methods.rs:147-152 | crates/perry-codegen/src/expr/array_methods.rs:361-366 \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/perry-codegen/src/expr/array_methods.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4def5f46376a91897d25e6aea529705c57b0facddace8a5e3079fa7efa1bb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/bigint_set.rs:1511-1518 | crates/perry-codegen/src/expr/bigint_set.rs:1537-1542 \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/perry-codegen/src/expr/bigint_set.rs"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"943c730b7197534838264d278099b7116841ebb2452336773f7201a86b3d6034"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/body_call.rs:162-167 | crates/perry-codegen/src/expr/collection_receiver.rs:68-74 \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/perry-codegen/src/expr/body_call.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1246d386d619664887462cd4353816928378d8dab40b7c95dd40078ad20314"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/buffer_access.rs:821-826 | crates/perry-codegen/src/expr/proven_view_access.rs:597-602 \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/perry-codegen/src/expr/buffer_access.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"3412fbd25bf3a20148054529681b4360ef6fb4f574175817e0a453284266bfc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/byte_cell.rs:543-548 | crates/perry-codegen/src/expr/static_method.rs:348-353 \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/perry-codegen/src/expr/byte_cell.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c327db6271bee31323a9d5ac65c99989ea48b7c0a19955ad7b530c3a4a5353"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 3): crates/perry-codegen/src/expr/calls/crypto_hash.rs:356-361 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:600-605 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:688-691 \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/perry-codegen/src/expr/calls/crypto_hash.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4883cf22bf808ea0bf5e525952956dbd48924e54c2251ab2fab96b130ddcf9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/calls/crypto_kdf.rs:20-25 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:634-639 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/calls/crypto_kdf.rs\u0060 and \u0060crates/perry-codegen/src/expr/calls/crypto_misc.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 47 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/perry-codegen/src/expr/calls/crypto_kdf.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d70f0a4b0ff46a86b9bd7dfc3aeae8635614883463e44bfdbf2335080373a87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/calls/crypto_keys.rs:42-47 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:165-170 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/calls/crypto_keys.rs\u0060 and \u0060crates/perry-codegen/src/expr/calls/crypto_misc.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 54 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/perry-codegen/src/expr/calls/crypto_keys.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"71711f852342102978742c022d93690d155a7da0283f573f2aedc7faaa35ebbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/class_field_push.rs:35-40 | crates/perry-codegen/src/stmt/loops.rs:3301-3306 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/class_field_push.rs\u0060 and \u0060crates/perry-codegen/src/stmt/loops.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 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/perry-codegen/src/expr/class_field_push.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e376a11a36af8232840dffdc883417985f1a575d1785b3f3a373c9a339623ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/compare.rs:137-142 | crates/perry-codegen/src/lower_string_concat.rs:289-294 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/compare.rs\u0060 and \u0060crates/perry-codegen/src/lower_string_concat.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 47 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/perry-codegen/src/expr/compare.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b563c4ff8a8a303758cbbdb213e2a97c70013875afadfecac6e16d05438968"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/compare.rs:136-141 | crates/perry-codegen/src/stmt/loops.rs:6784-6789 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/compare.rs\u0060 and \u0060crates/perry-codegen/src/stmt/loops.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 55 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/perry-codegen/src/expr/compare.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd1008886647f6df1fd3737526e4bd1b70052a9cf0428ebed018fc8adcdaf46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/i32_fast_path.rs:1154-1159 | crates/perry-codegen/src/expr/i32_fast_path.rs:1217-1222 \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/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"5066ede13fab6437004e8dba9f92e52de02f6bda68ab7cc5b0b75ccb938fb7e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/index_get.rs:413-418 | crates/perry-codegen/src/expr/index_get.rs:1248-1253 \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/perry-codegen/src/expr/index_get.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6edc6e0501fd7ddfeb2b5c01e5613f3d73b1380e753d5e9938ba59cc83476be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 3): crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs:200-202 | crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs:688-693 | crates/perry-codegen/src/expr/property_get.rs:541-546 \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/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"072bed9378ebf36da41e244f70a01d955044c95423e52df062f7ed34d2aff6c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 5): crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs:714-719 | crates/perry-codegen/src/expr/private_resume_frame.rs:33-35 | crates/perry-codegen/src/expr/private_resume_frame.rs:203-206 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:1067-1072 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:1096-1098 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs\u0060 and \u0060crates/perry-codegen/src/stmt/stable_packed_loop.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 51 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/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba09bfd5a1df056ac0580c1fc0a50baac8400c0f4ec322268356836ba28ce4e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/js_runtime.rs:30-35 | crates/perry-codegen/src/expr/js_runtime.rs:54-59 \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/perry-codegen/src/expr/js_runtime.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9738b69427b422bcf27a012c8e81168f9ebadfec108ba3840b387957f162f65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/literals_vars.rs:367-372 | crates/perry-codegen/src/expr/this_super_call.rs:212-217 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/literals_vars.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc117190198d449d26dab4a73ef03898f3e9756229cf61e313243085e1f1513c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/object_literal.rs:288-293 | crates/perry-codegen/src/lower_call/new_alloc.rs:973-978 \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/perry-codegen/src/expr/object_literal.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"53545eb4dd6e81cec01efc2ebef75587245007b2c8ed61c57fc0fc6df6dda010"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/property_get.rs:618-623 | crates/perry-codegen/src/expr/property_get.rs:635-640 \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/perry-codegen/src/expr/property_get.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fb8dc98e2dd1d50da4f41d596337b4bd12091ae8c0a008bd616e653c82c142"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/property_get.rs:1027-1032 | crates/perry-codegen/src/expr/property_set.rs:743-748 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/property_get.rs\u0060 and \u0060crates/perry-codegen/src/expr/property_set.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 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/perry-codegen/src/expr/property_get.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b209f43aa1995d623074768da8c4e54dcabafca6977214babeb92cda1fe925"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): crates/perry-codegen/src/expr/static_method.rs:138-142 | crates/perry-codegen/src/lower_conditional.rs:159-164 \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/perry-codegen/src/expr/static_method.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe809a4b5a5d54c7d0b69d50362af49eb2dd9cde7c61f5a6012700984f5643c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/layout_families.rs:1502-1507 | crates/perry-codegen/src/layout_families/literal.rs:69-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/layout_families.rs"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"647449365587384b5a901269d7e87780e1b21938086e3af1fdb4a2e7d5f040d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/lower_call/method_override.rs:311-317 | crates/perry-codegen/src/lower_call/method_override.rs:326-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/method_override.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"315a9f3f9a4a3fb5bdb1fad6d60c11e946054ff2bb1aee68a11562cd044a411c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/lower_call/method_override.rs:1137-1142 | crates/perry-codegen/src/lower_call/scalar_method.rs:917-922 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/method_override.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/scalar_method.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 38 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/perry-codegen/src/lower_call/method_override.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"141904e6ba2bd893bc30f9dd8bbe712e57838991a7acd3b7945fd00ff0192e41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/lower_call/new.rs:337-342 | crates/perry-codegen/src/lower_call/new.rs:370-375 \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/perry-codegen/src/lower_call/new.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"facd24c396f955f13616c0a9c133d5460d516f65b96d2643e645d5dec2e17ae4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/lower_call/new.rs:711-716 | crates/perry-codegen/src/lower_call/new.rs:746-751 \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/perry-codegen/src/lower_call/new.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b70cf4115c1dfc14bc3e53f4a9583b933be74d321d38b0705fb58502e9219f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:425-430 | crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:1076-1081 \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/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf46be3fedb2a8b3dc2d6002c99de8784095767933841ff48b5d74994d5431b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 3): crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:290-292 | crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:640-645 | crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:821-826 \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/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"02483c97ae84618c340722f2e816f7dede9f5d89198fcce66f8de10cff573b4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/lower_call/property_get/map_set.rs:125-130 | crates/perry-codegen/src/lower_call/property_get/map_set.rs:209-214 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/property_get/map_set.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7eff29b3421f3986129b625e5f80698690d90823b8fbb16d1b94fef7eee1ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/lower_call/property_get/map_set.rs:154-159 | crates/perry-codegen/src/lower_call/property_get/map_set.rs:238-243 \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/perry-codegen/src/lower_call/property_get/map_set.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecbd9a84959f9c8bbc45b8e05a999e8b72c37fb9ae9f777b36f6325b683dbd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/lower_string_concat.rs:959-965 | crates/perry-codegen/src/lower_string_concat.rs:987-992 \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/perry-codegen/src/lower_string_concat.rs"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"26450a3db576a2497498f61d1c8d002a59bebf4fa1b6109ced71c90860801138"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/lower_string_method.rs:510-515 | crates/perry-codegen/src/lower_string_method.rs:1267-1272 \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/perry-codegen/src/lower_string_method.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ce5c43a3ee2e50fa9a6187c773fcab98dcebf998e781e0b1e8c0135ece8402"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/native_root_coverage/inline_birth.rs:156-161 | crates/perry-codegen/src/native_root_coverage/inline_birth.rs:187-192 \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/perry-codegen/src/native_root_coverage/inline_birth.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d4b363724a9db8ad1a0304f4ec8545fd7b5f1debab642a890b4b8ab796a921"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/stmt/counter_range.rs:93-98 | crates/perry-codegen/src/stmt/loops.rs:682-687 \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/perry-codegen/src/stmt/counter_range.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1684246ff3dd16b5e2e0e3af997d35cdb075e081e0c9f19a3d142444ea9c331"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:563-568 | crates/perry-codegen/src/stmt/loops.rs:802-807 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4b5935aea24e51ba85f8f4b08b8770c099dc8ad5770b8cfaac37cfc9b536f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:1254-1259 | crates/perry-codegen/src/stmt/loops.rs:1367-1372 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"821b5bdd3903d1c9692bb70e32899eb4a593a2e509db1bc5472489b5ae48182e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:3181-3188 | crates/perry-codegen/src/stmt/masked_window_region.rs:383-388 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/stmt/loops.rs\u0060 and \u0060crates/perry-codegen/src/stmt/masked_window_region.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":3181}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c13581317b9aaa75967432662662e9c5ff3a36cabaae697d89af825ae4cde6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 5): crates/perry-codegen/src/stmt/loops.rs:3727-3732 | crates/perry-codegen/src/stmt/loops.rs:7329-7332 | crates/perry-codegen/src/stmt/loops.rs:7406-7408 | crates/perry-codegen/src/stmt/masked_window_region.rs:781-783 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:1559-1564 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/stmt/loops.rs\u0060 and \u0060crates/perry-codegen/src/stmt/masked_window_region.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":3727}}}],"partialFingerprints":{"codehealthFindingId/v1":"8622a1c0d50cbfdd73d85a04d4fb1d9fe996c6d2ad668a620be3391ab87ddd00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/stmt/region_loop/guard.rs:537-542 | crates/perry-codegen/src/stmt/region_loop/guard.rs:640-645 \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/perry-codegen/src/stmt/region_loop/guard.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d59163cd95caeb74546a6afba88b1d8ec04cd482c3641d29b23e937d12e22a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/stmt/stable_packed_loop.rs:173-178 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:233-238 \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/perry-codegen/src/stmt/stable_packed_loop.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"305c17a20d947ad76e6b51184feb21afdf0093686c303cedd8fccc63fe60d1f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/type_analysis/pod.rs:200-205 | crates/perry-codegen/src/type_analysis/pod.rs:217-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/type_analysis/pod.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f9af786af0e34fef7e7ba980f2213cfae6be8a803b35f53d75dd35bbf3756e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/type_analysis_facts.rs:152-157 | crates/perry-hir/src/analysis/value_types.rs:1417-1422 \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/perry-codegen/src/type_analysis_facts.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3be6cec8bbfe314c50d807e3d9833156f4f226b7d145d397cd0aaefcb10956"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-component-host/src/sync_wasi/streams.rs:442-447 | crates/perry-component-host/src/sync_wasi/streams.rs:464-469 \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/perry-component-host/src/sync_wasi/streams.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"2516c078dab59b47f79c3fb2222334a691e281ef519e1e9a6f36cce9f892fb0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-container-compose/src/backend/apple.rs:131-136 | crates/perry-container-compose/src/backend/apple.rs:187-192 \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/perry-container-compose/src/backend/apple.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6850e3c3143ea733791f06def98d7ef1c0ad4e2b9217a4c11d1b0c849132c5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-container-compose/src/backend/apple.rs:350-355 | crates/perry-container-compose/src/backend/docker.rs:350-355 \u2014 before extracting anything, compare \u0060crates/perry-container-compose/src/backend/apple.rs\u0060 and \u0060crates/perry-container-compose/src/backend/docker.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 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/perry-container-compose/src/backend/apple.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5a63076c0eac3d516fd6987d74259afeeb2a5e12c0446fe2fad8c9f42b7d31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-ext-http/src/client_overload.rs:192-197 | crates/perry-ext-http/src/lib.rs:575-580 \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/perry-ext-http/src/client_overload.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6854d1f090fae1c54e4f65bf00646af536cd8befcb0db6ccda0942ec1b3f9a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 3): crates/perry-ext-http/src/response_headers.rs:68-71 | crates/perry-ext-http/src/response_headers.rs:76-81 | crates/perry-ext-http/src/response_headers.rs:100-105 \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/perry-ext-http/src/response_headers.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3df91aae24376f4539bf8993f43235021a26605477ff90db4a2f161878bab9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-ext-http/src/server/response.rs:1327-1332 | crates/perry-ext-http/src/server/response.rs:1383-1388 \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/perry-ext-http/src/server/response.rs"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bce7971e61373c0c973c7071ac935d557d45ee801243e9dd36ef01771aaceb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-ext-http/src/server/turnloop_h2/conn.rs:393-398 | crates/perry-http-server/src/conn.rs:184-189 \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/perry-ext-http/src/server/turnloop_h2/conn.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"6833e45adfd2d243d72ad6ad7616e93525a4d6823c86a3394e117150d77fd3a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-ext-net/src/jsvalue.rs:247-252 | crates/perry-ext-net/src/jsvalue.rs:292-297 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-net/src/jsvalue.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b30c0c1b61bcfb4faac033542e1fa34d3a0f67c87f127fdd2a3c4bd29a837f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-ext-net/src/payload_closed.rs:67-72 | crates/perry-ext-net/src/payload_closed.rs:87-92 \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/perry-ext-net/src/payload_closed.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"44aac4864c91cc5cf6043b7fb417afcfb265f95e83b6825df98de75b69fc9461"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-ext-net/src/payload_io.rs:611-616 | crates/perry-ext-net/src/payload_io.rs:649-654 \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/perry-ext-net/src/payload_io.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"da19f9afb1447a6343e8ebcdb8af111ee427da6527269627260dba93775bd46c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-ext-net/src/tls.rs:420-425 | crates/perry-ext-net/src/tls.rs:514-519 \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/perry-ext-net/src/tls.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aceb3f744fb185411459d8d76b20ea7c286bbc4bd81a94d8f45135103bfdbde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/destructuring/pattern_binding.rs:639-656 | crates/perry-hir/src/lower/stmt.rs:265-270 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/destructuring/pattern_binding.rs\u0060 and \u0060crates/perry-hir/src/lower/stmt.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 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/perry-hir/src/destructuring/pattern_binding.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"e658520444fa59b6d242d11ddba22119a8d23301c2cf79a76ee1fe8c929473d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/intrinsics/bare_builtins.rs:51-56 | crates/perry-hir/src/lower/expr_call/intrinsics/bare_builtins.rs:101-106 \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/perry-hir/src/lower/expr_call/intrinsics/bare_builtins.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ce4e0f591d50905b414945f45bfa900be26e43a5e714c788ae205c605d99bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/native_module.rs:489-494 | crates/perry-hir/src/lower/expr_member.rs:261-266 \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/perry-hir/src/lower/expr_call/native_module.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"44da2d9dc01828785c4105ca0fea91594eebbc1b73137d0afe56ecbad151612f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/native_module/object_statics.rs:13-18 | crates/perry-hir/src/lower/expr_call/static_and_instance.rs:16-21 \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/perry-hir/src/lower/expr_call/native_module/object_statics.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91cb1c178b25ffd1530dd1e6dcaa90f6b805205bf414a9ae11e1ae140fabf7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/native_module/reflect_statics.rs:26-31 | crates/perry-hir/src/lower/expr_call/native_module/reflect_statics.rs:77-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/native_module/reflect_statics.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cfbc83f4016affb1f4770fb56ba188369e70399ee9c3d23f9fb86485624e9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/stream.rs:84-89 | crates/perry-hir/src/lower/expr_new/non_ident.rs:47-52 \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/perry-hir/src/lower/expr_call/stream.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab85b9f658f3ab67ef303f6f7ea3551e4595535d3e95cbc2f44fe902c74318c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/stream.rs:113-118 | crates/perry-hir/src/lower/expr_new/non_ident.rs:76-81 \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/perry-hir/src/lower/expr_call/stream.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96f956265a70fde63da9ed956bb99e961cd47ebe2728d1e1a96a58eb5f7a53e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower/expr_member/member_tail.rs:531-536 | crates/perry-hir/src/lower/expr_member/member_tail.rs:566-571 \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/perry-hir/src/lower/expr_member/member_tail.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"441fd484347fdd34201de343c0d37631bef9df2102df9e0e1e9645d4c07eb676"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower/expr_member/stdlib_guard.rs:88-93 | crates/perry-hir/src/lower/expr_member/stdlib_guard.rs:134-139 \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/perry-hir/src/lower/expr_member/stdlib_guard.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea97860559bf4deb19fdc39826d3586fd2ecb35167c501e4157cfe1b7227c3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower/expr_object.rs:184-189 | crates/perry-hir/src/lower/expr_object.rs:521-526 \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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fd73fd94a1083fd8c398d9d8e75716e998493ca3ebcd91b6f9ce01adec760a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower/fn_ctor_env.rs:235-240 | crates/perry-hir/src/lower/fn_ctor_env.rs:264-269 \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/perry-hir/src/lower/fn_ctor_env.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e57dafa6039ceff76799aedfc3ace1f988a2e21794fd9b16bd32eb08b8bc04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower/module_decl.rs:1233-1238 | crates/perry-hir/src/lower/module_decl.rs:1310-1315 \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/perry-hir/src/lower/module_decl.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bed0ed6e956c6a4cfe056ce5933735f3de639dd555bc737ebca44660b1ca19f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower/module_decl/namespace.rs:314-319 | crates/perry-hir/src/lower/module_decl/namespace.rs:343-348 \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/perry-hir/src/lower/module_decl/namespace.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"23eb023b444a3c2612782e3d44346378890da962b4e1619b5cda8eacd80ac6e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower/shared_mutable_capture.rs:1354-1362 | crates/perry-hir/src/lower/shared_mutable_capture.rs:1372-1377 \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/perry-hir/src/lower/shared_mutable_capture.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"48aabc891acdcbd4c5e79654eb8f6249f19b89d62d4615a7e5f576946c7bf2a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs:76-81 | crates/perry-hir/src/lower_decl/body_stmt/detect.rs:76-81 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt/detect.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 133 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/perry-hir/src/lower/stmt_loops/for_await_targets.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a89b52538dc390ecf1b49606814237ce30a7efc0209e420b4e5afd08e0e45ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower/widget_decl.rs:404-409 | crates/perry-hir/src/lower/widget_decl.rs:1648-1653 \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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"a287581e35e15faf1b421602bae865c30993bc96db2ae1b40f2b15de4d8a9c41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 4): crates/perry-hir/src/lower/expr_new/helpers.rs:82-85 | crates/perry-hir/src/lower/widget_decl.rs:877-880 | crates/perry-hir/src/lower/widget_decl.rs:1126-1131 | crates/perry-hir/src/lower/widget_decl.rs:1203-1208 \u2014 there are 4 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_new/helpers.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"9436ce3454a8a3ef1ad2529aefafbf9b2df2391cd3b8726b9d19624fa5f49f26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower_decl/block.rs:150-155 | crates/perry-hir/src/lower_decl/block.rs:304-309 \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/perry-hir/src/lower_decl/block.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d785b862ee275b269f65eb55102f03782938eecfa477fade674dfaec7c0a924"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower_decl/block.rs:362-367 | crates/perry-hir/src/lower_decl/block.rs:413-418 \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/perry-hir/src/lower_decl/block.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e75b3e1cbdfa2016a40e012f81df2dcb8161ba8ca4b7f73edf8642fc0febb2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower_decl/class_decl.rs:357-362 | crates/perry-hir/src/lower_decl/class_decl/from_ast.rs:127-145 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower_decl/class_decl.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/class_decl/from_ast.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 548 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/perry-hir/src/lower_decl/class_decl.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8647777cf0fbd62226ab42ad4b259696ca4067a6ab8a3d2d397791dafd9cefd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower_decl/helpers.rs:496-501 | crates/perry-hir/src/lower_decl/helpers.rs:513-518 \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/perry-hir/src/lower_decl/helpers.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"86cc6293a8ce16c170a5fa530c3c157ae74280ea124203b7be90e0c0cb2535d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower_types.rs:1195-1202 | crates/perry-hir/src/lower_types.rs:1257-1262 \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/perry-hir/src/lower_types.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6050a88090e8da62d199fc4e8c15713079e854e0b07177448b2f83b521dd65a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 38): crates/perry-codegen/src/expr/array_literal.rs:310-317 | crates/perry-codegen/src/expr/bigint_set.rs:85-91 | crates/perry-codegen/src/expr/bigint_set.rs:197-203 | crates/perry-codegen/src/expr/bigint_set.rs:264-270 | crates/perry-codegen/src/expr/checked_super.rs:120-124 | crates/perry-codegen/src/expr/class_env.rs:156-161 | crates/perry-codegen/src/expr/compare.rs:136-141 | crates/perry-codegen/src/expr/compare.rs:478-483 | crates/perry-codegen/src/expr/compare.rs:877-882 | crates/perry-codegen/src/expr/inline_birth/fixed_alloc.rs:48-52 | crates/perry-codegen/src/expr/inline_birth/shared.rs:140-144 | crates/perry-codegen/src/expr/instance_misc1.rs:285-290 | crates/perry-codegen/src/expr/instance_misc1.rs:745-750 | crates/perry-codegen/src/expr/logical_collections.rs:487-493 | crates/perry-codegen/src/expr/logical_collections.rs:1742-1746 | crates/perry-codegen/src/expr/math_simple.rs:208-214 | crates/perry-codegen/src/expr/math_simple.rs:303-309 | crates/perry-codegen/src/expr/math_simple.rs:372-378 | crates/perry-codegen/src/expr/pod_record.rs:560-566 | crates/perry-codegen/src/expr/property_get.rs:538-544 | crates/perry-codegen/src/expr/property_get/composed_ics.rs:66-70 | crates/perry-codegen/src/expr/property_get/generic_dispatch.rs:702-710 | crates/perry-codegen/src/expr/property_get/helpers.rs:600-605 | crates/perry-codegen/src/expr/suffix_cursor.rs:59-63 | crates/perry-codegen/src/lower_call/new_alloc.rs:885-889 | crates/perry-codegen/src/lower_call/property_get/completed_object.rs:135-139 | crates/perry-codegen/src/lower_conditional.rs:110-115 | crates/perry-codegen/src/lower_string_concat.rs:288-293 | crates/perry-codegen/src/lower_string_method/char_code_at.rs:217-229 | crates/perry-codegen/src/native_value/materialize.rs:488-494 | crates/perry-codegen/src/stmt/loops.rs:551-557 | crates/perry-codegen/src/stmt/loops.rs:790-796 | crates/perry-codegen/src/stmt/loops.rs:3814-3820 | crates/perry-codegen/src/stmt/loops.rs:6784-6789 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:913-918 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:1058-1063 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:1231-1236 | crates/perry-codegen/src/stmt/string_length_loop.rs:209-214 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/array_literal.rs\u0060 and \u0060crates/perry-codegen/src/expr/bigint_set.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 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/perry-codegen/src/expr/array_literal.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9c590b8fe32ef237a044f469b8791beb68a96659648377f2b83b15e29f0d60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 17): crates/perry-codegen/src/expr/env_clones.rs:115-119 | crates/perry-codegen/src/expr/math_simple.rs:1241-1245 | crates/perry-codegen/src/expr/misc_methods.rs:338-342 | crates/perry-codegen/src/expr/misc_methods.rs:383-387 | crates/perry-codegen/src/expr/misc_methods.rs:405-409 | crates/perry-codegen/src/expr/misc_methods.rs:432-436 | crates/perry-codegen/src/expr/misc_methods.rs:494-498 | crates/perry-codegen/src/expr/misc_methods.rs:515-519 | crates/perry-codegen/src/expr/misc_methods.rs:536-540 | crates/perry-codegen/src/expr/misc_methods.rs:563-567 | crates/perry-codegen/src/expr/misc_methods.rs:639-643 | crates/perry-codegen/src/expr/os_uri_dates.rs:219-223 | crates/perry-codegen/src/expr/os_uri_dates.rs:249-253 | crates/perry-codegen/src/expr/os_uri_dates.rs:284-288 | crates/perry-codegen/src/expr/os_uri_dates.rs:344-348 | crates/perry-codegen/src/expr/string_regex_proc.rs:524-528 | crates/perry-codegen/src/expr/super_method.rs:97-101 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/env_clones.rs\u0060 and \u0060crates/perry-codegen/src/expr/misc_methods.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 55 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/perry-codegen/src/expr/env_clones.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6d2bbea35f2984feef983474809802b612ffc924b5197a74c7943019f418c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 16): crates/perry-codegen/src/expr/env_clones.rs:115-119 | crates/perry-codegen/src/expr/math_simple.rs:1241-1245 | crates/perry-codegen/src/expr/misc_methods.rs:338-342 | crates/perry-codegen/src/expr/misc_methods.rs:383-387 | crates/perry-codegen/src/expr/misc_methods.rs:405-409 | crates/perry-codegen/src/expr/misc_methods.rs:432-436 | crates/perry-codegen/src/expr/misc_methods.rs:464-469 | crates/perry-codegen/src/expr/misc_methods.rs:494-498 | crates/perry-codegen/src/expr/misc_methods.rs:515-519 | crates/perry-codegen/src/expr/misc_methods.rs:536-540 | crates/perry-codegen/src/expr/misc_methods.rs:563-567 | crates/perry-codegen/src/expr/misc_methods.rs:601-606 | crates/perry-codegen/src/expr/misc_methods.rs:639-643 | crates/perry-codegen/src/expr/os_uri_dates.rs:219-223 | crates/perry-codegen/src/expr/string_regex_proc.rs:524-528 | crates/perry-codegen/src/expr/super_method.rs:97-101 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/env_clones.rs\u0060 and \u0060crates/perry-codegen/src/expr/misc_methods.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 55 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/perry-codegen/src/expr/env_clones.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e55a70a5343f1b7c828d2588cdf684803e309e74de5d9118a33652130c2eb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 15): crates/perry-codegen/src/expr/env_clones.rs:90-94 | crates/perry-codegen/src/expr/misc_methods.rs:315-319 | crates/perry-codegen/src/expr/misc_methods.rs:363-367 | crates/perry-codegen/src/expr/misc_methods.rs:733-737 | crates/perry-codegen/src/expr/misc_methods.rs:871-875 | crates/perry-codegen/src/expr/misc_methods.rs:889-893 | crates/perry-codegen/src/expr/misc_methods.rs:921-925 | crates/perry-codegen/src/expr/misc_methods.rs:1052-1056 | crates/perry-codegen/src/expr/misc_methods.rs:1081-1085 | crates/perry-codegen/src/expr/os_uri_dates.rs:380-384 | crates/perry-codegen/src/expr/string_regex_proc.rs:62-66 | crates/perry-codegen/src/expr/string_regex_proc.rs:78-82 | crates/perry-codegen/src/expr/string_regex_proc.rs:324-328 | crates/perry-codegen/src/expr/string_regex_proc.rs:553-557 | crates/perry-codegen/src/expr/string_regex_proc.rs:573-577 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/env_clones.rs\u0060 and \u0060crates/perry-codegen/src/expr/misc_methods.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 55 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/perry-codegen/src/expr/env_clones.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"886d2f581e92397337063db1183cd7b5e43975b9888b98fe186202574ff2ff8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 10): crates/perry-codegen/src/codegen/entry_outline.rs:816-820 | crates/perry-codegen/src/codegen/fresh_class_templates.rs:103-107 | crates/perry-codegen/src/codegen/function_source_header.rs:227-231 | crates/perry-codegen/src/codegen/split_regions_facts.rs:368-372 | crates/perry-codegen/src/collectors/cjs_scaffolding.rs:202-206 | crates/perry-codegen/src/collectors/cjs_scaffolding.rs:435-439 | crates/perry-codegen/src/collectors/ptr_shape_returns.rs:404-408 | crates/perry-codegen/src/collectors/scalar_method_dispatch.rs:493-497 | crates/perry-codegen/src/collectors/scalar_method_dispatch.rs:547-551 | crates/perry-codegen/src/scope_env/mod.rs:231-235 \u2014 there are 10 copies across 8 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 10 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/entry_outline.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9dc1fb80410d013a7d4883db7399a68bd1bce05cba8dd994b8f2c62a954c77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 9): crates/perry-codegen/src/expr/calls/crypto_kdf.rs:71-75 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:109-113 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:240-244 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:315-319 | crates/perry-codegen/src/expr/misc_methods.rs:341-345 | crates/perry-codegen/src/expr/misc_methods.rs:407-411 | crates/perry-codegen/src/expr/misc_methods.rs:468-472 | crates/perry-codegen/src/expr/misc_methods.rs:565-569 | crates/perry-codegen/src/expr/misc_methods.rs:607-611 \u2014 there are 9 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 9 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/calls/crypto_kdf.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"7319dd8597db8138d4bb7c6e31f99b3e2c50ceb2acf53aeeef66f7bdb0752a46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 8): crates/perry-codegen/src/expr/array_literal.rs:487-492 | crates/perry-codegen/src/expr/byte_cell.rs:542-546 | crates/perry-codegen/src/expr/index_get/symbol_ic.rs:107-111 | crates/perry-codegen/src/expr/literals_vars.rs:132-137 | crates/perry-codegen/src/expr/mod.rs:2761-2766 | crates/perry-codegen/src/expr/static_method.rs:347-351 | crates/perry-codegen/src/scope_env/access.rs:86-91 | crates/perry-codegen/src/stmt/region_loop/guard.rs:630-635 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/array_literal.rs\u0060 and \u0060crates/perry-codegen/src/expr/index_get/symbol_ic.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 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/perry-codegen/src/expr/array_literal.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32dc37374e7b76ffa97db56d902b905fd9add28c5cf66649b24ec1b5078e914"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 8): crates/perry-codegen/src/lower_call/func_ref.rs:1147-1151 | crates/perry-codegen/src/lower_call/func_ref.rs:1221-1225 | crates/perry-codegen/src/lower_call/func_ref.rs:1297-1301 | crates/perry-codegen/src/lower_call/func_ref.rs:1389-1393 | crates/perry-codegen/src/lower_call/method_override.rs:1356-1360 | crates/perry-codegen/src/lower_call/method_override.rs:1440-1444 | crates/perry-codegen/src/lower_call/method_override.rs:1526-1530 | crates/perry-codegen/src/lower_call/method_override.rs:1613-1617 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/func_ref.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/method_override.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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/perry-codegen/src/lower_call/func_ref.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da83f4d3391e37b1f9575c94524c387f79d17d4145bc0a66f3a0eeba849eebf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): crates/perry-codegen/src/expr/calls/crypto_kdf.rs:45-49 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:72-76 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:110-114 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:241-245 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:316-320 | crates/perry-codegen/src/expr/calls/crypto_keys.rs:132-136 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:659-663 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/calls/crypto_kdf.rs\u0060 and \u0060crates/perry-codegen/src/expr/calls/crypto_misc.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 47 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/perry-codegen/src/expr/calls/crypto_kdf.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72292f68f845748c78c42853f3bbd93847115c8e2556e228c9b1dc3011ab6f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/perry-codegen/src/expr/array_push_own.rs:127-131 | crates/perry-codegen/src/expr/method_site.rs:138-142 | crates/perry-codegen/src/expr/method_site.rs:641-645 | crates/perry-codegen/src/expr/method_site.rs:965-969 | crates/perry-codegen/src/expr/typed_element.rs:412-416 \u2014 there are 5 copies across 3 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 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/array_push_own.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"7593ec0bde8d7d008408d6879029844e2f14b823849066a24c5196e2ae65b570"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 15): crates/perry-codegen/src/expr/calls/crypto_hash.rs:351-355 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:41-44 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:103-106 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:141-145 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:234-237 | crates/perry-codegen/src/expr/calls/crypto_keys.rs:190-195 | crates/perry-codegen/src/expr/calls/crypto_keys.rs:220-224 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:51-54 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:274-277 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:399-403 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:458-461 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:595-599 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:630-633 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:655-658 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:683-687 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/calls/crypto_kdf.rs\u0060 and \u0060crates/perry-codegen/src/expr/calls/crypto_misc.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 47 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/perry-codegen/src/expr/calls/crypto_hash.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bda645f0eea0a18d52e15c2b90e855b9ccac53ab1134cfc908159b5974b0db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/perry-codegen/src/expr/method_site.rs:136-140 | crates/perry-codegen/src/expr/method_site.rs:639-643 | crates/perry-codegen/src/expr/method_site.rs:963-967 | crates/perry-codegen/src/expr/typed_element.rs:410-414 | crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch_select.rs:113-117 \u2014 there are 5 copies across 3 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 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/method_site.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ffbc6858b3e49753e8e8db9a1ef27eefdde8a0836ff27c13ee0a0cce50d9a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/perry-hir/src/destructuring/var_decl_sources.rs:196-200 | crates/perry-hir/src/destructuring/var_decl_sources.rs:243-247 | crates/perry-hir/src/destructuring/var_decl_sources.rs:292-296 | crates/perry-hir/src/lower/stmt.rs:340-344 | crates/perry-hir/src/lower_decl/class_decl.rs:1191-1195 \u2014 there are 5 copies across 3 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 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/destructuring/var_decl_sources.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"9edf1336cbc2258ae041bd633a112a018efe1734ed34e5f6f37078b0bfa7b07d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/perry-hir/src/lower/builder_fold.rs:1255-1259 | crates/perry-hir/src/lower/builder_fold.rs:1290-1294 | crates/perry-hir/src/lower/builder_fold.rs:1296-1300 | crates/perry-hir/src/lower/builder_fold.rs:1452-1456 | crates/perry-hir/src/lower/builder_fold.rs:1463-1468 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/builder_fold.rs"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"98faf52d6f91b0842a4df284d4597e5cd607b39879d8bd49245c3af560ae9c64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/perry-codegen/src/expr/call_spread.rs:701-705 | crates/perry-codegen/src/expr/this_super_call.rs:812-816 | crates/perry-codegen/src/lower_call/method_override.rs:693-697 | crates/perry-codegen/src/lower_call/new_helpers.rs:258-262 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/call_spread.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d4b748dfbc5fbeaa8d213dace6098c5da3731d85b7375d44d732182e172b5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/perry-codegen/src/lower_call/native/mod.rs:395-399 | crates/perry-codegen/src/lower_call/native/mod.rs:450-454 | crates/perry-codegen/src/lower_call/property_get/static_dispatch.rs:461-465 | crates/perry-codegen/src/lower_call/web_storage.rs:36-40 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/native/mod.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/web_storage.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 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/perry-codegen/src/lower_call/native/mod.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"6067a8a8a154a0741cf2759d703b1cda463544bf51c2a57a5d3c13e6f0b0dac9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 5): crates/perry-codegen/src/lower_call/property_get.rs:123-127 | crates/perry-codegen/src/lower_call/property_get.rs:244-248 | crates/perry-codegen/src/lower_call/property_get/completed_object.rs:122-124 | crates/perry-codegen/src/lower_call/property_get/imported_object.rs:112-116 | crates/perry-codegen/src/lower_call/property_get/imported_object.rs:258-262 \u2014 there are 5 copies across 3 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 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/property_get.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf25cc5f87cbbb22e678060aac29d487952878721a6b06c53f0d5245b1dba3d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/perry-codegen/src/lower_string_method.rs:513-517 | crates/perry-codegen/src/lower_string_method.rs:881-885 | crates/perry-codegen/src/lower_string_method.rs:1050-1055 | crates/perry-codegen/src/lower_string_method.rs:1270-1274 \u2014 all 4 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/perry-codegen/src/lower_string_method.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c813174cd157768ce2402855a6ee5497d62744bf0b04df9ef92e76908ffe83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/perry-hir/src/lower/expr_call/native_module/object_statics.rs:14-18 | crates/perry-hir/src/lower/expr_call/static_and_instance.rs:17-21 | crates/perry-hir/src/lower/expr_member/member_tail.rs:532-536 | crates/perry-hir/src/lower/expr_member/member_tail.rs:567-571 \u2014 there are 4 copies across 3 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/native_module/object_statics.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f135750696073ddcd26cf5cfcb395a37c963142c2614091b306af6ab22bfa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs:62-66 | crates/perry-hir/src/lower_decl/body_stmt.rs:1261-1265 | crates/perry-hir/src/lower_decl/body_stmt/detect.rs:62-66 | crates/perry-hir/src/lower_decl/helpers.rs:16-20 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt/detect.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 133 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/perry-hir/src/lower/stmt_loops/for_await_targets.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"4595159e895a5db523bf9cf33b0675a4eb2abdbe00b2d9e26d62343a003f985a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/perry-codegen/src/codegen/function.rs:950-954 | crates/perry-codegen/src/codegen/method.rs:448-454 | crates/perry-codegen/src/codegen/method_static.rs:166-178 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/function.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 253 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/perry-codegen/src/codegen/function.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6b675846c45c1c22e15f178db585e5806e89d64478736e7b72690bd530fa33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 4): crates/perry-codegen/src/codegen/method_trampolines.rs:108-110 | crates/perry-codegen/src/codegen/method_trampolines.rs:154-158 | crates/perry-codegen/src/codegen/method_trampolines.rs:208-212 | crates/perry-codegen/src/codegen/method_trampolines.rs:411-415 \u2014 all 4 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/perry-codegen/src/codegen/method_trampolines.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4eec5da396144b26ab24b391758a6d9c87142860bba62a4bcc6578bcfba794"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 4): crates/perry-codegen/src/expr/array_methods.rs:186-191 | crates/perry-codegen/src/expr/array_methods.rs:394-398 | crates/perry-codegen/src/expr/arrays_finds.rs:632-635 | crates/perry-codegen/src/expr/arrays_finds.rs:740-744 \u2014 there are 4 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/array_methods.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffe8a7f0bfe38f80bf0b9ee95481d3a903beedf405b7198427d9ca4d88290e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 4): crates/perry-codegen/src/codegen/method_trampolines.rs:311-313 | crates/perry-codegen/src/expr/arrays_finds.rs:178-182 | crates/perry-codegen/src/expr/class_field_push.rs:74-80 | crates/perry-codegen/src/expr/u8_buffer_read.rs:303-308 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/method_trampolines.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"a175d3438409f1cd7033a62a9519a1ea60d87358edc700754f8562e359745941"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 7): crates/perry-codegen/src/expr/array_pop.rs:194-196 | crates/perry-codegen/src/expr/array_push.rs:1361-1363 | crates/perry-codegen/src/expr/i32_fast_path.rs:1175-1179 | crates/perry-codegen/src/expr/i32_fast_path.rs:1238-1242 | crates/perry-codegen/src/expr/index_get/guarded_array.rs:784-788 | crates/perry-codegen/src/expr/masked_window.rs:56-59 | crates/perry-codegen/src/expr/string_window.rs:58-60 \u2014 there are 7 copies across 6 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 7 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/array_pop.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e776ce7d8b14da3bc19586a3c42a74835c4c6c3633557e16cea6acc01c45e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/perry-codegen/src/expr/logical_collections.rs:792-798 | crates/perry-codegen/src/expr/logical_collections.rs:1504-1508 | crates/perry-codegen/src/expr/logical_collections.rs:1542-1559 \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/perry-codegen/src/expr/logical_collections.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff329c506c633455936508b1be9c19d4bf2ce150700f89ed04b174a912d47287"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/perry-codegen/src/expr/method_site.rs:963-967 | crates/perry-codegen/src/expr/private_field_site.rs:326-330 | crates/perry-codegen/src/expr/typed_element.rs:410-414 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/method_site.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"930f04c1cabd16748d4c226088d8ff65641c35773f965da8cf616088f22336e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 5): crates/perry-codegen/src/expr/property_get.rs:252-254 | crates/perry-codegen/src/expr/property_get.rs:337-339 | crates/perry-codegen/src/expr/static_field_meta.rs:470-474 | crates/perry-codegen/src/lower_call/method_override.rs:1195-1199 | crates/perry-codegen/src/lower_call/scalar_method.rs:670-674 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/method_override.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/scalar_method.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 38 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/perry-codegen/src/expr/property_get.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb959aadd6804546839d77d0ffad414a585c103546c33a6847036b6ea8efc7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 4): crates/perry-codegen/src/expr/static_method.rs:513-517 | crates/perry-codegen/src/lower_array_method.rs:1218-1222 | crates/perry-codegen/src/lower_call/console_promise.rs:788-790 | crates/perry-codegen/src/lower_call/property_get/builtin_kind_guard.rs:315-319 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/static_method.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a80d5a2bece9a778a54d5b9d42b8eb603fc5f1d5b88e03a56311aa3f6d3cf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/perry-codegen/src/expr/this_super_call.rs:119-124 | crates/perry-codegen/src/expr/this_super_call.rs:178-183 | crates/perry-codegen/src/stmt/region_loop/mod.rs:882-886 \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/perry-codegen/src/expr/this_super_call.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0105a8ce382378941be65c9fa2ef46833753fa021f144c7da5d1ef485fd9a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/perry-codegen/src/lower_call/method_override.rs:1276-1280 | crates/perry-codegen/src/lower_call/method_override.rs:1361-1365 | crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:1865-1869 \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/perry-codegen/src/lower_call/method_override.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"773afe451f6cd3fd19f5ca9c749c3851a158e254176c542e8230426cf14ae59a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/perry-codegen/src/lower_call/options/fetch.rs:553-557 | crates/perry-codegen/src/lower_call/options/fetch.rs:722-726 | crates/perry-codegen/src/lower_call/options/fetch.rs:835-839 \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/perry-codegen/src/lower_call/options/fetch.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"71154d75bcc055206c235b809034e73cc54a94ae2b63a761ce27f5026f835214"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/perry-ext-net/src/payload_closed.rs:65-69 | crates/perry-ext-net/src/payload_closed.rs:85-89 | crates/perry-ext-net/src/payload_closed.rs:107-111 \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/perry-ext-net/src/payload_closed.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6d24a4ef481ef1076a2a411904a1dc1f2325231cace8f01dc509bd4b72a9b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/perry-hir/src/lower/expr_assign.rs:801-805 | crates/perry-hir/src/lower/expr_call/static_and_instance.rs:233-239 | crates/perry-hir/src/lower/expr_member.rs:1125-1134 \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/perry-hir/src/lower/expr_assign.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2634a59196f22d218f26267e100c3c403775a4411f5fc84cbce5dd9ead1e7c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/globals.rs:928-932 | crates/perry-hir/src/lower/expr_call/module_static.rs:1295-1299 | crates/perry-hir/src/lower/expr_call/native_module/buffer_statics.rs:152-156 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/globals.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/module_static.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 296 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/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b818c53644c8f29b8ef5f8292d39339605d442510731b94687f74913b3ac28f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/perry-hir/src/lower/expr_member.rs:972-976 | crates/perry-hir/src/lower/expr_member.rs:1060-1064 | crates/perry-hir/src/lower/stmt.rs:519-523 \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/perry-hir/src/lower/expr_member.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"427889b33c5fd6aa8617bf99d8ed8a40ed051ec66382fdb4509ef7aecb36a610"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen-arkts/src/widgets/foreach.rs:36-40 | crates/perry-codegen-arkts/src/widgets/scroll.rs:199-203 \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/perry-codegen-arkts/src/widgets/foreach.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"217c49008a93bc9a02435704eedc35c94e2c559da6e996387c84163b776d2d20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen-glance/src/emit.rs:703-707 | crates/perry-codegen-wear-tiles/src/emit.rs:468-472 \u2014 before extracting anything, compare \u0060crates/perry-codegen-glance/src/emit.rs\u0060 and \u0060crates/perry-codegen-wear-tiles/src/emit.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 144 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/perry-codegen-glance/src/emit.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae80af56908ec60627fd3a00b1e5815c0e1a0b5c39d6b4ed18e5040e28aba33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/builtin_proto.rs:322-326 | crates/perry-codegen/src/expr/method_site.rs:674-678 \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/perry-codegen/src/builtin_proto.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e2e21fed7fb94e18385233ea8dbbbe29483e90430eeada812c0def75ea7c09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/codegen/artifacts.rs:395-399 | crates/perry-codegen/src/codegen/export_value_wrappers.rs:182-188 \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/perry-codegen/src/codegen/artifacts.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d72acbdb7f2d04fff93d4968ffc723e6e69808b75137c1dcb461a657c02096"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/codegen/closure.rs:324-328 | crates/perry-codegen/src/codegen/closure.rs:370-374 \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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84b9dbf521da8cec6502e7b44c367e25946234bb815b05acfee55c13b7a4f2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/codegen/export_value_wrappers.rs:227-231 | crates/perry-codegen/src/codegen/export_value_wrappers.rs:291-295 \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/perry-codegen/src/codegen/export_value_wrappers.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94003793d581f22d80078b900e4c51ddf69a58d21d331d2fd66f57e66568663"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/codegen/function.rs:298-302 | crates/perry-codegen/src/codegen/method_trampolines.rs:97-101 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/function.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method_trampolines.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 96 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/perry-codegen/src/codegen/function.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"04dd4e5c527962627b31df88e707eb06277761ff7dcf2e968d6caceca2b01260"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/codegen/function.rs:309-313 | crates/perry-codegen/src/codegen/function.rs:506-510 \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/perry-codegen/src/codegen/function.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"814a058ae0db325abcb4fec8f1659d0bf751a2fd31953dc2eb35b01a19ce4ab7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/codegen/function.rs:764-768 | crates/perry-codegen/src/codegen/method_static.rs:79-83 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/function.rs\u0060 and \u0060crates/perry-codegen/src/codegen/method_static.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 268 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/perry-codegen/src/codegen/function.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6132ead2ebb7197901f54cf5ece3585b5b2380224cd1a45748fcff94b203240"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/codegen/mod.rs:1938-1942 | crates/perry-codegen/src/codegen/mod.rs:1987-1991 \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/perry-codegen/src/codegen/mod.rs"},"region":{"startLine":1938}}}],"partialFingerprints":{"codehealthFindingId/v1":"217821a0fc406bb6c0961dcf31f8362ae95d957e919435e6b0651c3bf1c43e3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/codegen/source_need/flow.rs:1698-1702 | crates/perry-codegen/src/codegen/source_need/flow.rs:1766-1770 \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/perry-codegen/src/codegen/source_need/flow.rs"},"region":{"startLine":1698}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea3f8295551321e5fa126f236e7bda600811fc083510b2284fbd32032f28a11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/codegen/split_regions.rs:481-485 | crates/perry-codegen/src/collectors/typed_locals.rs:126-130 \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/perry-codegen/src/codegen/split_regions.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"782def04d7619ff11d45c3f8a3b711cb0a6ad26baefe75ec7add9aad31fda9c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/codegen/static_constfn.rs:37-41 | crates/perry-codegen/src/codegen/static_constfn.rs:572-576 \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/perry-codegen/src/codegen/static_constfn.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c0c2efca4cfee3ecd0d4a92a199b7d76c7eb68060fc0113d53a4de720af76c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/codegen/static_fields.rs:156-160 | crates/perry-codegen/src/codegen/static_fields.rs:292-296 \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/perry-codegen/src/codegen/static_fields.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"1460b93179bda5849e99b16c8eec16502e88348f59097fb0ec34189a87b0381c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/codegen/static_shape_ids.rs:701-705 | crates/perry-codegen/src/codegen/static_shape_ids.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/static_shape_ids.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be00f4605832a67c3e200331f81a44f019c5478b461bc7edb3a9d4281446d8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/codegen/typed_abi.rs:101-105 | crates/perry-codegen/src/expr/proven_view_guarded.rs:101-105 \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/perry-codegen/src/codegen/typed_abi.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff0f5248bb96c56885f11c9a2c5c5ee4f212a5adfc766ae000072e9fdbdd853"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/collectors/ptr_shape_elements.rs:797-801 | crates/perry-codegen/src/collectors/ptr_shape_elements.rs:1011-1015 \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/perry-codegen/src/collectors/ptr_shape_elements.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"71aec3236bb1738ca0e463d4d80ecc7f740ad0ee1a21b1d01d91f83b4e21a448"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/dialect/mod.rs:875-879 | crates/perry-codegen/src/dialect/mod.rs:1013-1017 \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/perry-codegen/src/dialect/mod.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be6e22dc3c36feb540c3c9b13f350713eb60bf23706c585049a86b286621bd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/dialect/mod.rs:960-970 | crates/perry-codegen/src/dialect/mod.rs:1064-1068 \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/perry-codegen/src/dialect/mod.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"316225bee1034fa74e362b3e9493799a972ca6af1ce60e7fd6adc4dfd19ec7a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/array_literal.rs:439-443 | crates/perry-codegen/src/expr/array_literal.rs:453-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/array_literal.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7add4f05f092a2124a04b3b1904807e011b5867f7388b69d6d4327511182e2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): crates/perry-codegen/src/expr/array_methods.rs:429-433 | crates/perry-codegen/src/expr/instance_misc1.rs:791-795 | crates/perry-codegen/src/expr/proxy_reflect.rs:788-791 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/array_methods.rs\u0060 and \u0060crates/perry-codegen/src/expr/instance_misc1.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 67 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/perry-codegen/src/expr/array_methods.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace8668e912277c7caf532d6fd027030b0f45d20fe56d43bafca798cf1e4d1f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/arrays_finds.rs:890-894 | crates/perry-codegen/src/expr/arrays_finds.rs:898-902 \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/perry-codegen/src/expr/arrays_finds.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d403d2d301f3308ed835bffd8273eb0ae6fc75e34bac73d55dedcfed85e8e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 4): crates/perry-codegen/src/expr/binary.rs:88-92 | crates/perry-codegen/src/expr/binary.rs:101-105 | crates/perry-codegen/src/lower_call/buffer_intrinsic.rs:482-484 | crates/perry-codegen/src/stmt/loops.rs:6792-6796 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/binary.rs\u0060 and \u0060crates/perry-codegen/src/stmt/loops.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 33 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/perry-codegen/src/expr/binary.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a1108b3d83fd6cb0c161075f4b5f5ed1b90558c33717dae7ca505a50148997"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/binary.rs:878-882 | crates/perry-codegen/src/expr/binary.rs:918-922 \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/perry-codegen/src/expr/binary.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b0c756ff813df7e585b7a1be3a9eb51ecc42c63b48ae1576ec19ba72fdf371"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/byte_cell.rs:289-293 | crates/perry-codegen/src/expr/byte_cell.rs:546-550 \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/perry-codegen/src/expr/byte_cell.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"513abab6f88b95ef1242c5f639cee7c8feecd0a732577e94d99b3f747e39317b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/calls/crypto_misc.rs:94-98 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:278-282 \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/perry-codegen/src/expr/calls/crypto_misc.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"75de9035287c992f788659fed24bfa7f6a66f3cdada4c6c49bd02e8edff1ea01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/calls/fs.rs:450-455 | crates/perry-codegen/src/expr/calls/fs.rs:466-470 \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/perry-codegen/src/expr/calls/fs.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"289d501af65bfe41058819dade02e9ce80d5900237ead5ed7fc1e6a5f38e902f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/child_proc.rs:254-261 | crates/perry-codegen/src/expr/child_proc.rs:418-422 \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/perry-codegen/src/expr/child_proc.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"70bb6d1cb4b63c25d0f62e85805cbf7a992d0f8308a556c94f13f2f7d33666ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/child_proc.rs:451-456 | crates/perry-codegen/src/expr/child_proc.rs:489-493 \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/perry-codegen/src/expr/child_proc.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ece890569239da6ec48417821829318b1fb1c0ab34444ee93532c7fc5ad7fe0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/compare.rs:962-969 | crates/perry-codegen/src/expr/compare_short_string.rs:21-25 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/compare.rs\u0060 and \u0060crates/perry-codegen/src/expr/compare_short_string.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 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/perry-codegen/src/expr/compare.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"898718d8185ba1fa5a814ed633316ea9f3acbfdcb37ae231bbe2bebf2fa44ec8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): crates/perry-codegen/src/expr/compare.rs:1000-1004 | crates/perry-codegen/src/expr/compare.rs:1018-1022 | crates/perry-codegen/src/expr/compare.rs:1036-1038 \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/perry-codegen/src/expr/compare.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31c93a9f8e8c57d940d1aacbde91d23485ca4e04a93d058cd31a69851205f0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/i32_fast_path.rs:1410-1414 | crates/perry-codegen/src/expr/i32_fast_path.rs:1639-1643 \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/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":1410}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa70e2269344b076efaf8eaed3ae7aa1c02a2a4ef4d9b90b0e2169b0ea32638"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/index.rs:415-419 | crates/perry-codegen/src/proto_constants.rs:1415-1419 \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/perry-codegen/src/expr/index.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a1cdef58ffc45ae16d41cacf39d7018af5abec276d805693113a97d2c5e9f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/index_get.rs:458-462 | crates/perry-codegen/src/expr/index_get.rs:1447-1451 \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/perry-codegen/src/expr/index_get.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"2939375d5030ad86b45312e8c0609d944170ad4009ba9ecd81b8699d3d9cd784"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/index_get/guarded_array.rs:885-889 | crates/perry-codegen/src/expr/index_get/guarded_array.rs:962-966 \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/perry-codegen/src/expr/index_get/guarded_array.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"367e4f70a937886ae10cb3934bc5b990d40f9303794eb32d055e4f15936f2589"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs:707-712 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:1061-1065 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs\u0060 and \u0060crates/perry-codegen/src/stmt/stable_packed_loop.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 51 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/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e997a10c8260012d75724d8ca428d630724a448ba15e204552d5b2753d73543"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/index_set_guarded.rs:269-273 | crates/perry-codegen/src/expr/index_set_guarded.rs:323-328 \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/perry-codegen/src/expr/index_set_guarded.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"30afb99e38d4d015352cb9dd28857eaf434759efa707e298eb231f7e9cc4698a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/index_set_guarded.rs:301-305 | crates/perry-codegen/src/expr/index_set_guarded.rs:377-383 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/index_set_guarded.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c00ce457255a748902125cfdb3d0af8c2ca6d3e19113dbe53d7de27beddbad3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/instance_misc1.rs:837-845 | crates/perry-codegen/src/expr/instance_misc1.rs:867-871 \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/perry-codegen/src/expr/instance_misc1.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a264691d42b2320a6db1a2d6c1efdf291bb42c5b17b221ef36469a468ba315"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/layout_read.rs:668-672 | crates/perry-codegen/src/expr/layout_read.rs:811-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/perry-codegen/src/expr/layout_read.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"edde72fa320b8c58a4815b52cdfbb0bd1a34fd27da6bbb886ce36dddfae5b406"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/literals_vars.rs:37-41 | crates/perry-codegen/src/scope_env/access.rs:96-100 \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/perry-codegen/src/expr/literals_vars.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d3af3a1c0b712ebbadb0db4cce98b28dcc19fbfad1eee60d4e7f3104cf4c9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/method_site.rs:823-827 | crates/perry-codegen/src/stmt/region_loop/guard.rs:440-444 \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/perry-codegen/src/expr/method_site.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ee2bdf7b9f6b591337bae8e2518976b1e87af16eafb016afa93500638715ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/misc_methods.rs:821-826 | crates/perry-codegen/src/expr/misc_methods.rs:842-846 \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/perry-codegen/src/expr/misc_methods.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49240c50eab2ca7a3295b9c42be12722d7febfc2a930bb88b469ef39fb39c68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/native_memory.rs:135-139 | crates/perry-codegen/src/expr/native_memory.rs:157-161 \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/perry-codegen/src/expr/native_memory.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea6cf2eeda037c9427db676e4e07f48af3eb7ac97dbd11cea6ae180a5029254"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/property_get.rs:1374-1378 | crates/perry-codegen/src/expr/property_get.rs:1538-1542 \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/perry-codegen/src/expr/property_get.rs"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68b2afc47cc69c1950f8782413993cc7cbdcb759a142964fa735e10bb59835a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/static_field_meta.rs:100-104 | crates/perry-codegen/src/expr/static_field_meta.rs:140-144 \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/perry-codegen/src/expr/static_field_meta.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"480492325895f713b2e50ea8d49f0aa68b63e0e8d4fe071e15a70e69036b41ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/static_field_meta.rs:139-143 | crates/perry-codegen/src/expr/typed_array_rmw.rs:298-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/perry-codegen/src/expr/static_field_meta.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cb7539b6d7db00a0d7f8ccb4483e5b4b91cea5fdf062c476dc13ce66d51797"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/this_super_call.rs:1014-1018 | crates/perry-codegen/src/expr/this_super_call.rs:1096-1100 \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/perry-codegen/src/expr/this_super_call.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"788ce4a991e23c142092889139e44f5d5a9fe16a47b7f0c6e0c44c486ccf0ea2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/u8_buffer_read.rs:143-147 | crates/perry-codegen/src/expr/u8_buffer_read.rs:355-359 \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/perry-codegen/src/expr/u8_buffer_read.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7f1200acb0a60a6d5a989c7ad7ea202a85c0229b07736252ba72e5e2e36362"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/lower_call/func_ref.rs:222-226 | crates/perry-codegen/src/lower_call/func_ref.rs:280-284 \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/perry-codegen/src/lower_call/func_ref.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"c112c4d5cf85df221464624ad18b692c802c551b519a303a565e090babe521c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/lower_call/inline_birth_invariant.rs:23-27 | crates/perry-codegen/src/lower_call/inline_birth_invariant.rs:138-142 \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/perry-codegen/src/lower_call/inline_birth_invariant.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9cd4627025212a53d927b21ee5d2e5e34fdd0859cf08085f08dab6b545f23e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/lower_call/method_override.rs:1195-1199 | crates/perry-codegen/src/stmt/versioned_indexed_loop.rs:263-267 \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/perry-codegen/src/lower_call/method_override.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdfcb5daa87618fc1d07b06607c4acd41ff4d37bb9890df9b49e2294d7d282c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:401-406 | crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:1053-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"82626e5019a80b9c7e6a9f3b93b366f07365a45b3ae8fb950071bb21c3d83d1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/lower_call/scalar_method.rs:323-327 | crates/perry-codegen/src/lower_call/scalar_method.rs:427-431 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/scalar_method.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce73440c13b8929fdb1cf04cbbbbcf7429146c25cd3f3e289c3e81590059f321"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/lower_string_concat.rs:279-283 | crates/perry-codegen/src/lower_string_method/char_code_at.rs:167-171 \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/perry-codegen/src/lower_string_concat.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ea5ed4504924274ed3e4de79aaa3c9f622a9b2e01ead437546968b6d39d0ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/proto_constants.rs:232-236 | crates/perry-codegen/src/stmt/region_loop/guard.rs:628-632 \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/perry-codegen/src/proto_constants.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3ef0536712e50b2d02c7594e7199a45c657e10eabebb89b2c90e0537f2218a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 4): crates/perry-codegen/src/proto_constants.rs:246-249 | crates/perry-codegen/src/proto_constants.rs:252-256 | crates/perry-codegen/src/proto_constants.rs:590-593 | crates/perry-codegen/src/proto_constants.rs:596-600 \u2014 all 4 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/perry-codegen/src/proto_constants.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"069fe5a74bc5f6ec0d2274a49af89166e0ece271a335441e863f44be3238c6af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/stmt/let_scalar_new.rs:239-243 | crates/perry-codegen/src/stmt/let_scalar_new.rs:272-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/let_scalar_new.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fb3eca9d4cdb0671ed6fd1c64d360fedf2703103c2a1b656153bf6cc4a15b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:5165-5169 | crates/perry-codegen/src/stmt/loops.rs:5253-5257 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":5165}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee39fb4c76f38dbd24244893de0e778751e431bf78a6ca6fd89a2645a637b78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:5487-5491 | crates/perry-codegen/src/stmt/loops.rs:5557-5561 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":5487}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3bdd00b2fb3c91863d75b0a8ad5f638e69d2a6d15bf09e036c598126e674b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:6822-6827 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:1232-1236 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/stmt/loops.rs\u0060 and \u0060crates/perry-codegen/src/stmt/stable_packed_loop.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 79 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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":6822}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2205b036f735968408623aad79915acacd013e36e2a31f2d9b650b21052e8fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:7627-7632 | crates/perry-codegen/src/stmt/loops/i32_counter.rs:29-33 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":7627}}}],"partialFingerprints":{"codehealthFindingId/v1":"1764bbcfdccbcd5a9543ead933cb7f65087035b8bcf7a05b650dcae1b373fb78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/stmt/region_loop/mod.rs:537-541 | crates/perry-codegen/src/stmt/region_loop/mod.rs:1223-1227 \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/perry-codegen/src/stmt/region_loop/mod.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"86036baf35d0900004a86ba29320de47ba081717875ef1dc12522b6744386954"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/stmt/try_stmt.rs:298-302 | crates/perry-codegen/src/stmt/try_stmt.rs:325-329 \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/perry-codegen/src/stmt/try_stmt.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e8f23c5421dd1ead48a7247ca731a1f4ce1d56cf61e42a9a640d1d67f88347"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 4): crates/perry-container-compose/src/backend/apple.rs:99-101 | crates/perry-container-compose/src/backend/apple.rs:162-164 | crates/perry-container-compose/src/backend/docker.rs:103-107 | crates/perry-container-compose/src/backend/docker.rs:171-175 \u2014 before extracting anything, compare \u0060crates/perry-container-compose/src/backend/apple.rs\u0060 and \u0060crates/perry-container-compose/src/backend/docker.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 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/perry-container-compose/src/backend/apple.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a9a4e45551bd86f67b190b0c59cc4865342a29ad17c4f6ab38f7d340540dd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-container-compose/src/compose.rs:338-342 | crates/perry-container-compose/src/compose.rs:800-804 \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/perry-container-compose/src/compose.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1cf4c87f1019a5ba01d8cfcabd7be18fe56f03af5f5b8e65252daaa6d4c7188"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-ext-cheerio/src/lib.rs:275-279 | crates/perry-ext-cheerio/src/lib.rs:362-366 \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/perry-ext-cheerio/src/lib.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abc9573da9749aaf2a159d1344b42c2ad6ee90536572f3d9d115033376f5bd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-ext-http/src/server/bun_server.rs:682-686 | crates/perry-ext-ws/src/server.rs:403-407 \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/perry-ext-http/src/server/bun_server.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2fdd1a31e93b329bbfe2fc44c18583a271c7c79c81aef180122bc569292474"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-ext-http/src/server/response.rs:817-821 | crates/perry-ext-http/src/server/response.rs:859-863 \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/perry-ext-http/src/server/response.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bac725fd9a4c2e51b79b05da5e627d394d115cd942a7f66b270917037aba3d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-ext-zlib/src/stream.rs:359-363 | crates/perry-ext-zlib/src/stream.rs:377-381 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-zlib/src/stream.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"7511a1c19013fddb11dd23253e804135f88052a5ba7cb0fa958e784fc067432d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-gc-effects/src/instructions.rs:401-405 | crates/perry-gc-effects/src/instructions.rs:479-483 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-gc-effects/src/instructions.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"613c85394852b29a1062628a9997de9d0c43d187ffb692b474928cb308d1e2f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/destructuring/var_decl/native_fetch.rs:487-491 | crates/perry-hir/src/destructuring/var_decl/native_fetch.rs:526-530 \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/perry-hir/src/destructuring/var_decl/native_fetch.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd80d8b9ffc9550fede418e37ccf8da6d78f3f6b0df3d2258e0ae82559b71893"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/js_transform/imports.rs:1000-1006 | crates/perry-hir/src/js_transform/imports.rs:1110-1114 \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/perry-hir/src/js_transform/imports.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01b044e5162c44e9611311e294c49c8b2a531eec779627c6bdd9e31d322a017"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/js_transform/local_natives.rs:1055-1059 | crates/perry-hir/src/js_transform/local_natives.rs:1254-1258 \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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"2137dc71fca2daac134dfd954b666b46424bf76bb6c46cc224319eaa978a3e09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/lower/builder_fold.rs:157-161 | crates/perry-hir/src/lower/expr_call/intrinsics/require.rs:161-165 \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/perry-hir/src/lower/builder_fold.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03d76cf96e7222ed51d814996b2a1f4fa017e0e0fe35d2fbd40bf5659727d2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/lower/expr_assign.rs:43-47 | crates/perry-hir/src/lower/lower_expr/helpers.rs:316-320 \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/perry-hir/src/lower/expr_assign.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8df965e20c8efbd15cb2bbc7333baf230ddffbb54e3663883e74b2bee5978a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/lower/expr_assign.rs:142-146 | crates/perry-hir/src/lower_patterns.rs:585-589 \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/perry-hir/src/lower/expr_assign.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26b412415ebeeefc14112a58fe9d717120e49cc1d5ef43731697e363aee9a55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/lower/expr_assign.rs:1016-1020 | crates/perry-hir/src/lower/expr_member/member_tail.rs:893-900 \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/perry-hir/src/lower/expr_assign.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4ee79018d925706c2b30ebb55a333fa8a592f3b89f9eaffbc328be7ffa2aaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs:561-565 | crates/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs:661-665 \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/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bc56d6b69b2ae36e4979cabb9538a8b01d065be6b395f6f781ffb3bc2f2844"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/intrinsics/namespace_static.rs:152-156 | crates/perry-hir/src/lower/expr_call/module_static.rs:17-21 \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/perry-hir/src/lower/expr_call/intrinsics/namespace_static.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51706b4f52e48ee4d398e61cde5c2bbb4c9de2434ac4dc180d10911d94cbed6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/local_array_methods.rs:837-841 | crates/perry-hir/src/lower/expr_call/local_array_methods.rs:979-984 \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/perry-hir/src/lower/expr_call/local_array_methods.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba66ebb6e704497043d48bd749a0eb5f36d035bdba83ec6ef4812e12d8df4f50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/textencoder.rs:26-30 | crates/perry-hir/src/lower/expr_call/url_date_instance.rs:24-28 \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/perry-hir/src/lower/expr_call/textencoder.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b93c8fa3575602698196185e2f14a6338d9399b93f1ef88b4a85c71e6a13fde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/lower/lower_expr/arm_unary.rs:481-485 | crates/perry-hir/src/lower/lower_expr/arm_unary.rs:518-522 \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/perry-hir/src/lower/lower_expr/arm_unary.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"d788c2922bcc8c66467adbfbc86c14dd02900363fc095dfeba582f0e783820fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/lower/stmt.rs:340-344 | crates/perry-hir/src/lower_decl/class_decl.rs:680-684 \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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"537344bff096bba56c377aef60b89a1ce5d4497099ff53d6c6eb9f68478f9a6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/lower/stmt.rs:1568-1572 | crates/perry-hir/src/lower_decl/body_stmt.rs:1106-1111 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 308 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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e107f83be3ed6ee425e6ef52b79eb0c6e08ab70097f848e8f792f2f601e813"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/lower/stmt.rs:1573-1577 | crates/perry-hir/src/lower_decl/body_stmt.rs:1112-1116 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 308 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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b18f76a389b26e9640985da55c3537f65a8517da00cf41fa458e6f537163a3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops.rs:1230-1234 | crates/perry-hir/src/lower_decl/body_stmt.rs:1719-1723 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt.rs\u0060 as WHOLE FILES: this scan already matched 28 separate duplicated blocks between them, totalling at least 540 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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"8baed159fd9c6f72af310ec823ccf348bac51bd9d3eb95deae62977740a762c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): crates/perry-hir/src/lower_decl/class_field_assign.rs:173-175 | crates/perry-hir/src/lower_decl/class_validation.rs:56-60 | crates/perry-hir/src/lower_types/extract.rs:654-658 \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/perry-hir/src/lower_decl/class_field_assign.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"645d240726d5c425a38e55b3c0ceab687b9e1152cfa77954a969b0d2705badd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/lower_decl/interface_decl.rs:146-150 | crates/perry-hir/src/lower_decl/interface_decl.rs:164-170 \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/perry-hir/src/lower_decl/interface_decl.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"774102cd60b2f0daaf21e226c60f84e5efea492ae33e237e9739d6611066a6d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/solid_jsx.rs:534-538 | crates/perry-hir/src/solid_jsx/native.rs:85-89 \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/perry-hir/src/solid_jsx.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57bd10c76378b616a018c0d57c4040b0a1fd1ab724a3518aebf0e10dc3b5783"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2): crates/perry-codegen-arkts/src/set_hidden.rs:188-236 | crates/perry-codegen-arkts/src/view_builders.rs:254-302 \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/perry-codegen-arkts/src/set_hidden.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e21791de575c72771e2a6e0dd45864235b404a162444921bb77f6fd408b99af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen-glance/src/emit.rs:744-751 | crates/perry-codegen-wear-tiles/src/emit.rs:489-496 \u2014 before extracting anything, compare \u0060crates/perry-codegen-glance/src/emit.rs\u0060 and \u0060crates/perry-codegen-wear-tiles/src/emit.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 144 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/perry-codegen-glance/src/emit.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"4deec6ec014adaefa5f7f2ce471ae6cf1585934121e39a0511e12aaae7a62075"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen-js/src/lib.rs:210-215 | crates/perry-codegen-wasm/src/lib.rs:98-103 \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/perry-codegen-js/src/lib.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d69c7450e006816cacaa4cb84bc57cfca355d89537859edb509e43730054f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/perry-codegen/src/collectors/int_valued_ta_locals.rs:176-186 | crates/perry-codegen/src/expr/binary.rs:1160-1170 | crates/perry-codegen/src/stmt/number_local_loop.rs:256-266 \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/perry-codegen/src/collectors/int_valued_ta_locals.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"88174f977f7646c74a747ed4c659865758e081cf7696b981ee1faf39d7abd44a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/perry-codegen/src/collectors/ptr_numarray.rs:122-126 | crates/perry-codegen/src/collectors/ptr_shape.rs:161-165 | crates/perry-codegen/src/expr/slot_rep.rs:252-256 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/ptr_numarray.rs\u0060 and \u0060crates/perry-codegen/src/collectors/ptr_shape.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 165 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/perry-codegen/src/collectors/ptr_numarray.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"682d5d01522181a85f18745b650915496c390729b42e496b597c895cb364e70e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/bigint_set.rs:329-338 | crates/perry-codegen/src/expr/math_simple.rs:42-51 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/bigint_set.rs\u0060 and \u0060crates/perry-codegen/src/expr/math_simple.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 205 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/perry-codegen/src/expr/bigint_set.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e75daede768f8228b5e56e8196bd3ba884cb58715e2105767872d15d550340a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/bigint_set.rs:347-356 | crates/perry-codegen/src/expr/math_simple.rs:62-71 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/bigint_set.rs\u0060 and \u0060crates/perry-codegen/src/expr/math_simple.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 205 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/perry-codegen/src/expr/bigint_set.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"7802ca150d074c83726d01040b886416fbb2226bf2589260b6b0e035f2de8312"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-codegen/src/expr/bigint_set.rs:369-382 | crates/perry-codegen/src/expr/math_simple.rs:102-115 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/bigint_set.rs\u0060 and \u0060crates/perry-codegen/src/expr/math_simple.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 205 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/perry-codegen/src/expr/bigint_set.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff337e988d9e9d4d2cc4681b9bad87ece2ef4b876f245d755000af7d6ebbbb6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-codegen/src/expr/bigint_set.rs:404-410 | crates/perry-codegen/src/expr/math_simple.rs:141-147 | crates/perry-codegen/src/native_value/pod.rs:306-312 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/bigint_set.rs\u0060 and \u0060crates/perry-codegen/src/expr/math_simple.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 205 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/perry-codegen/src/expr/bigint_set.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d22d8eec167eae0076838636972a5c0b9a82a3c35dcb8261d03884a18d7018"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/family_slot.rs:120-124 | crates/perry-codegen/src/expr/private_field_site.rs:252-256 \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/perry-codegen/src/expr/family_slot.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9b97899caabd9e3f259b7e2a08d01b7c5dc2ebff71622fd216477cc741fce9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/expr/i32_fast_path.rs:584-592 | crates/perry-codegen/src/expr/ta_param_f64_read.rs:46-54 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/i32_fast_path.rs\u0060 and \u0060crates/perry-codegen/src/expr/ta_param_f64_read.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 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/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3316e23d3081ce6b43f5c9fc90a0daa22290928adcfd7e7e19bb4a82ac7bd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/index_get.rs:233-242 | crates/perry-codegen/src/lower_call/early_branches.rs:81-90 \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/perry-codegen/src/expr/index_get.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"384057b2ad008fd5da57238361ead58cbe7da39d268b94c7f3c2682256ee9e67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/index_get/guarded_array.rs:732-737 | crates/perry-codegen/src/expr/index_set.rs:220-225 \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/perry-codegen/src/expr/index_get/guarded_array.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c01356cbc992715cbb6df8ca7da9dda40f76b001fb54bc03f7f659ff90d2040"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/logical_collections.rs:179-184 | crates/perry-codegen/src/expr/math_simple.rs:171-176 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/logical_collections.rs\u0060 and \u0060crates/perry-codegen/src/expr/math_simple.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 117 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/perry-codegen/src/expr/logical_collections.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c50a36dafeebd373527d99e136737a7428e2b5d7b6cd363496aa6e55f9f224"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/object_literal.rs:68-73 | crates/perry-codegen/src/expr/property_get/generic_dispatch.rs:57-62 \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/perry-codegen/src/expr/object_literal.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e92631d06c6a43cc8d6a88873d9768dca924e0216d4c058e20722747598110e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/perry-codegen/src/expr/property_get_names.rs:17-39 | crates/perry-hir/src/lower/expr_member/native_dispatch.rs:300-322 \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/perry-codegen/src/expr/property_get_names.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04616e549c89b6271634974ab01bf055206c7441a874229bfbcb9df37a42401"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/static_field_meta.rs:76-83 | crates/perry-codegen/src/lower_call/property_get/patched_proto.rs:95-102 \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/perry-codegen/src/expr/static_field_meta.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b862ba11ffed996307e8075d547d42d6f493741f7aefd0113a259e3b3b21c18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/lower_call/func_ref.rs:13-20 | crates/perry-codegen/src/lower_call/method_override.rs:657-664 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/lower_call/func_ref.rs\u0060 and \u0060crates/perry-codegen/src/lower_call/method_override.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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/perry-codegen/src/lower_call/func_ref.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e664bbe0a40e4649c77accda977ca5218cf161cc3e8ea31295e9accb06914c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:9545-9568 | crates/perry-codegen/src/type_analysis/pod.rs:666-689 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":9545}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcfe7c5b924156c82803512bf4edbe79aff8b12d7371063c69716f954c273ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-component-host/src/sync_wasi/tcp.rs:431-436 | crates/perry-component-host/src/sync_wasi/udp.rs:246-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-component-host/src/sync_wasi/tcp.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86b02318d84016c99f82fb0db2d4bef5886be4e6fba118a0ae00be74b90d339"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-component-host/src/sync_wasi/tcp.rs:445-449 | crates/perry-component-host/src/sync_wasi/udp.rs:260-264 \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/perry-component-host/src/sync_wasi/tcp.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"86bbb63d9b9f3c59318854d40e41d4957e02bd52f66eabd34cc1b0378fcaefa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-component-host/src/sync_wasi/tcp.rs:458-462 | crates/perry-component-host/src/sync_wasi/udp.rs:273-277 \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/perry-component-host/src/sync_wasi/tcp.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"5957515463ae00b099e83da368a19515cb1513591eca0f86abea97f5e4fad8bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-component-io/src/lib.rs:399-403 | crates/perry-component-io/src/resource.rs:255-259 \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/perry-component-io/src/lib.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7366827daff1059a2169d77e92aca184f5ee014e54f368a99af81fbcbce703"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-container-compose/src/backend/apple.rs:198-207 | crates/perry-container-compose/src/backend/docker.rs:213-220 \u2014 before extracting anything, compare \u0060crates/perry-container-compose/src/backend/apple.rs\u0060 and \u0060crates/perry-container-compose/src/backend/docker.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 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/perry-container-compose/src/backend/apple.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a31d53dfe394112d0d493a910421e6f3c4407ceded721532a6f8af3ce508ca8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-ext-http/src/client_dispatch_ext.rs:168-174 | crates/perry-ext-http/src/server/dispatch_ext.rs:336-342 \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/perry-ext-http/src/client_dispatch_ext.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10926f6d8c738f71225e791a884d33b006857f161d66d566bf91c0a45ea95ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/perry-ext-http/src/response_headers.rs:21-43 | crates/perry-ext-http/src/server/request.rs:275-297 \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/perry-ext-http/src/response_headers.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18153d6fad94d45c392e8a359a4a42c7a42f45ba186213c9550e74f81de2857"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-ext-http/src/server/native_dispatch.rs:63-69 | crates/perry-ext-net/src/native_dispatch.rs:49-55 \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/perry-ext-http/src/server/native_dispatch.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe47ee7cff36406033acddfe66198585fecf3c98ecef5329a79b6bd20729791b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-ext-http/src/server/response.rs:38-43 | crates/perry-ext-http/src/validation.rs:18-23 \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/perry-ext-http/src/server/response.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"3643684526b51eef88a6a5e9973dbb1daee0b11b4bb173e8bbf2a8f2de648d8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-ext-http/src/server/turnloop_h2/mod.rs:88-94 | crates/perry-ext-http/src/server/turnloop_serve/conn.rs:206-212 \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/perry-ext-http/src/server/turnloop_h2/mod.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"997512ef36d8eda977c7d368ba195680891011851a223426dbc89249861d6875"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-ext-http/src/server/turnloop_h2/mod.rs:99-106 | crates/perry-ext-http/src/server/turnloop_serve/conn.rs:214-221 \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/perry-ext-http/src/server/turnloop_h2/mod.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d01deea6630ddd29f671d1baa431089b998f7d78a119ba9d50bbc8f71ca03c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-ext-http/src/server/turnloop_serve/conn.rs:1079-1090 | crates/perry-http-server/src/conn.rs:875-886 \u2014 before extracting anything, compare \u0060crates/perry-ext-http/src/server/turnloop_serve/conn.rs\u0060 and \u0060crates/perry-http-server/src/conn.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 65 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/perry-ext-http/src/server/turnloop_serve/conn.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08f0ebe87fe855f336d422b954bfad9ba2dd735633721f20bd6fc8268ba8b16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-ext-http/src/server/turnloop_serve/wire.rs:45-50 | crates/perry-http-server/src/wire.rs:59-64 \u2014 before extracting anything, compare \u0060crates/perry-ext-http/src/server/turnloop_serve/wire.rs\u0060 and \u0060crates/perry-http-server/src/wire.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 115 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/perry-ext-http/src/server/turnloop_serve/wire.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b0e72181468f75182feab7862855ef5a266eb1975a206da995cdaa11797b4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-hir/src/destructuring/assignment_stmt.rs:23-31 | crates/perry-hir/src/destructuring/pattern_binding.rs:82-90 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/destructuring/assignment_stmt.rs\u0060 and \u0060crates/perry-hir/src/destructuring/pattern_binding.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 53 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/perry-hir/src/destructuring/assignment_stmt.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4c53d625d17857bde970c6e8b1de312e3f978885b7a0234a4f48de571ab43d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-hir/src/destructuring/assignment_stmt.rs:33-44 | crates/perry-hir/src/tdz_check.rs:39-50 \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/perry-hir/src/destructuring/assignment_stmt.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"784b58d03b02b3a848b27241d5e061dc7f32a48ed26b35db3d0ad1553d2e0401"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/destructuring/pattern_binding.rs:73-78 | crates/perry-hir/src/lower_patterns.rs:1126-1131 \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/perry-hir/src/destructuring/pattern_binding.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2d40cf68b7964fcd406809f72799834a41dc3237e46c52442a336c098154c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/array_only_methods.rs:42-48 | crates/perry-hir/src/lower/expr_call/local_array_methods.rs:154-160 \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/perry-hir/src/lower/expr_call/array_only_methods.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"916f6b1e56811b6cea333e1989844583effc120ab5390e21231024e1e65504f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/intrinsics/native_arena.rs:177-182 | crates/perry-hir/src/lower_types.rs:50-55 \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/perry-hir/src/lower/expr_call/intrinsics/native_arena.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca6962d59fe9f3020b01b2c7efcb8475ca02f5da34f9f271c35bc183fed4b8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/intrinsics/native_arena.rs:184-191 | crates/perry-hir/src/lower_types.rs:57-64 \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/perry-hir/src/lower/expr_call/intrinsics/native_arena.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"378802734a30aed27421e4cae4b5c604fbe54a0f0da8803d3979f2dadb6f4c58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs:99-106 | crates/perry-hir/src/lower_decl/body_stmt/detect.rs:99-106 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt/detect.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 133 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/perry-hir/src/lower/stmt_loops/for_await_targets.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7a8c3ff072b5c355736d529c007e59529f45d558e2b64fd4397b782383e648"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs:225-234 | crates/perry-hir/src/lower_decl/body_stmt/detect.rs:135-144 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/stmt_loops/for_await_targets.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/body_stmt/detect.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 133 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/perry-hir/src/lower/stmt_loops/for_await_targets.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"694670204b308348abee3c667fbae099eac5109dde5963f2bb84db0884abec64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/perry-codegen/src/collectors/escape_arrays.rs:41-48 | crates/perry-codegen/src/collectors/escape_news.rs:123-130 | crates/perry-codegen/src/collectors/escape_objects.rs:28-35 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/escape_arrays.rs\u0060 and \u0060crates/perry-codegen/src/collectors/escape_objects.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 46 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/perry-codegen/src/collectors/escape_arrays.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9478fe101abea04b7447b238d14c0d8a698b17b4b00c00a5ce8fb875ff3ee2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/collectors/loop_bounded_i32.rs:559-564 | crates/perry-codegen/src/collectors/segview.rs:699-704 \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/perry-codegen/src/collectors/loop_bounded_i32.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79d2da2932d12428426380f9f7ea16d6f8ef82d258c5c800e5f10aacc40e6b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-component-host/src/sync_wasi/filesystem.rs:115-120 | crates/perry-component-host/src/sync_wasi/network.rs:158-163 \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/perry-component-host/src/sync_wasi/filesystem.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b741db4e9cc77df89735f613d6d66b748bd988dc03fa9bd8b575c1d2e4e07d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-http-client/src/lib.rs:147-152 | crates/perry-http-server/src/lib.rs:133-138 \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/perry-http-client/src/lib.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"af68d6acc42ccb595f78b136b7b3db59a21d21830e263ba9d7d2c7b2beee4ebc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/perry-codegen/src/expr/new_dynamic.rs:327-346 | crates/perry-codegen/src/expr/new_dynamic.rs:555-583 \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/perry-codegen/src/expr/new_dynamic.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d35f42e602d136508c505db8f3df70d9b6d5c4a62b071e8aee9ec24df8d791a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/perry-codegen/src/codegen/string_pool.rs:1633-1661 | crates/perry-codegen/src/codegen/string_pool.rs:1715-1739 \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/perry-codegen/src/codegen/string_pool.rs"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6584d42ffe7e398e4d38bc30d6370fffd2b0d4fdd1a2068fddc18a6f873c0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/perry-codegen/src/codegen/class_artifacts.rs:715-736 | crates/perry-codegen/src/codegen/class_artifacts.rs:760-781 \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/perry-codegen/src/codegen/class_artifacts.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3d02044b03b13124e0a1a98aabf4e755fdff7b8028d83da62f4357d1f189fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/native_module/object_statics.rs:144-149 | crates/perry-hir/src/lower/expr_call/native_module/object_statics.rs:170-191 \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/perry-hir/src/lower/expr_call/native_module/object_statics.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d3cc00f72b775cae19c7c919165afa93e5cbc94207b8b9be0d05c59c2b62a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/lower_call/options/fetch.rs:777-798 | crates/perry-codegen/src/lower_call/options/fetch.rs:1181-1191 \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/perry-codegen/src/lower_call/options/fetch.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"49597384d1d5bf9730fb7a661c7dbfb74f1897ae2f9ccae2d576841702771016"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-codegen/src/expr/this_super_call.rs:854-875 | crates/perry-codegen/src/expr/this_super_call.rs:1373-1387 \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/perry-codegen/src/expr/this_super_call.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6cba2e9e6a3dfa51297ed99e64dc20a77ca0a466e0f9a9eee247eef0d96129c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 8): crates/perry-codegen-arkts/src/widgets/calendar.rs:33-53 | crates/perry-codegen-arkts/src/widgets/date_picker.rs:32-52 | crates/perry-codegen-arkts/src/widgets/inputs.rs:30-44 | crates/perry-codegen-arkts/src/widgets/inputs.rs:58-72 | crates/perry-codegen-arkts/src/widgets/inputs.rs:123-137 | crates/perry-codegen-arkts/src/widgets/inputs.rs:175-190 | crates/perry-codegen-arkts/src/widgets/inputs.rs:201-214 | crates/perry-codegen-arkts/src/widgets/inputs.rs:235-254 \u2014 there are 8 copies across 3 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 8 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-arkts/src/widgets/calendar.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f67a6905fde6a2b6edd9d6a9c4a6edcc9dd654edeae5ac21ddd104452119a20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-hir/src/lower/expr_new.rs:600-608 | crates/perry-hir/src/lower/expr_new.rs:673-693 \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/perry-hir/src/lower/expr_new.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e58b81e078454f4ff14aac189cd434899c9e9329a9348485cffbeb6504da6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/perry-codegen/src/lower_call/console_promise.rs:207-225 | crates/perry-codegen/src/lower_call/console_promise.rs:366-385 \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/perry-codegen/src/lower_call/console_promise.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"052b1eff95cd64c44e6a22ba3b6599fd87d96ed0b55bd0cfa8097c2d3a22039b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/perry-codegen/src/codegen/class_artifacts.rs:376-394 | crates/perry-codegen/src/codegen/class_artifacts.rs:500-518 \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/perry-codegen/src/codegen/class_artifacts.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"226e85a3cefc8de899b9a9bebad9e6adcaddb553a9176c7163413e6fb1fd5383"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/globals.rs:885-903 | crates/perry-hir/src/lower/expr_call/module_static.rs:1073-1081 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/globals.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/module_static.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 296 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/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9430155fa63c8a0b7efee2913d0ea1221649dd23971540a2d60e9f88d849d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/perry-codegen/src/lower_call/property_get/number_string.rs:129-144 | crates/perry-codegen/src/lower_call/property_get/number_string.rs:176-194 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/property_get/number_string.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fa728707ca936afcd3a68e1c66f8fdfb302c6687a09e1b980783b5ed35305a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/perry-codegen/src/expr/property_get/helpers.rs:523-541 | crates/perry-codegen/src/expr/property_get/helpers.rs:625-643 \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/perry-codegen/src/expr/property_get/helpers.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd31373146707554668219385cfc12ca5d64a0f280cbd6a1c2288cd00d8232b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5): crates/perry-codegen/src/lower_call/extern_timers.rs:128-141 | crates/perry-codegen/src/lower_call/extern_timers.rs:165-178 | crates/perry-codegen/src/lower_call/extern_timers.rs:218-236 | crates/perry-codegen/src/lower_call/extern_timers.rs:243-256 | crates/perry-codegen/src/lower_call/extern_timers.rs:265-283 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/extern_timers.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56956e2e9e158e170bea74d2c22ea8b9eecc0014e49e86814765a4ab041ceb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 14): crates/perry-codegen/src/expr/misc_methods.rs:319-328 | crates/perry-codegen/src/expr/misc_methods.rs:345-360 | crates/perry-codegen/src/expr/misc_methods.rs:367-376 | crates/perry-codegen/src/expr/misc_methods.rs:388-397 | crates/perry-codegen/src/expr/misc_methods.rs:411-425 | crates/perry-codegen/src/expr/misc_methods.rs:437-450 | crates/perry-codegen/src/expr/misc_methods.rs:472-487 | crates/perry-codegen/src/expr/misc_methods.rs:499-508 | crates/perry-codegen/src/expr/misc_methods.rs:520-529 | crates/perry-codegen/src/expr/misc_methods.rs:541-554 | crates/perry-codegen/src/expr/misc_methods.rs:569-583 | crates/perry-codegen/src/expr/misc_methods.rs:611-628 | crates/perry-codegen/src/expr/string_regex_proc.rs:529-538 | crates/perry-codegen/src/expr/string_regex_proc.rs:557-566 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/misc_methods.rs\u0060 and \u0060crates/perry-codegen/src/expr/string_regex_proc.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 72 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/perry-codegen/src/expr/misc_methods.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df0b75b2b81625722bbd2d3e86ceb0b3bc48783e5cfb25649172e6a4ed5208e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/perry-codegen-arkts/src/widgets/structure.rs:451-466 | crates/perry-codegen-arkts/src/widgets/structure.rs:496-512 \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/perry-codegen-arkts/src/widgets/structure.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b396f84748db0f1eefac0ef22cce12e96f87caf8e749abb5bcd40ef30d5545"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/codegen/entry.rs:1224-1230 | crates/perry-codegen/src/codegen/entry.rs:1451-1467 \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/perry-codegen/src/codegen/entry.rs"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a81a03818b6dbbca0153c9e33813d01e351925b7d76f4ba94a11ce4caa118f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/perry-codegen/src/expr/method_site.rs:779-795 | crates/perry-codegen/src/expr/put_value_store_ic.rs:132-145 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:1347-1355 \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/perry-codegen/src/expr/method_site.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f8103f91468ba646d7109428b6c80a74e9485d8418615230ad37002010d93f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/expr/calls/crypto_kdf.rs:157-173 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:27-37 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/calls/crypto_kdf.rs\u0060 and \u0060crates/perry-codegen/src/expr/calls/crypto_misc.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 47 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/perry-codegen/src/expr/calls/crypto_kdf.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd31f9cc75913379dc901c73b5dfe0f6b934d5862252f4d213c37fc1ff00010"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/lower_string_method.rs:785-801 | crates/perry-codegen/src/lower_string_method.rs:810-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/perry-codegen/src/lower_string_method.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"e909c8e8dfef187213ec36bc97b1545f1784ea627f554d29529e3eb415b7888e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/array_only_methods.rs:1069-1085 | crates/perry-hir/src/lower/expr_call/imported_array_methods.rs:218-225 | crates/perry-hir/src/lower/expr_call/inline_array_methods.rs:147-154 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/array_only_methods.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/imported_array_methods.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 97 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/perry-hir/src/lower/expr_call/array_only_methods.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e723ee52e004770d327da44b410c98f1a8576fcbcc733222a8a671c7a836ed8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/perry-codegen/src/expr/misc_methods.rs:1056-1066 | crates/perry-codegen/src/expr/misc_methods.rs:1085-1095 | crates/perry-codegen/src/expr/os_uri_dates.rs:224-234 | crates/perry-codegen/src/expr/os_uri_dates.rs:260-276 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/misc_methods.rs\u0060 and \u0060crates/perry-codegen/src/expr/os_uri_dates.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 51 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/perry-codegen/src/expr/misc_methods.rs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c9b28905e19688163d5488d09619495463f8e750c36ebb5a6f99013f767d58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/perry-codegen/src/expr/calls/crypto_misc.rs:472-487 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:520-536 \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/perry-codegen/src/expr/calls/crypto_misc.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"4225704a554598316b86a02d57d37b04fef664096a55ac86d929d956ff2c5263"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/perry-codegen/src/expr/calls/crypto_kdf.rs:79-94 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:287-301 | crates/perry-codegen/src/expr/calls/crypto_kdf.rs:323-338 \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/perry-codegen/src/expr/calls/crypto_kdf.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a70e7b28040f371d14e1980de86e3c0307c953e79dce1b91313a2a66a7a858"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/perry-codegen/src/expr/js_runtime.rs:84-99 | crates/perry-codegen/src/expr/js_runtime.rs:213-228 \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/perry-codegen/src/expr/js_runtime.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"64cef9e563d217a7faea1f6b248a8a79b2fa31d662b30ab3ccda357d24573c8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-codegen/src/expr/mod.rs:4520-4534 | crates/perry-codegen/src/expr/mod.rs:4542-4557 \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/perry-codegen/src/expr/mod.rs"},"region":{"startLine":4520}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b201bdaa4e73a59982850cfd577c4db9c82ff283ded26102b59f7258afe6416"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/perry-codegen/src/expr/this_super_call.rs:482-497 | crates/perry-codegen/src/expr/this_super_call.rs:515-526 | crates/perry-codegen/src/expr/this_super_call.rs:548-559 \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/perry-codegen/src/expr/this_super_call.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc65924fe35695f1ca2f4290d6877d31ac2782acc03a47afaeb337a7984bcd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/perry-codegen/src/expr/js_runtime.rs:84-99 | crates/perry-codegen/src/expr/js_runtime.rs:115-130 | crates/perry-codegen/src/expr/js_runtime.rs:213-228 \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/perry-codegen/src/expr/js_runtime.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c18c0a74457bdb1295b9c4f4467dcd9db6ca6db9b372daff2c380a250ffe81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/lower_call/options/fetch.rs:255-264 | crates/perry-codegen/src/lower_call/options/fetch.rs:420-435 \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/perry-codegen/src/lower_call/options/fetch.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e33fe0308d90d7fff24fa6599e1b0d579c90b29cd66636be919e2edf5c7eaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-codegen/src/native_value/verify/abi.rs:346-360 | crates/perry-codegen/src/native_value/verify/abi.rs:410-424 \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/perry-codegen/src/native_value/verify/abi.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ecc2c35bd63fffa85477404334202ff0caa51c5afd6d76dea2b5a0c259a9de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-codegen/src/expr/index_set.rs:101-115 | crates/perry-codegen/src/expr/property_set.rs:370-384 \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/perry-codegen/src/expr/index_set.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4852688809c51a4bbe9c815674950bea9d050e008d2818909c31b893b616cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/expr/function_bind.rs:94-102 | crates/perry-codegen/src/lower_call/buffer_intrinsic.rs:503-517 \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/perry-codegen/src/expr/function_bind.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0d8b8dc7b2e187abd67c6e9d29e11a900cdbf1f65321ba0e75e8c24725228c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/perry-codegen/src/lower_call/namespace_call.rs:146-160 | crates/perry-codegen/src/lower_call/namespace_call.rs:178-192 | crates/perry-codegen/src/lower_call/namespace_call.rs:210-219 \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/perry-codegen/src/lower_call/namespace_call.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc83b39795a849cffc7c373a94248009ea3ec4594f18fe57e70f2740af434e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/perry-codegen/src/stmt/indexed_owner_loop.rs:1516-1530 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:1806-1817 | crates/perry-codegen/src/stmt/versioned_indexed_loop.rs:709-720 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/indexed_owner_loop.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"360bd5430ea8a0fa50ef556aa3c140cf3bc7ce6284d8ee4dbb668531c3d1364d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-codegen/src/lower_call/method_override.rs:1474-1488 | crates/perry-codegen/src/lower_call/method_override.rs:1649-1663 \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/perry-codegen/src/lower_call/method_override.rs"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"565379783a2906350864fda65032c2757b76ac9633378537bc3cacb2111ff5bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/perry-codegen/src/stmt/stable_packed_loop.rs:453-467 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:855-869 \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/perry-codegen/src/stmt/stable_packed_loop.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e6ee378d06b1990c838e9407973074f229dff9174693e4526b38eed10b471f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/expr/array_methods.rs:154-167 | crates/perry-codegen/src/expr/instance_misc1.rs:1015-1025 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/array_methods.rs\u0060 and \u0060crates/perry-codegen/src/expr/instance_misc1.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 67 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/perry-codegen/src/expr/array_methods.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"77096c7bbff08cf6881e3363c047f49ff9dc24dd31c9a37c32e779e1808319f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/perry-codegen/src/stmt/let_stmt.rs:1435-1448 | crates/perry-codegen/src/stmt/let_stmt.rs:1456-1469 | crates/perry-codegen/src/stmt/let_stmt.rs:1473-1486 \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/perry-codegen/src/stmt/let_stmt.rs"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9b1544b0f6274919919a231cebcb17882973028b93c3537223700066a20303"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/expr/child_proc.rs:463-476 | crates/perry-codegen/src/expr/child_proc.rs:499-507 \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/perry-codegen/src/expr/child_proc.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f301326ed8c1d3a34e75cdc636de8ebfbd4329c8770b2b9341e9b8bb66422ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/property_get.rs:743-756 | crates/perry-codegen/src/expr/property_get.rs:775-782 \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/perry-codegen/src/expr/property_get.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2570d257214fcb43833f95160b13148dfb1cc8ab2d828999a8d62ce8db5b1cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-ext-http/src/server/response.rs:417-430 | crates/perry-ext-http/src/server/response.rs:538-550 \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/perry-ext-http/src/server/response.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45424cb8d193a5c08ebeaca196cc69bab3245fe9e0b64f53753f2fedf996ce6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): crates/perry-codegen/src/stmt/let_stmt.rs:1435-1448 | crates/perry-codegen/src/stmt/let_stmt.rs:1456-1469 | crates/perry-codegen/src/stmt/let_stmt.rs:1473-1486 | crates/perry-codegen/src/stmt/let_stmt.rs:1492-1505 \u2014 all 4 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/perry-codegen/src/stmt/let_stmt.rs"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8a517bf59844d2c017a50c92bd46b14ce63e12d1cf2914592f1a1b24517345"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-codegen/src/lower_call/early_branches.rs:949-962 | crates/perry-codegen/src/lower_call/early_branches.rs:1053-1066 \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/perry-codegen/src/lower_call/early_branches.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18b1f742443aed82cb78c27c117b72b91a7cac27b1b2d4f7b14922ef3377f7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen/src/lower_call/field_init.rs:970-982 | crates/perry-codegen/src/lower_call/new.rs:1461-1474 \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/perry-codegen/src/lower_call/field_init.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3fb9ae2d34e628e4799b94cece558427bf734d28238785bbbd2f6fb033a576"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/perry-codegen/src/lower_string_method.rs:703-716 | crates/perry-codegen/src/lower_string_method.rs:790-802 | crates/perry-codegen/src/lower_string_method.rs:811-821 \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/perry-codegen/src/lower_string_method.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a361c48073b9e188e1503f51431a7c17172b5c5889c7bf38b58ec7e30a01014"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/perry-codegen/src/expr/arrays_finds.rs:1008-1021 | crates/perry-codegen/src/expr/arrays_finds.rs:1039-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/arrays_finds.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"58abae2996e0be06cce1dbda65a469d7f39498d8a21e5bc7651629af1f89e67f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/lower_call/builtin.rs:1262-1271 | crates/perry-codegen/src/lower_call/builtin.rs:1296-1309 \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/perry-codegen/src/lower_call/builtin.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"471017f7bf6bfa9d549e36c3530b5517f7d35872b3c44bfa91eab8eb6d2c54cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/module_class_static.rs:110-122 | crates/perry-hir/src/lower/expr_call/native_module/imported_module_dispatch.rs:284-296 | crates/perry-hir/src/lower/expr_member/member_tail.rs:783-794 \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/perry-hir/src/lower/expr_call/module_class_static.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"075cc92068d01d7ed6970832d82e5c73faa0644b8a06d75ad7a1352889abd28a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/instance_misc1.rs:292-299 | crates/perry-codegen/src/lower_call/property_get/imported_object.rs:172-184 \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/perry-codegen/src/expr/instance_misc1.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d08e2a6513379bc140c66f1c33492c5347233f18dfa5646cac4405346342e55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen/src/codegen/typed_abi/lower.rs:55-67 | crates/perry-codegen/src/codegen/typed_abi/lower.rs:438-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/typed_abi/lower.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"958d608dc0df3ec0316e68ac5d78049b01aaf6a3955ff59dcc132a04d1b9dd91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen-glance/src/emit.rs:449-461 | crates/perry-codegen-swiftui/src/emit.rs:889-901 \u2014 before extracting anything, compare \u0060crates/perry-codegen-glance/src/emit.rs\u0060 and \u0060crates/perry-codegen-swiftui/src/emit.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 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/perry-codegen-glance/src/emit.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ac8cc9d3b90c387884fd975dc31fd7f03626504e91fae9a09cf3458416e9f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/local_array_methods.rs:508-515 | crates/perry-hir/src/lower/expr_call/local_array_methods.rs:519-531 \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/perry-hir/src/lower/expr_call/local_array_methods.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdeaea1187a5d3b3a504df5ac05ea2cb75a26a8350fc91b683bf37b0020344a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen/src/inprocess/native_homes.rs:408-420 | crates/perry-codegen/src/inprocess/native_homes.rs:655-667 \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/perry-codegen/src/inprocess/native_homes.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a16d78143e6113e91117a4b4b06f249f4a7ea46d52dbfb63078d86c0436c4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/perry-codegen/src/expr/bigint_set.rs:746-758 | crates/perry-codegen/src/expr/bigint_set.rs:770-782 | crates/perry-codegen/src/expr/bigint_set.rs:794-806 \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/perry-codegen/src/expr/bigint_set.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"aedffc8136fc899078a872f3f1c67d42f124dcd250a3b6afcbc56fda8717fa94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/perry-codegen/src/expr/env_clones.rs:435-443 | crates/perry-codegen/src/expr/logical_collections.rs:1698-1710 | crates/perry-codegen/src/expr/super_method.rs:204-216 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/env_clones.rs\u0060 and \u0060crates/perry-codegen/src/expr/super_method.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 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/perry-codegen/src/expr/env_clones.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b4d9647a84252bcdd0a5f7b767d27c470a47e55107967b22ade5d944b29b13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/expr/static_field_meta.rs:105-117 | crates/perry-codegen/src/lower_call/new_helpers.rs:979-987 \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/perry-codegen/src/expr/static_field_meta.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d31b919c0c532dee1d2cf17e4c6bac0fceee99251a1cf5b9994f415ff752aad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen/src/expr/i32_fast_path.rs:1199-1211 | crates/perry-codegen/src/expr/i32_fast_path.rs:1262-1274 \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/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a669c698ea5326f3c5c1f309ebcc9b7522e69e7e3c7e3b426aa0e78cf995d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen/src/native_value/verify.rs:69-81 | crates/perry-codegen/src/native_value/verify.rs:99-111 \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/perry-codegen/src/native_value/verify.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a7af6f3e2fe0f9b1fbd2a317a6917a1e710dc4913b9973f02305b5c248e6f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/perry-codegen/src/expr/proven_view_access.rs:346-358 | crates/perry-codegen/src/expr/proven_view_access.rs:468-480 \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/perry-codegen/src/expr/proven_view_access.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0369a5935afea2522b2dc8e3a9f45eddd84b20e5ccd55bfe235be62b56f3f3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/lower_string_concat.rs:968-979 | crates/perry-codegen/src/lower_string_concat.rs:995-1003 \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/perry-codegen/src/lower_string_concat.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5f4f2242e3a6421f975e7a982ff58da843839decbfe67c9e79910f99de31d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u201312 lines \u00D7 3): crates/perry-codegen/src/lower_call/property_get/map_set.rs:357-368 | crates/perry-codegen/src/lower_call/property_get/map_set.rs:384-395 | crates/perry-codegen/src/lower_call/property_get/map_set.rs:414-418 \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/perry-codegen/src/lower_call/property_get/map_set.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0e9126f86a89c86b5c48659192109a4e7e07e963b169fdeaae8b4022ad7a13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:4026-4037 | crates/perry-codegen/src/stmt/loops.rs:4072-4083 \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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":4026}}}],"partialFingerprints":{"codehealthFindingId/v1":"0009ba4c28ad24cfcce947f284cb1ea185e493d717f6b1daf3f3cdd177cb4561"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-codegen/src/module.rs:1003-1009 | crates/perry-codegen/src/module.rs:1045-1056 | crates/perry-codegen/src/module.rs:1564-1570 \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/perry-codegen/src/module.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"9571fb4e196d40c25942b1579bff4321cc2bccdd44545444af286aecda821ed8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/stmt/mod.rs:651-662 | crates/perry-codegen/src/stmt/mod.rs:678-686 \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/perry-codegen/src/stmt/mod.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"80797f660a40d5fb46c635793a709983a15cc424a825acb1f0d6876e221cd14e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/stmt/mod.rs:752-763 | crates/perry-codegen/src/stmt/mod.rs:776-783 \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/perry-codegen/src/stmt/mod.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bece61b768110a5cb8fd5c94fa602aa917e181f87f84ddf85733d1c4a0a553b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/stmt/versioned_indexed_loop.rs:654-665 | crates/perry-codegen/src/stmt/versioned_indexed_loop.rs:694-705 \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/perry-codegen/src/stmt/versioned_indexed_loop.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec8a495976082c0259ad42d3acc9d766e14fe7653508fbb82aeaa463e8b2cf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6): crates/perry-hir/src/lower/expr_call/globals.rs:275-286 | crates/perry-hir/src/lower/expr_call/globals.rs:378-389 | crates/perry-hir/src/lower/expr_call/globals.rs:415-426 | crates/perry-hir/src/lower/expr_call/globals.rs:433-444 | crates/perry-hir/src/lower/expr_call/globals.rs:455-466 | crates/perry-hir/src/lower/expr_call/globals.rs:480-491 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"703a53aaac57e3997c0b9c922e367977968360b5b9db6bdb7de2427980df80bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower/widget_decl.rs:152-157 | crates/perry-hir/src/lower/widget_decl.rs:212-223 \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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c022c10b3b6936f7b3af2b3dcf30b7b0f436134d8ffd63e7e4ec43ddc296c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8): crates/perry-codegen/src/expr/calls/fs.rs:66-72 | crates/perry-codegen/src/expr/calls/fs.rs:174-180 | crates/perry-codegen/src/expr/calls/fs.rs:191-197 | crates/perry-codegen/src/expr/calls/fs.rs:308-314 | crates/perry-codegen/src/expr/calls/fs.rs:325-331 | crates/perry-codegen/src/expr/calls/fs.rs:342-348 | crates/perry-codegen/src/expr/calls/fs.rs:382-393 | crates/perry-codegen/src/expr/calls/fs.rs:422-428 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/calls/fs.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9bc453c901707099c3e21f9fa30a4f79f891f8f870ac8dffd99e98ab384f84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/lower_call/builtin.rs:1426-1437 | crates/perry-codegen/src/lower_call/builtin.rs:1449-1460 \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/perry-codegen/src/lower_call/builtin.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1dbe42bc76ae00eebc6b222334c20a77eaed34ff1e874aa20272777b2377d4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/type_analysis/strings.rs:28-39 | crates/perry-codegen/src/type_analysis/strings.rs:298-309 \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/perry-codegen/src/type_analysis/strings.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8007ee3c0976f80d52b9a0cb5aa8ddfbbe810c41f37317d1e0eb2d7a407732"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/expr/proven_view_access.rs:430-440 | crates/perry-codegen/src/expr/proven_view_access.rs:612-622 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/proven_view_access.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"f254f28213407e8cc96ca2a54947591172e7ecbb7f31a9bf72483d618956de6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/codegen/typed_abi/lower.rs:333-343 | crates/perry-codegen/src/codegen/typed_abi/lower.rs:469-479 \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/perry-codegen/src/codegen/typed_abi/lower.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"926e842969df072683339083d53e35a84755705f01720c68f97bfe731924d01c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/stmt/loops.rs:325-335 | crates/perry-codegen/src/stmt/loops.rs:357-367 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52ddf0adf5f99bcd7079b66c3d8acf1f272b9a722dab44e38c8fb3a95c21ea0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/expr/property_get.rs:1476-1486 | crates/perry-codegen/src/expr/property_set.rs:874-880 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/property_get.rs\u0060 and \u0060crates/perry-codegen/src/expr/property_set.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 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/perry-codegen/src/expr/property_get.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c335822a1814607ac340ed59d9b1a6dd33844f9f968755cedc5c59cd123ae45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/stmt/element_shape_loop.rs:1859-1869 | crates/perry-codegen/src/stmt/number_local_loop.rs:587-594 \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/perry-codegen/src/stmt/element_shape_loop.rs"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"58da0d9fd707c3d2ba755f84bf057a43ec7b41edbe9c841ad4080eaa94a76a6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-hir/src/lower/lower_expr/reactive_text.rs:132-142 | crates/perry-hir/src/lower/widget_decl/reactive_animate.rs:209-215 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/lower_expr/reactive_text.rs\u0060 and \u0060crates/perry-hir/src/lower/widget_decl/reactive_animate.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 87 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/perry-hir/src/lower/lower_expr/reactive_text.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efbdfcd0ce778e4506d141b489e9ff5102e0ccc76baf2c6cb7da2127b5af183"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/lower_call/options/fetch.rs:615-625 | crates/perry-codegen/src/lower_call/options/fetch.rs:628-638 \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/perry-codegen/src/lower_call/options/fetch.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc15d7a7b52461f595638759a14e6e023539fc6176b70caedf2db0d02e44bd8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/expr/url_main.rs:459-469 | crates/perry-codegen/src/expr/url_main.rs:488-498 \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/perry-codegen/src/expr/url_main.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"984d632836fb84e459f8e29cee84904b0b6a1992ae8a9a9c3de0e49746f40535"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/lower_string_method.rs:718-728 | crates/perry-codegen/src/lower_string_method.rs:742-752 \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/perry-codegen/src/lower_string_method.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaabe8619d6336c648dab8d471e0115d103e74add8a5c09f892210f233966042"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/expr/calls/crypto_keys.rs:197-205 | crates/perry-codegen/src/expr/calls/crypto_keys.rs:227-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/calls/crypto_keys.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"031375a2f7da6de790651ec862beb953910a3dfd4b095913990ffc726d082a25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/perry-ext-better-sqlite3/src/lib.rs:540-550 | crates/perry-ext-better-sqlite3/src/lib.rs:555-565 | crates/perry-ext-better-sqlite3/src/lib.rs:570-580 \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/perry-ext-better-sqlite3/src/lib.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"af186e483a2fc07386dc15cf3e51c6abe60424639370d901e6d9c0aff324319e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 11): crates/perry-codegen/src/block.rs:1458-1468 | crates/perry-codegen/src/block.rs:1471-1481 | crates/perry-codegen/src/block.rs:1484-1494 | crates/perry-codegen/src/block.rs:1500-1510 | crates/perry-codegen/src/block.rs:1515-1525 | crates/perry-codegen/src/block.rs:1528-1538 | crates/perry-codegen/src/block.rs:1541-1551 | crates/perry-codegen/src/block.rs:1554-1564 | crates/perry-codegen/src/block.rs:1567-1577 | crates/perry-codegen/src/block.rs:1580-1590 | crates/perry-codegen/src/block.rs:1593-1603 \u2014 all 11 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/perry-codegen/src/block.rs"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5ef65491fab31c8b875432ea727335127dc40a827d86d83b92d310cfa2fc9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/array_push.rs:731-738 | crates/perry-codegen/src/expr/number_to_string_inline.rs:37-47 \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/perry-codegen/src/expr/array_push.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd843811cc3fb76f85e3a5af99320363f491d64c71715f36224f5dc95068080"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/perry-codegen/src/lower_call/options/fetch.rs:803-813 | crates/perry-codegen/src/lower_call/options/fetch.rs:971-981 | crates/perry-codegen/src/lower_call/options/fetch.rs:992-1002 \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/perry-codegen/src/lower_call/options/fetch.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2b5837dabc68890781a0a029ae1843d2bb385b7596a0665ed92dd0558f56db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/codegen/entry.rs:1392-1402 | crates/perry-codegen/src/expr/write_barrier.rs:72-77 \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/perry-codegen/src/codegen/entry.rs"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"809529357e8dc24e032f9d82f9dab17be2eed981f75ede7d1e8bf8770c455963"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/instance_misc1.rs:1308-1317 | crates/perry-codegen/src/expr/instance_misc1.rs:1528-1537 \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/perry-codegen/src/expr/instance_misc1.rs"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd1c6391340ee763ee11c1a554b2ec283aa163863d13f617b0c9d5b61e441cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 43): crates/perry-codegen/src/builtin_proto.rs:212-217 | crates/perry-codegen/src/codegen/checked_integer.rs:378-382 | crates/perry-codegen/src/expr/array_literal.rs:310-317 | crates/perry-codegen/src/expr/bigint_set.rs:85-90 | crates/perry-codegen/src/expr/bigint_set.rs:197-202 | crates/perry-codegen/src/expr/bigint_set.rs:264-269 | crates/perry-codegen/src/expr/binary.rs:1053-1058 | crates/perry-codegen/src/expr/checked_super.rs:120-124 | crates/perry-codegen/src/expr/class_env.rs:156-161 | crates/perry-codegen/src/expr/class_first_evaluation.rs:90-99 | crates/perry-codegen/src/expr/compare.rs:478-483 | crates/perry-codegen/src/expr/compare.rs:877-882 | crates/perry-codegen/src/expr/family_slot.rs:279-284 | crates/perry-codegen/src/expr/folded_builtin_override.rs:851-856 | crates/perry-codegen/src/expr/index_get/symbol_ic.rs:37-41 | crates/perry-codegen/src/expr/inline_birth/fixed_alloc.rs:48-52 | crates/perry-codegen/src/expr/inline_birth/shared.rs:140-144 | crates/perry-codegen/src/expr/instance_misc1.rs:285-290 | crates/perry-codegen/src/expr/instance_misc1.rs:745-750 | crates/perry-codegen/src/expr/literals_vars.rs:857-862 | crates/perry-codegen/src/expr/literals_vars.rs:1111-1116 | crates/perry-codegen/src/expr/logical_collections.rs:487-492 | crates/perry-codegen/src/expr/logical_collections.rs:1742-1746 | crates/perry-codegen/src/expr/math_simple.rs:208-213 | crates/perry-codegen/src/expr/math_simple.rs:303-308 | crates/perry-codegen/src/expr/math_simple.rs:372-377 | crates/perry-codegen/src/expr/pod_record.rs:283-289 | crates/perry-codegen/src/expr/pod_record.rs:357-363 | crates/perry-codegen/src/expr/pod_record.rs:560-566 | crates/perry-codegen/src/expr/property_get/helpers.rs:600-605 | crates/perry-codegen/src/expr/suffix_cursor.rs:59-63 | crates/perry-codegen/src/expr/unary.rs:55-60 | crates/perry-codegen/src/lower_call/early_branches.rs:534-539 | crates/perry-codegen/src/lower_call/func_ref.rs:214-219 | crates/perry-codegen/src/lower_call/new_alloc.rs:885-889 | crates/perry-codegen/src/lower_string_concat.rs:288-293 | crates/perry-codegen/src/native_value/materialize.rs:488-493 | crates/perry-codegen/src/stmt/loops.rs:551-557 | crates/perry-codegen/src/stmt/loops.rs:790-796 | crates/perry-codegen/src/stmt/loops.rs:3814-3820 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:913-918 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:1231-1236 | crates/perry-codegen/src/stmt/string_length_loop.rs:209-214 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/builtin_proto.rs\u0060 and \u0060crates/perry-codegen/src/expr/instance_misc1.rs\u0060 as WHOLE FILES: this scan already matched 4 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/perry-codegen/src/builtin_proto.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e873d67b8b9bfcbf097b5ef5c0cb706bf2bde50ee0cd51202223cc28111a01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/logical_collections.rs:761-770 | crates/perry-codegen/src/expr/logical_collections.rs:777-786 \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/perry-codegen/src/expr/logical_collections.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5aade6772604dda7f8b54786fb7e12b8063e9d7f9e9a69f1574cf1faf37b24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/native_module/process_module.rs:176-185 | crates/perry-hir/src/lower/expr_call/native_module/process_module.rs:315-324 \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/perry-hir/src/lower/expr_call/native_module/process_module.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f9fa9b988ce05dbe35b1bd84d472ee7166e1e0ec144dbe3b517f99bd152953"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/literal_descriptor.rs:236-245 | crates/perry-codegen/src/expr/literal_descriptor.rs:355-364 \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/perry-codegen/src/expr/literal_descriptor.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"570e2e804e3800bf834f0eeb54dc484147b7bc75b9c8791867b9848f5fa8b81d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/lower_call/builtin.rs:438-447 | crates/perry-codegen/src/lower_call/builtin.rs:914-919 \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/perry-codegen/src/lower_call/builtin.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"34227a204104e367a4328839ace3967c2179440ebd7b9ec261427f98f504a90a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/perry-codegen/src/collectors/ptr_numarray.rs:260-269 | crates/perry-codegen/src/collectors/ptr_shape.rs:241-250 | crates/perry-codegen/src/expr/slot_rep.rs:277-286 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/ptr_numarray.rs\u0060 and \u0060crates/perry-codegen/src/collectors/ptr_shape.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 165 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/perry-codegen/src/collectors/ptr_numarray.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbb757db87079a967b62873dffed9ac016b2355383cb4a4072dbcd358455eba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): crates/perry-codegen/src/block.rs:680-689 | crates/perry-codegen/src/block.rs:721-730 | crates/perry-codegen/src/block.rs:734-743 | crates/perry-codegen/src/block.rs:747-756 | crates/perry-codegen/src/block.rs:760-769 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/block.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"0592e5dd9d4a0ca21824085889f7fb756bde7fbfd7b91cdba19ef4cfd7c63a0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/function/precise_roots.rs:100-109 | crates/perry-codegen/src/function/precise_roots.rs:115-124 \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/perry-codegen/src/function/precise_roots.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c618d572ad7f02e5deca8223d47ba913e5f68d1b2f618868065509efa02601"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/calls/crypto_keys.rs:85-94 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:405-414 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/calls/crypto_keys.rs\u0060 and \u0060crates/perry-codegen/src/expr/calls/crypto_misc.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 54 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/perry-codegen/src/expr/calls/crypto_keys.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a2ba93d484359febe519dcd9e77e050936413475e8421317c52b97e0db3188"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/typed_array_rmw.rs:306-315 | crates/perry-codegen/src/expr/typed_array_rmw.rs:342-349 \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/perry-codegen/src/expr/typed_array_rmw.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35c61f6778736f0ff649e4aa631b857627a21db53650c2f863f2cd0b1763b27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/calls/fs.rs:456-465 | crates/perry-codegen/src/expr/super_method.rs:100-109 \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/perry-codegen/src/expr/calls/fs.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"282f77821288ff73ce3f27fe48ed3a710ec3fcd031337f5b04c8012f7576365a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/arrays_finds.rs:527-536 | crates/perry-codegen/src/expr/arrays_finds.rs:549-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/arrays_finds.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3811395881832905b2c3ab9d2028366b802ff2a0bf2c5df27cab85c11c0801d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/perry-hir/src/lower/widget_decl.rs:1498-1507 | crates/perry-hir/src/lower/widget_decl.rs:1512-1521 | crates/perry-hir/src/lower/widget_decl.rs:1555-1564 \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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74fbc7d3de18a98c8e0dd49743030a792887cd8dfb3480941d3919c9622eb23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 53): crates/perry-codegen/src/builtin_proto.rs:212-217 | crates/perry-codegen/src/codegen/checked_integer.rs:378-382 | crates/perry-codegen/src/expr/array_literal.rs:310-317 | crates/perry-codegen/src/expr/array_literal.rs:434-439 | crates/perry-codegen/src/expr/bigint_set.rs:85-90 | crates/perry-codegen/src/expr/bigint_set.rs:197-202 | crates/perry-codegen/src/expr/bigint_set.rs:264-269 | crates/perry-codegen/src/expr/binary.rs:1053-1058 | crates/perry-codegen/src/expr/checked_super.rs:120-124 | crates/perry-codegen/src/expr/class_env.rs:156-161 | crates/perry-codegen/src/expr/class_first_evaluation.rs:90-99 | crates/perry-codegen/src/expr/collection_receiver.rs:67-72 | crates/perry-codegen/src/expr/compare.rs:478-483 | crates/perry-codegen/src/expr/compare.rs:877-882 | crates/perry-codegen/src/expr/family_slot.rs:279-284 | crates/perry-codegen/src/expr/folded_builtin_override.rs:851-856 | crates/perry-codegen/src/expr/index_get/symbol_ic.rs:37-41 | crates/perry-codegen/src/expr/inline_birth/fixed_alloc.rs:48-52 | crates/perry-codegen/src/expr/inline_birth/shared.rs:140-144 | crates/perry-codegen/src/expr/instance_misc1.rs:285-290 | crates/perry-codegen/src/expr/instance_misc1.rs:745-750 | crates/perry-codegen/src/expr/literals_vars.rs:857-862 | crates/perry-codegen/src/expr/literals_vars.rs:1111-1116 | crates/perry-codegen/src/expr/logical_collections.rs:487-492 | crates/perry-codegen/src/expr/logical_collections.rs:1742-1746 | crates/perry-codegen/src/expr/math_simple.rs:208-213 | crates/perry-codegen/src/expr/math_simple.rs:303-308 | crates/perry-codegen/src/expr/math_simple.rs:372-377 | crates/perry-codegen/src/expr/pod_record.rs:49-57 | crates/perry-codegen/src/expr/pod_record.rs:283-289 | crates/perry-codegen/src/expr/pod_record.rs:357-363 | crates/perry-codegen/src/expr/pod_record.rs:560-566 | crates/perry-codegen/src/expr/property_get/generic_dispatch.rs:182-189 | crates/perry-codegen/src/expr/property_get/helpers.rs:600-605 | crates/perry-codegen/src/expr/static_field_meta.rs:139-143 | crates/perry-codegen/src/expr/static_method.rs:484-488 | crates/perry-codegen/src/expr/suffix_cursor.rs:59-63 | crates/perry-codegen/src/expr/unary.rs:55-60 | crates/perry-codegen/src/lower_call/early_branches.rs:534-539 | crates/perry-codegen/src/lower_call/extern_func/pod_params.rs:307-313 | crates/perry-codegen/src/lower_call/func_ref.rs:214-219 | crates/perry-codegen/src/lower_call/new_alloc.rs:885-889 | crates/perry-codegen/src/lower_conditional.rs:364-370 | crates/perry-codegen/src/lower_string_concat.rs:288-293 | crates/perry-codegen/src/native_value/materialize.rs:488-493 | crates/perry-codegen/src/stmt/if_stmt.rs:183-191 | crates/perry-codegen/src/stmt/loops.rs:551-557 | crates/perry-codegen/src/stmt/loops.rs:790-796 | crates/perry-codegen/src/stmt/loops.rs:3814-3820 | crates/perry-codegen/src/stmt/number_local_loop.rs:456-461 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:913-918 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:1231-1236 | crates/perry-codegen/src/stmt/string_length_loop.rs:209-214 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/builtin_proto.rs\u0060 and \u0060crates/perry-codegen/src/expr/instance_misc1.rs\u0060 as WHOLE FILES: this scan already matched 4 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/perry-codegen/src/builtin_proto.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6917744c048a6d8223cb928425c3338e0733c75b8dad30566f81a73ad2f0bd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/index_get/guarded_array.rs:904-913 | crates/perry-codegen/src/expr/property_get.rs:342-351 \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/perry-codegen/src/expr/index_get/guarded_array.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcb05a30f49f6e26f082853ac9289947a30e33938850c883f05566713eb9d77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/lower_call/options/fetch.rs:222-231 | crates/perry-codegen/src/lower_call/options/fetch.rs:668-677 \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/perry-codegen/src/lower_call/options/fetch.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"90def03d4d8267d87ef8cf7370794561b79c38e742598748792f0f0255236bf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/instance_misc1.rs:1075-1082 | crates/perry-codegen/src/expr/instance_misc1.rs:1089-1097 \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/perry-codegen/src/expr/instance_misc1.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"723dbca98893ddc7349c7dfbde6af839e7a7755cb2159431fd48364e35eddef3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 7): crates/perry-hir/src/lower/expr_member.rs:1228-1233 | crates/perry-hir/src/lower/expr_member.rs:1280-1285 | crates/perry-hir/src/lower/expr_member.rs:1430-1435 | crates/perry-hir/src/lower/expr_member.rs:1517-1525 | crates/perry-hir/src/lower/expr_member.rs:1571-1576 | crates/perry-hir/src/lower/expr_member.rs:1581-1586 | crates/perry-hir/src/lower/expr_member.rs:1591-1596 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_member.rs"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"5236b152684999c32909d9dc18d0792152ec92b068cfff3e530d6f3694d9f600"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-hir/src/lower/expr_member.rs:1247-1253 | crates/perry-hir/src/lower/expr_member.rs:1305-1311 | crates/perry-hir/src/lower/expr_member.rs:1333-1341 \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/perry-hir/src/lower/expr_member.rs"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20f4ba4a74271f6c96b642a5f3f03deab7386e1625a376bfd2fc8c3e359b8dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen-glance/src/emit.rs:455-463 | crates/perry-codegen-wear-tiles/src/emit.rs:313-321 \u2014 before extracting anything, compare \u0060crates/perry-codegen-glance/src/emit.rs\u0060 and \u0060crates/perry-codegen-wear-tiles/src/emit.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 144 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/perry-codegen-glance/src/emit.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cecdd056f8f90d75f32bf46420ec244060878ae8d40bc1e6ae6b142d53220e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/expr/arrays_finds.rs:516-524 | crates/perry-codegen/src/expr/arrays_finds.rs:538-546 \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/perry-codegen/src/expr/arrays_finds.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9124ab061ded32ccbd4b0b7e898c8ddbdb6870e06b268e35df39bcf634cbf32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/expr/index.rs:626-632 | crates/perry-codegen/src/stmt/loops.rs:9836-9844 \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/perry-codegen/src/expr/index.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ba032a213d893fbe3baf66d44f5d443a78faa5cc0599b0e2b32cf397d1887c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/codegen/static_fields.rs:70-78 | crates/perry-codegen/src/codegen/static_fields.rs:79-87 \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/perry-codegen/src/codegen/static_fields.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2305645337d4a322b61f5ef1f33101dc11bfe663f65de15e4d9863d6c9d522a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/lower_call/builtin.rs:582-590 | crates/perry-codegen/src/lower_call/builtin.rs:595-603 \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/perry-codegen/src/lower_call/builtin.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"1694e68102f75c3650ef6d4634fc98ce19ebb9fca87092a7967db98fb1e8577e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 9): crates/perry-ext-net/src/payload_abi.rs:560-568 | crates/perry-ext-net/src/payload_abi.rs:650-658 | crates/perry-ext-net/src/payload_abi.rs:666-674 | crates/perry-ext-net/src/payload_abi.rs:682-690 | crates/perry-ext-net/src/payload_abi.rs:797-805 | crates/perry-ext-net/src/payload_abi.rs:843-851 | crates/perry-ext-net/src/payload_abi.rs:859-867 | crates/perry-ext-net/src/payload_abi.rs:1006-1014 | crates/perry-ext-net/src/payload_abi.rs:1104-1112 \u2014 all 9 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/perry-ext-net/src/payload_abi.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"f447e5f20c287f0fbbaab75e9cd2340223c9a7313fbc3d752617d41f5df9124e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 29): crates/perry-codegen/src/expr/calls.rs:193-201 | crates/perry-codegen/src/expr/calls.rs:254-262 | crates/perry-codegen/src/expr/calls.rs:268-276 | crates/perry-codegen/src/expr/calls.rs:282-290 | crates/perry-codegen/src/expr/calls.rs:296-304 | crates/perry-codegen/src/expr/calls.rs:399-407 | crates/perry-codegen/src/expr/calls.rs:412-420 | crates/perry-codegen/src/expr/calls.rs:425-433 | crates/perry-codegen/src/expr/calls.rs:443-451 | crates/perry-codegen/src/expr/calls.rs:457-465 | crates/perry-codegen/src/expr/calls.rs:504-512 | crates/perry-codegen/src/expr/calls.rs:517-525 | crates/perry-codegen/src/expr/calls.rs:531-539 | crates/perry-codegen/src/expr/calls.rs:545-553 | crates/perry-codegen/src/expr/calls.rs:560-568 | crates/perry-codegen/src/expr/calls.rs:572-580 | crates/perry-codegen/src/expr/calls.rs:605-613 | crates/perry-codegen/src/expr/calls.rs:620-628 | crates/perry-codegen/src/expr/calls.rs:635-643 | crates/perry-codegen/src/expr/calls.rs:648-656 | crates/perry-codegen/src/expr/calls.rs:661-669 | crates/perry-codegen/src/expr/calls.rs:674-682 | crates/perry-codegen/src/expr/calls.rs:687-695 | crates/perry-codegen/src/expr/calls.rs:700-708 | crates/perry-codegen/src/expr/calls.rs:717-725 | crates/perry-codegen/src/expr/calls.rs:730-738 | crates/perry-codegen/src/expr/calls.rs:747-755 | crates/perry-codegen/src/expr/calls.rs:762-770 | crates/perry-codegen/src/expr/calls.rs:778-786 \u2014 all 29 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/perry-codegen/src/expr/calls.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ad22ea9e80ba5cbc164ecfdcbe7fc17ec404d0d2ce4fa852dacd2147d91e49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/lower_call/property_get/map_set.rs:55-63 | crates/perry-codegen/src/lower_call/property_get/map_set.rs:71-79 \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/perry-codegen/src/lower_call/property_get/map_set.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a25dde7453005ccb3dd7991e9fdbc83fbc68e45d5600154e26dcdce10661477"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/expr/array_methods.rs:381-389 | crates/perry-codegen/src/expr/arrays_finds.rs:777-785 \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/perry-codegen/src/expr/array_methods.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b39c7948cad39286407f3bc24cf2380978070e64ba2381ce7f8416634047f18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-hir/src/lower/expr_assign.rs:76-84 | crates/perry-hir/src/lower/expr_assign.rs:102-110 \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/perry-hir/src/lower/expr_assign.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"2537a281807bf1a51a805deea20ef335201b731bcab34540014c2c2bcd8d4830"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-ext-ws/src/connect.rs:41-49 | crates/perry-http-client/src/ws/mod.rs:52-59 \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/perry-ext-ws/src/connect.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a960a2eb04daf6fc99d40d8d5ab0fd2630c46f31726f773442ba4d76d0465c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): crates/perry-codegen/src/expr/static_method.rs:210-215 | crates/perry-codegen/src/lower_call/options/fetch.rs:815-823 | crates/perry-codegen/src/lower_call/options/fetch.rs:1053-1061 | crates/perry-codegen/src/lower_call/options/fetch.rs:1093-1101 | crates/perry-codegen/src/lower_call/options/fetch.rs:1127-1135 | crates/perry-codegen/src/lower_call/options/fetch.rs:1146-1154 \u2014 there are 6 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 6 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/static_method.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"3560dcd57b8d5382202ed706fccc2ef8eb2703a1764a0a6b06396bb7daa58dbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/dialect/mod.rs:1272-1280 | crates/perry-codegen/src/dialect/mod.rs:1387-1395 \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/perry-codegen/src/dialect/mod.rs"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"920a296a998760d5a26f340ccf6465826e25bd808a7e14e1e4bfeeacbd68ec70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/expr/instance_misc1.rs:919-927 | crates/perry-codegen/src/expr/string_regex_proc.rs:498-506 \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/perry-codegen/src/expr/instance_misc1.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25d17fde2e6713daea8b39ee898a26102ff4dc3c24754dc74ce99fa384bc05d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-ext-net/src/payload_abi.rs:1190-1195 | crates/perry-ext-net/src/payload_abi.rs:1217-1225 \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/perry-ext-net/src/payload_abi.rs"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa24d3fba95e1590bbe2601dddd4187256f57991f974f5e72e54f617894e122f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/intrinsics/require.rs:34-42 | crates/perry-hir/src/lower/lower_expr/reactive_text.rs:38-43 \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/perry-hir/src/lower/expr_call/intrinsics/require.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e05015915186c7b214f3ef669e4d16bf2dcc0f152aab2dd80fb8ede5c826ce8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-codegen/src/layout_desc.rs:279-287 | crates/perry-codegen/src/layout_desc.rs:364-372 \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/perry-codegen/src/layout_desc.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba168306da298dccbdf15b448ca095cb3f834ce98054ff054ecdfcdb49f8984e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-ext-net/src/payload_abi.rs:974-982 | crates/perry-ext-net/src/payload_abi.rs:1254-1262 \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/perry-ext-net/src/payload_abi.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cda3c9d95f74b5496a929d9a3ddaf4b20bfdafd2620d601712a87fbc14a8c88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/perry-codegen/src/codegen/typed_abi/lower.rs:298-305 | crates/perry-codegen/src/codegen/typed_abi/lower.rs:331-338 | crates/perry-codegen/src/codegen/typed_abi/lower.rs:467-474 \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/perry-codegen/src/codegen/typed_abi/lower.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6312c2ae7237025e0cdb00346190b42d915a25187255bbeb209fa95d716ec2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/lower_call/console_promise.rs:264-271 | crates/perry-codegen/src/lower_call/console_promise.rs:357-364 \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/perry-codegen/src/lower_call/console_promise.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"949d41bbef00f9f8849b6d47e86db9ac9ee6bf783176ff1527ec4efe3af97b7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/url_search_params.rs:48-55 | crates/perry-hir/src/lower/expr_call/url_search_params.rs:63-70 \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/perry-hir/src/lower/expr_call/url_search_params.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fad1bb4e2ced6941b7ceed2053f72eb4e992da51a3dc6245151c3fc442d3e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/codegen/checked_integer.rs:217-224 | crates/perry-codegen/src/codegen/checked_integer.rs:255-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/checked_integer.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f9061ac9a105ef22819791cb171cedbeb1a2b00c8b03c02964afe0d9918629"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/logical_collections.rs:1194-1201 | crates/perry-codegen/src/expr/logical_collections.rs:1240-1247 \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/perry-codegen/src/expr/logical_collections.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89cceb77016e4a87493007c2ae08ea1e098bf09631f362e240595d51d9fde90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/closure_births.rs:197-204 | crates/perry-codegen/src/expr/literal_descriptor.rs:218-225 \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/perry-codegen/src/closure_births.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc0bda68fb688932b176af6435174e07403770b6f6a992a3edb9bc24417a8cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/array_literal.rs:680-687 | crates/perry-codegen/src/expr/strings.rs:15-22 \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/perry-codegen/src/expr/array_literal.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"208019df3c51e069c0b16a6046a061d88218366c437af76541d39a6d578e35cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/expr/os_uri_dates.rs:79-86 | crates/perry-codegen/src/expr/os_uri_dates.rs:126-132 \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/perry-codegen/src/expr/os_uri_dates.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"224e52084053c021b709e365d31b12d888b308a2c6871bd44de1f16dff7fbf82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/perry-ext-net/src/payload_closed.rs:137-144 | crates/perry-ext-net/src/payload_pipe.rs:178-185 | crates/perry-ext-net/src/payload_server.rs:714-721 \u2014 before extracting anything, compare \u0060crates/perry-ext-net/src/payload_closed.rs\u0060 and \u0060crates/perry-ext-net/src/payload_server.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 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/perry-ext-net/src/payload_closed.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fb82a49e8edcfe5ab1b37e195d1e5304c87621232f2f03da7bda0a67cb49e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/type_analysis/strings.rs:180-187 | crates/perry-codegen/src/type_analysis/strings.rs:312-319 \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/perry-codegen/src/type_analysis/strings.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"0254cdd7ac4d6c513f1b6846a3e9568a0667409c1614da4fd0e2e650a7b5c5f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 15): crates/perry-codegen/src/codegen/helpers.rs:265-272 | crates/perry-codegen/src/codegen/helpers.rs:514-521 | crates/perry-codegen/src/codegen/helpers.rs:1663-1670 | crates/perry-codegen/src/codegen/spec_abi.rs:50-57 | crates/perry-codegen/src/collectors/definite_init.rs:69-76 | crates/perry-codegen/src/collectors/proven_this.rs:130-137 | crates/perry-codegen/src/collectors/ptr_numarray.rs:113-120 | crates/perry-codegen/src/collectors/ptr_shape.rs:152-159 | crates/perry-codegen/src/collectors/typed_locals.rs:42-49 | crates/perry-codegen/src/expr/mod.rs:4810-4817 | crates/perry-codegen/src/expr/repsel_gates.rs:90-97 | crates/perry-codegen/src/expr/slot_rep.rs:227-234 | crates/perry-codegen/src/expr/slot_rep.rs:243-250 | crates/perry-codegen/src/lower_call/method_override.rs:232-239 | crates/perry-codegen/src/stmt/stable_packed_accumulator.rs:17-24 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/collectors/ptr_numarray.rs\u0060 and \u0060crates/perry-codegen/src/collectors/ptr_shape.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 165 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/perry-codegen/src/codegen/helpers.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"092656cbc57204cfb2f5621cfe1d12736df39a9dabfda1cb355a473ceeddc88e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/stmt/number_local_loop.rs:584-591 | crates/perry-codegen/src/stmt/string_length_loop.rs:242-249 \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/perry-codegen/src/stmt/number_local_loop.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e945cc9ea9add4de5a970ddb7f49e525eb93ffeea6f7cb1469c2f43e4c5e7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 55): crates/perry-codegen/src/builtin_proto.rs:211-215 | crates/perry-codegen/src/codegen/checked_integer.rs:377-381 | crates/perry-codegen/src/expr/array_literal.rs:309-314 | crates/perry-codegen/src/expr/array_literal.rs:433-437 | crates/perry-codegen/src/expr/bigint_set.rs:84-88 | crates/perry-codegen/src/expr/bigint_set.rs:196-200 | crates/perry-codegen/src/expr/bigint_set.rs:263-267 | crates/perry-codegen/src/expr/binary.rs:1052-1056 | crates/perry-codegen/src/expr/checked_super.rs:119-123 | crates/perry-codegen/src/expr/class_env.rs:155-159 | crates/perry-codegen/src/expr/class_first_evaluation.rs:89-93 | crates/perry-codegen/src/expr/collection_receiver.rs:66-70 | crates/perry-codegen/src/expr/compare.rs:477-481 | crates/perry-codegen/src/expr/compare.rs:876-880 | crates/perry-codegen/src/expr/family_slot.rs:278-282 | crates/perry-codegen/src/expr/folded_builtin_override.rs:850-854 | crates/perry-codegen/src/expr/index_get/symbol_ic.rs:36-40 | crates/perry-codegen/src/expr/inline_birth/fixed_alloc.rs:47-51 | crates/perry-codegen/src/expr/inline_birth/shared.rs:139-143 | crates/perry-codegen/src/expr/instance_misc1.rs:284-288 | crates/perry-codegen/src/expr/instance_misc1.rs:744-748 | crates/perry-codegen/src/expr/literals_vars.rs:856-860 | crates/perry-codegen/src/expr/literals_vars.rs:1110-1114 | crates/perry-codegen/src/expr/logical_collections.rs:486-490 | crates/perry-codegen/src/expr/logical_collections.rs:1741-1745 | crates/perry-codegen/src/expr/math_simple.rs:207-211 | crates/perry-codegen/src/expr/math_simple.rs:302-306 | crates/perry-codegen/src/expr/math_simple.rs:371-375 | crates/perry-codegen/src/expr/pod_record.rs:48-53 | crates/perry-codegen/src/expr/pod_record.rs:282-287 | crates/perry-codegen/src/expr/pod_record.rs:356-361 | crates/perry-codegen/src/expr/pod_record.rs:559-564 | crates/perry-codegen/src/expr/property_get/generic_dispatch.rs:181-185 | crates/perry-codegen/src/expr/property_get/helpers.rs:599-603 | crates/perry-codegen/src/expr/static_field_meta.rs:138-142 | crates/perry-codegen/src/expr/static_method.rs:483-487 | crates/perry-codegen/src/expr/suffix_cursor.rs:58-62 | crates/perry-codegen/src/expr/unary.rs:54-58 | crates/perry-codegen/src/lower_call/early_branches.rs:533-537 | crates/perry-codegen/src/lower_call/extern_func/pod_params.rs:306-311 | crates/perry-codegen/src/lower_call/func_ref.rs:213-217 | crates/perry-codegen/src/lower_call/new_alloc.rs:884-888 | crates/perry-codegen/src/lower_conditional.rs:362-368 | crates/perry-codegen/src/lower_string_concat.rs:287-291 | crates/perry-codegen/src/native_value/materialize.rs:487-491 | crates/perry-codegen/src/stmt/class_first_loop.rs:42-46 | crates/perry-codegen/src/stmt/class_first_loop.rs:93-97 | crates/perry-codegen/src/stmt/if_stmt.rs:181-188 | crates/perry-codegen/src/stmt/loops.rs:550-555 | crates/perry-codegen/src/stmt/loops.rs:789-794 | crates/perry-codegen/src/stmt/loops.rs:3813-3818 | crates/perry-codegen/src/stmt/number_local_loop.rs:455-459 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:912-916 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:1230-1234 | crates/perry-codegen/src/stmt/string_length_loop.rs:208-212 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/builtin_proto.rs\u0060 and \u0060crates/perry-codegen/src/expr/instance_misc1.rs\u0060 as WHOLE FILES: this scan already matched 4 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/perry-codegen/src/builtin_proto.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"431a5c4b01a69118a5cec39a005d90f4b1e44cad24bb8cfd550f733a10538124"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 9): crates/perry-codegen/src/expr/array_methods.rs:347-351 | crates/perry-codegen/src/expr/arrays_finds.rs:814-818 | crates/perry-codegen/src/expr/instance_misc1.rs:1049-1054 | crates/perry-codegen/src/expr/instance_misc1.rs:1056-1060 | crates/perry-codegen/src/expr/logical_collections.rs:1102-1109 | crates/perry-codegen/src/expr/logical_collections.rs:1116-1120 | crates/perry-codegen/src/expr/misc_methods.rs:163-167 | crates/perry-codegen/src/expr/misc_methods.rs:287-291 | crates/perry-codegen/src/expr/string_regex_proc.rs:546-550 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/array_methods.rs\u0060 and \u0060crates/perry-codegen/src/expr/instance_misc1.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 67 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/perry-codegen/src/expr/array_methods.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb54ce89318e468de3459ed82b7ba5efc12ff48bc537dea2e8fdee7bb6c9925c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/lower_call/ui_styling.rs:85-92 | crates/perry-codegen/src/lower_call/ui_styling.rs:97-103 \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/perry-codegen/src/lower_call/ui_styling.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"9335c5ba557eb789916844d5c5f8f76f37a64a5165e9578e9fac22d4d096ebb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/perry-codegen/src/expr/calls/crypto_misc.rs:202-206 | crates/perry-codegen/src/lower_call/property_get/number_string.rs:34-38 | crates/perry-codegen/src/lower_call/property_get/number_string.rs:46-53 | crates/perry-codegen/src/lower_call/property_get/number_string.rs:62-69 \u2014 there are 4 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/calls/crypto_misc.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b100b7d61f2e66482d7a67164eb2039b70adb33baace6e5dfef729990b6046"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/block.rs:1098-1105 | crates/perry-codegen/src/block.rs:1118-1125 \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/perry-codegen/src/block.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f390c1cd1412ec05ac72e5106f68bd27c03a904969995a6932e58c86b78ca3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/array_length.rs:32-36 | crates/perry-codegen/src/expr/instance_misc1.rs:746-753 \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/perry-codegen/src/expr/array_length.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73c6084689a8c7ea5d0827b7f27d07891fbd4d57e13025bec23ba4622c1d421"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 10): crates/perry-codegen/src/expr/bigint_set.rs:86-92 | crates/perry-codegen/src/expr/bigint_set.rs:198-204 | crates/perry-codegen/src/expr/bigint_set.rs:265-271 | crates/perry-codegen/src/expr/dispatch.rs:790-795 | crates/perry-codegen/src/expr/instance_misc1.rs:286-293 | crates/perry-codegen/src/expr/logical_collections.rs:488-494 | crates/perry-codegen/src/expr/math_simple.rs:209-215 | crates/perry-codegen/src/expr/math_simple.rs:304-310 | crates/perry-codegen/src/expr/math_simple.rs:373-379 | crates/perry-codegen/src/native_value/materialize.rs:489-495 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/bigint_set.rs\u0060 and \u0060crates/perry-codegen/src/expr/instance_misc1.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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/perry-codegen/src/expr/bigint_set.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a7e6b840dc4ccc9f6f29a12fb6160389004686d4791063aaf790fa528ae026"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/calls/fs.rs:285-292 | crates/perry-codegen/src/expr/calls/fs.rs:404-411 \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/perry-codegen/src/expr/calls/fs.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8e180a413bda559a0dfaa72c3695babfbe8c6c057c80ba45d0137f5e8fcc45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/calls/fs.rs:13-20 | crates/perry-codegen/src/expr/calls/fs.rs:137-144 \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/perry-codegen/src/expr/calls/fs.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"af63f9fd54ad2ed0f3676b04b95f71be2c10a4690497f6423fd675f3660b226f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/perry-codegen/src/expr/arrays_finds.rs:1454-1461 | crates/perry-codegen/src/expr/arrays_finds.rs:1464-1468 | crates/perry-codegen/src/expr/arrays_finds.rs:1471-1475 \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/perry-codegen/src/expr/arrays_finds.rs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"894ee3f23c8ab664045b37d8d7611050f350ba29381d31ee025b2d1aa85f49b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/static_method.rs:206-213 | crates/perry-codegen/src/expr/static_method.rs:217-224 \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/perry-codegen/src/expr/static_method.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"32452ca5f809bea58da2b93aa129f5dce505126626ecf9b9ff67eef884118340"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 35): crates/perry-codegen/src/codegen/entry.rs:1251-1256 | crates/perry-codegen/src/codegen/global_transfer.rs:217-222 | crates/perry-codegen/src/concat_site_cache.rs:197-202 | crates/perry-codegen/src/expr/array_pop.rs:60-65 | crates/perry-codegen/src/expr/array_push.rs:1124-1130 | crates/perry-codegen/src/expr/class_field_push.rs:30-35 | crates/perry-codegen/src/expr/compare.rs:246-252 | crates/perry-codegen/src/expr/compare.rs:605-610 | crates/perry-codegen/src/expr/compare.rs:956-961 | crates/perry-codegen/src/expr/compare.rs:1093-1098 | crates/perry-codegen/src/expr/compare_short_string.rs:19-24 | crates/perry-codegen/src/expr/i32_fast_path.rs:671-676 | crates/perry-codegen/src/expr/index.rs:138-144 | crates/perry-codegen/src/expr/index_get/guarded_array.rs:933-938 | crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs:145-150 | crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs:801-806 | crates/perry-codegen/src/expr/index_set_typed_array.rs:289-294 | crates/perry-codegen/src/expr/layout_read.rs:242-247 | crates/perry-codegen/src/expr/layout_read.rs:800-807 | crates/perry-codegen/src/expr/property_get.rs:535-540 | crates/perry-codegen/src/expr/property_get/generic_dispatch.rs:566-571 | crates/perry-codegen/src/expr/shadow_inline.rs:140-145 | crates/perry-codegen/src/expr/ta_element_read.rs:232-237 | crates/perry-codegen/src/expr/ta_param_f64_read.rs:253-258 | crates/perry-codegen/src/expr/typed_array_rmw.rs:291-296 | crates/perry-codegen/src/lower_string_method/char_code_at.rs:210-215 | crates/perry-codegen/src/proto_constants.rs:230-235 | crates/perry-codegen/src/proto_constants.rs:567-572 | crates/perry-codegen/src/stmt/loops.rs:3877-3882 | crates/perry-codegen/src/stmt/loops.rs:5326-5331 | crates/perry-codegen/src/stmt/masked_window_region.rs:920-925 | crates/perry-codegen/src/stmt/region_loop/guard.rs:131-136 | crates/perry-codegen/src/stmt/region_loop/guard.rs:623-628 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:1054-1059 | crates/perry-codegen/src/stmt/versioned_indexed_loop.rs:486-491 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/array_pop.rs\u0060 and \u0060crates/perry-codegen/src/expr/class_field_push.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 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/perry-codegen/src/codegen/entry.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"342f4206659af806ce1cd7e4d16fa17ca349418d52cfb7c4d190216b57a76526"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/calls/fs.rs:247-254 | crates/perry-codegen/src/expr/calls/fs.rs:266-273 \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/perry-codegen/src/expr/calls/fs.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"8460ee77e2774af94e018c848136fbdb1b04be2efa49155eeb6d239d1f377658"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/perry-codegen/src/expr/calls.rs:241-248 | crates/perry-codegen/src/expr/calls.rs:355-362 | crates/perry-codegen/src/expr/calls.rs:368-375 \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/perry-codegen/src/expr/calls.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e73af604c5491c635b406d3d39f2761cc07504386a01578c80668fc5db1d3a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/expr/env_clones.rs:96-103 | crates/perry-codegen/src/expr/env_clones.rs:123-130 \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/perry-codegen/src/expr/env_clones.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"86682c85d5fd63ac3f574ede4c815e0d00be49df2cfa413bd4f043d34a12ceca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-codegen/src/codegen/entry.rs:487-494 | crates/perry-codegen/src/codegen/entry.rs:498-505 \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/perry-codegen/src/codegen/entry.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"debe4a76c81b878e00632ebe5fc39a19f3b4d1f8804335a7e7177a6257bee738"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/url_search_params.rs:33-40 | crates/perry-hir/src/lower/expr_call/url_search_params.rs:78-85 \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/perry-hir/src/lower/expr_call/url_search_params.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"094440657791934439cfeefcfe7eff50862f3733a1356c0277f88133eae75d75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/perry-codegen/src/expr/calls/fs.rs:30-36 | crates/perry-codegen/src/expr/calls/fs.rs:48-54 | crates/perry-codegen/src/expr/calls/fs.rs:359-365 | crates/perry-codegen/src/expr/calls/fs.rs:461-467 \u2014 all 4 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/perry-codegen/src/expr/calls/fs.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f21363f7da4ec625d3525ae63b207657d3963c994504025f52705049ecd2f0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/nested_namespace.rs:113-119 | crates/perry-hir/src/lower/expr_call/nested_namespace.rs:137-143 \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/perry-hir/src/lower/expr_call/nested_namespace.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e30cfe429cd599af2456437df5933bacd33941ad4e15d451256a0b7eff9399"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen-glance/src/emit.rs:402-408 | crates/perry-codegen-swiftui/src/emit.rs:841-847 \u2014 before extracting anything, compare \u0060crates/perry-codegen-glance/src/emit.rs\u0060 and \u0060crates/perry-codegen-swiftui/src/emit.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 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/perry-codegen-glance/src/emit.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"658c17f68baeee0adb1c99fe0da90d3b6db24865f0ecc2e74d38cc6d4a337ba4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/put_value_store_ic.rs:120-124 | crates/perry-codegen/src/stmt/loops.rs:6821-6827 \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/perry-codegen/src/expr/put_value_store_ic.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a5e91bf3b6c43fc2171bf69103eca03569b89dc482c370f83567a5e80a8b48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/dispatch.rs:794-799 | crates/perry-codegen/src/expr/ic_fast_split.rs:93-99 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/dispatch.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa049619d8fafb8ab8a9037e07c44fedcda8997deabfa5c287dc6f62be14af2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/codegen/helpers.rs:305-311 | crates/perry-codegen/src/codegen/spec_abi.rs:107-113 \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/perry-codegen/src/codegen/helpers.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ed62115e977368d55ccf7d82ecfa5670c21b919941b118c7c9e2b69e2de500"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-api-manifest/src/emit.rs:86-92 | crates/perry-api-manifest/src/emit.rs:121-127 \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/perry-api-manifest/src/emit.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"38239c929d2518816caed7eb2d29a50772dba2614650ecafaf63c30f9f09b106"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/lower_call/extern_timers.rs:290-296 | crates/perry-codegen/src/lower_call/extern_timers.rs:298-304 \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/perry-codegen/src/lower_call/extern_timers.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa21058e71962b41d897f6af503a462bec6705d0604b26852b530ef7590bc74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): crates/perry-hir/src/lower/expr_call/nested_namespace.rs:147-153 | crates/perry-hir/src/lower/expr_call/nested_namespace.rs:171-177 | crates/perry-hir/src/lower/expr_call/nested_namespace.rs:197-203 | crates/perry-hir/src/lower/expr_call/nested_namespace.rs:208-214 | crates/perry-hir/src/lower/expr_call/nested_namespace.rs:219-225 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/nested_namespace.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbbdb00884226a01cbf5878deaf47f541aef95d2233d0178e2b67662277b9c92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/native_module/object_statics.rs:109-115 | crates/perry-hir/src/lower/expr_call/native_module/reflect_statics.rs:58-64 \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/perry-hir/src/lower/expr_call/native_module/object_statics.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bf432fb71faacf7f051b3b774e48515b1e5aedeefb7c5b18c5635df06667d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-codegen/src/expr/dispatch.rs:794-799 | crates/perry-codegen/src/expr/ic_fast_split.rs:93-99 | crates/perry-codegen/src/expr/unary.rs:72-78 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/dispatch.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"233332a17e2e3a424d54c286bdcf6a28f9500aa29d96126e9ab07c1e9fdf6e0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/expr/property_get/helpers.rs:504-510 | crates/perry-codegen/src/expr/property_get/helpers.rs:576-582 \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/perry-codegen/src/expr/property_get/helpers.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b20e3284f8ea2c1eafc3ee82308733e325d40e208dc623adbec5cd921aed1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-codegen/src/expr/compare.rs:989-995 | crates/perry-codegen/src/expr/compare.rs:1004-1010 | crates/perry-codegen/src/expr/compare.rs:1022-1028 \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/perry-codegen/src/expr/compare.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"700e9915f9f3b58e1fc39143bfad939b368240c70273414539f28e2c7aa5840b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/index_get.rs:710-716 | crates/perry-codegen/src/proto_constants.rs:1373-1378 \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/perry-codegen/src/expr/index_get.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6f5fcfd64a27dc434f3bdd0332d4c46bcdc90c67058b8a2bbd5254d28adcf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/literals_vars.rs:489-495 | crates/perry-codegen/src/expr/literals_vars.rs:498-503 \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/perry-codegen/src/expr/literals_vars.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13415b8cb70c1610126837be3c32884996117092cf2bf6ff4360a1ea69e1cf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-codegen/src/expr/calls/fs.rs:230-235 | crates/perry-codegen/src/expr/calls/fs.rs:248-254 | crates/perry-codegen/src/expr/calls/fs.rs:267-273 \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/perry-codegen/src/expr/calls/fs.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"7429e703c2809ea993294467bd350e943fee1c74be50910a1cfaa5c4cdfe0aea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/lower_call/new.rs:998-1004 | crates/perry-codegen/src/lower_call/new.rs:1290-1296 \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/perry-codegen/src/lower_call/new.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeba47b6131d81eecafd77861293315aa1400b4c414327e22d09d6c242f45bb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-ext-argon2/src/lib.rs:83-89 | crates/perry-ext-bcrypt/src/lib.rs:76-82 \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/perry-ext-argon2/src/lib.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8590c9824a430bfc77c419e2b66082d10dca0b7f34d1e7667cbfdc1d2f563b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-ext-net/src/payload_socket.rs:1009-1015 | crates/perry-ext-net/src/payload_socket.rs:1249-1255 \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/perry-ext-net/src/payload_socket.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"8179e40cf6df71826b7a1079101d826916a24fada55a326ba07574e4aeb88290"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/lower_call/func_ref.rs:1349-1354 | crates/perry-codegen/src/lower_call/scalar_method.rs:1135-1141 \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/perry-codegen/src/lower_call/func_ref.rs"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a119474c65af94773853c25f1d76041e30febbc72e0bb5a876df0e07efaded3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/nested_namespace.rs:125-131 | crates/perry-hir/src/lower/expr_call/nested_namespace.rs:184-190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/nested_namespace.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae8024333801a2896d5ab168893f98a71c0e01a06528a7f095c1c7e121c869c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/lower_call/ui_styling.rs:318-324 | crates/perry-codegen/src/lower_call/ui_styling.rs:464-470 \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/perry-codegen/src/lower_call/ui_styling.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"5119108a86e8244d3cb0b861b48fbdb5d5a0be658f9e5e46a5a6b14db5776b8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/codegen/helpers.rs:285-291 | crates/perry-codegen/src/codegen/helpers.rs:405-411 \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/perry-codegen/src/codegen/helpers.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"edce830f1fda63eac3ee2e684f8a23e361ba903f9b4ab0188f6b2efb7aab14e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/compare.rs:1189-1194 | crates/perry-codegen/src/expr/property_set.rs:106-112 \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/perry-codegen/src/expr/compare.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9dd3836f3fb6703b42760783f0cc47aedabf0154b6bb2eedb93c25d30c0c8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/dialect/mod.rs:389-395 | crates/perry-codegen/src/dialect/mod.rs:970-976 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/dialect/mod.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef1e6437cb2819a1ed8f5760589f014dce261038af339fe6c68a5eff7ba828d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/nested_namespace.rs:159-165 | crates/perry-hir/src/lower/expr_call/nested_namespace.rs:231-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/nested_namespace.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17ec25328c26c13288de35f1ad9a4ab6252e19e6dd7eb16eee62ae8c2715a51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/native_module/reflect_statics.rs:33-39 | crates/perry-hir/src/lower/expr_call/native_module/reflect_statics.rs:137-143 \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/perry-hir/src/lower/expr_call/native_module/reflect_statics.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"383e8c53d9b277c0ac14ab3d8b205a815bfbbbe21ad457746f1c6692978e2698"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-codegen/src/lower_call/ui_styling.rs:116-122 | crates/perry-codegen/src/lower_call/ui_styling.rs:138-144 | crates/perry-codegen/src/lower_call/ui_styling.rs:156-162 \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/perry-codegen/src/lower_call/ui_styling.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c64773c62b015c7a4efaf05168d776a69a36816bfdf90c8f8c8e5f54db3752"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/perry-ext-argon2/src/lib.rs:25-31 | crates/perry-ext-argon2/src/lib.rs:83-89 | crates/perry-ext-bcrypt/src/lib.rs:49-55 | crates/perry-ext-bcrypt/src/lib.rs:76-82 \u2014 there are 4 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-argon2/src/lib.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"43607eeef169c7cdfef3100e49e486ce94c680b96466a33f6fe49b8e03ae49d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-codegen/src/expr/array_push.rs:908-914 | crates/perry-codegen/src/expr/method_site.rs:851-856 | crates/perry-codegen/src/stmt/loops.rs:3300-3305 \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/perry-codegen/src/expr/array_push.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d9eec2d65d560bbab52202e0e4daa8e5a5a3f1585783f258c792fd8c79125f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8): crates/perry-codegen/src/expr/calls/fs.rs:31-37 | crates/perry-codegen/src/expr/calls/fs.rs:49-55 | crates/perry-codegen/src/expr/calls/fs.rs:219-224 | crates/perry-codegen/src/expr/calls/fs.rs:231-236 | crates/perry-codegen/src/expr/calls/fs.rs:250-255 | crates/perry-codegen/src/expr/calls/fs.rs:269-274 | crates/perry-codegen/src/expr/calls/fs.rs:360-366 | crates/perry-codegen/src/expr/calls/fs.rs:462-468 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/calls/fs.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe81fcacdff210493a740a7d122c42dd5d5d90fec6e096e571b4ca79c71a08cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/lower_call/console_promise.rs:498-503 | crates/perry-codegen/src/lower_call/console_promise.rs:508-513 \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/perry-codegen/src/lower_call/console_promise.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"3daa0eaa6bdc11dac949e9748bcfb96abca66860c4878011c40532f1480ac00a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen-glance/src/emit_glue.rs:118-123 | crates/perry-codegen-wear-tiles/src/emit_glue.rs:69-74 \u2014 before extracting anything, compare \u0060crates/perry-codegen-glance/src/emit_glue.rs\u0060 and \u0060crates/perry-codegen-wear-tiles/src/emit_glue.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 111 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/perry-codegen-glance/src/emit_glue.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b448b3a40e9cb3291281f465c590d0f8ea31b3e1cc2bd5f65be01b9fa1a54bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/perry-codegen-glance/src/emit.rs:112-116 | crates/perry-codegen-glance/src/emit.rs:136-140 | crates/perry-codegen-glance/src/emit_glue.rs:10-15 | crates/perry-codegen-wear-tiles/src/emit_glue.rs:11-16 \u2014 before extracting anything, compare \u0060crates/perry-codegen-glance/src/emit_glue.rs\u0060 and \u0060crates/perry-codegen-wear-tiles/src/emit_glue.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 111 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/perry-codegen-glance/src/emit.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9a32e94f65092a989f7292de4ceb5bfb67e921724959850f4b093873790086"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower_decl/private_members.rs:266-271 | crates/perry-hir/src/lower_decl/private_members.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_decl/private_members.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"85269979f6f738073dd522b82e864098fb5cbb305e74de8923e4a426cee090b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/dialect/mod.rs:1171-1176 | crates/perry-codegen/src/dialect/mod.rs:1232-1237 \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/perry-codegen/src/dialect/mod.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee2b8bfa858b107126fe15f3aaed7d48bc3893d6470b077ed72913854c0f5bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/nested_namespace.rs:659-664 | crates/perry-hir/src/lower/expr_call/nested_namespace.rs:696-701 \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/perry-hir/src/lower/expr_call/nested_namespace.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff882af25dc75257e1756c249ba550853a934e595af253a4d0c94f281350aa6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/arrays_finds.rs:579-584 | crates/perry-codegen/src/expr/string_regex_proc.rs:22-26 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/arrays_finds.rs\u0060 and \u0060crates/perry-codegen/src/expr/string_regex_proc.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 30 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/perry-codegen/src/expr/arrays_finds.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"320600f367a520115f58d01a29802f01684ab8cd48e2476de15bfaa4a7ec8e39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/nested_namespace.rs:328-333 | crates/perry-hir/src/lower/expr_call/nested_namespace.rs:406-411 | crates/perry-hir/src/lower/expr_call/nested_namespace.rs:453-458 \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/perry-hir/src/lower/expr_call/nested_namespace.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1c00d8ce6a8d08e1a7bcd4c751e36a9e300b8c46c859074fca48d301575f73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-hir/src/lower/expr_call/local_array_methods.rs:1005-1010 | crates/perry-hir/src/lower/expr_call/local_array_methods.rs:1028-1033 | crates/perry-hir/src/lower/expr_call/local_array_methods.rs:1051-1056 \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/perry-hir/src/lower/expr_call/local_array_methods.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ce44e63b32921c192265cb9e0875b92d3a2528d57061176a4c7f421b974223"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/compare_typeof_object.rs:20-25 | crates/perry-codegen/src/expr/index_get/guarded_array.rs:862-866 \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/perry-codegen/src/expr/compare_typeof_object.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef976036325a0393259f859c3bfbe284e17022f1db4fc18528ee9d7b8c93851"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/lower_call/builtin.rs:205-210 | crates/perry-codegen/src/lower_call/builtin.rs:1484-1489 \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/perry-codegen/src/lower_call/builtin.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d94d337f1165905763f0f3ed45f2cf83b63c0eb7c0b6e9d2ba60b966e72ca6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/perry-codegen/src/expr/array_length.rs:31-36 | crates/perry-codegen/src/expr/dispatch.rs:789-794 | crates/perry-codegen/src/expr/inline_birth.rs:46-50 | crates/perry-codegen/src/expr/layout_read.rs:270-275 | crates/perry-codegen/src/expr/mod.rs:2694-2699 \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 5 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/array_length.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d23d9a99677a841a627b876e1175476b9491af5e8ef266bb9ab1a05589131a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): crates/perry-hir/src/lower/expr_call/globals.rs:757-762 | crates/perry-hir/src/lower/expr_call/globals.rs:783-788 | crates/perry-hir/src/lower/expr_call/module_static.rs:334-339 | crates/perry-hir/src/lower/expr_call/module_static.rs:360-365 | crates/perry-hir/src/lower/expr_call/module_static.rs:709-714 | crates/perry-hir/src/lower/expr_call/module_static.rs:781-786 \u2014 before extracting anything, compare \u0060crates/perry-hir/src/lower/expr_call/globals.rs\u0060 and \u0060crates/perry-hir/src/lower/expr_call/module_static.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 296 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/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0f7994a7aad9a99894f331b60380d741d29210ad54ab7cd37c3ca5e4e338c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/lower_call/property_get/map_set.rs:160-165 | crates/perry-codegen/src/lower_call/property_get/map_set.rs:244-249 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/property_get/map_set.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a876b0471c1d97d791e9c72764165685df5bbb69a30e08e5156e65ef089f89c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/codegen/helpers.rs:242-246 | crates/perry-codegen/src/stmt/binding_cell.rs:366-371 \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/perry-codegen/src/codegen/helpers.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"46fdf5d928e6193780b0c406b943dc5d9c4db00f204db06c89ecbb0274be7410"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/misc_methods.rs:294-299 | crates/perry-codegen/src/expr/misc_methods.rs:302-306 \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/perry-codegen/src/expr/misc_methods.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b8aacfe75311d64f0e0f4d15a35d41995e1e264f8247ce92e72d077387d04a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/testing/temp_slots.rs:116-120 | crates/perry-codegen/src/testing/temp_slots.rs:147-152 \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/perry-codegen/src/testing/temp_slots.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a65c98d82f75d904d36c9cb8b34239af74536a13c6773b19765f57d84a32f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-codegen/src/lower_call/ui_styling.rs:318-323 | crates/perry-codegen/src/lower_call/ui_styling.rs:464-469 | crates/perry-codegen/src/lower_call/ui_styling.rs:491-496 \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/perry-codegen/src/lower_call/ui_styling.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7affe0a7051fbc443565eadd940726204abb51db3fc1df3f09a68ec844d4e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/codegen/closure.rs:342-347 | crates/perry-codegen/src/codegen/closure.rs:388-393 \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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2068228151fb3bf065af5312be6f565eb61e42642945a80559f3411028eacf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower/widget_decl.rs:122-127 | crates/perry-hir/src/lower/widget_decl.rs:1212-1217 \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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f160a61dff8792a7183ad6e1ab17d07e442b8e327fa4e0da6ca0268334e163d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 6): crates/perry-hir/src/lower/expr_call/array_only_methods.rs:955-957 | crates/perry-hir/src/lower/expr_call/array_only_methods.rs:959-964 | crates/perry-hir/src/lower/expr_call/array_only_methods.rs:991-995 | crates/perry-hir/src/lower/expr_call/array_only_methods.rs:996-1001 | crates/perry-hir/src/lower/expr_call/array_only_methods.rs:1005-1010 | crates/perry-hir/src/lower/expr_call/array_only_methods.rs:1014-1019 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/array_only_methods.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf20c6d852121f41b5bf22332b95df0d05d85c3e93f975ec56ad953dd07def6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower/widget_decl.rs:1208-1213 | crates/perry-hir/src/lower/widget_decl.rs:1404-1409 \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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b814f41f281bf7a8e4b7afa2f88739d20b306d40804ec9cede90ad99efc3e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/agent_ptr.rs:150-154 | crates/perry-codegen/src/expr/agent_ptr.rs:194-198 \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/perry-codegen/src/expr/agent_ptr.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"61aa4a08bbc32ff14af70718c1117b4f3f8debb2a18be6ca29776d3b7f7edd2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): crates/perry-codegen/src/expr/bigint_set.rs:78-82 | crates/perry-codegen/src/expr/bigint_set.rs:190-194 | crates/perry-codegen/src/expr/bigint_set.rs:257-261 | crates/perry-codegen/src/expr/logical_collections.rs:480-484 | crates/perry-codegen/src/expr/math_simple.rs:201-205 | crates/perry-codegen/src/expr/math_simple.rs:296-300 | crates/perry-codegen/src/expr/math_simple.rs:365-369 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/bigint_set.rs\u0060 and \u0060crates/perry-codegen/src/expr/logical_collections.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 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/perry-codegen/src/expr/bigint_set.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55ce0bec2dd0d5c737baf47143989e8cf1577d922c3fefda3fa848f6d53b0a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/perry-codegen/src/expr/arrays_finds.rs:649-653 | crates/perry-codegen/src/expr/os_uri_dates.rs:311-315 | crates/perry-codegen/src/expr/property_get.rs:199-203 | crates/perry-codegen/src/expr/string_regex_proc.rs:317-321 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/arrays_finds.rs\u0060 and \u0060crates/perry-codegen/src/expr/string_regex_proc.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 30 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/perry-codegen/src/expr/arrays_finds.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ca8673f8874bf74d0e2b620d85c91db1769ec2cb9e9e498ca2910964f67025"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/perry-ext-http/src/server/response.rs:635-639 | crates/perry-ext-http/src/server/response.rs:648-652 | crates/perry-ext-http/src/server/response.rs:674-678 | crates/perry-ext-http/src/server/response.rs:716-720 \u2014 all 4 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/perry-ext-http/src/server/response.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fec292565eaa58b32cca691c1f72856dc7e34b7f01e8541cbeb74f93250981"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/perry-codegen/src/codegen/helpers.rs:304-308 | crates/perry-codegen/src/codegen/helpers.rs:360-364 | crates/perry-codegen/src/codegen/spec_abi.rs:106-110 \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/perry-codegen/src/codegen/helpers.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8e597a80e2fad796d545d3c6c57e984c526b05af414bf181c06c5cca857b95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/index_set_guarded.rs:102-106 | crates/perry-codegen/src/expr/index_set_guarded.rs:235-239 \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/perry-codegen/src/expr/index_set_guarded.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c45ea56d400514ac3f22d840b244ad461e2ac11570881bedd5c09db4019d5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-ext-ws/src/handshake.rs:163-167 | crates/perry-ext-ws/src/handshake.rs:208-212 \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/perry-ext-ws/src/handshake.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aaedf0d22960da2bb2d92752feb4649d155e4b390460706d96b7aff9ed1f49e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/method_site.rs:371-375 | crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs:1713-1717 \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/perry-codegen/src/expr/method_site.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b3faab16c84ea222082ae4759279dcd78021315a489785143114ab49f0e0ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/lower/widget_decl.rs:128-132 | crates/perry-hir/src/lower/widget_decl.rs:133-137 \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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2bf56c67275591a6d12c2f15d53837c721f095a9fcc4fb994dcb89805456e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/stmt/class_first_loop.rs:36-40 | crates/perry-codegen/src/stmt/class_first_loop.rs:87-91 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/class_first_loop.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cda96fbaa6d0ce32419b7f78ee482cfe8214e2d7909bc562d7fdf911086413d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/perry-codegen/src/expr/array_methods.rs:275-279 | crates/perry-codegen/src/expr/bigint_set.rs:702-706 | crates/perry-codegen/src/expr/logical_collections.rs:1148-1152 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/bigint_set.rs\u0060 and \u0060crates/perry-codegen/src/expr/logical_collections.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 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/perry-codegen/src/expr/array_methods.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"1728c747920257f1ade9a0753d3146868aee2523609a63cae62a92598acf79ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/v8_interop.rs:72-76 | crates/perry-codegen/src/expr/v8_interop.rs:166-170 \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/perry-codegen/src/expr/v8_interop.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebe2e67e4054b253affe7ad35b92015eb8047a0ce848aadcc96ed3743fca92e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/lower_call/property_get/imported_object.rs:65-69 | crates/perry-codegen/src/stmt/stable_packed_loop.rs:1132-1136 \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/perry-codegen/src/lower_call/property_get/imported_object.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a557a4addbf5b0f4d8fdf9baefaea33972837d93854e3da6085b4900025a71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/lower_call/lookup_first.rs:173-177 | crates/perry-codegen/src/lower_call/new.rs:713-717 \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/perry-codegen/src/lower_call/lookup_first.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"6340db224e675bcd5e23674dfcea98e362aaffee1cd05e2c72388a10ded64837"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs:465-469 | crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs:470-474 \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/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"8916a1ca77e268f6afcf4ec98c04698b7ebe50b5423b09ae983f9a42b11e2540"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/dialect/mod.rs:586-590 | crates/perry-codegen/src/dialect/mod.rs:647-651 \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/perry-codegen/src/dialect/mod.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"0892653df8a68c0637174f6cc43f777d3177c450fa3f4ee6f3516ebef457837b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/module_class_static.rs:226-230 | crates/perry-hir/src/lower/expr_call/module_class_static.rs:237-241 \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/perry-hir/src/lower/expr_call/module_class_static.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b7f781136c10b04577129e492916a1f084b293f60711ba5ca14ec5d1ad4638"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen-glance/src/lib.rs:41-45 | crates/perry-codegen-wear-tiles/src/lib.rs:34-38 \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/perry-codegen-glance/src/lib.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"843f8dd57117c6ed84d9f9d3e986992827dba9981eb3c338c63b46fa1a9fcac8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/perry-codegen/src/expr/dyn_extern_i18n.rs:482-486 | crates/perry-codegen/src/expr/dyn_extern_i18n.rs:1321-1325 | crates/perry-codegen/src/expr/index_set_guarded.rs:492-496 | crates/perry-codegen/src/expr/property_set.rs:401-405 \u2014 there are 4 copies across 3 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 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/dyn_extern_i18n.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b436966e2fffaf1c8ab82773e33622d9bc7e02c22f34c16749538e2a34776f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen-glance/src/emit_glue.rs:134-138 | crates/perry-codegen-wear-tiles/src/emit_glue.rs:81-85 \u2014 before extracting anything, compare \u0060crates/perry-codegen-glance/src/emit_glue.rs\u0060 and \u0060crates/perry-codegen-wear-tiles/src/emit_glue.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 111 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/perry-codegen-glance/src/emit_glue.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb3a42baa6ff0e1743ac6b2ad962953243556cd9252e76b52d4bd165c10e041"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 10): crates/perry-hir/src/lower/expr_call/nested_namespace.rs:117-121 | crates/perry-hir/src/lower/expr_call/nested_namespace.rs:141-145 | crates/perry-hir/src/lower/expr_call/nested_namespace.rs:152-156 | crates/perry-hir/src/lower/expr_call/nested_namespace.rs:165-169 | crates/perry-hir/src/lower/expr_call/nested_namespace.rs:176-180 | crates/perry-hir/src/lower/expr_call/nested_namespace.rs:191-195 | crates/perry-hir/src/lower/expr_call/nested_namespace.rs:202-206 | crates/perry-hir/src/lower/expr_call/nested_namespace.rs:213-217 | crates/perry-hir/src/lower/expr_call/nested_namespace.rs:224-228 | crates/perry-hir/src/lower/expr_call/nested_namespace.rs:237-241 \u2014 all 10 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/perry-hir/src/lower/expr_call/nested_namespace.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b308d48a35c23dcd20b8807c479d72bb0beeac8387cd218d05a7093d5a7335b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/dialect/mod.rs:691-695 | crates/perry-codegen/src/dialect/mod.rs:765-769 \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/perry-codegen/src/dialect/mod.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"891fa0184c687a6a82fcbf6ef3e654beb46b780cc0deba64113d8f4932875c82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/logical_collections.rs:1353-1357 | crates/perry-codegen/src/expr/math_simple.rs:497-501 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/logical_collections.rs\u0060 and \u0060crates/perry-codegen/src/expr/math_simple.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 117 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/perry-codegen/src/expr/logical_collections.rs"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"0739171dadee378946f97cf51c1a1d085c7d290de0c510bf60497ddb9ee0641f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/lower/widget_decl.rs:738-742 | crates/perry-hir/src/lower/widget_decl.rs:1131-1135 \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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac1241da644bc289c2dab930411dfe8f41069a552255f3e2058085cabe38fd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/perry-codegen/src/dialect/mod.rs:797-801 | crates/perry-codegen/src/dialect/mod.rs:1171-1175 | crates/perry-codegen/src/dialect/mod.rs:1232-1236 \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/perry-codegen/src/dialect/mod.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"4087da4d69b9ef84c1a1e6d55ad7466f24d3f55a5c363a22e0295dd17118603a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/perry-hir/src/lower/widget_decl.rs:738-742 | crates/perry-hir/src/lower/widget_decl.rs:790-794 | crates/perry-hir/src/lower/widget_decl.rs:1131-1135 \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/perry-hir/src/lower/widget_decl.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"baabe83c7d61b08297f9810530cc428a042777dad9924cc1a24dba33246f8161"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 20): crates/perry-codegen/src/expr/array_methods.rs:336-340 | crates/perry-codegen/src/expr/arrays_finds.rs:725-729 | crates/perry-codegen/src/expr/env_clones.rs:34-38 | crates/perry-codegen/src/expr/os_uri_dates.rs:144-148 | crates/perry-codegen/src/expr/os_uri_dates.rs:150-154 | crates/perry-codegen/src/expr/os_uri_dates.rs:156-160 | crates/perry-codegen/src/expr/os_uri_dates.rs:162-166 | crates/perry-codegen/src/expr/os_uri_dates.rs:168-172 | crates/perry-codegen/src/expr/os_uri_dates.rs:174-178 | crates/perry-codegen/src/expr/os_uri_dates.rs:180-184 | crates/perry-codegen/src/expr/os_uri_dates.rs:186-190 | crates/perry-codegen/src/expr/os_uri_dates.rs:192-196 | crates/perry-codegen/src/expr/os_uri_dates.rs:198-202 | crates/perry-codegen/src/expr/string_regex_proc.rs:33-37 | crates/perry-codegen/src/expr/string_regex_proc.rs:303-307 | crates/perry-codegen/src/expr/string_regex_proc.rs:310-314 | crates/perry-codegen/src/expr/string_regex_proc.rs:393-397 | crates/perry-codegen/src/expr/string_regex_proc.rs:399-403 | crates/perry-codegen/src/expr/string_regex_proc.rs:487-491 | crates/perry-codegen/src/expr/string_regex_proc.rs:588-592 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/arrays_finds.rs\u0060 and \u0060crates/perry-codegen/src/expr/string_regex_proc.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 30 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/perry-codegen/src/expr/array_methods.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"51cdb0cdc80abda5d20191a8524f0f47a30dc52648ae46a4e019fad82414d6d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/index_set_typed_array.rs:391-395 | crates/perry-codegen/src/expr/index_set_typed_array.rs:402-406 \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/perry-codegen/src/expr/index_set_typed_array.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c41a5c3f39f560a277cad623a068b3551d90257575a88a7f81e1c2cd80b3c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/calls/crypto_keys.rs:178-182 | crates/perry-codegen/src/expr/calls/crypto_misc.rs:189-193 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/expr/calls/crypto_keys.rs\u0060 and \u0060crates/perry-codegen/src/expr/calls/crypto_misc.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 54 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/perry-codegen/src/expr/calls/crypto_keys.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab8162a7deefd809b8bfeb6571f5487c9ba172a9d3008abed4bbd4d2cf8980e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-ext-net/src/payload_closed.rs:33-37 | crates/perry-ext-net/src/payload_pipe.rs:132-136 \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/perry-ext-net/src/payload_closed.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6598d3be6a7d30291abb3caa6ab74917a554a3af5294a25f0420d9bb647b3685"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/codegen/arguments.rs:368-372 | crates/perry-codegen/src/expr/property_get/generic_dispatch.rs:355-359 \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/perry-codegen/src/codegen/arguments.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a839fa173578bac2ba82bfbe289b6f06c7a325682d76452731b50b8839b232"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/codegen/checked_integer.rs:335-339 | crates/perry-codegen/src/codegen/checked_integer.rs:366-370 \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/perry-codegen/src/codegen/checked_integer.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d5415f6e77dae572d99ab6e96af23c1a1e0d3a4d6164250bb3c9951cb7046d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/perry-codegen/src/codegen/closure.rs:1587-1591 | crates/perry-codegen/src/codegen/entry.rs:1471-1475 | crates/perry-codegen/src/codegen/entry/module_init.rs:680-684 | crates/perry-codegen/src/codegen/function.rs:1813-1817 \u2014 before extracting anything, compare \u0060crates/perry-codegen/src/codegen/closure.rs\u0060 and \u0060crates/perry-codegen/src/codegen/entry.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 221 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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53078a05a834396e61da9b0a3d1ad81f621aba01be79ae358c4c63b35cb9b27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/codegen/entry.rs:39-43 | crates/perry-codegen/src/codegen/entry.rs:82-86 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/entry.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8ebf65459d37c129db1f81592daafd3f364e256a7075303ffcf0c1f0e2893e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/codegen/string_pool.rs:1787-1796 | crates/perry-codegen/src/codegen/string_pool/image_handles.rs:59-68 \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/perry-codegen/src/codegen/string_pool.rs"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"13efcdc2e95bcec3a3312d358d2fe04cb5f6d2359cb94d3bfd3bd597069399f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/codegen/typed_abi.rs:267-271 | crates/perry-codegen/src/lower_call/property_get.rs:154-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/perry-codegen/src/codegen/typed_abi.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fdfcbeac0cc1bf59cc6e8c263cb091148d1384e05d45be7a55f88393bb05b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/perry-codegen/src/expr/array_pop.rs:95-105 | crates/perry-codegen/src/expr/array_pop.rs:152-162 \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/perry-codegen/src/expr/array_pop.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f97a8549e63a91c3c6e19fcf59075daf950695c58dd4097d6c2699fc8943a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-codegen/src/expr/array_push.rs:1097-1106 | crates/perry-codegen/src/expr/index_get.rs:752-761 \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/perry-codegen/src/expr/array_push.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece8f09300d8718c56083b3df50fbb408327be217bea0b2c0c5a7056215fc3c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/binary.rs:1687-1691 | crates/perry-codegen/src/expr/i32_fast_path.rs:1460-1464 \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/perry-codegen/src/expr/binary.rs"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c7a727fae5c591bab9f334d0a11f8b63c95e362320b7ca59dea056dba5ca06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/perry-codegen/src/expr/element_shape_guard.rs:232-237 | crates/perry-codegen/src/expr/element_shape_guard.rs:286-291 | crates/perry-codegen/src/expr/element_shape_guard.rs:408-413 \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/perry-codegen/src/expr/element_shape_guard.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2cbe6875235ea3e93f2694273ed4bb4e026637b3c000efaabb3a016b906b28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/expr/function_bind.rs:54-60 | crates/perry-codegen/src/expr/method_site.rs:278-284 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/function_bind.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e9bee0296e4cffa45edc8942644b221780d4461d7ba7661ddd4bc127041fce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/perry-codegen/src/expr/index.rs:429-433 | crates/perry-codegen/src/expr/index_get/guarded_array.rs:45-49 | crates/perry-codegen/src/expr/index_get/guarded_array.rs:65-69 \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/perry-codegen/src/expr/index.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c6cf32248c31f720a4d8c2f2df2b7068c6696a2156eab6eff4adbea0313ebb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/index_get.rs:526-530 | crates/perry-codegen/src/expr/index_get.rs:1488-1492 \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/perry-codegen/src/expr/index_get.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ba8a68773f814e64992d7acd416c0376d8558b3355190c59290cc0ea26ccd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/index_get/foreign_counter.rs:188-192 | crates/perry-codegen/src/stmt/loops.rs:2420-2424 \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/perry-codegen/src/expr/index_get/foreign_counter.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"622deee856bf4c79b2ab3bfcf3f91586c0f515d6056bbbea786787b6a8c65ec0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs:620-625 | crates/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs:823-828 \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/perry-codegen/src/expr/index_get/inline_dyn_typed_array.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c36002b0200deb41bc136dc663d5a25fe9667eb74f24cea95f11a4828462a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/mod.rs:3944-3949 | crates/perry-codegen/src/stmt/indexed_owner_loop.rs:954-959 \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/perry-codegen/src/expr/mod.rs"},"region":{"startLine":3944}}}],"partialFingerprints":{"codehealthFindingId/v1":"90df30a96b3f9f0a0228aca800e14c47ee6760ad0a2177504c13c35b3c7c3ffa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-codegen/src/expr/pod_record.rs:775-780 | crates/perry-codegen/src/lower_call/extern_func/pod_params.rs:89-94 \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/perry-codegen/src/expr/pod_record.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"c963e0a5fa2709595d6941468ded2969ac1dfdcae93b4b6ff0fa6f9233f99a7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/perry-codegen/src/expr/property_get.rs:1603-1609 | crates/perry-codegen/src/expr/property_get/helpers.rs:511-517 | crates/perry-codegen/src/expr/property_get/helpers.rs:584-590 \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/perry-codegen/src/expr/property_get.rs"},"region":{"startLine":1603}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa18b9a2971088df3833e41a7e32723a3e1a2979ff4ddc228dae8d1b101fe13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/expr/write_barrier.rs:778-782 | crates/perry-codegen/src/expr/write_barrier.rs:800-804 \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/perry-codegen/src/expr/write_barrier.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"41cdcf215fd89d73fe338f70201b53c38f58a3342b97bb742bfa696f65920cca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/layout_desc/create_families.rs:958-964 | crates/perry-codegen/src/layout_desc/create_families.rs:1189-1195 \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/perry-codegen/src/layout_desc/create_families.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e952fdaaefbbca1529d98f77f37f33798685c3c97cd5ed43c62d44d68eaf30a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/lower_call/extern_func.rs:695-699 | crates/perry-codegen/src/lower_call/extern_func.rs:704-708 \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/perry-codegen/src/lower_call/extern_func.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"2858c77313b1a9fdc85b835d7c133351d46757944455c49af50e2b8768e576dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/lower_call/extern_func.rs:743-749 | crates/perry-codegen/src/lower_call/extern_func.rs:843-849 \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/perry-codegen/src/lower_call/extern_func.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"e019bda1db1a1b726448faa2c0f63ea35fa70bab100ec57d08392391f83db6ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/lower_call/extern_timers.rs:212-216 | crates/perry-codegen/src/lower_call/extern_timers.rs:259-263 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/extern_timers.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc2f805877ba4dafc1402595a7bb83d7d3330bfb717fe56adf7f771bce766bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/lower_call/property_get/imported_object.rs:107-111 | crates/perry-codegen/src/lower_call/property_get/imported_object.rs:253-257 \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/perry-codegen/src/lower_call/property_get/imported_object.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"003ce706cce4e73931048b79e9b6e58a6bfecfdd2b870148fb11180de9dbb16c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/module.rs:422-426 | crates/perry-codegen/src/module.rs:436-440 \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/perry-codegen/src/module.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad4675d6533b620d7bc6504cde17265ed334fa709d25d02a056fe07aef879fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/stmt/indexed_owner_loop.rs:1151-1155 | crates/perry-codegen/src/stmt/indexed_owner_loop.rs:1163-1167 \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/perry-codegen/src/stmt/indexed_owner_loop.rs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"74355905751496e037e19a207f5aedd8dfd6d2d6a27ca249eb4262227f8ca6d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-codegen/src/stmt/region_loop/verify.rs:113-119 | crates/perry-codegen/src/stmt/region_loop/verify.rs:187-193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/region_loop/verify.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"8652523262323e9bd94d6e18068d77646cc0900b78ddabd831241bed0d60e515"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-codegen/src/type_analysis/predicates.rs:816-820 | crates/perry-codegen/src/type_analysis/predicates.rs:831-835 \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/perry-codegen/src/type_analysis/predicates.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a25b7708400c8d973f7990b66594772b7c5c038e86d96de7560a9c220e26807"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/perry-component-host/src/sync_wasi/udp.rs:56-62 | crates/perry-component-host/src/sync_wasi/udp.rs:91-97 \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/perry-component-host/src/sync_wasi/udp.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bac16df9b6a03198f729620619d5da8d117ac1ff8ba5e21ea12cf7cee9a685e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/perry-container-compose/src/backend/docker.rs:145-152 | crates/perry-container-compose/src/backend/docker.rs:198-205 \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/perry-container-compose/src/backend/docker.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd484c53a28dfa40df295391e672af060a9b2d88fc2768ba2f9fbdac1550ffa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-ext-cheerio/src/lib.rs:216-220 | crates/perry-ext-cheerio/src/lib.rs:245-249 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-cheerio/src/lib.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4866558c968a49f20a56efd056e1acf68ce923581cdc98a8b71315a22327be0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-ext-cheerio/src/lib.rs:321-325 | crates/perry-ext-cheerio/src/lib.rs:337-341 \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/perry-ext-cheerio/src/lib.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"259df4d1b686ce31615f1efb47475467293ea1ee32f497ff323bcd0a67d0dea5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-ext-ethers/src/lib.rs:24-28 | crates/perry-ext-ethers/src/lib.rs:138-142 \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/perry-ext-ethers/src/lib.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"93df2532d5fee1ec76fbae4a76021695bac893b9429fb31128cfb41b1f7a41a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-ext-sharp/src/lib.rs:40-44 | crates/perry-ext-sharp/src/lib.rs:58-62 \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/perry-ext-sharp/src/lib.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"736808290529bd7a9e80766875f0ded8d76f94dae92b133430c1876c611db5f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-ext-zlib/src/lib.rs:191-196 | crates/perry-ext-zlib/src/lib.rs:221-226 \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/perry-ext-zlib/src/lib.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b65fea840e1ef6374adea0838084c582237ee401c9ff3b55dc51f85f257073"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/perry-ffi/src/async_runtime.rs:217-226 | crates/perry-ffi/src/async_runtime.rs:240-249 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ffi/src/async_runtime.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"0614b434b50c484ba967aea7cfa2bf0a7f1bae0ecf113b5e4749d945a4950157"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/destructuring/var_decl/native_fetch.rs:329-333 | crates/perry-hir/src/lower/expr_call/mod.rs:223-227 \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/perry-hir/src/destructuring/var_decl/native_fetch.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"5578267e6ce5a73db69eabbc64da7ca191d16da2554f2eb9081293cedb9df440"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/destructuring/var_decl/native_new.rs:201-205 | crates/perry-hir/src/lower/expr_assign.rs:226-230 \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/perry-hir/src/destructuring/var_decl/native_new.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"1964218f5d6da6a8069e9cea171fca9b98424c5ef829787af0c15084638287c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/destructuring/var_decl/type_infer.rs:244-248 | crates/perry-hir/src/patched_builtins.rs:106-110 \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/perry-hir/src/destructuring/var_decl/type_infer.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"693f280c9c230406cbcdf823b99abe68b329ece34eb690ab037f2a922d7bde3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/ir/decl.rs:438-443 | crates/perry-hir/src/ir/decl.rs:449-454 \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/perry-hir/src/ir/decl.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e60fab8d2ace2303195b4c31cc71426ee5270e372a2e8fc8af807726a9663dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/array_only_methods.rs:21-25 | crates/perry-hir/src/lower/module_decl/object_literal.rs:11-15 \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/perry-hir/src/lower/expr_call/array_only_methods.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"104c7d5d0c8c618eb179548cecdb64e4f4c3d284501313a8aade1ed19f35e1fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/module_static.rs:1342-1346 | crates/perry-hir/src/lower/expr_member.rs:910-914 \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/perry-hir/src/lower/expr_call/module_static.rs"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fd790bcbb37dd66443c38936dfeca70b01aca653c2fb4d720000817676fe79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/nested_namespace.rs:27-31 | crates/perry-hir/src/lower/expr_call/nested_namespace.rs:58-62 \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/perry-hir/src/lower/expr_call/nested_namespace.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fdf24b9e5b2586b08713cf727e64d3db3a1c8b3ddb312c504a00fd35c3b8241"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/post_args_dispatch.rs:75-79 | crates/perry-hir/src/lower/expr_call/post_args_dispatch.rs:115-119 \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/perry-hir/src/lower/expr_call/post_args_dispatch.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e7d275baeae7c17d476ea3960b056915d8d4ef4c393d8f07981d610296914f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/perry-hir/src/lower/expr_call/post_args_dispatch.rs:145-150 | crates/perry-hir/src/lower/expr_call/post_args_dispatch.rs:205-210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower/expr_call/post_args_dispatch.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"347cf142290daffcc11527c449c2962f1dc09b7f3ab89fd5a2f74854e9cdf9e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/perry-hir/src/lower/expr_member.rs:738-742 | crates/perry-hir/src/lower/expr_member.rs:784-788 \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/perry-hir/src/lower/expr_member.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8166a8113f204ceb7decb3b0183a96c37eacce8e43970042803882db7874a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (87 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/HoneEditorView.kt:124-210 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/HoneEditorView.kt:124-210 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/HoneEditorView.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/HoneEditorView.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 174 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":"android-build/app/src/main/java/com/perry/app/HoneEditorView.kt"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d75f62a53df58e89d5780e49c1dd5189007d00b911a271d5ac9e59f67de768c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (73 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:953-1025 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1301-1373 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87d4712252d5a4a88faa0372a372b54d3ac0c319edc8a258053ee2967b701d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (64 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/HoneEditorView.kt:56-119 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/HoneEditorView.kt:56-119 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/HoneEditorView.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/HoneEditorView.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 174 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":"android-build/app/src/main/java/com/perry/app/HoneEditorView.kt"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1a6a8e531aa0180130bf70e54836aa0618080fab5482862c358b4c0b7fd772"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1052-1097 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1400-1445 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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 \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1052\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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"4430309a10cdf9079b2a0f702341a017955ba3116bf350e2e386f0ef82e8918b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:524-566 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:675-717 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c29ac918b11e0245642ce970d1ec3e866e30d04b5c988441ed6fba438114be3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:722-763 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1067-1108 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"070a129d0006a02299787ebd67cc5b326edc90b176398e2c6eecd977d168f52e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:909-950 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1257-1298 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f47d89d88c9004947f58ebf24f2099ad17cdc4483e24aadace7e5691e64872"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36\u201338 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:825-860 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1171-1208 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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 \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt:825\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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6048cc3f605472add5fbc69b11a6594c0dff9285c0a4afe69df92fb764093d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:680-714 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1025-1059 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ac5d4040cf022233cf78873f45af9a6bb6c008f4370faef9e514cc46d0511f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:586-618 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:737-769 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec503b0cafb549822d5b976d59de336eaa4693fa67a1f402959a65a88b2c312"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:460-489 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:611-640 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb26b6f849b4ea7db6af5a3806b70fa0a9637f840317d792f6ec22e49f767cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryActivity.kt:100-124 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryActivity.kt:145-169 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryActivity.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryActivity.kt\u0060 as WHOLE FILES: this scan already matched 4 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. 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":"android-build/app/src/main/java/com/perry/app/PerryActivity.kt"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"14106d7e2e81eb8cb28445900e79e2cb8511a6ba5af069b65ca503b68aebe8c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryActivity.kt:140-163 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryActivity.kt:201-224 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryActivity.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryActivity.kt\u0060 as WHOLE FILES: this scan already matched 4 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. 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":"android-build/app/src/main/java/com/perry/app/PerryActivity.kt"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fee94a82e335ca4284325938bed15046313f61cf55f51456e7cf4177c1c4c4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1028-1051 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1376-1399 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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 \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1028\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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"8634b482b97c9bf00de2b2b8497e4db801599e2601007b656a4fdf957843a425"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201323 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBackgroundWorker.kt:26-44 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBackgroundWorker.kt:26-48 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBackgroundWorker.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBackgroundWorker.kt\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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":"android-build/app/src/main/java/com/perry/app/PerryBackgroundWorker.kt"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd222dd2d02191e6027a5b6aedb05c50ef6cedf4f9fdd1c7e0294ad6af14e463"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:803-824 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1148-1170 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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 \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt:803\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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada3fba12082bad27159fa7f315c35ac975814931720217e4540113f15d2cebf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201322 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:635-653 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:786-807 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4e0814333dcadcc5370e1d206aa70c21ff75d0319ed9c46daaf0c49e509f3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1620-1641 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:2192-2212 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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 \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1620\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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1620}}}],"partialFingerprints":{"codehealthFindingId/v1":"781fd442f5eca45a0b4f9e65c4a6aa5b56e421614c0a18c2f236b228202794ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201322 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1699-1720 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:2270-2286 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"30cd2d50e74a838d73effab5b369601b4b816069fc65a20a89878dc86bbc7aae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201322 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1750-1771 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:2316-2332 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1750}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c15fa49bf000fa52eb026033a884bcb7e7d9c4db2304909594d7f64819fecff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1127-1146 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1475-1494 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3aa6fef084798fb65d54b2ca0dbd2e3179e99fe885530b8a7fcf8687c291a5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:503-521 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:654-672 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c841f23e711cd8794610b962e6dc4eb2e312cdbdd22ba9749c1fbb362a4a94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1154-1172 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1502-1520 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e1274b583f3abc032b0902e58fa31e46249e5b3be41378c7ad62651680af31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:657-674 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:811-828 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c43fa0e24b4e50256ceeb20fc9bd8df728722f4909338dbd53182ba6d610b49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/HoneEditorView.kt:214-229 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/HoneEditorView.kt:214-229 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/HoneEditorView.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/HoneEditorView.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 174 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":"android-build/app/src/main/java/com/perry/app/HoneEditorView.kt"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d1772126f26300cb6cbdf522873784d19da10e6987df731f06efb43e7b8da9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1319-1334 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1898-1912 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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 \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1319\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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ed4cbd7a6eb44dedbdd9de17a76ce8937139c496ffc3d642666bde2461b0ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1426-1441 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:2002-2017 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"53dbe91d4c6f2383c3e387a31fbf020cbe0369e0f32df8a0872cdbb8bcdccb19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1463-1478 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:2036-2051 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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 \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1463\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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c53603033a8555da88fcbda9a3278ddab3fa2576548455f9e3084fb33698411"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1550-1565 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:2123-2138 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b3e78864ba266f6e84f74bb1937f4f54683b38a71ca0face0b21a9dd47de02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:246-260 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:274-288 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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 \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt:246\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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b14a7d6ae3da9e9daa381dd0e18c409389580b1d099fcd1b9009e985e838aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:366-380 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:517-531 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd77a98a289790fca4cba0d7d261394061cb1ca878fc549701ae0c9d24466de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:415-428 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:566-579 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf06e8b6a7eccc1670be3fe220ad2e02a297edbf34a059ad39a1dc1dbfe9484"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:570-583 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:721-734 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a88d6c830770214add79310b675755264797a2084684b100e89445c4aebdb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1778-1791 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:2339-2352 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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 \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1778\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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"89faab9c83ebad44d8f30dba64a91e5ee44e222b4f15997eafb6555af822103c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:331-343 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:440-452 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"62cba2e65337298ea1b66a25b353d5613f6d906cb4a81ad66eb4f1b0a0cb37fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1241-1253 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1589-1601 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"af35bf96599c6e38f82cbe3f5c17f56d866fc2d7b987522b2192ac76f4572ba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1267-1279 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1805-1817 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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 \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1267\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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd1cb13d23153b4e102b3624909d8a610ab7c9c1e88e8865e10f4e27b00dd6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1379-1391 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1955-1967 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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 \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1379\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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"298c3fb2ab51aab89b2621679d1b64600d3a9de1ba5456afd377ed49d4c39d17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:864-874 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1212-1222 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abecdec724f0f3d42d7d9d02096ff768a640ad623b0360ab9bb44b429501e47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryActivity.kt:84-93 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryActivity.kt:129-138 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryActivity.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryActivity.kt\u0060 as WHOLE FILES: this scan already matched 4 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. 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":"android-build/app/src/main/java/com/perry/app/PerryActivity.kt"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"455417ed9fdd01269f775048131a86f558d42208e8b45769635467a3f6210db4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:622-631 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:773-782 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9908475a0386f9a37d3e8401d4ffc085360e13091daa2cda36b3d437bfece23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1413-1422 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1989-1998 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"04217b79718b32b12ad6ae2a8725e6b218ef2103edf780a6041de168c89b60a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1335-1342 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1913-1920 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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 \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1335\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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b968fb2508489f3e65703e3a36b2ec06a95c67e7412f441579cf4aa547a94b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1392-1399 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1968-1975 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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 \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1392\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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72b24133b0a474787d561fdf2cf47de6a850819644844035a1ee11dddd9f5cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1611-1618 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:2183-2190 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35bc320c81c71f905cf0bb4c3da46252210d030bf0ab7a7d5327655f3acd627"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1647-1654 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:2218-2225 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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 \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1647\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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1647}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aeefc80dc1dd4c7beb32d82aa17f92c3ecad59a8c93a6d92cdee1a7623f87bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:109-115 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:110-116 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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 \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt:109\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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1867048757377472888cfcf0c7ae142c2d01f95233b97df9e3ca35b7381d392"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:303-309 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:412-418 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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 \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt:303\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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a3bf6473d290d71f3e405936fca6f46020b20a9af0b7b733f74ef48bd50eb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1335-1340 | android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1392-1397 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1913-1918 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1968-1973 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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 \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1335\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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1f54d62fee3425794569a91cce6f3d2e7bd6833d8e0f58331587fb14e0ec06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:101-106 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:102-107 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb24d355286939e09ddb63f0d7c70ff3a59f4388735caee80a73bb2b489bd787"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1183-1188 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1531-1536 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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 \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1183\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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a139ea0d3bba2b30aae5b786d6ce02e22f067fd93aef18a7874543f3e956803"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1284-1289 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1822-1827 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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 \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1284\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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ba1d129ff3652dd72fca6f9a9e0c43034f81749ea67bd5b99508fb75126e2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 4): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1569-1574 | android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1588-1591 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:2142-2147 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:2160-2163 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a42ac7ae4c0aae35ecc924876a0ed5ddaa1f1e81e2de57112372c283b0e3ba5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1580-1585 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:2152-2157 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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 \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1580\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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1580}}}],"partialFingerprints":{"codehealthFindingId/v1":"3514c00d2af3bb7c00d6612bcbc9bf911052c02d4ca0cfd26933715c90b01d53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:550-554 | android-build/app/src/main/java/com/perry/app/PerryBridge.kt:597-601 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:701-705 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:748-752 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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 \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt:550\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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92dc5b4a6b56f5117dfb060db84d18fb106daa6c5919781a3bd203d3f77c0cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:94-98 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:95-99 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1c30ff400e1c3375d3778d5d2b176acfcaa97ef27f2f0dbf9c09dec636061f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1599-1603 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:2171-2175 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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 \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1599\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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1599}}}],"partialFingerprints":{"codehealthFindingId/v1":"174c855d62df95c5b56ad6fddce02cad17cf44ea0e77d2fca99b44d24a5568d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1604-1608 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:2176-2180 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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 \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1604\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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1604}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4ee443c5a9e9a0f2e5ff3eeaa7c0ba56505f95d19f4ceb5e5e87d69e2f9703"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/HoneEditorView.kt:47-53 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/HoneEditorView.kt:47-53 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/HoneEditorView.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/HoneEditorView.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 174 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":"android-build/app/src/main/java/com/perry/app/HoneEditorView.kt"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"330411ace62d9e27885a6d20f2dee7eed692eb9750164e653f1a6b4b9e1535d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryActivity.kt:127-133 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryActivity.kt:188-194 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryActivity.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryActivity.kt\u0060 as WHOLE FILES: this scan already matched 4 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. 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":"android-build/app/src/main/java/com/perry/app/PerryActivity.kt"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44935bd08ae76bf79a68586c9cc941cd68bc883ac322626c1c0c884db442a33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:181-189 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:141-149 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"80127421b9d67dc464a37cf7ddd73acb9ab0657c060a89bd4ba3ad66fcb0d33f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:198-209 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:158-169 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd830998b2e66f6d480e90b97f40bacbf098b3eecf0b5c0d8998c7cc1afc92a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:265-276 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:374-385 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"292773ab0241fac5f362e637813b065456d21b940d16cacf5956987797aad973"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:285-295 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:394-404 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cdd1bb65b39b2313167d902e270d2cd8010bcf6f8aa37dbdad14ca5e00b6b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:314-324 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:423-433 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f13e3d1196ea71e3d36160abcd89e497a7165ab1ae47b27486f16f764085a5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:346-351 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:455-460 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e2fe0733f86fff6b368ef4e4caff4ab35feb887486cc4bd42a49bf065771de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:385-390 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:536-541 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd715b9822347e95751437e6e31101ab416e6f43048ffaffecb9020ec73a6c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:393-397 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:544-548 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"044509bc6719aff4c283ff12e8cce1ba2a2a2d43f91250914c245aa7c71ad9f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:402-409 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:553-560 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b9614f054fd7608c5eee9ee851ffbeca5050f25e6d69d111d8b61a504df928"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:445-457 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:596-608 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e790d41ea94a56ddb88411af25fd71194d394f2f2d2123cc00e15d69919b2e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:765-777 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1110-1122 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"094148f5f6cf0e30d62e48df261c26aaa1a01386e1841a1faaaf73a22a91a0da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:879-886 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1227-1234 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a56499d3c0876300c6a006a7f2bd7ac0dbe58e937159bde4a718d5093020a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:888-899 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1236-1247 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"b735e7b548f5b35862f845dff7d3baca9c0cec6ee4a219789baa0c5186e15601"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1100-1113 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1448-1461 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"678625ceaac60b67041bdcbec47bd8b5f99ec75c70ba158844d8f5e4a54258f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1116-1123 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1464-1471 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0280a74e5e148a2252a4a63266e8d53707b2104ee3dea7c2762c5172869722"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1209-1217 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1557-1565 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"209612892029aff842dd6a49223d768284850ca52d51d25d258bde5638a83916"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1227-1235 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1575-1583 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4745f3d28c6cdb0457d42fc0ef0363742415d31fb1cc6d15f2454ca0cb73a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1443-1453 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:2019-2026 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"df11d5eb9e345fcc4494e5ad423f0080d390329443149ec3f06a1269bde41d99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1481-1487 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:2054-2060 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e6ceb7bc951725bac7d2666d05d20de58dd938bfc855b1bcff7f0b4f624d6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1490-1496 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:2063-2069 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc7c68cd3678b5bc7286911e46541ae18920d8eb5a8cf011783517f43921211"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1657-1663 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:2228-2234 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10fc91064475d1d1a4a02c0f11c659a6fdc4ec13a17effe2617450ebe905f2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1728-1737 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:2294-2303 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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 \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1728\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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7648f350a7daf4f032c8cb3b98083dd1f396a1bc4401f88e01f09a45277212"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): android-build/app/src/main/java/com/perry/app/PerryBridge.kt:1293-1299 | crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt:1831-1837 \u2014 before extracting anything, compare \u0060android-build/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 and \u0060crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt\u0060 as WHOLE FILES: this scan already matched 74 separate duplicated blocks between them, totalling at least 1129 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":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"747c5b74c71a879f65cfe5ec7cd00df64ee78f65ea62685caf3c3c5f54619089"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2): scripts/gc_store_site_inventory.py:1269-1314 | scripts/gc_store_site_inventory.py:1335-1380 \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 \u0060scripts/gc_store_site_inventory.py:1269\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":"scripts/gc_store_site_inventory.py"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"0974882e777e06927ecdb9fe1970a65da6d4728c6909661b93778faa08ac5b4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): docs/audits/gc-rss-instructions-2026-10-03/qb6-current0ed-build-v14.py:70-106 | docs/audits/gc-rss-instructions-2026-10-03/qb6-currente532-build-v1.py:61-97 \u2014 before extracting anything, compare \u0060docs/audits/gc-rss-instructions-2026-10-03/qb6-current0ed-build-v14.py\u0060 and \u0060docs/audits/gc-rss-instructions-2026-10-03/qb6-currente532-build-v1.py\u0060 as WHOLE FILES: 82% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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 \u0060docs/audits/gc-rss-instructions-2026-10-03/qb6-current0ed-build-v14.py:70\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":"docs/audits/gc-rss-instructions-2026-10-03/qb6-current0ed-build-v14.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab63f4965776e67976a261118dbb068805b78b42c8b57a59229bcffe87059237"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201331 lines \u00D7 2): scripts/gc_store_site_inventory.py:1291-1319 | scripts/gc_store_site_inventory.py:1480-1510 \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 \u0060scripts/gc_store_site_inventory.py:1291\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":"scripts/gc_store_site_inventory.py"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69f1a219a9ed5aafcb0d12d80b3b84e291574acf74277224ddfa40869c9b946"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): scripts/gc_store_site_inventory.py:1356-1384 | scripts/gc_store_site_inventory.py:1459-1487 \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 \u0060scripts/gc_store_site_inventory.py:1356\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":"scripts/gc_store_site_inventory.py"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fd6a1124edf3cb312535b02c1da01099acdbce58b5c37b396cc3b6ae1940e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): scripts/gc_root_dominance_check.py:2737-2760 | scripts/gc_root_dominance_check.py:5691-5715 \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 \u0060scripts/gc_root_dominance_check.py:2737\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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":2737}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2c879127d8eba48bac500fbfdd3163108e20d636e8cb291af6f917645a5eac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 3): docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py:38-58 | docs/audits/gc-rss-instructions-2026-10-03/gc-currentc170-regression-profile-v23.py:38-58 | docs/audits/gc-rss-instructions-2026-10-03/gc-final-instruction-profile.py:38-60 \u2014 before extracting anything, compare \u0060docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py\u0060 and \u0060docs/audits/gc-rss-instructions-2026-10-03/gc-currentc170-regression-profile-v23.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 72 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":"docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce67530219e829990f752434b3e69ed26f5631592e48e1dea0c769ae3266b9b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201322 lines \u00D7 2): scripts/shape_descriptor_census.py:1215-1233 | scripts/shape_descriptor_census.py:1396-1417 \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/shape_descriptor_census.py"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0e6c56b674a5a5197fa2388e91efbabffc33b21ea4e6e5c54783b7bbdeee24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): scripts/shape_descriptor_census.py:1284-1304 | scripts/shape_descriptor_census.py:1325-1346 \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, \u0060scripts/shape_descriptor_census.py:1305\u0060 calls \u0060function_body\u0060 and \u0060scripts/shape_descriptor_census.py:1347\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":"scripts/shape_descriptor_census.py"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f0d0598f0d611a139ee9f662fabbcf0e64a872774eb0f9e9b556f191e1a15d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): scripts/compiler_output_harness/repsel_determinism.py:148-167 | scripts/compiler_output_harness/repsel_temp_hygiene.py:186-205 \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 after the matched lines, \u0060scripts/compiler_output_harness/repsel_temp_hygiene.py:211\u0060 calls \u0060mkdir\u0060 and \u0060scripts/compiler_output_harness/repsel_determinism.py:170\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":"scripts/compiler_output_harness/repsel_determinism.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5a218a257fe20428d2f3ad72a4d39ff946f0a86dc80f677b4485e7405421ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): scripts/gc_runtime_root_holders.py:1295-1313 | scripts/gc_runtime_root_holders.py:1334-1353 \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 \u0060scripts/gc_runtime_root_holders.py:1295\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":"scripts/gc_runtime_root_holders.py"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"6805cdb2f55cabc513482d5b50e3bfc1a67f93fc917890d66b0b6e4d9a29b28b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): scripts/shape_descriptor_census.py:1347-1366 | scripts/shape_descriptor_census.py:1367-1385 \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/shape_descriptor_census.py"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3b28613a563b3f9acfa42fadd408c602dd73e38c99495c759fef67a6bf7c6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): scripts/copied_minor_fallback_report.py:805-823 | scripts/copied_minor_fallback_report.py:869-885 \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/copied_minor_fallback_report.py"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d49ba443ce779a5eebfe52807d272267ef03c6f3c00af797b1449639e3ec44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): scripts/shape_descriptor_census.py:1149-1167 | scripts/shape_descriptor_census.py:1218-1235 \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 \u0060scripts/shape_descriptor_census.py:1149\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":"scripts/shape_descriptor_census.py"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"a896c075e6274f29dacf2a7d4a3c91809bf160ad394d5d9fd940a4d4c79f3a7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201318 lines \u00D7 2): scripts/native_export_collisions.py:177-194 | scripts/native_export_collisions.py:239-249 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"scripts/native_export_collisions.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c29451e293869e224fbc10893309ff32436653d6b7bedfc1b3d0cb647eb184"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 2): scripts/sso_unbox_inventory.py:584-597 | scripts/string_payload_access_inventory.py:426-443 \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 \u0060scripts/sso_unbox_inventory.py:584\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":"scripts/sso_unbox_inventory.py"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"8246da81109aa7344ccfe0d67ef975afcd16c82f9dd645979b3feca929ba0423"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): scripts/check_cross_thread_promise_provenance.py:76-92 | scripts/runtime_abi_check.py:150-166 \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. 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":"scripts/check_cross_thread_promise_provenance.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbeb4c0bfaf591b90cfdee4fa11172a1302c124c2548d5e62ec9abe3168988f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): scripts/check_gate_freshness.py:795-810 | scripts/check_gate_freshness.py:901-917 \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 \u0060scripts/check_gate_freshness.py:795\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":"scripts/check_gate_freshness.py"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2b2557c0b5ea9f3df81303ed9a00598f178cf6bda4ede0fe48f38dc623974a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201317 lines \u00D7 2): scripts/thread_exit_address_globals.py:676-692 | scripts/thread_exit_address_globals.py:792-803 \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 \u0060scripts/thread_exit_address_globals.py:676\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":"scripts/thread_exit_address_globals.py"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f6146118ae94214ae429d6632221d7e3e5c6c4dd53ffb5f0addfe2384be623"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): scripts/compiler_output_harness/verification.py:724-739 | scripts/compiler_output_harness/verification.py:1080-1095 \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 \u0060scripts/compiler_output_harness/verification.py:724\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":"scripts/compiler_output_harness/verification.py"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"82da30828020bafc7237b30af320ba368295eabc480ec63a21a174dbc0543592"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 2): scripts/gc_root_dominance_check.py:5495-5506 | scripts/gc_root_dominance_check.py:8479-8494 \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/gc_root_dominance_check.py"},"region":{"startLine":5495}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed705669218c2980bc0d5b972638b73815b0f01a092365832e3f61159a7c1a09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): scripts/gc_runtime_root_holders.py:600-615 | scripts/gc_runtime_root_holders.py:682-697 \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 \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":"scripts/gc_runtime_root_holders.py"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d746870061334fec9bd753cdcdbaadfca0ffd47de56c6fbd340d4fa440fe042"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): scripts/sso_unbox_inventory.py:607-620 | scripts/string_payload_access_inventory.py:448-463 \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 \u0060scripts/string_payload_access_inventory.py:448\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. 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":"scripts/sso_unbox_inventory.py"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa90f1f0bb92b03335c8eb9e94b24c5c25f92753ec657c524c81af1a3234a655"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201315 lines \u00D7 2): scripts/test262_subset.py:498-505 | scripts/test262_subset.py:530-544 \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/test262_subset.py"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fcf98e02084a3afbffaa550bc1e21be17dc72a2600f9b64a6ac805272e2437"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): scripts/addr_class_inventory.py:324-337 | scripts/gc_store_site_inventory.py:254-267 \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. 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":"scripts/addr_class_inventory.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd26070ac9c257527cace2b9173a7e03ae5dc79b76b8e84f64b10c509a9810e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): scripts/thread_exit_address_globals.py:697-710 | scripts/thread_exit_address_globals.py:718-730 \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/thread_exit_address_globals.py"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab19aefe2f43b618f871b3726f7411e27bcb8e867a1ede23b6e6311bbf41f568"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 8): docs/audits/gc-rss-instructions-2026-10-03/latest-main2026-normal-auto-driver.py:59-71 | docs/audits/gc-rss-instructions-2026-10-03/primary-entry-once-main07-v46-auto.py:84-96 | docs/audits/gc-rss-instructions-2026-10-03/primary-lazy-rss-main07-v52-auto.py:84-96 | docs/audits/gc-rss-instructions-2026-10-03/primary-learned-floor-main07-v60-auto.py:83-95 | docs/audits/gc-rss-instructions-2026-10-03/primary-mainad0-v79-auto.py:67-79 | docs/audits/gc-rss-instructions-2026-10-03/primary-map-prefix-main07-v69-auto.py:83-95 | docs/audits/gc-rss-instructions-2026-10-03/primary-map-prefix-main07-v69r1-auto.py:83-95 | docs/audits/gc-rss-instructions-2026-10-03/primary-map-prefix-main07-v69r2-auto.py:93-105 \u2014 before extracting anything, compare \u0060docs/audits/gc-rss-instructions-2026-10-03/latest-main2026-normal-auto-driver.py\u0060 and \u0060docs/audits/gc-rss-instructions-2026-10-03/primary-lazy-rss-main07-v52-auto.py\u0060 as WHOLE FILES: 84% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 3 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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":"docs/audits/gc-rss-instructions-2026-10-03/latest-main2026-normal-auto-driver.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"207c4e9a23e81cc3140a663b15df241209910bc9b93591b0ccbde9cba0b5e64c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): scripts/compiler_output_harness/verification.py:724-737 | scripts/compiler_output_harness/verification.py:826-838 | scripts/compiler_output_harness/verification.py:1080-1093 \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 \u0060scripts/compiler_output_harness/verification.py:724\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":"scripts/compiler_output_harness/verification.py"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8291d3c8b6a6f62ce02948c326153e084ad160e276f8114c5457ce482c7304"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): scripts/buffer_b1_validate.py:131-143 | scripts/buffer_b4_validate.py:131-143 \u2014 before extracting anything, compare \u0060scripts/buffer_b1_validate.py\u0060 and \u0060scripts/buffer_b4_validate.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 57 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":"scripts/buffer_b1_validate.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e9eefd4c7487ba855d4d13ba34a6771611a910625d20c1bd2b27de3dc562ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): scripts/compiler_output_harness/repsel_knob_isolation.py:564-573 | scripts/compiler_output_harness/repsel_knob_isolation.py:575-587 \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 \u0060scripts/compiler_output_harness/repsel_knob_isolation.py:564\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, \u0060scripts/compiler_output_harness/repsel_knob_isolation.py:574\u0060 calls \u0060arm\u0060, \u0060_capture\u0060 and \u0060scripts/compiler_output_harness/repsel_knob_isolation.py:564\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":"scripts/compiler_output_harness/repsel_knob_isolation.py"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d17f736a2d35397d902ed258499882dc7c116b2d2616f555270e382b07e7ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): scripts/compiler_output_harness/verification.py:643-655 | scripts/compiler_output_harness/verification.py:811-823 \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/compiler_output_harness/verification.py"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dac5a39a04fda62953b08b072d9cd9c7a31785921d36169869c343501322205"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): scripts/sso_unbox_inventory.py:394-404 | scripts/string_payload_access_inventory.py:253-265 \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. 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":"scripts/sso_unbox_inventory.py"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3f8ed8dabcb09a241cce8d30e8982c429d110b21c826b991029a55aa70c80c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 4): scripts/compiler_output_harness/verification.py:728-739 | scripts/compiler_output_harness/verification.py:754-764 | scripts/compiler_output_harness/verification.py:829-840 | scripts/compiler_output_harness/verification.py:1084-1095 \u2014 all 4 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 \u0060scripts/compiler_output_harness/verification.py:728\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":"scripts/compiler_output_harness/verification.py"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da733e88869daf13ec3bd495321e5bc5485541b79f7512c674556b92f0171c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py:98-109 | docs/audits/gc-rss-instructions-2026-10-03/gc-currentc170-regression-profile-v23.py:98-109 | docs/audits/gc-rss-instructions-2026-10-03/gc-final-instruction-profile.py:100-111 \u2014 before extracting anything, compare \u0060docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py\u0060 and \u0060docs/audits/gc-rss-instructions-2026-10-03/gc-currentc170-regression-profile-v23.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 72 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":"docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2e716f22485bb81e9e9ba282082cc6a9f131ff59a08982e865f165d23949da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): scripts/addr_class_inventory.py:339-350 | scripts/gc_store_site_inventory.py:269-280 \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. 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":"scripts/addr_class_inventory.py"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f86fe5d94f818bdee3bb14ba0b4f4652a714b6086f1b4b3380c18aefa0aeef0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): scripts/check_gate_freshness.py:436-447 | scripts/gate_failure_watch.py:150-161 \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":"scripts/check_gate_freshness.py"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7333d24c320d5a8940de42ffc500d22ddd7de74f4614a8b44390eccd6b16c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): scripts/component_async_guest_exports_acceptance.py:33-44 | scripts/component_scheduler_wake_acceptance.py:28-39 \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":"scripts/component_async_guest_exports_acceptance.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1579baf1441496f3861709e859da7eb9a2c088706f3a41d5e834feba7f8d41ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): scripts/copied_minor_fallback_report.py:823-834 | scripts/copied_minor_fallback_report.py:897-907 \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 \u0060scripts/copied_minor_fallback_report.py:823\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, \u0060scripts/copied_minor_fallback_report.py:896\u0060 calls \u0060check_fallback_source_attribution\u0060 and \u0060scripts/copied_minor_fallback_report.py:823\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":"scripts/copied_minor_fallback_report.py"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"301411b0d2fe7d381458f909b92af52cb773391b86574a75b24f4b789a5bf7c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): scripts/gc_root_dominance_check.py:2725-2736 | scripts/gc_root_dominance_check.py:5679-5690 \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 \u0060scripts/gc_root_dominance_check.py:2725\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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":2725}}}],"partialFingerprints":{"codehealthFindingId/v1":"263405ee5f2cbbfe30a29be26d0eed7e716780f5fa6706bc559f4566e6b2faae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): scripts/global_sink_isolation.py:536-547 | scripts/global_sink_isolation.py:556-567 \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/global_sink_isolation.py"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"f398de165dc01254c1fa3e74f846f8ecadf6473f69e70487362ea9f5ea5d22d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): scripts/thread_exit_address_globals.py:660-670 | scripts/thread_exit_address_globals.py:678-689 \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 \u0060scripts/thread_exit_address_globals.py:660\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 before the matched lines, \u0060scripts/thread_exit_address_globals.py:659\u0060 calls \u0060expect\u0060, \u0060any\u0060 and \u0060scripts/thread_exit_address_globals.py:678\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":"scripts/thread_exit_address_globals.py"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe96521c40459e7f9fdc1ddd403c47c3db61d061c2891ca13626dbbf6d76d71b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): scripts/component_async_acceptance.py:61-71 | scripts/component_persistent_acceptance.py:52-62 | scripts/component_producer_acceptance.py:64-74 | scripts/component_reader_acceptance.py:62-72 \u2014 before extracting anything, compare \u0060scripts/component_async_acceptance.py\u0060 and \u0060scripts/component_persistent_acceptance.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 63 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":"scripts/component_async_acceptance.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40f8133a44504069e4d46b9568c76140f867da0c91a49507d21fd52ba093fd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): scripts/compiler_output_harness/verification.py:584-594 | scripts/compiler_output_harness/verification.py:598-608 \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 \u0060scripts/compiler_output_harness/verification.py:584\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":"scripts/compiler_output_harness/verification.py"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"a465b1c42eb79f949c9da03074f90e302fcd2401ff932563a36e7bfb9d06d49e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): scripts/component_host_acceptance.py:114-124 | scripts/component_host_acceptance.py:162-172 \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 \u0060scripts/component_host_acceptance.py:114\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":"scripts/component_host_acceptance.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea7780dd4058626ad155818328951418c778e9391101b192d805e5e68d18133"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): scripts/copied_minor_fallback_report.py:719-729 | scripts/copied_minor_fallback_report.py:731-741 \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 \u0060scripts/copied_minor_fallback_report.py:719\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":"scripts/copied_minor_fallback_report.py"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb94637eed231558809822ab15a400cb92d218845b137690ab3086ff10e5fce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): scripts/gc_1090_evidence_report.py:582-592 | scripts/gc_1090_evidence_report.py:650-661 \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 \u0060scripts/gc_1090_evidence_report.py:582\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":"scripts/gc_1090_evidence_report.py"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d718bf6749e04ad4500409575d5184bc3a429cde23d92489f063382f8afa129"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): scripts/gc_root_dominance_check.py:2704-2714 | scripts/gc_root_dominance_check.py:5657-5667 \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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":2704}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ef60be25bb5bc3281001ac7ea9a4d23e7b204e9ddd07b01b65243ca734bb69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): scripts/gc_store_site_inventory.py:804-814 | scripts/registry_lifetime_check.py:216-226 \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. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060scripts/gc_store_site_inventory.py:803\u0060 calls \u0060group\u0060 and \u0060scripts/registry_lifetime_check.py:215\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":"scripts/gc_store_site_inventory.py"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e674c604bf82abc298b2b9465fd9ba233451395d8c65f7e83a28d7225b7aad5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py:13-22 | docs/audits/gc-rss-instructions-2026-10-03/gc-currentc170-regression-profile-v23.py:13-22 | docs/audits/gc-rss-instructions-2026-10-03/gc-final-instruction-profile.py:13-22 \u2014 before extracting anything, compare \u0060docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py\u0060 and \u0060docs/audits/gc-rss-instructions-2026-10-03/gc-currentc170-regression-profile-v23.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 72 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 \u0060docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py:13\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":"docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c14656752c0884c7cf5ac86a9eaae015026e0169471e5b15adcdff7e05a35a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py:80-89 | docs/audits/gc-rss-instructions-2026-10-03/gc-currentc170-regression-profile-v23.py:80-89 | docs/audits/gc-rss-instructions-2026-10-03/gc-final-instruction-profile.py:82-91 \u2014 before extracting anything, compare \u0060docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py\u0060 and \u0060docs/audits/gc-rss-instructions-2026-10-03/gc-currentc170-regression-profile-v23.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 72 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":"docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6a44fa863c1c35888f39802f490159de897aa612b890b6a4b8389d18a9efd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): scripts/addr_class_inventory.py:356-365 | scripts/gc_store_site_inventory.py:286-295 \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. 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":"scripts/addr_class_inventory.py"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f5be6e319ca48df4241bc28eb09d8144af36cf3d659b526d3b1ffe2fe37ed6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): scripts/gc_root_dominance_check.py:6742-6751 | scripts/gc_root_dominance_check.py:8313-8322 \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/gc_root_dominance_check.py"},"region":{"startLine":6742}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d68560c3a77cd84964b4cdee030f9b6c590c08e41a7a12286f6edb6508bc27a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): scripts/parity_known_failures.py:484-492 | scripts/parity_known_failures.py:540-549 \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 \u0060scripts/parity_known_failures.py:540\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":"scripts/parity_known_failures.py"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1a370d4c3537716b23e637740f0e49bd2abbd7985dcbb614335ab55ff02ff4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): scripts/sso_unbox_inventory.py:408-417 | scripts/string_payload_access_inventory.py:271-280 \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. 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":"scripts/sso_unbox_inventory.py"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8037e686361f178b2e50693f6cba7245e52f7f5ca9bb2d4e27cb5dc4663360b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): scripts/sso_unbox_inventory.py:421-430 | scripts/string_payload_access_inventory.py:284-293 \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":"scripts/sso_unbox_inventory.py"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"48db2b67afd5a1023b664dc54ce7d43e0162997e23dc0ac647ab298af5f34c0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): scripts/component_async_acceptance.py:39-47 | scripts/component_persistent_acceptance.py:30-38 | scripts/component_producer_acceptance.py:39-47 | scripts/component_reader_acceptance.py:37-45 \u2014 before extracting anything, compare \u0060scripts/component_async_acceptance.py\u0060 and \u0060scripts/component_persistent_acceptance.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 63 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 \u0060scripts/component_async_acceptance.py:39\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":"scripts/component_async_acceptance.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f95c63d03adc0d46217ad640dddb5b295d973fe2a68df15a2e6884e9e067e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): scripts/component_async_acceptance.py:73-81 | scripts/component_persistent_acceptance.py:64-72 | scripts/component_producer_acceptance.py:76-84 | scripts/component_reader_acceptance.py:74-82 \u2014 before extracting anything, compare \u0060scripts/component_async_acceptance.py\u0060 and \u0060scripts/component_persistent_acceptance.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 63 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 \u0060scripts/component_async_acceptance.py:73\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":"scripts/component_async_acceptance.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd784e6058f463d8ed92100c554c5ccd0a8f5b4f58c0f0c40836b25bc9973ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): scripts/component_host_acceptance.py:102-110 | scripts/component_host_acceptance.py:126-134 | scripts/component_host_acceptance.py:150-158 \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":"scripts/component_host_acceptance.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f5cd9448819ff6640d05798b3fc48ffac9a4e50951ac879dd4f65e637d40df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): docs/audits/gc-rss-instructions-2026-10-03/qb6-current0ed-build-v14.py:58-66 | docs/audits/gc-rss-instructions-2026-10-03/qb6-currente532-build-v1.py:49-57 \u2014 before extracting anything, compare \u0060docs/audits/gc-rss-instructions-2026-10-03/qb6-current0ed-build-v14.py\u0060 and \u0060docs/audits/gc-rss-instructions-2026-10-03/qb6-currente532-build-v1.py\u0060 as WHOLE FILES: 82% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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":"docs/audits/gc-rss-instructions-2026-10-03/qb6-current0ed-build-v14.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f3773279bb9012b7350c626a4ef2c50caaf80b858590c979b015965a7dee93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): scripts/check_gate_freshness.py:1067-1075 | scripts/check_npm_publish_freshness.py:883-891 \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":"scripts/check_gate_freshness.py"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"de53570a1119c5244b049b4c5f8180e99d19ef96824e8421a6980b22c791f30f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): scripts/check_thread_locals.py:360-368 | scripts/check_thread_locals.py:432-440 \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":"scripts/check_thread_locals.py"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51f331948dc519bd21ddad92950599706c089316d7075a4ce1c99656daeda30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): scripts/compiler_output_harness/repsel_knob_isolation.py:553-561 | scripts/compiler_output_harness/repsel_knob_isolation.py:603-609 \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 \u0060scripts/compiler_output_harness/repsel_knob_isolation.py:553\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":"scripts/compiler_output_harness/repsel_knob_isolation.py"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66c28a8b1912c0db5e19fe56aa21751b5a07dd7bfee8524e66d7108f69830c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): scripts/component_async_compound_resources_acceptance.py:32-40 | scripts/component_async_resource_cancel_acceptance.py:32-40 \u2014 before extracting anything, compare \u0060scripts/component_async_compound_resources_acceptance.py\u0060 and \u0060scripts/component_async_resource_cancel_acceptance.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 34 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":"scripts/component_async_compound_resources_acceptance.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b27aacd15ab83a037e085d23e1416809eb4fc12dbddfade7aace2da10c18743"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20139 lines \u00D7 7): scripts/component_async_acceptance.py:54-57 | scripts/component_async_guest_cancellation_acceptance.py:32-35 | scripts/component_async_guest_exports_acceptance.py:45-48 | scripts/component_persistent_acceptance.py:45-48 | scripts/component_producer_acceptance.py:54-62 | scripts/component_reader_acceptance.py:52-60 | scripts/component_scheduler_wake_acceptance.py:40-43 \u2014 before extracting anything, compare \u0060scripts/component_async_acceptance.py\u0060 and \u0060scripts/component_persistent_acceptance.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 63 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. 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":"scripts/component_async_acceptance.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f94eefc9998c9149542c880eda69c9c062a15586b341953ba4a8982ad1766a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): scripts/gc_parse_churn_layout_check.py:211-219 | scripts/gc_parse_churn_layout_check.py:222-230 \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/gc_parse_churn_layout_check.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb3202001e7707ef4db0eeba71a5b1aff5aa8168bdd11f2c5e81275ab7d646b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): scripts/gc_root_dominance_check.py:863-870 | scripts/gc_root_dominance_check.py:1382-1390 \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. 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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a90a38294a19a5ab5660793ff2f05fe48373dd0dcb1d6c4402454fc46deb6cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): scripts/gc_root_dominance_check.py:3204-3214 | scripts/gc_root_dominance_check.py:5142-5150 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060scripts/gc_root_dominance_check.py:5153\u0060 calls \u0060use_proves_numeric\u0060 and \u0060scripts/gc_root_dominance_check.py:3215\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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":3204}}}],"partialFingerprints":{"codehealthFindingId/v1":"e542592a8828cd95fc7b67e130cfc17b9d663d894171a4a74a5b65b158c6de68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): scripts/test262_subset.py:227-235 | scripts/test262_subset.py:237-244 \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 \u0060scripts/test262_subset.py:227\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":"scripts/test262_subset.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0a13aada0338058d21205580a01a33520ad249a4f5b787be7a55a18e5e9824"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): scripts/component_async_acceptance.py:15-22 | scripts/component_http_acceptance.py:25-32 | scripts/component_persistent_acceptance.py:15-22 | scripts/component_producer_acceptance.py:15-22 | scripts/component_reader_acceptance.py:15-22 \u2014 before extracting anything, compare \u0060scripts/component_async_acceptance.py\u0060 and \u0060scripts/component_persistent_acceptance.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 63 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":"scripts/component_async_acceptance.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"14897ee42044bf4846c44ef3e9a1b583b70d1e5b12d852bcb3ddd2f7eea24ffc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): scripts/addr_class_inventory.py:692-699 | scripts/sso_unbox_inventory.py:384-391 | scripts/string_payload_access_inventory.py:243-250 \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. 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":"scripts/addr_class_inventory.py"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4d60a0dfb459cc1afa0e47ae510cc40b28b548c2ae6444edfc599c7298c556"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): scripts/buffer_b1_validate.py:152-159 | scripts/buffer_b4_validate.py:164-171 | scripts/buffer_b5_validate.py:22-29 \u2014 before extracting anything, compare \u0060scripts/buffer_b1_validate.py\u0060 and \u0060scripts/buffer_b4_validate.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 57 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 \u0060scripts/buffer_b1_validate.py:152\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":"scripts/buffer_b1_validate.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ee8e4618fe9df551d2b497fa8a9b788f24a4098c89bb99626c19b682410850"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20138 lines \u00D7 4): scripts/component_async_compound_resources_acceptance.py:18-25 | scripts/component_async_guest_cancellation_acceptance.py:17-20 | scripts/component_async_guest_resources_acceptance.py:22-29 | scripts/component_async_resource_cancel_acceptance.py:18-25 \u2014 before extracting anything, compare \u0060scripts/component_async_compound_resources_acceptance.py\u0060 and \u0060scripts/component_async_resource_cancel_acceptance.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 34 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. 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":"scripts/component_async_compound_resources_acceptance.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"af712de577742aad8882f5b0537dad5872e28f6f375ae1212009f62b203bcbbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): scripts/thread_exit_address_globals.py:663-671 | scripts/thread_exit_address_globals.py:682-689 | scripts/thread_exit_address_globals.py:792-799 \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 \u0060scripts/thread_exit_address_globals.py:663\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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 before the matched lines, \u0060scripts/thread_exit_address_globals.py:659\u0060 calls \u0060expect\u0060, \u0060any\u0060 and \u0060scripts/thread_exit_address_globals.py:678\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":"scripts/thread_exit_address_globals.py"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"d161c9aadfc9395f002353da59c0b6a08b5fae71c8574ec17314b39eef397279"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): docs/audits/gc-rss-instructions-2026-10-03/current0ed-meta-observer-v17.py:15-22 | docs/audits/gc-rss-instructions-2026-10-03/current0ed-meta-observer-v19.py:15-22 \u2014 before extracting anything, compare \u0060docs/audits/gc-rss-instructions-2026-10-03/current0ed-meta-observer-v17.py\u0060 and \u0060docs/audits/gc-rss-instructions-2026-10-03/current0ed-meta-observer-v19.py\u0060 as WHOLE FILES: 92% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 3 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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":"docs/audits/gc-rss-instructions-2026-10-03/current0ed-meta-observer-v17.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca90efea3e0c847fed92d89ecd9957316646c3a0728cf905b7e247aa9cdcaa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/check_gc_scanner_latches.py:170-177 | scripts/check_gc_scanner_latches.py:192-199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"scripts/check_gc_scanner_latches.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c42ed32cca92d70a9187e8fe5baec261e49c69b590a51877e372f3da554b64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/check_readpath3_gaps.py:17-24 | scripts/perf_readpath3.py:27-34 \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":"scripts/check_readpath3_gaps.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7e4b5e76fae1c59bd5e3734ad3a008201c3f31c3d9b81b0985cafc9ca80bea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/component_async_compound_resources_acceptance.py:52-59 | scripts/component_async_guest_resources_acceptance.py:61-68 \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 \u0060scripts/component_async_compound_resources_acceptance.py:52\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":"scripts/component_async_compound_resources_acceptance.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efa020aa92813fd318da9083b321c1c7fd38345992abb0e151891228db92333"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): scripts/gc_1090_evidence_report.py:1435-1441 | scripts/perf_frontier_report.py:1009-1016 \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 \u0060scripts/gc_1090_evidence_report.py:1435\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":"scripts/gc_1090_evidence_report.py"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c7dd6e4479c1d7ee198f0cda702482f637f5cc776246208f6443b8a0780da9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/gc_root_dominance_check.py:2222-2229 | scripts/gc_root_dominance_check.py:2235-2242 \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":"scripts/gc_root_dominance_check.py"},"region":{"startLine":2222}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa32ccefad4117ed4a4233ce7cefc81c65d3b02a6b9aeb4f038b395ca30db2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/gc_root_dominance_check.py:6720-6727 | scripts/gc_root_dominance_check.py:8447-8454 \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/gc_root_dominance_check.py"},"region":{"startLine":6720}}}],"partialFingerprints":{"codehealthFindingId/v1":"78958199188a36e5f2f0dc5290c2d526106c5992f24adbe38e5e15bc3c5738f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/node_core_subset.py:318-325 | scripts/test262_subset.py:376-383 \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. 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":"scripts/node_core_subset.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6a51480216b8ad207e28352e059d6d5c79f629b16ec5febb4355240f21e8e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): scripts/component_host_acceptance.py:92-98 | scripts/component_host_acceptance.py:117-123 | scripts/component_host_acceptance.py:165-171 \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":"scripts/component_host_acceptance.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b57bffc6ff3b68988d45872cf4cc13507edb710fccbe6327652e41fba823ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): scripts/gc_runtime_root_holders.py:2056-2062 | scripts/registry_lifetime_check.py:864-870 | scripts/thread_exit_address_globals.py:815-821 \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. 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":"scripts/gc_runtime_root_holders.py"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b47acdbd4b6ad5e6f47048eeac34a7cab78e1f33b859dfd063aa4e0b5fd2cdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20137 lines \u00D7 3): docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py:111-117 | docs/audits/gc-rss-instructions-2026-10-03/gc-currentc170-regression-profile-v23.py:110-111 | docs/audits/gc-rss-instructions-2026-10-03/gc-final-instruction-profile.py:113-119 \u2014 before extracting anything, compare \u0060docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py\u0060 and \u0060docs/audits/gc-rss-instructions-2026-10-03/gc-currentc170-regression-profile-v23.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 72 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 \u0060docs/audits/gc-rss-instructions-2026-10-03/gc-currentc170-regression-profile-v23.py:110\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":"docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e7c2a11f1bc91cfbd5c43b19e932f59e593de5dbe53958ee8fd000831ce7b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 2): scripts/check_gc_scanner_latches.py:170-174 | scripts/check_gc_scanner_latches.py:217-223 \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 \u0060scripts/check_gc_scanner_latches.py:170\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":"scripts/check_gc_scanner_latches.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"957508401926be383a55e226b9d8d5f520251894187592409323bf36f14504bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): scripts/compiler_output_harness/cli.py:46-52 | scripts/compiler_output_harness/cli.py:81-87 \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 \u0060scripts/compiler_output_harness/cli.py:46\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":"scripts/compiler_output_harness/cli.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2ddafdf4b742deaccd1a868862b24825dc40fb852990dba47c243047af02a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): scripts/compiler_output_harness/repsel_knob_isolation.py:563-569 | scripts/compiler_output_harness/repsel_knob_isolation.py:631-637 \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 \u0060scripts/compiler_output_harness/repsel_knob_isolation.py:563\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":"scripts/compiler_output_harness/repsel_knob_isolation.py"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54db2032f6455929b1ac366dea74bb0f44c17ab2b90efc1dace102ca2340da7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 3): scripts/component_command_acceptance.py:84-90 | scripts/component_guest_acceptance.py:103-105 | scripts/component_host_acceptance.py:77-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 all 3 call sites, so a change lands once. 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":"scripts/component_command_acceptance.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b156f4e2603625fe608db08cd37070da9adc0e7181321a7d4f970b1edf36486"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): scripts/native_abi_evidence_report.py:1350-1356 | scripts/native_abi_evidence_report.py:1432-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 \u0060scripts/native_abi_evidence_report.py:1350\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":"scripts/native_abi_evidence_report.py"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e19094488f4a80ea111819327f56219cebaf2f6d135854c6f881722ea9a1c21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): scripts/package_bench.py:466-472 | scripts/package_bench_attr.py:420-426 \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":"scripts/package_bench.py"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"352c2310573d9f260a8dfd296f7d639f84e2f7db2c18b386eb8e04889ca1e425"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): scripts/parity_matrix_trend.py:115-121 | scripts/parity_threshold_gate.py:83-89 \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. 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":"scripts/parity_matrix_trend.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca7248754a8ddfbc5be2f307883a1ca928513e1e8632b33f9f5243d67ecebc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): scripts/perf_frontier_report.py:1045-1051 | scripts/perf_frontier_report.py:1053-1059 \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/perf_frontier_report.py"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2b51acd2c848a9e96d7bbd07a474cc82e49f8747f97a5ccac90b0aa3469fb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): scripts/turnloop_p0_loop_stats.py:55-61 | scripts/turnloop_p0_native_probe.py:124-129 \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":"scripts/turnloop_p0_loop_stats.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa581f06a792d53618a08f12ee8e813931d1a676c2765eea3d7d7d30de2b1cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): scripts/component_async_acceptance.py:48-53 | scripts/component_persistent_acceptance.py:39-44 | scripts/component_producer_acceptance.py:48-53 | scripts/component_reader_acceptance.py:46-51 \u2014 before extracting anything, compare \u0060scripts/component_async_acceptance.py\u0060 and \u0060scripts/component_persistent_acceptance.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 63 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 \u0060scripts/component_async_acceptance.py:48\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":"scripts/component_async_acceptance.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ec7d30ce9766969c39219b584a13a22bc0e75319d944863079ca74db22bb76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): scripts/component_async_compound_resources_acceptance.py:94-99 | scripts/component_async_guest_resources_acceptance.py:96-101 | scripts/component_async_resource_cancel_acceptance.py:78-83 \u2014 before extracting anything, compare \u0060scripts/component_async_compound_resources_acceptance.py\u0060 and \u0060scripts/component_async_resource_cancel_acceptance.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 34 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":"scripts/component_async_compound_resources_acceptance.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"95783003a69748c33fa155fa3969dd91688150d512a0f9eb2b4c4d0b6435ccff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): scripts/buffer_b1_validate.py:123-128 | scripts/buffer_b4_validate.py:120-125 \u2014 before extracting anything, compare \u0060scripts/buffer_b1_validate.py\u0060 and \u0060scripts/buffer_b4_validate.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 57 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":"scripts/buffer_b1_validate.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3c9ad5219b16309db8b930ab13f5c6539372b6ed5a8e8899f9551267e0c522"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20136 lines \u00D7 4): scripts/buffer_b1_validate.py:171-176 | scripts/buffer_b4_validate.py:183-188 | scripts/buffer_b5_validate.py:39-40 | scripts/buffer_b5_validate.py:51-52 \u2014 before extracting anything, compare \u0060scripts/buffer_b1_validate.py\u0060 and \u0060scripts/buffer_b4_validate.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 57 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 \u0060scripts/buffer_b5_validate.py:39\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"scripts/buffer_b1_validate.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9514181de162c6187167920565d8fcf8b5fce48ea4a55250be9a392fecfc13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 3): scripts/buffer_b1_validate.py:179-184 | scripts/buffer_b4_validate.py:191-196 | scripts/buffer_b5_validate.py:44-47 \u2014 before extracting anything, compare \u0060scripts/buffer_b1_validate.py\u0060 and \u0060scripts/buffer_b4_validate.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 57 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. 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":"scripts/buffer_b1_validate.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a86925a0fe99b77c69c297fc06196e3c7c95bb2a784c9e9bcbda634d71c6628"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): scripts/check_gate_freshness.py:622-627 | scripts/check_gate_freshness.py:686-691 \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/check_gate_freshness.py"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3c83e4280c01979b647f5341299184101ee8ac70948da7af7b1d007ebce962"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): scripts/component_async_compound_resources_acceptance.py:73-78 | scripts/component_async_resource_cancel_acceptance.py:65-70 \u2014 before extracting anything, compare \u0060scripts/component_async_compound_resources_acceptance.py\u0060 and \u0060scripts/component_async_resource_cancel_acceptance.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 34 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":"scripts/component_async_compound_resources_acceptance.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c7b7aa6de475105163df0b30d1686ae98c378b2e7dc057d80c49bc110b6165"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): scripts/component_http_guest_acceptance.py:125-130 | scripts/component_http_p3_acceptance.py:159-164 \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":"scripts/component_http_guest_acceptance.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ccf4c441b8642fa5c751c5b1afaaa9e8950254152317b4521f40b9caa396c06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): scripts/stackmap_anatomy.py:196-201 | scripts/stackmap_anatomy.py:222-227 \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/stackmap_anatomy.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"8740609c7d443011007ce38f1c6c30bb1e1861365e37a0b6b5878b3dc943e084"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 9): docs/audits/gc-rss-instructions-2026-10-03/latest-main2026-normal-auto-driver.py:39-42 | docs/audits/gc-rss-instructions-2026-10-03/latest-main2026-normal-auto-driver.py:45-47 | docs/audits/gc-rss-instructions-2026-10-03/primary-entry-once-main07-v46-auto.py:66-70 | docs/audits/gc-rss-instructions-2026-10-03/primary-lazy-rss-main07-v52-auto.py:66-70 | docs/audits/gc-rss-instructions-2026-10-03/primary-learned-floor-main07-v60-auto.py:65-69 | docs/audits/gc-rss-instructions-2026-10-03/primary-mainad0-v79-auto.py:49-53 | docs/audits/gc-rss-instructions-2026-10-03/primary-map-prefix-main07-v69-auto.py:65-69 | docs/audits/gc-rss-instructions-2026-10-03/primary-map-prefix-main07-v69r1-auto.py:65-69 | docs/audits/gc-rss-instructions-2026-10-03/primary-map-prefix-main07-v69r2-auto.py:75-79 \u2014 before extracting anything, compare \u0060docs/audits/gc-rss-instructions-2026-10-03/latest-main2026-normal-auto-driver.py\u0060 and \u0060docs/audits/gc-rss-instructions-2026-10-03/primary-lazy-rss-main07-v52-auto.py\u0060 as WHOLE FILES: 84% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 3 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060docs/audits/gc-rss-instructions-2026-10-03/latest-main2026-normal-auto-driver.py:43\u0060 calls \u0060exists\u0060, \u0060disk_usage\u0060 and \u0060docs/audits/gc-rss-instructions-2026-10-03/primary-entry-once-main07-v46-auto.py:70\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":"docs/audits/gc-rss-instructions-2026-10-03/latest-main2026-normal-auto-driver.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab21f8965fc4611ddb79b5bb8ac82c82105b6affaecd0d15664e6f5a6d4d0095"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): scripts/compiler_output_harness/repsel_knob_isolation.py:540-544 | scripts/compiler_output_harness/repsel_knob_isolation.py:551-555 | scripts/compiler_output_harness/repsel_knob_isolation.py:560-564 | scripts/compiler_output_harness/repsel_knob_isolation.py:569-573 | scripts/compiler_output_harness/repsel_knob_isolation.py:583-587 | scripts/compiler_output_harness/repsel_knob_isolation.py:608-612 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060scripts/compiler_output_harness/repsel_knob_isolation.py:588\u0060 calls \u0060arm\u0060 and \u0060scripts/compiler_output_harness/repsel_knob_isolation.py:545\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":"scripts/compiler_output_harness/repsel_knob_isolation.py"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"7decb9b30e1cb5fec1f70be5e542e9b8647140c6bf74f3cdc8fb19aed6dee370"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): scripts/component_async_acceptance.py:17-21 | scripts/component_http_acceptance.py:27-31 | scripts/component_p3_command_acceptance.py:46-50 | scripts/component_persistent_acceptance.py:17-21 | scripts/component_producer_acceptance.py:17-21 | scripts/component_reader_acceptance.py:17-21 \u2014 before extracting anything, compare \u0060scripts/component_async_acceptance.py\u0060 and \u0060scripts/component_persistent_acceptance.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 63 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":"scripts/component_async_acceptance.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c796b3dedf3eddcee41211c4fe10512f4285c9874b7f8fda17d70f036052e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): scripts/component_async_acceptance.py:49-53 | scripts/component_async_guest_exports_acceptance.py:39-44 | scripts/component_persistent_acceptance.py:40-44 | scripts/component_producer_acceptance.py:49-53 | scripts/component_reader_acceptance.py:47-51 | scripts/component_scheduler_wake_acceptance.py:34-39 \u2014 before extracting anything, compare \u0060scripts/component_async_acceptance.py\u0060 and \u0060scripts/component_persistent_acceptance.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 63 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 \u0060scripts/component_async_acceptance.py:49\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":"scripts/component_async_acceptance.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c2d6716a1e3f4e9740903189fc8b6becee1b738c7165878a58bbecfbace1df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): scripts/addr_class_inventory.py:333-337 | scripts/addr_class_inventory.py:695-699 | scripts/gc_store_site_inventory.py:263-267 | scripts/sso_unbox_inventory.py:387-391 | scripts/string_payload_access_inventory.py:246-250 \u2014 there are 5 copies across 4 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 5 sites; resolving a subset leaves the remainder to drift apart. 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":"scripts/addr_class_inventory.py"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9e0e87aee24874691a96e045854009383fad739de2b4cdcbfe2d4726758d36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): scripts/compiler_output_harness/repsel_knob_isolation.py:540-544 | scripts/compiler_output_harness/repsel_knob_isolation.py:551-555 | scripts/compiler_output_harness/repsel_knob_isolation.py:560-564 | scripts/compiler_output_harness/repsel_knob_isolation.py:601-605 | scripts/compiler_output_harness/repsel_knob_isolation.py:608-612 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/compiler_output_harness/repsel_knob_isolation.py"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc53c94e0d931c81f65d5759b875806b96f30d922c5701fe7be1fac5518004ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): scripts/component_host_acceptance.py:81-85 | scripts/component_host_acceptance.py:106-110 | scripts/component_host_acceptance.py:130-134 | scripts/component_host_acceptance.py:154-158 \u2014 all 4 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":"scripts/component_host_acceptance.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d25744e9f581be56daafbcdcda166b5541188f0feaec9b2436c458da0a5605"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py:64-68 | docs/audits/gc-rss-instructions-2026-10-03/gc-currentc170-regression-profile-v23.py:64-68 | docs/audits/gc-rss-instructions-2026-10-03/gc-final-instruction-profile.py:66-70 \u2014 before extracting anything, compare \u0060docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py\u0060 and \u0060docs/audits/gc-rss-instructions-2026-10-03/gc-currentc170-regression-profile-v23.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 72 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":"docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1d54b9dec1dcd58892ab148485479eab663959584d161198a1680a8baf70d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py:91-95 | docs/audits/gc-rss-instructions-2026-10-03/gc-currentc170-regression-profile-v23.py:91-95 | docs/audits/gc-rss-instructions-2026-10-03/gc-final-instruction-profile.py:93-97 \u2014 before extracting anything, compare \u0060docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py\u0060 and \u0060docs/audits/gc-rss-instructions-2026-10-03/gc-currentc170-regression-profile-v23.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 72 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 \u0060docs/audits/gc-rss-instructions-2026-10-03/gc-currentc170-regression-profile-v23.py: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":"docs/audits/gc-rss-instructions-2026-10-03/gc-current0ed-instruction-profile-v21.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8c7e4bec3044d30b10f1d2fd5e0a87beea4b3a9c6ac2084f6a01eb64f96454"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): scripts/component_async_compound_resources_acceptance.py:32-36 | scripts/component_async_guest_resources_acceptance.py:36-40 | scripts/component_async_resource_cancel_acceptance.py:32-36 \u2014 before extracting anything, compare \u0060scripts/component_async_compound_resources_acceptance.py\u0060 and \u0060scripts/component_async_resource_cancel_acceptance.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 34 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":"scripts/component_async_compound_resources_acceptance.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55223548934317802e7ff429af88965fdaab4bf3a5c7b5830f491a9baf0f456"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 8): docs/audits/gc-rss-instructions-2026-10-03/latest-main2026-normal-auto-driver.py:72-74 | docs/audits/gc-rss-instructions-2026-10-03/primary-entry-once-main07-v46-auto.py:97-99 | docs/audits/gc-rss-instructions-2026-10-03/primary-lazy-rss-main07-v52-auto.py:97-99 | docs/audits/gc-rss-instructions-2026-10-03/primary-learned-floor-main07-v60-auto.py:96-98 | docs/audits/gc-rss-instructions-2026-10-03/primary-mainad0-v79-auto.py:82-86 | docs/audits/gc-rss-instructions-2026-10-03/primary-map-prefix-main07-v69-auto.py:96-98 | docs/audits/gc-rss-instructions-2026-10-03/primary-map-prefix-main07-v69r1-auto.py:96-98 | docs/audits/gc-rss-instructions-2026-10-03/primary-map-prefix-main07-v69r2-auto.py:108-112 \u2014 before extracting anything, compare \u0060docs/audits/gc-rss-instructions-2026-10-03/latest-main2026-normal-auto-driver.py\u0060 and \u0060docs/audits/gc-rss-instructions-2026-10-03/primary-lazy-rss-main07-v52-auto.py\u0060 as WHOLE FILES: 84% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 3 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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. 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. 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":"docs/audits/gc-rss-instructions-2026-10-03/latest-main2026-normal-auto-driver.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fc4c1fe0d9f9f22f2cabee927bd1340eac79ff3c69578afdaa6fa51b771cb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/component_command_acceptance.py:47-52 | scripts/component_host_acceptance.py:53-57 \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 \u0060scripts/component_command_acceptance.py:47\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":"scripts/component_command_acceptance.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6eff8be878f441c3d3662ee567d08a313929b0d2288a568f13150f96614211"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/component_guest_acceptance.py:87-91 | scripts/component_host_acceptance.py:59-63 \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":"scripts/component_guest_acceptance.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"328cf92c21aed266601e6eee24fce091b0a79d22d575456c8b1284249797173c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): scripts/component_command_acceptance.py:81-83 | scripts/component_guest_acceptance.py:98-102 | scripts/component_host_acceptance.py:71-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. 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, \u0060scripts/component_guest_acceptance.py:102\u0060 calls \u0060round\u0060, \u0060monotonic\u0060, \u0060str\u0060 and \u0060scripts/component_command_acceptance.py:83\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":"scripts/component_command_acceptance.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be33d7fdd1fd6e30fc75a4e60ad3db2ebb274b9c5f94fba4ac5ef89a2284f9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/component_http_acceptance.py:53-58 | scripts/component_http_guest_acceptance.py:151-155 \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 \u0060scripts/component_http_acceptance.py:53\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":"scripts/component_http_acceptance.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d5f9d4f058c24997a8e302bdf740baf201c7cf27a6aeb84cd86ad2f69a42a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/constfn_executable_gates.py:145-149 | scripts/constfn_executable_gates.py:270-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 \u0060scripts/constfn_executable_gates.py:145\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":"scripts/constfn_executable_gates.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"7585c6a057880962231b4dfe732c0ad9ac8c36ece95598d3e009400bf6fc4f01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): scripts/constfn_executable_gates.py:469-473 | scripts/constfn_executable_gates.py:497-501 | scripts/constfn_executable_gates.py:603-606 \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":"scripts/constfn_executable_gates.py"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e029cabedc02bd1b12be36dd49d7e1f38a1c5b9a40662eb32e49d01e79271f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/gc_root_dominance_check.py:6762-6766 | scripts/gc_root_dominance_check.py:6776-6784 \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/gc_root_dominance_check.py"},"region":{"startLine":6762}}}],"partialFingerprints":{"codehealthFindingId/v1":"226ba93b861f7dbc5be8214e80a78fcc6317b4536e5435d695160470c40b8629"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u201320 lines \u00D7 8): docs/audits/gc-rss-instructions-2026-10-03/currentc170-peak-mappings-v28.py:13-15 | docs/audits/gc-rss-instructions-2026-10-03/currentc170-peak-mappings-v28.py:16-16 | docs/audits/gc-rss-instructions-2026-10-03/currentc170-peak-mappings-v28.py:17-18 | docs/audits/gc-rss-instructions-2026-10-03/currentc170-peak-mappings-v28.py:19-21 | docs/audits/gc-rss-instructions-2026-10-03/currentc170-peak-mappings-v28.py:22-23 | docs/audits/gc-rss-instructions-2026-10-03/currentc170-peak-mappings-v28.py:24-26 | docs/audits/gc-rss-instructions-2026-10-03/currentc170-peak-mappings-v28r1.py:10-29 | docs/audits/gc-rss-instructions-2026-10-03/currentc170-peak-mappings-v28r2.py:10-29 \u2014 before extracting anything, compare \u0060docs/audits/gc-rss-instructions-2026-10-03/currentc170-peak-mappings-v28r1.py\u0060 and \u0060docs/audits/gc-rss-instructions-2026-10-03/currentc170-peak-mappings-v28r2.py\u0060 as WHOLE FILES: 94% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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 \u0060docs/audits/gc-rss-instructions-2026-10-03/currentc170-peak-mappings-v28.py:17\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060docs/audits/gc-rss-instructions-2026-10-03/currentc170-peak-mappings-v28.py:15\u0060 calls \u0060match\u0060, \u0060split\u0060, \u0060dict\u0060 and \u0060docs/audits/gc-rss-instructions-2026-10-03/currentc170-peak-mappings-v28.py:18\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":"docs/audits/gc-rss-instructions-2026-10-03/currentc170-peak-mappings-v28.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"732d78a4babee220124779051c806aea01adfbf32d0aaeac689f43960ebafd6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): docs/audits/gc-rss-instructions-2026-10-03/primary-lazy-rss-main07-v51-build.py:7-12 | docs/audits/gc-rss-instructions-2026-10-03/primary-learned-floor-main07-v59-build.py:7-12 | docs/audits/gc-rss-instructions-2026-10-03/primary-mainad0-base-v77-build.py:7-12 | docs/audits/gc-rss-instructions-2026-10-03/primary-mainad0-once-v74-build.py:7-12 | docs/audits/gc-rss-instructions-2026-10-03/primary-map-prefix-main07-v68-build.py:7-12 | docs/audits/gc-rss-instructions-2026-10-03/primary-mark-frontier-mainad0-v85-build.py:7-12 \u2014 before extracting anything, compare \u0060docs/audits/gc-rss-instructions-2026-10-03/primary-lazy-rss-main07-v51-build.py\u0060 and \u0060docs/audits/gc-rss-instructions-2026-10-03/primary-learned-floor-main07-v59-build.py\u0060 as WHOLE FILES: 82% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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":"docs/audits/gc-rss-instructions-2026-10-03/primary-lazy-rss-main07-v51-build.py"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a9291fc6b30f462072c73f1df2e1c1454788805999f54c58a243ab5622400d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): docs/audits/gc-rss-instructions-2026-10-03/qb6-current0ed-census-v17.py:8-15 | docs/audits/gc-rss-instructions-2026-10-03/qb6-current0ed-census-v19.py:8-15 | docs/audits/gc-rss-instructions-2026-10-03/qb6-current0ed-zod-census-v17.py:8-15 \u2014 before extracting anything, compare \u0060docs/audits/gc-rss-instructions-2026-10-03/qb6-current0ed-census-v17.py\u0060 and \u0060docs/audits/gc-rss-instructions-2026-10-03/qb6-current0ed-census-v19.py\u0060 as WHOLE FILES: 92% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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":"docs/audits/gc-rss-instructions-2026-10-03/qb6-current0ed-census-v17.py"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f247dfc346b2dad4be5d02169772d14371f171ffc7099e04b79869fa845506bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): docs/audits/gc-rss-instructions-2026-10-03/summarize-gc-comparison.py:30-34 | docs/audits/gc-rss-instructions-2026-10-03/verify-gc-final-instruction-profile-v1.py:15-19 | docs/audits/gc-rss-instructions-2026-10-03/verify-gc-paired-instruction-domains-v1.py:10-14 | docs/audits/gc-rss-instructions-2026-10-03/verify-gc-runtime-build.py:11-15 | docs/audits/gc-rss-instructions-2026-10-03/verify-gc-window-v6r1-inputs.py:9-13 \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 5 call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060docs/audits/gc-rss-instructions-2026-10-03/verify-gc-final-instruction-profile-v1.py:22\u0060 calls \u0060require\u0060, \u0060ValueError\u0060 and \u0060docs/audits/gc-rss-instructions-2026-10-03/verify-gc-window-v6r1-inputs.py:16\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":"docs/audits/gc-rss-instructions-2026-10-03/summarize-gc-comparison.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"de710170f21fb61dde3def7a85210ef6fa6647e86118571c0581d88a1bde2aa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): scripts/gc_1090_evidence_report.py:100-105 | scripts/native_abi_evidence_report.py:315-320 | scripts/perf_frontier_report.py:83-88 \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. 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":"scripts/gc_1090_evidence_report.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9f5c3d06c3e0415410af6196622492e13d79fa6866e9ea3875b03760151abc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): scripts/node_core_subset.py:205-210 | scripts/test262_subset.py:177-182 \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. 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":"scripts/node_core_subset.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"2547df388a69df19ecece682d1129b1b761b58b2c8c132dadb09094afe0452c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/parity_known_failures.py:109-113 | scripts/parity_threshold_gate.py:45-49 \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. 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":"scripts/parity_known_failures.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"edee67abf524dea4176af215c8bb6c59fcb38e4b0d43c3d157241556493de1e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): docs/audits/gc-rss-instructions-2026-10-03/current0ed-meta-observer-v17.py:39-43 | docs/audits/gc-rss-instructions-2026-10-03/current0ed-meta-observer-v19.py:39-43 \u2014 before extracting anything, compare \u0060docs/audits/gc-rss-instructions-2026-10-03/current0ed-meta-observer-v17.py\u0060 and \u0060docs/audits/gc-rss-instructions-2026-10-03/current0ed-meta-observer-v19.py\u0060 as WHOLE FILES: 92% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 3 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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. 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":"docs/audits/gc-rss-instructions-2026-10-03/current0ed-meta-observer-v17.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc24e49b08c589902d52845d512bacf9f025b63707cb6f1f71647635cd52aa19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): docs/audits/gc-rss-instructions-2026-10-03/current0ed-meta-observer-v17.py:46-51 | docs/audits/gc-rss-instructions-2026-10-03/current0ed-meta-observer-v19.py:56-61 \u2014 before extracting anything, compare \u0060docs/audits/gc-rss-instructions-2026-10-03/current0ed-meta-observer-v17.py\u0060 and \u0060docs/audits/gc-rss-instructions-2026-10-03/current0ed-meta-observer-v19.py\u0060 as WHOLE FILES: 92% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 3 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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. 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":"docs/audits/gc-rss-instructions-2026-10-03/current0ed-meta-observer-v17.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1914af848680988d18ab6151fe47ad17904f77a5c29a0db36e828cc8f80073b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): docs/audits/gc-rss-instructions-2026-10-03/primary-entry-once-main07-v46-auto.py:72-77 | docs/audits/gc-rss-instructions-2026-10-03/primary-lazy-rss-main07-v52-auto.py:72-77 | docs/audits/gc-rss-instructions-2026-10-03/primary-learned-floor-main07-v60-auto.py:71-76 | docs/audits/gc-rss-instructions-2026-10-03/primary-map-prefix-main07-v69-auto.py:71-76 | docs/audits/gc-rss-instructions-2026-10-03/primary-map-prefix-main07-v69r1-auto.py:71-76 | docs/audits/gc-rss-instructions-2026-10-03/primary-map-prefix-main07-v69r2-auto.py:81-86 \u2014 before extracting anything, compare \u0060docs/audits/gc-rss-instructions-2026-10-03/primary-entry-once-main07-v46-auto.py\u0060 and \u0060docs/audits/gc-rss-instructions-2026-10-03/primary-lazy-rss-main07-v52-auto.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 34 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 \u0060docs/audits/gc-rss-instructions-2026-10-03/primary-entry-once-main07-v46-auto.py:72\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":"docs/audits/gc-rss-instructions-2026-10-03/primary-entry-once-main07-v46-auto.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"035595ec3f4f05e5531880eae1432ecc8b36c8084151b41ad15296c546764468"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): docs/audits/gc-rss-instructions-2026-10-03/primary-entry-once-main07-v46-auto.py:54-58 | docs/audits/gc-rss-instructions-2026-10-03/primary-lazy-rss-main07-v52-auto.py:54-58 | docs/audits/gc-rss-instructions-2026-10-03/primary-learned-floor-main07-v60-auto.py:53-57 | docs/audits/gc-rss-instructions-2026-10-03/primary-map-prefix-main07-v69-auto.py:53-57 | docs/audits/gc-rss-instructions-2026-10-03/primary-map-prefix-main07-v69r1-auto.py:53-57 | docs/audits/gc-rss-instructions-2026-10-03/primary-map-prefix-main07-v69r2-auto.py:63-67 \u2014 before extracting anything, compare \u0060docs/audits/gc-rss-instructions-2026-10-03/primary-entry-once-main07-v46-auto.py\u0060 and \u0060docs/audits/gc-rss-instructions-2026-10-03/primary-lazy-rss-main07-v52-auto.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 34 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. 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":"docs/audits/gc-rss-instructions-2026-10-03/primary-entry-once-main07-v46-auto.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5153e155fdd7d213fb2426cb4199d1d040cbacb351b00282b7857d7f6b89ecf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): scripts/DG-fallback-gap.py:22-27 | scripts/link_absence.py:208-213 \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":"scripts/DG-fallback-gap.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba0f959c2c6a4964b7f26d127afa2e54b95cf571c5b3e519e8fc18a378680f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): scripts/buffer_b1_validate.py:208-217 | scripts/buffer_b4_validate.py:220-229 \u2014 before extracting anything, compare \u0060scripts/buffer_b1_validate.py\u0060 and \u0060scripts/buffer_b4_validate.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 57 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":"scripts/buffer_b1_validate.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"67bc17d2fdf5a52bab148829a3a713ccf739a2c0d7af3a42a4232fd9c67bb3f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/buffer_b1_validate.py:198-205 | scripts/buffer_b4_validate.py:210-217 \u2014 before extracting anything, compare \u0060scripts/buffer_b1_validate.py\u0060 and \u0060scripts/buffer_b4_validate.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 57 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 \u0060scripts/buffer_b1_validate.py:198\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":"scripts/buffer_b1_validate.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f193d809e5a2d7ac25ecaa14ab65a37d809e58862e48232c2e965435e073ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): scripts/compiler_output_harness/analyzers.py:374-379 | scripts/compiler_output_harness/verification.py:148-153 \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. 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":"scripts/compiler_output_harness/analyzers.py"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd31a4c3e6559d89058683adf315495e0f90ed10632e2160d8ae36f197300cda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/gc_root_dominance_check.py:4042-4046 | scripts/gc_root_dominance_check.py:4063-4067 \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/gc_root_dominance_check.py"},"region":{"startLine":4042}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca59a50c45d6da814da4ddd62180dc884619927456f288c9c93d2d6dbb41df63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/node_core_subset.py:471-475 | scripts/node_core_subset.py:867-871 \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/node_core_subset.py"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"6349824264df11bbaaa34f496fcc7e16e1a9d3d4962646928bd57eca4c2afad1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/wpfacts_recompute.py:1108-1112 | scripts/wpfacts_recompute.py:1144-1148 \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 \u0060scripts/wpfacts_recompute.py: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wpfacts_recompute.py"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"56302487d1a41862968de8b73e950bedecc6b3dd00d364c1a9d2599a65b83509"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/perry-codegen/src/codegen/spec_return_proof.rs:636-647 | crates/perry-codegen/src/codegen/spec_return_proof.rs:649-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/spec_return_proof.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f59a30d9443780cf4e0d21e55ad510bfa4abe1b82a6cfb5943da76304087f7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/perry-doc-tests/src/lint.rs:19-27 | crates/perry-doc-tests/src/main.rs:367-375 \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/perry-doc-tests/src/lint.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7490d0e92fd70e7f7e6b93c5438be9836a1e6ddab641f455fd73294d1af370"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): test-compat/npm-sweep/run.py:370-381 | test-compat/npm-sweep/run.py:389-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060test-compat/npm-sweep/run.py:389\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":"test-compat/npm-sweep/run.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"7762b366a1a15b09ee93231a9f919c4c89c4e7e64180698a3c96a979044df34d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): scripts/ci_e2e_scope.py:284-291 | scripts/ci_e2e_scope.py:405-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 \u0060scripts/ci_e2e_scope.py: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci_e2e_scope.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"136e18493e5c5dc65451e6fb2331af72bd9e2ce5dd33d4cbc921d82877b98c0f"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project perry-ext-http: perry-ext-http has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dec15868500eb0e64f4fb515e7413b78c25690cd2c947d6a32e89eda6b960165"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project perry-stdlib: perry-stdlib has instability 0.85 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"135998b544f81a71af6dd5ac6d432b294f4046df3dedd5fdef2077621d702437"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project perry-ui-windows: perry-ui-windows has instability 0.86 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"24a8cd29ecedf78a868dc6d0a547541b9561c3a6486be52a53e1dea75c414db1"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project windows-reactor: windows-reactor has instability 0.88 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4871441313359ec7bfc99d12ad9c5852d2fdb0874a1bf9d54a6a63255887b91b"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: perry-api-manifest: perry-api-manifest: 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":"61a510bad87bd4b6862ee06ffad665015192541cfbf51756556a49d48e1387d4"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: perry-dispatch: perry-dispatch: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"69c7f867f8c9c6187d1ce692575fb5318a46f05f936963d494f1c37addcc47c0"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: perry-native-registration: perry-native-registration: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"442cacfdd4e9f120b004497b3a46d2d12321adaa4a923367134d6ac424084e2d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: perry-perex: perry-perex: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"232d726b4e16ac0bfa269c04b9bf820b5368472ee5909de96e3020bf44d9eb5e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: perry-ui-model: perry-ui-model: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8ca71bb6ef16a956d81059a1373b2424a5b81bb9f64ec33bc2202afd7cc2b8a9"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: perry-uuid: perry-uuid: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1711df923a5aa66e0434e48cfffdee6dda292026a2d2dcf2aeb4672c4cb8c197"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: perry-wit: perry-wit: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"52c01b104af9dba6b07b68195ef17c1a45160c1a2e37d3b04df367b292e21e86"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: perry-abi: perry-abi: abstractness 0.08, instability 0.00, distance 0.92 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2561d862767a192ed2517a05536c1cd32be89b7cfa5ab9450b4ca30837017151"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: perry-ffi: perry-ffi: abstractness 0.02, instability 0.09, distance 0.89 \u2014 zone of pain \u2014 concrete and depended on by 31 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"47242769420c2db8eea9629eec9e892e7e06b3e86cd1f111d0cfd064384b62f4"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: perry-diagnostics: perry-diagnostics: abstractness 0.11, instability 0.00, distance 0.89 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"69b8499459b919822f1cd132cf6efa885dbba127ea4f91298a7464be942be3bd"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: perry-tls-session: perry-tls-session: abstractness 0.11, instability 0.00, distance 0.89 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7a49d8064ebe44ab54729ccc59022a7dea0e1e64be0b060197a383c5ea413692"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: perry-runtime-manifest: perry-runtime-manifest: abstractness 0.00, instability 0.20, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2cfc66f0f28532e7b748e55b4406cf385132f5c0d89d6cd35d03d7532f68917b"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: perry-ui: perry-ui: abstractness 0.00, instability 0.20, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f3c693b133299e7fbc91940f76f5cc1cea3b35448a474ce95825c9b9fc6db045"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: perry-audio-miniaudio: perry-audio-miniaudio: abstractness 0.00, instability 0.25, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bad1cb33e28293607200d601f2bae7d1f9e3cfd84caad3cbb4359d7ccfa79776"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: perry-base64: perry-base64: abstractness 0.25, instability 0.00, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 17 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0f493def6d7494a9f683217231b6bea48d853661d286a2b5bc163956f8f8387f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: perry-parser: perry-parser: abstractness 0.00, instability 0.25, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3cccb8f7920649672cc8d8f0c43c56319fc0280424fff7850511451eff589e36"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WasiFilesystemCtxView (LCOM4 26): WasiFilesystemCtxView\u0027s methods fall into 26 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 26 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/perry-wasi/src/filesystem.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30a5c637f5e234d2640ebea4db2ac93c34ec00b1d63e271167c5d49c3e49cc4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LoweringContext (LCOM4 18): LoweringContext\u0027s methods fall into 18 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 18 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/perry-hir/src/lower/lowering_context.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7632218c62c262e938fd4426a926f981fea678198d6563076dedd62bb94df6"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FnCtx (LCOM4 6): FnCtx\u0027s methods fall into 6 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 6 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/perry-codegen/src/expr/mod.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f4c7c346a05b22bd7a9460a221ad3f42e4c01ace8c145930cc774bd2603233"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ComposeService (LCOM4 5): ComposeService\u0027s methods fall into 5 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 5 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/perry-container-compose/src/types.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1b3d2ecf36dc4d5efce5062c3ac89639db58f6086e12366296ea7b0f304320"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Scan (LCOM4 5): Scan\u0027s methods fall into 5 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 5 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/perry-hir/src/lower/pre_scan/function_ctor_reach.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"dadec72032f31638edb85b88f66f9ba45b57e3358c3b9a7abc05027c3398b5a8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: State (LCOM4 4): State\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-component-host/src/sync_wasi/mod.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb55187540b73cfe56f3153b957a9480c0bb734b326f7352debf1c3071eb09b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Accessor (LCOM4 4): Accessor\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/accessor_pair.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b32f1db0771429c1d816ea980212254f132d864da46135e7904175af75c203c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NetCompletion (LCOM4 4): NetCompletion\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/turnloop_net/sink.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"941c363e3835b1befb4cf3bb9e0168f42e50d88c1664248877ea06f619ce8055"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WasiRandomCtx (LCOM4 4): WasiRandomCtx\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wasi/src/random.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfef2731b65a973f433bc4bd3d93927cda9d61bd937c1f8ef31323fe9a3a0be"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AsyncIo (LCOM4 4): AsyncIo\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"third_party/turnloop/turnloop/src/executor.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc00fae7bb1d1044631f298978cf9062bacc520126c21ff0072f411dadeaf0cf"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0000-ci-fast-feedback: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/0000-ci-fast-feedback.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9b4a525d18b8de5f9ee257ef653c19309153bf849557912138ac246ef61e87"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0000-sqlite-handle-properties: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/0000-sqlite-handle-properties.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ec7e9d3102423d15899652f907b76a025138b2e5b685eb02414e16f7bc4d36"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0000-sqlite-run-row-returning: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/0000-sqlite-run-row-returning.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15578531fef7cb63c54777ab2176fc0e9d5f6e87be70f6033b6becd24587c9d3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 2879-concat-typed-array-not-spreadable: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/2879-concat-typed-array-not-spreadable.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"058947adb2f6c1a38882bc4b6be78442b7de415ff78134faf4c51189ec57afaa"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 4644-retained-growth-verifier: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/4644-retained-growth-verifier.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f99c4f72b31685336a4a8fd62eb2e6e2cb63e04b8198619f7a04aacc2e07b1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 4975-http-header-array: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/4975-http-header-array.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcdce8fbb7737696081144eac13e40142be5225f8d4a13fdeabb2b5431a04e97"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 5694-state-value-native: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/5694-state-value-native.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0dae2c3cf69834575d20e46fb7b797ad31ef635fe104be338deb8bc7bdfd33"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 5716-native-binding-governance: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/5716-native-binding-governance.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cb47a5dbbc09d1adf059b66acf7741990bf324bc55af7771dc5229962b434d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 5731-embed-project-root: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/5731-embed-project-root.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ec9990cd3cc0162ddc7556cc64797cfdfba6f69dc72c7b8a0ca90681da9925"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 5742-android-x86-64: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/5742-android-x86-64.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfda87d011a4c52fe33f41ddc7a7a3b1fef7003b2685f0cacc558bf5aaf69af9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 5756-tanstack-start-compat: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/5756-tanstack-start-compat.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff40fa024ab1e639a673df1d5921db44873b925ee87b895425987323af62023a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 5884-windows-bloomview-dpi: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/5884-windows-bloomview-dpi.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f78450c688b4902fa37bc605333753fec65b03aa7c681e877868d882871f08"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6352-clang-minimum-version: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6352-clang-minimum-version.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12c4db38661ba18443f2890d780e1b88a7565022a9d6787aacfbce7f6d8b3e9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6744-rand-0.10.1: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6744-rand-0.10.1.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9621a88b1faa4344450ae49fbff5266657c15f5761a235499d343e0aaf925b3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6745-wasm-encoder-0.254.0: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6745-wasm-encoder-0.254.0.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2441ad875964e45141e5ba17d9b742a31ff879013e83f7bf91c84814ae78676b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6746-cbc-0.2.1: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6746-cbc-0.2.1.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb86f1f1dbc6e45a48c3cb54e0f63d3640c53d1006f927554f7226b3be6dce2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6747-png-0.18.1: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6747-png-0.18.1.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5c0ec86042ffc3e0b27a7223356a130bd5ea2700de9dccecca0d9d630d0d6c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6754-workspace-lints: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6754-workspace-lints.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa2f6f74eaae1cb89dc31f48318cad233fd6be68aac91377a18749e721e1d68"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6755-gap-snapshot-ratchet: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6755-gap-snapshot-ratchet.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfa5c2fc94114cc737c673a998c340ed5ee73157f77ecd20f111f62030937a7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6758-workspace-architecture: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6758-workspace-architecture.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba175cf6b2ce0051a499c0f6fb99d904e733ef9afe5cc254073d10503837d64"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6760-merge-types-into-hir: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6760-merge-types-into-hir.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2164ba699e7890cda3797d05ad022b6060807765985e395d0ddc254796914cd5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6761-multiplatform-workspace: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6761-multiplatform-workspace.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2001d11d2b8ccf297574af65c9d457c72f7d71925ab82f9ff1acde42c398c35"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6762-parity-fork-containment: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6762-parity-fork-containment.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b24dc6cfb3bab6d70dcce4a27354525570fa2b25a3be6df04b68da87c654f0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6764-async-hooks-final: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6764-async-hooks-final.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9dcad3485f2c3e3799e3e52a49af4e9b1227a428b9b1e981b0f33e185e28464"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6784-diagnostics-worker-dispatch: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6784-diagnostics-worker-dispatch.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58224764374a574725be4d56c96c005c175798e175f89e751d98edc19daf6f74"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6785-fs-promises-parity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6785-fs-promises-parity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"780a8a087d1a878e9264a3e4f7c6ff17d450949c1524daba4522a39d124c4e78"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6786-http2-request-session-order: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6786-http2-request-session-order.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f78dbad9f9466703e36597bbde31dc1ecf4879a94ff70257fb5735e5882180"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6787-path-matches-glob-feature: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6787-path-matches-glob-feature.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d08f4bf62d53798c06b57b9919caf12b6a2be54c381568f2330577fd2fd8f33"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6788-named-callable-length: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6788-named-callable-length.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d06c826715c8b22e4186840868fe49d0ddbd8754506f80f123df028021ed92"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6789-form-data-constructor-length: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6789-form-data-constructor-length.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfbf20cf28ba3036172e049c735403f8b32b0692f3926ac7a1902bca5b3b95a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6790-net-connection-state: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6790-net-connection-state.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebbdb3b7637831cf4e474c8bea05ede87b1ec44d246708d383edc73f68c46bf8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6791-readline-interface-properties: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6791-readline-interface-properties.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aec92b069115a4225146a663e162ab6331e7a87d60cdc2d22942a119948c7f1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6792-util-isarray-arity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6792-util-isarray-arity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6096a578d97143718fcf1e54ebf470695a8101c0a76b115824125d206071600d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6793-local-ci-entrypoint: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6793-local-ci-entrypoint.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafc8f49970ebc1f49b9082642f4cded806da201fc2dcb150a62af20a7c0873c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6794-untyped-param-masked-window: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6794-untyped-param-masked-window.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d672d38921b8e08aa7709c7d348aae9c89f506408287f6ca540905c06460073"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6795-runtime-state-phase-a: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6795-runtime-state-phase-a.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1159c44a9af9674685fd89682e800ceba3ccf0f19aaa548eb189e3f50815ade"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6796-object-meta-phase-b: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6796-object-meta-phase-b.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e142a12bf6335b0df165608581a65289c35bd456f8a940e1e91cde2469a85add"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6797-shape-records-phase-c1: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6797-shape-records-phase-c1.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7b875ec4e2c3624e07439f42bd3e2b1f7d3cfc1a59e0beb6f6e712e414bbf8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6800-object-meta-descriptor-summaries-phase-c2: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6800-object-meta-descriptor-summaries-phase-c2.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc11fd9ce3164de46d94b96dabd6e6706a3b2feb892fa7ba27802757d1377539"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6801-stable-shape-identity-phase-c3a: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6801-stable-shape-identity-phase-c3a.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc41ffcc660800211a316633917427cc4d842f4088f6907c56641d95d9cad37"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6802-inline-guard-per-key-c5a: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6802-inline-guard-per-key-c5a.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bccd5f1531a3a920b4e3d0e81eec7c3f9a25a1fe46bc544680c00151a393e11"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6803-header-shape-id-c3c-r: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6803-header-shape-id-c3c-r.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e087b9157ec3cdd7e3546dd491abf5d61718916ee0cacae665122cb5893743f9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6805-test-reset-c5a-sets: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6805-test-reset-c5a-sets.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a68e1b99663b2e6f2ebb5503e3ac9dd40f7f991130104c4734a18f0aa32402a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6807-eager-shape-stamping: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6807-eager-shape-stamping.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff40278daae2b1df20dead5b68ebc1476e73f862244bcf44b435bcd7b9a4e15"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6808-pic-shape-id-compare: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6808-pic-shape-id-compare.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a963d982f79b1f289bcbc5a42c7ed2b828a54849c04aff333ea3c3a97126871a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6810-aot-runtime-fast-paths: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6810-aot-runtime-fast-paths.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36d573740ce3d916276d6e967d7454bae27b2f9269a2cc333f82ebc36ef7d8f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6811-object-write-fast-paths: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6811-object-write-fast-paths.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0625cd3d2619632cc622ed9fa7d824cae8b3dbb03be0ab2b9c91d6ee0b8ce36e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6812-builder-fold: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6812-builder-fold.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1205fcd705468de5ddeff5d05fa99ab93029886298a4154541610330ae2af000"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6812-clone-eligibility: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6812-clone-eligibility.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b7905376f0ae75168a4caf2670dd75a4cd5bccab92f21969339307d47214e4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6812-immutable-string-key-loop-pic: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6812-immutable-string-key-loop-pic.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7232778c9f5fae7a90abb87355751f739051d3f92cb62f6f635609467619f2b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6812-keytable-lane: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6812-keytable-lane.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"633344bb2752a4976a7260bc4b0865ad93020afc7cfdb46e5c778ebe6080ac0e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6812-nonzero-object-write-start: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6812-nonzero-object-write-start.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfc99e85bf2c8d12769c9cc8d4cb854fa77b0235905a4afeab02d8d9aeeb806"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6812-object-spill: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6812-object-spill.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58cdb6f179cfedf89967655c42b1e1e7aa5ac72891a87416d64b67f3277ec28d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6812-object-write-loop-generalization: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6812-object-write-loop-generalization.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae393fe3203649112823d6dfe9b7180f4ed2aac26fcf421b1b36862a1b8fbcfa"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6812-polymorphic-write-pic: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6812-polymorphic-write-pic.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb380bc020cc7d5f212d9b4f25ea61cb72a7bbd14143a86128778bcd318767d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6812-spill-lanes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6812-spill-lanes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b2ba2e2a2e1cfa6580059a2f896f938d3946c1065357239fe276ef395233d1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6812-w16-builder-identity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6812-w16-builder-identity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a40a0a1af1d7aec1effe4ff9e266f8d07464d6e7c5132996b1070c8398e8cf"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6812-w8-temps-w13-intkeys: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6812-w8-temps-w13-intkeys.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9137c49076d7779937278e2401a7a4808d99d335c11f1e90af90e5650524af62"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6821-review-followups: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6821-review-followups.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6494bf7f17bb70f4b5cd07f350ccc9f5798e3451b6d8fe71f9984882734af5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6826-http-server-consolidation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6826-http-server-consolidation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"363618fda9a61bdb12848852e9c09ec24c6d08ede8326d9f7242e1b66ddff21f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6827-native-scalar-widths: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6827-native-scalar-widths.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d6e3d49acdb8f76789161dda81b773ea83c4dc097910dd794aa59ead04fa97"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6831-json-parse-born-old-write-barrier: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6831-json-parse-born-old-write-barrier.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1fe6ce864ad65b60bd8a5873f216c04e405d51ad0b212b62b61497da39376e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6834-http-ffi-boundary: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6834-http-ffi-boundary.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafd30084eda274975829fd3872b787434deb28d3af630e89a99cc211f38e81d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6835-remove-stdlib-http-client: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6835-remove-stdlib-http-client.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f304016e76035ae0b5b0b0752102c517898edda72e3b18a3fd7e97738432c90"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6836-node26-crypto-parity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6836-node26-crypto-parity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee17fa0ee23726cc234666d146ddc4663c655610168e7c1968d44a43babc262a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6837-rust-warnings-to-zero: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6837-rust-warnings-to-zero.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b73fb106e7d100a4f4a54c031ce53cf69021fd71844e3b53b5ecce15d4d0da0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6838-random-bytes-async-test-macrotask: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6838-random-bytes-async-test-macrotask.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a3d967710f786789fc5698d2f539d3bf82c59cc919f1953af0a4eb3a572f0f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6839-native-proof-uint8array-symbol: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6839-native-proof-uint8array-symbol.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5794daef730c3dd9497cdb5f332d6cf0c514eb9fd421e9096d1cee5e2e4d0625"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6840-typed-feedback-entry-return-ordering: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6840-typed-feedback-entry-return-ordering.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58432a547a2cc80c47810dbe5884858eed7cc0e6f3406c14cdce5ad5a10089e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6844-region-i32-chains: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6844-region-i32-chains.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e84eff237a89979266ab114ca03515a4c10ed9d62d2257a17e9eb9975033d8c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6846-region-shadow-clear-dedup: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6846-region-shadow-clear-dedup.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"762f1c279741f853b00b5919480b707272de1ff0050b10140f7c33e53c8b7639"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6850-native-imul-typed-array-param: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6850-native-imul-typed-array-param.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a016133af1c834f0509816581b0bcbc39979b5a0c6dcbf9b377ac484b04da165"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6852-axios-async-response-properties: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6852-axios-async-response-properties.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1006d4e8b86854c41f77686f89350f98adcc5221d681e03bafdfa3ccd0727fb4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6853-node-globals-parity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6853-node-globals-parity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa30c5f38dc316c6b7e1b1f0cf1132a8738175bca7acf51c73ccc402f0880c9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6855-inline-hot-small: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6855-inline-hot-small.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc66d5b7c6bc064440cbd33df04b7aaeadc90d8cabbeb698d490e3ce31d5ff5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6857-fs-node26-parity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6857-fs-node26-parity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1381a3e543401f0b53162237311b1a1d96e5985bc66958a8cde03363142e59"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6860-inline-nonbigint-bitwise: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6860-inline-nonbigint-bitwise.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1933b77c6a619925f40699381fbc7b96080617fdf2ffbf7204bf1c41245e96b5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6861-trace-events-node26-parity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6861-trace-events-node26-parity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"966d72c07a4786dabdd57b044d0dcedf46f15f9c8279b8e6c8db4cf51146d65b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6862-dns-parity-expansion: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6862-dns-parity-expansion.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa38d7aec6742e191debf17a941a1a2b7a86a1126b3af33d9606c03d1b24195"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6863-dgram-node26-parity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6863-dgram-node26-parity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f07ff38555193a4b218278e57894a8c5643ca622d1208996f786755922b482c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6865-net-parity-expansion: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6865-net-parity-expansion.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b054e4b103e65151f6c99a8595d6e6621bfa0b5655f0edc966f7ad5aea9046ec"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6866-http2-parity-expansion: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6866-http2-parity-expansion.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3faae446b0cc8a4650c114d993759f87ebc24e1e22281b930cb8b77ec2a8c7be"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6867-https-parity-expansion: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6867-https-parity-expansion.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ae823087dd437c5967db563cf83e8ff0b41466088782ccb5b79a05fcfb81b8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6868-w9-multigroup: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6868-w9-multigroup.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a842bd20c9b979d8e946ca5467cc9258b38e1ccae46edf37bfd60f68d5c9303e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6870-splice-unshift-spread: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6870-splice-unshift-spread.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd5378bd30d58a1955197f2e654dae59d2f89d44550a7f3fc00d4e8373233a0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6871-uninit-let-loop-reset: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6871-uninit-let-loop-reset.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65d4b5139404ef51abe5eda9b42af3d5e9f1cc1df5070341df38c71e608b399"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6873-optional-require-try: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6873-optional-require-try.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2dac0e82e97b5d986d89f2b40b5833aa95b7b253f3de82b0e6e4635b61786a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6879-imported-enum-member-descent: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6879-imported-enum-member-descent.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"704ad2116ac965897f313fb31b55810332d23cbd597e44697fdcff20bd5471bb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6880-readline-parity-expansion: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6880-readline-parity-expansion.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4524c0326c692ea23512036d9b91c05fbd87e4fb212cb429a36aaa70940c56b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6883-inline-ta-param-numeric-read: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6883-inline-ta-param-numeric-read.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3d3b28627d66c63d92f09d14e5b246717ce541cbe131aa4c8c63a324f00e26"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6885-vercel-cli-corpus-compat: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6885-vercel-cli-corpus-compat.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbaf9c84db80b587adbba620924080ab08dfb9c5bf979110841fb99f707e8de2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6887-sso-concat-string-index: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6887-sso-concat-string-index.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"495cb8800e9c08cb0ba8d83ac320ad23d33d7b16b898338e68735b75a1aa88ca"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6890-tag-last-release-pipeline: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6890-tag-last-release-pipeline.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58138f8fc0f1a9a710af180741d4a07fad3307fd9a5a8d4cae7a6f5cf2069ebd"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6891-linux-verification-sweep: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6891-linux-verification-sweep.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f705984ed174d98d18c4245a08744143d7781edff3be4c58c8230dabbb25d1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6894-dgram-node-parity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6894-dgram-node-parity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70726e9d5060e5f46f8289fab97ff4f616e7daed41db0c08d5f7b74ae4bb3274"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6896-sqlite-node26-parity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6896-sqlite-node26-parity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eacfeac7525c40bbdfab48fb2587e3891e4c23465116ef09943160ea8b807ef1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6898-native-i32-integer-locals: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6898-native-i32-integer-locals.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbd403a48793d1be4e52ce3309de7de166996e8d00e4e9cd4de1e66a7a8970e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6900-llvm-legacy-attr-spellings: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6900-llvm-legacy-attr-spellings.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"398a461d218a2395bb5c20742ede5358d6c00fff41387cf30655d5ee553e1b20"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6903-repsel-p1-canonical-i32-locals: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6903-repsel-p1-canonical-i32-locals.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56820f5f6b369d1675bb2ca1db2da86cdbffc7d9f71ac856c5fa2488f8bc62f7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6905-repsel-p2-specialized-abi: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6905-repsel-p2-specialized-abi.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7877a6743dcf7274c4201fb414ecf76fbb809b7f657555fb46836b03ec7bc828"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6907-proxy-array-mutator-traps: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6907-proxy-array-mutator-traps.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9207a0576744c35ca9c570a6fb23d2b6429f6a3ebc8af7cf29b152d9e84da6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6909-repsel-p3a-canonical-str-locals: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6909-repsel-p3a-canonical-str-locals.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14840877c69deb9f1386a6b82da7e4a2d010e70f96eb1133c82531bcb33e7e45"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6911-repsel-p3b-shape-proven-objects: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6911-repsel-p3b-shape-proven-objects.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"589c070459707e278e4f935e46ef998af6864a39663267fd6fe16efe2631e90a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6912-security-tooling-soak: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6912-security-tooling-soak.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33825b2c31a60efbea542e8b965f0cf31dfea9ea420a1388f6e0d8e44c481272"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6914-install-sfw-firewall: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6914-install-sfw-firewall.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ace157e1974bfdde8309967d2a27ccb9900308ac2713131f8459ff968df02bb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6915-repsel-p4a-numarray-inline-tiers: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6915-repsel-p4a-numarray-inline-tiers.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01848082cf69666e3c2defdfb58426cd73e897e116ed024c31611313e1ed0ac9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6916-repsel-p4a3-ptr-numarray: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6916-repsel-p4a3-ptr-numarray.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d8473e61e6fd89b909fc41d374f54c354946b3bf430262e3df848a0656017f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6917-size-optimized-binaries: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6917-size-optimized-binaries.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25340adf15f75d48095851025d16708c264683eb1b7932c732e0a8233bc9fde5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6919-repsel-p4b-store-elision: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6919-repsel-p4b-store-elision.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd126c184d8bbdc405205d9d4696875fdc84fb631b3a00ab37c9644571fcb57"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6922-fs-thread-codec: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6922-fs-thread-codec.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"865001f9bb596c21bf0039941327aa73a223cdda4645b9f3818c804025a6a61b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6923-macos-dylib-gate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6923-macos-dylib-gate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"798496987331cbc3b7df123952d7596893170182dda40dc4005207305dab3691"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6925-repsel-p5a-proven-this: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6925-repsel-p5a-proven-this.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4107def51bca8d031bf910d6a4b46e4e0f190275a367bb388c586171b4531b39"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6928-nm-namespace-hooks: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6928-nm-namespace-hooks.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a971677213364f816793ee58c138ce6a3db477da203345141e141361935df41"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6929-gc-root-word-mark-rewrite-parity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6929-gc-root-word-mark-rewrite-parity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"201629bb9506e8bf8800fd5e883714018d0309528d63d0a2ec438213793c3e15"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6930-typed-shape-layout-ctor-exit: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6930-typed-shape-layout-ctor-exit.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f08f2b211ee5d35bd2b31df79f824cd89f315e31c928fc267aa60318eb48b6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6931-callable-attach-registry: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6931-callable-attach-registry.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"285390f303c33076cafb1dbf231766493b8a1771d07e40b5b0a89be7b2dcf812"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6932-gc-root-word-test-handle-hygiene: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6932-gc-root-word-test-handle-hygiene.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7320668614a666d92558392585ff2a21b78a0fc242a9583603d684c95ddf82ea"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6933-minor-sweep-old-gen-finalize: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6933-minor-sweep-old-gen-finalize.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05377d4b28da944e297f34ee598e5fa123a893dda9a737f3f77043edcea0838"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6934-dynamic-arith-operand-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6934-dynamic-arith-operand-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"636bdd308a6b75d692a120553c2f9dc11d8c31fd9bcd8eb6165afae199cfa9bb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6937-callable-export-table: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6937-callable-export-table.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a766e45d72597e3bbc0695f5b2b7b21bdbf4205b98257f0c05198c01e1b9aa9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6938-arity-table: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6938-arity-table.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a23d9dbe20cc778d4ae9e63cc98cc13d2f9f6b8538bcb0a2a9d29144f9b7cb2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6940-const-tables: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6940-const-tables.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"929561734c7950cfa5ab9ac58ab03c6f79f45abf05ee7276b1ff4f1ce3fd3ab3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6941-property-key-operand-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6941-property-key-operand-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0e7a870fcb682bbf7ed1ef0d1850c3c8a57d060f8886d9ca3e4df8be5519d8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6948-string-coerce-property-key-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6948-string-coerce-property-key-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7fe002fe004f27e384c3cf24f34f486b6588d14151360fa1fe97327e701d9d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6954-gc-repsel-stress-matrix: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6954-gc-repsel-stress-matrix.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02893c0fe0edbfe50846c72684bd3263891ac2827d160fbd1d5d94f2e947b61"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6957-ta-fractional-index-expectation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6957-ta-fractional-index-expectation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a171440b9e8fff888c7a227078ecf3e7f8910183dc343eda6fc87228942e230"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6959-intl-namespace-gate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6959-intl-namespace-gate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb5dc490b6dff18dad97dc52ce48b8b3178d57f70759e3edb9337d517c34427"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6963-shape-keyed-typed-layout-queries: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6963-shape-keyed-typed-layout-queries.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc41443c06c49b2eb8d1dbb3b87f456aea01d3525407152a2a4c14c89bd3d63"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6972-precise-root-argument-temporaries: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6972-precise-root-argument-temporaries.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccff6d8069e207a27c476053e902208fd4c0ba0ef6c3990639db052f9b82b74"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6974-layout-transfer-shape-keyed-intact: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6974-layout-transfer-shape-keyed-intact.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8839e8f80887e116e66ae25378b97241200e75efe972774174253f422110449a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6975-temp-root-coercion-gate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6975-temp-root-coercion-gate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e2e477120e4b4c96ca2564a461a3d82ab9bcb7db73e069181dac752716149b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6977-reachable-evacuating-minor: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6977-reachable-evacuating-minor.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c7ee42ef81c15983183532c684d5dd5f4b184953beef9252a0144eb7885fe7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6979-temp-root-cut-invariant: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6979-temp-root-cut-invariant.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cadb99daecedc98335f4322e956a0e61270eebe22b970427c702d9fdd711cba8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6980-lazy-global-namespaces: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6980-lazy-global-namespaces.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f05af152b5d1d32ad3ee3ac0e4a227d4a3678a3d9dfd26a91d33810139bcbbb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6983-operand-temporaries-precise-roots: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6983-operand-temporaries-precise-roots.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6fab099bc87fa8d8dc6113c7206ae73fdc780f2e0a24828b2e1315d2e14b8d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6985-lazy-global-web: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6985-lazy-global-web.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa76e6bd4070463c3ec1d6a50b6a6320e3630991f37fbdbeb7baf6cc3f7b5120"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6989-gc-policy-default-docs: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6989-gc-policy-default-docs.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6b8d6a7ce19d498556123132da345adb3bab5317ce093deee1578f07f9ff96"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6990-typed-array-ctor-source-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6990-typed-array-ctor-source-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"375abb4d190ff9087b7e0134e2bc26acb961d819757e0949e289b54bf9354236"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6994-gc-globalthis-population-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6994-gc-globalthis-population-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeeb864b2d102e02cce4b6800d323ea20595815ee0654b7c3fdca23614183ecc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6997-temp-root-typed-element-reads: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6997-temp-root-typed-element-reads.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"677b419691677ff7270ba23109f581781d8cfe5bfc10012758a9d7cce1908237"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 6999-mts-file-discovery: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/6999-mts-file-discovery.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec35065c2854730a7dddc1a7998667dd58123cc9a5d6b17155dffb20ee9f2cc2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7000-deps-check-scoped-subpath: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7000-deps-check-scoped-subpath.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12a84a43c76a54157fc6393e326dcf18141370cda29362947513a54ece1b5ee"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7001-ancestor-node-modules-walk: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7001-ancestor-node-modules-walk.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0bec2d185f5a247090fa5baf6274e1c3ef952a2f608893e53e6a76b55838a5b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7002-aliased-import-origin-name: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7002-aliased-import-origin-name.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bae573a17d54bdf44c3a197bfbdee90ae6532e959048de46205add91b93188a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7003-wasmi-simd: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7003-wasmi-simd.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"026871495d94a97418093ccfce5e3260accac9462bf36ffde7cf06f6a800e262"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7004-cjs-globalthis-export-shadow: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7004-cjs-globalthis-export-shadow.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efbe3f5ec27f30ca4dd625a24361987954e5e0d69d726d14b2b8d2d8d896418"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7005-reflect-members-real-values: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7005-reflect-members-real-values.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50cddd24a4153e19c1f4e3e7f192a6955e0ce0c7b7d3da30a5f5d50b1008487d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7006-fs-promises-named-import: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7006-fs-promises-named-import.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e56806a7d1d2a7df1d4fe2e7cc11d1c6a9cfa3b68dd47e39db32b7034783b1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7007-scalar-replaced-local-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7007-scalar-replaced-local-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5628ec103b8a0d10cf91c628d880fe1677776ed7367aa31251fddf760aab8eb4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7008-ctor-dispatch-web: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7008-ctor-dispatch-web.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9a8f5c90c164d47fb912405d2bb90e1cb38a25545fb58e4bef58399bd84b78"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7009-intl-tolocale-gate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7009-intl-tolocale-gate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32967d091296a2559e0901bd06af69795806051430da7642845b21de8019a38f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7010-corpus-duplicate-entry: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7010-corpus-duplicate-entry.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b977a924890c8f310a01a8962da3356b93e7b52f942e62f16284bfc218eaef6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7010-proc-ipc-gate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7010-proc-ipc-gate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c054e193ea7471b5af66091ebc50d77a04f390280e1b0af950d7f0a072ac4e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7013-hoist-scalar-slot-root-binds: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7013-hoist-scalar-slot-root-binds.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d9f9f84da48dbb5a44ac4fd3c024b8353589aac376aa25176c9816152dca63"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7021-real-npm-cli-compile-gaps: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7021-real-npm-cli-compile-gaps.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2675b8c7aced4ed14e95c9ab7215e1dc9c9f40bf32376bee0b7e0ef4aee1d6b2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7028-subpath-imports: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7028-subpath-imports.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"080b94f7114cbe24cb41dfc8025ef850ad3a83152faebf8e15b464b239e62dd2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7029-stdlib-cherry-pick: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7029-stdlib-cherry-pick.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4fe2a61fc429779fc0378b0347bcc12245fd1575dac0d222b25098ed99417d3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7030-size-panic-immediate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7030-size-panic-immediate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81eeb49655e3156f25c28e2c88a8205f321f92d3730819e38c989d64c1749fe"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7031-binding-upstream-lockstep: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7031-binding-upstream-lockstep.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2829de0a4856cfc7f41acbf9f081cb43bcf033bf1ba14abf5a87007e6da7fc1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7032-ext-undici: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7032-ext-undici.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b04dff681fc9745899f2e50d83d35218a91e4e239e32a075440d744cc485c9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7033-ext-node-forge: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7033-ext-node-forge.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df7d9540eb48664699a728efa6739d36dbc719a9cf9ecc8b65e0d9051978c95"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7037-opt-report: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7037-opt-report.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f79faae7986d55839450af4e96277d4d479837320b3e75b5e5e19a7bff441db"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7039-codegen-determinism: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7039-codegen-determinism.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b664b0966664e0cbf382a2266fbfe42d53465792ab361aa880f7c97ba770825"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7040-matrix-moved-counter: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7040-matrix-moved-counter.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0fbe1d810d112b9d173a3fc38ef0e2fe28b1fa4354ba552cc64799eb58de2e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7041-gc-whole-heap-fromspace-scan: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7041-gc-whole-heap-fromspace-scan.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ad443731d2c04dae9e5d8bccda7426c7f77d98c3580b5125de9b65df0b9d9a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7042-lint-fmt-backlog: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7042-lint-fmt-backlog.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbcd2e9015eecf54a36f2866f6fee696a2f97c07fd21defa7ddd557bf53a9f9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7043-heap-min-diagnostic: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7043-heap-min-diagnostic.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4510e0031128d8223982547946795ffdf2cdd4385d9002d287e0b9134fc784a8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7044-baseline-static-crates: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7044-baseline-static-crates.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5163cfc67b695c3c9baa55e30c3e4b54101b70a03dcdc6ba539a5b72281bfe7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7045-gc-perf-ratchet-baseline: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7045-gc-perf-ratchet-baseline.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d802e18f0b8312cd2d7e0856e89680b1bb9800a3b65dff3d4de5db8559080f11"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7046-gc-ratchet-unverified-correctness: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7046-gc-ratchet-unverified-correctness.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1728e93fcb66cf9c990d0d3fc7dce2039ba52d690819de0f54a72572c9259d2d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7047-gate-cannot-fail-patterns: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7047-gate-cannot-fail-patterns.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8286b61269bcaf3348c33efff2abfc662195bd185003edce60e4d957dc542063"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7048-cargo-cache: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7048-cargo-cache.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"902c36be0bd0940746899e517092ecfaf727b8afd3596057f7a719b4c4ac35b9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7050-gc-allocation-point-trigger-outside-arena-borrow: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7050-gc-allocation-point-trigger-outside-arena-borrow.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f603a40d290b40afa2510374d5cd8eb377081af56af10eebbbcfbcf3f00947fb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7052-arena-block-reservation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7052-arena-block-reservation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86de3f491a42a795f3533b257c713c5e4d7e325c275e39ac5c03ba660d9df594"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7052-parity-regressions: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7052-parity-regressions.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b124650f1aeb214b47a0d6a0775087cc79464dd59956c73c3342a94ebee0b318"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7057-gc-moving-defer-slack: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7057-gc-moving-defer-slack.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c994197f01f0503530ced01f7cc2c2945d2c6457b0cfc3155a77352915dcad4d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7065-closure-self-pointer-gc-root: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7065-closure-self-pointer-gc-root.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb288d07d819b510a05545582a8c0a80d2202e4eb92b067464e3c2d4b6a9e3c3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7067-node-stream-node-26-parity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7067-node-stream-node-26-parity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35a6eb0afe69f382dcfbba4d9ce59fee7dc678c1e18edc78492c7735ff49ddb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7068-cjs-ajv-source-routing: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7068-cjs-ajv-source-routing.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb1400898f4da4e8382ffde88e0515017a084d607dedc8360572218f4206288"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7069-widget-child-methods: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7069-widget-child-methods.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b2f18ee351835400661c057eb0ea298626083dceece6b618279351b9ca5222"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7070-windows-dark-controls: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7070-windows-dark-controls.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9cead5e8cdcd39689878724f05b368ec763c9b0ba141a9ad625bf56a37c124"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7071-array-prototype-addr-relocation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7071-array-prototype-addr-relocation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b2e1e727a0e9e5177eb9010f2095beaffc96a6b4bfd15c8c2e95b5c5bcceb7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7072-windows-widget-onclick: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7072-windows-widget-onclick.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f679da0950a04456de8305b33a65cbd091626d7e71bb270ddb0d4d516f1d9b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7073-windows-styling-setters: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7073-windows-styling-setters.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c070a0b6373201eb44f3602cfba4cfcd8695f7ea37b000ab36f15b7aebded2d0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7074-node-compat-matrix: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7074-node-compat-matrix.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7005004aa5ef69c2deffa7ff03116b18461b09efd9965233a84d33e673b3c6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7075-windows-table-widget-cells: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7075-windows-table-widget-cells.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffae678754c038b5e0ab1672b58ffe352713736d6d920474e3a6d4c7d154643f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7076-loop-purity-whitelist: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7076-loop-purity-whitelist.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89e65b554ad888ee52d1b98d624b851763adc9a660e87fc307c86405395de3b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7078-windows-ffi-signature-check: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7078-windows-ffi-signature-check.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b456806a087db65a0ebbc260fe273f66adf3cc30ebfc796ee9e01a7e3c12f6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7079-shadow-stack-runtime-ops: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7079-shadow-stack-runtime-ops.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf0821a693e8e5dc1fbc30d0a097ce1d2d43f0e4dfe2addebcf3c41ef966e13"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7080-windows-network-interfaces: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7080-windows-network-interfaces.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb288717f56370faa6e34228d66b350f09f0609aaf531e932e375768e260b78"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7081-windows-env-case-insensitive: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7081-windows-env-case-insensitive.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aae743386348f4cbf0e1866030f2476721d5f6fbdf92f5f1636fbc35f54bc16"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7082-windows-parity-harness: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7082-windows-parity-harness.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4f93f9a4ff0d705b81cbe069d44ee3fb776ef4de18235ffc9811658c503bc1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7083-windows-doc-tests: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7083-windows-doc-tests.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa530b1846dd909a149056f49fd5720842875ba0f6688afef169daada419ec05"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7084-windows-version-signing: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7084-windows-version-signing.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4a185674e82c9490f60ae69312ac1bd27457bbe24418b684752dd5ec3a5e42"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7085-windows-coff-dedup: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7085-windows-coff-dedup.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb06bfefd7d617b5bfc278102c257e629ab8c8434b709e887d2c558d0158b08a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7086-windows-parity-review: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7086-windows-parity-review.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ca0b3d286f612a7c775c4b84f63099880cbd3e9e05ad9d73728a2f9bae47af"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7087-class-expression-capture-refresh: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7087-class-expression-capture-refresh.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f16433e38d051c741ba1366ee8fbc2d95757c4e21a3c8418b2e134748b36b4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7088-inline-shadow-slot-store: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7088-inline-shadow-slot-store.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7eacb291d7be932e016cfdc113276e8f8beaf7df7dbb8eaf2b196a5e91db41e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7089-child-process-node-26-parity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7089-child-process-node-26-parity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f34e72aef7137abda3896e7c2ff7af7545f84a00a8bb2847e515217c3ef5fe"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7090-node-inspector-node-26-parity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7090-node-inspector-node-26-parity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e304f41910a282af1c25fb3b03adab9989b0d52e60d7516983fb90c93c794178"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7091-worker-structured-clone: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7091-worker-structured-clone.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98fb67a9b92fdab455ba7a8230d5b5e16661988a4b3559580c79def3a3cc150"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7092-gc-test-copied-count: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7092-gc-test-copied-count.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a56d9a3784e197301ec61bf05b64ac07eff5af690f34fb6e95f45806e8a4ead"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7093-async-hooks-prototypes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7093-async-hooks-prototypes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac101d45bdfd86ee022c85b9769cd6bd917acff63bf4f6afead6c7b6010d75c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7094-tls-alpn-surface: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7094-tls-alpn-surface.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7526d5bf6af917fd349cc002fa0a7b6a370a8cbf9c1a7b81f0d371c578906881"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7096-node-test-import-aliases: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7096-node-test-import-aliases.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57068932f1732909db0eec735a20f4b890e45023378d068bca3ada633fde3e63"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7097-node-test-mock-accessor-options: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7097-node-test-mock-accessor-options.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bd6bf4e9a572f2e69674bd1aa7868c0cbd7369ae38039a63c71866817a1dcc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7098-node-test-mock-once-indices: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7098-node-test-mock-once-indices.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2134d4c8a80248684784997ed5e4053dc020ff49c50bc2703831888129a381"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7099-node-test-mock-name-length: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7099-node-test-mock-name-length.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2cec3c0af6bda94c84935516494f5d3714c328d63a41ae3439efa190bbbc4b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7100-node-test-mock-property: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7100-node-test-mock-property.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7929e0cd961d19df4f699d76f13ba0e2098e6b41ad41e5dc80575eff3e13c9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7101-node-test-mock-reset: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7101-node-test-mock-reset.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78a80fd7420b619d4d91508081ffb79907b63c0a4f119d63ac99d717943ea0e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7102-node-test-mock-symbol: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7102-node-test-mock-symbol.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73aafc355c1dd36360a38e3ba4434bd99f8248a783a94be4f31281792e6a6014"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7103-node-test-mock-timers: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7103-node-test-mock-timers.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a04f2ebb5155f4fae6c2c17a2c38bf8da6e3b28c8ae0c34e3bbb6f8cfb6882"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7104-repsel-promotion-census: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7104-repsel-promotion-census.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"648a0607e805a931e4cd7d375d6d384670d53f0033082117032985c2a5ce6473"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7105-node-cluster-node26-parity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7105-node-cluster-node26-parity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00a8ad6a69c5814adb10cdf060598e9ff1a1f24e6df66b0fcf94147bcb6a480"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7107-repsel-return-shape-facts: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7107-repsel-return-shape-facts.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79297fada4a745844cf17c0674dbb5bc6d79ce2db34f7f8f362fa6dbc165f21f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7113-repsel-zero-candidate-visibility: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7113-repsel-zero-candidate-visibility.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df826ce0901debf0b51c2e0ac42a1682da57c6eac4f48faf68f829d69234c9e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7116-string-literal-operand-stale-after-evacuation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7116-string-literal-operand-stale-after-evacuation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae6acc1d05f250e7b2209230a0344e6f8a583b5e77be42256c2ee46094446e9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7117-repsel-consumed-census: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7117-repsel-consumed-census.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88c7b04415fc57626f4f273f14c0569213b6a978c35775bb47cf8d54afa7c80"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7118-auto-provision-ext-bindings: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7118-auto-provision-ext-bindings.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e9639284b48281d8b0cbf71115c459a2951bc1daab98cf1242e245acc356e5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7119-repsel-per-site-consumption: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7119-repsel-per-site-consumption.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cea8eda2ee0c3ad2db232872878aed34a9ea91f1c51e30d632c889510224a37"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7121-module-init-repsel: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7121-module-init-repsel.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73edcb9640b2b0103252d9454cab983f289cf9a3699124b7f169eeccc4830697"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7122-canonical-i32-loop-induction: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7122-canonical-i32-loop-induction.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"751032cc4a5158f1b78fe53b33361f1096c6c28ed4314c38ecb65945595c6a51"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7124-wasm-module-instanceof: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7124-wasm-module-instanceof.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8985ab308bc429c6111d0687f82c7fe25d1b6f84400355771ef24e959a16045d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7126-intl-rtf-auto-instanceof: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7126-intl-rtf-auto-instanceof.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be13f7fcd86b182b473ab3141f86ffa5527eae0677d6ce9bbb7bf27f72caabe3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7127-in-operator-to-property-key: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7127-in-operator-to-property-key.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f6e63d93a9085401f395fce9e2010ab2595c99ac0d6f6fd4b0df2287e2facf"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7130-wasi-node26-parity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7130-wasi-node26-parity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65c59f91ffc96e9dc760cdcc39413f307c42ff3cf583429f49798bde652f9f7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7132-repsel-profitability: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7132-repsel-profitability.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6abe92e376f0bbb696b23a1478d8ed317dc59acdc574dff385eceaed2fa9dc22"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7133-repsel-knob-isolation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7133-repsel-knob-isolation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de34410a46e094bcd71a3562fe7435ba3e9ce8e41deb63add1dbfe0babfd8a32"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7134-computed-key-class-proto: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7134-computed-key-class-proto.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa6297ab6423f85e5d3486765289c6bb9ce90a524f18ac425453d5e46744dab"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7135-deterministic-llvm-temp-names: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7135-deterministic-llvm-temp-names.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c575856bad76b07bb479402f562e23a8dc981a4198e4a4c5c1abdeb407faabd"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7136-lru-cache-faithful: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7136-lru-cache-faithful.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31632899de7f0f2f6504522f9dca4e1b507d95bdc1d1c3bb6587adc6e1cc642"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7136-native-region-proof-inline-root-barrier: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7136-native-region-proof-inline-root-barrier.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca94102dddcec26353f697370d0fda9017c4be90dac4201728550c72613134c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7137-zero-config-binding-faithfulness: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7137-zero-config-binding-faithfulness.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7621c61797f2e657fa5da70bade3d160e45d1ddf87754630be957b8ff2aa1a91"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7139-cjs-scaffolding-barrier-exemption: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7139-cjs-scaffolding-barrier-exemption.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f61001009c444b9bef9e7be9ef234eb3ba79fb7057d9594ebdde535c92a6bf"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7140-linux-emission-determinism: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7140-linux-emission-determinism.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f246a7c1258b6a845e7e61b7a43737e0cf4d60113abf9f2ecdb97de627cf2f21"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7141-pshape-routing: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7141-pshape-routing.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4112b0fbf352288e323c09c8177d2faeb696bef3428dc6775665a03a221d1764"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7147-gc-test-build-production-scan-mode: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7147-gc-test-build-production-scan-mode.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"735532eaa495c4a0a157e2b913061d89516a95f2e453d2d548e2edba2674bafa"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7149-ptr-shape-array-element-escape: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7149-ptr-shape-array-element-escape.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b00eeff16b34c76c1f7808589f68efbaef700d0c11c84bbd48e359796137b4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7154-gc-disable-evacuating-minor-default: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7154-gc-disable-evacuating-minor-default.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc4af6ca3d4b7c647c6a49791f59e792d18afb484590e0f07ce5570854f9a82"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7155-auto-opt-freshness-runtime-source-test: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7155-auto-opt-freshness-runtime-source-test.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c99d7e203377c78b5ae9df7abdc2d740508763965120c79a44318589bc495f5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7156-lru-cache-size-property-getter: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7156-lru-cache-size-property-getter.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd323e81bc480197e5b5cb21b4499b046333bb2fa975ee249f94e92cc3ff226a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7157-macos-child-process-posix-spawn: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7157-macos-child-process-posix-spawn.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"376bb6ef6b9c18880ea60a38b879806d37d721b83bc5550b9c66d799818a24e1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7159-manifest-consistency-iovalkey-drift: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7159-manifest-consistency-iovalkey-drift.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"052210c36dc2eb1e226ca7c062dae9ac108df44f1268c7faf6f7cbeb01ca5010"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7160-zig-cache-isolation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7160-zig-cache-isolation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd808ba233bab159e135e466e15a5ba390ae5b3d26c70019acd4ea96977e9652"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7164-ffi-by-index-field-count: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7164-ffi-by-index-field-count.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6cae2c302c9bceaf55cdb0aa93d47661d97a51eba283cc6d06e2bd88b5d32e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7165-scrub-absolute-home-paths: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7165-scrub-absolute-home-paths.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c079f6bbe9fe88a759a6ba43fdd5273bcfb4683f949b2cbb4b45d8acb5138f7f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7166-gc-safepoint-deferral-scan-census: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7166-gc-safepoint-deferral-scan-census.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6497267998f17738897e96978e2bbb9665bf2eb597dbfe941a537c71b30542bd"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7168-ll-temp-file-lifecycle: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7168-ll-temp-file-lifecycle.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b92d409fe9f24816f7fa7d8e32357cc7afbda13a0ad8ffcc098b1920a89f28"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7169-tower-pshape-keys-guard: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7169-tower-pshape-keys-guard.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49aea22bc6283500c8f64fc15d896c7c1dd697049d4e57827854fef2d137df9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7171-cjs-preamble-ptr-shape-report-noise: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7171-cjs-preamble-ptr-shape-report-noise.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c3f90c496621352a77fcd8fa1398515e51ea7100c4ff16c74c0d161748f24c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7175-no-link-object-staging-dir: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7175-no-link-object-staging-dir.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73482ba37a18aa92a9f20ef241c2da5e3f4aace65e14387ec27e8a1fda51642"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7176-repsel-alloc-site-buckets: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7176-repsel-alloc-site-buckets.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db012f7293e4761055aedc67483d91d5ba1674bb6d86ccea0be8905d19c371a6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7179-gc-pointer-publish-barrier: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7179-gc-pointer-publish-barrier.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02faa082a699f3a1f618109f7e7d88426166a5e4df42c8312661d7e050a68ef1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7182-fromspace-scan-forwarded-owners: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7182-fromspace-scan-forwarded-owners.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df1620f8571dbdcbd40cf5bb88b50b83f05515184c71d6ae7a57f5bbd5e2086"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7184-shadow-frame-slot-overflow: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7184-shadow-frame-slot-overflow.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91ad5f54b55ef882d8526daab509cc8c16982911ed5e1805e508035092246c0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7185-scalar-replaced-slot-roots-fixtures: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7185-scalar-replaced-slot-roots-fixtures.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"487fa05f6b0d73f19775eea16b66c0db6089684525bc7cd49feecbcc39651fe8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7186-scalar-replaced-slot-roots-fixtures: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7186-scalar-replaced-slot-roots-fixtures.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfdf825f846e5412774818e3b1823a5527ceb09252ccaa216b85fa9ed2d7ed8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7188-imported-member-array-name-fold: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7188-imported-member-array-name-fold.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefd014643ca340fef24c8bd8a8ee795fd0f4342f60029f1bf6d5a5c0a021c8c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7189-export-star-as-namespace-object: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7189-export-star-as-namespace-object.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e884fc3621f9f1af9753d79fe54bdfb34991ef6dae5c9ff8c48f34c53359456f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7192-root-store-dominance: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7192-root-store-dominance.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d319f0d46e3afa60cdec36fbb488c020ae847dbd9049f7c6a5e87cea1f0d78"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7193-barrier-parent-classify: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7193-barrier-parent-classify.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c4119ee72b2880deb03bed5f12e25a70fd55f19e4d59231f600b1f0239c57c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7195-zero-config-followups: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7195-zero-config-followups.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c55df39f1928c219e4cdbb0329b22b233008da97dae1712d9aeeda6b34726a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7196-gc-rooting-bug-instruments: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7196-gc-rooting-bug-instruments.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d3a89d22f4b82e1d8169333bcad20721bc313b2ed7646bba14abf1b54fa501"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7198-root-store-dominance-followup: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7198-root-store-dominance-followup.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e27d9eae5be4a6706e0f482c9355f21b299e243771dedbdfa42c0bacc8d6ef9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7199-dotenv-parse-manifest-wiring: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7199-dotenv-parse-manifest-wiring.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfae7f073019687592dd3162f1e9b9d14c0487ce94fcd7130e8fc13f0271033"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7203-lru-cache-stale-compat-comment: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7203-lru-cache-stale-compat-comment.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d180e90a1501d01d8b1ea928350edaf214b2c1b6f99bb41834513a3d4b6f0f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7204-loud-shim-member-diagnostic: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7204-loud-shim-member-diagnostic.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25b1201ecb041e8b55a5b8dafaff1861166b00913355f85d9db2449852e9daf"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7206-stale-receiver-registers: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7206-stale-receiver-registers.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"178d69861c71d50d2be8bb3f411401e8015992ef004a5becb616973a6c2e583f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7207-residual-root-store-holes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7207-residual-root-store-holes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae92f65cb965de9fdb095303b444485d745f5273829bf1604dd01026fed03ed2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7212-gc-root-dominance-gate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7212-gc-root-dominance-gate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f82de53b2f2777c9d08a5543b9c6539a1a994ffa9ac90d728afc3fe11a93f4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7214-closure-calln-stale-registers: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7214-closure-calln-stale-registers.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"179bc699c6961425e0ec79715340508c87ebe6f64a68ab5dca3f613b02d6ebaa"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7216-catch-closure-this-assign-source-roots: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7216-catch-closure-this-assign-source-roots.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce846fdbfdeec3c92780153a411b3283f2e99fedb27fc8c7dbcc69bd6dd7e347"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7219-registry-gc-unrooted-caches: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7219-registry-gc-unrooted-caches.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6870a0002f88ec08836dba8136e7d29f0c770b18c2962feeed9abe89e7070964"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7222-restore-version-high-water: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7222-restore-version-high-water.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"299c7b126e852a0472326eff9b1b2e65326f0ece49523f04fad95b845279c1ed"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7227-regexp-receiver-rooting-and-alloc-re-audit: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7227-regexp-receiver-rooting-and-alloc-re-audit.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7bbe32f271d389ca092a45b8f48d3b7d394c3783685c1ef0a0abb7808fa6d3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7228-gc-moving-witness-arm: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7228-gc-moving-witness-arm.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7c2d9ccf8c6e01e0e41a3359604d406e56848179463ee76eefe3c8af8cabbc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7229-utf16-cmp-ascii-fast-path: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7229-utf16-cmp-ascii-fast-path.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96004b6aaab75762a5eea77381c5de8697c5095037f2aaf7554afb86024a899"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7230-timer-arg-staging-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7230-timer-arg-staging-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39a3f3a1ef1f949276e08e787d221d1646f141bc34c7748eda5f1f9d7a8d701"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7233-repsel-cjs-iife-return-shape: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7233-repsel-cjs-iife-return-shape.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c6b98e00743e7f460ca4d3eee3a82c18cb869ed02f1e8ba56881f11472ce6c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7235-gc-heap-source-movability: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7235-gc-heap-source-movability.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73a22b0fb4e6efed3779a8a00d801d1223f464ce101699679720cfcc9448ba3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7237-i32-chain-double-rounding: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7237-i32-chain-double-rounding.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39eef398126c6d8b42c2f1147adcc299291af424f0bc66a27bd721cb6470b12"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7239-gc-unrooted-runtime-caches: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7239-gc-unrooted-runtime-caches.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29650c6318b87f979bc9b3a59f2d6ec3efb4550648785d77e4766901efe9704"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7240-cross-module-call-argument-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7240-cross-module-call-argument-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0737841abff1574d1adfc176bafa0f74aae111a822803c27f4a5fe476691c315"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7241-inprocess-llvm-native-construction: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7241-inprocess-llvm-native-construction.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e175a76130919d19f986227f952fe14e771dbf55ae4281da964d56b59e50b7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7242-i64-spec-exactness: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7242-i64-spec-exactness.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c9d753faa31dab21429a202a8794159c497494872f153f094a4d1561951c06"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7243-symbol-local-shadow-slot: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7243-symbol-local-shadow-slot.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6f92e0183155153a0efa386ee6f5aadac45211dc102396d6a3fe8eab62a887"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7249-realm-bootstrap-no-move-window: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7249-realm-bootstrap-no-move-window.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fabd6860213b32f9c4d655c423062ea6b2354042dc1decadd7e1f5bdaa3fe2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7250-gc-lazy-barrier-arming: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7250-gc-lazy-barrier-arming.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"195e0b53c3a3fa6fd23f4ca8483b06ff10edfc0983777677b18bf945e43441c4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7253-gc-gate-main-line-run: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7253-gc-gate-main-line-run.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85413f17686ec6871b2993a6aeac81e5f7a64141bf51316e5568f9652421659"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7256-split-large-files-lint: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7256-split-large-files-lint.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a0d397909218151281e37855aaf2e52481cd24d7fc691f1f018da9ca67981a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7263-register-dark-call-arg-witness: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7263-register-dark-call-arg-witness.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e70d0058fa1811f4ea404dd19a7a1ab5f6d73fd14c8e84120784a950177895b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7265-json-array-element-overflow-fields: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7265-json-array-element-overflow-fields.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"460f6486febbb9528b1fa4a5de61daa5a341eeb15363a8d88b2ebbcf17a553e6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7270-rest-and-same-module-call-argument-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7270-rest-and-same-module-call-argument-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9627331c97f6eb098587bf26e71a110538d0815e20eb608a425cc5a4d947065a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7273-lint-gc-store-and-addr-class-gates: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7273-lint-gc-store-and-addr-class-gates.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"002c9326e1e8c27db81472912ff0bb29f19ab0422e30625651b48131e1f19784"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7275-gc-matrix-liveness-gate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7275-gc-matrix-liveness-gate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0eb68c0287154450f51956ae2fc5865f226110f18dc82a906a70894fca6fe1a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7276-interned-string-cache-root-coverage: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7276-interned-string-cache-root-coverage.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f896f899b62de05036ab0e28a923f470ef4ced9c63c5501ee06387be255d704"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7278-barrier-arming-product-warnings: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7278-barrier-arming-product-warnings.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b6637f7731e6e661111f36b28d64d5dfcad13453e1555b2953801e125d893d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7278-dark-test-registration-gate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7278-dark-test-registration-gate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cc461d7dbf190cc00082bc8f7336fa164cfadfb3d422be414c828917202822"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7280-optional-param-and-dynamic-construct-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7280-optional-param-and-dynamic-construct-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5555bebb5de61c80df82576a62bc8beb37f4343906ca6bb1ae3acbf716bf8392"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7283-gc-test-trigger-suppression: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7283-gc-test-trigger-suppression.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b2706e0e244546870f472e3ae7ec8911484c3a0ac1a6d19b078ab8f97fd915"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7283-regenerate-public-baseline: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7283-regenerate-public-baseline.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"205714bd18c32d0ccf0f8e99f34edae244f60199826d86149cd0ad0add66d546"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7284-poll-capable-property-get-and-audit: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7284-poll-capable-property-get-and-audit.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ba8a65cb1b85fe63a43821156ddbb4a26ac603f4817d2d23b6681b3a4cfa2a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7288-path-dependent-class-field-store: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7288-path-dependent-class-field-store.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0651254188235dd95d41217ef9b174adfb1b7a4e1c2a78b6a7ae2e563cd7bf17"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7289-clarify-static-checker-scope: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7289-clarify-static-checker-scope.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff56ad35fb9d3f39980e63732f8d3f0da1e2e22768d928201d203715b5a1cd0e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7290-one-gc-plan: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7290-one-gc-plan.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"025e77a0e62fa30a69218000b2de1ad5ee154f2c1d0ebdcaed9a6e4f63d998a5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7293-one-engine-plan: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7293-one-engine-plan.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd69192197a0094db4aff87101c3b1f186481eb205a28ee4904c2fad6b400c0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7295-link-engine-tracker: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7295-link-engine-tracker.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"639731468b6d38d90f59f372eec36530436c06509d3f487987c68b97f1e90680"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7296-index-range-proof: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7296-index-range-proof.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cf49c3aa162056e4af39548461621b2a000ce1b0fa0934fdf96decb10d4dc3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7296-strip-scratch-leak: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7296-strip-scratch-leak.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42005315b8409fc90e69e0d3b7683f67a5d5ccfb4d54fcae0a3161f59e816773"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7298-dirty-page-mark-cache: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7298-dirty-page-mark-cache.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adcd18bfd1f49fb0b4bda2582a1921ea9fa83812d42329f7be458b58aedecff"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7299-gc-allocate-then-fill-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7299-gc-allocate-then-fill-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3044c80c4c7761da98ad78c3da47209491f2faae18fdf2cc1d2df5ead7e12cb3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7304-llvm-inprocess-ci-arm: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7304-llvm-inprocess-ci-arm.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14f63c8acaaa74088d66b8a0b23a6f3bc0775a0a9c364de6d84dd9e3d84d1e7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7305-invoke-eh-lowering: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7305-invoke-eh-lowering.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d019c8178c433252623463d08cb899f56ff4ec4f5bd41deb2e46ad86c25e53"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7306-lint-gates-report-independently: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7306-lint-gates-report-independently.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ce213b2e9461cf1041877fb3ac500c52079de900008cf0a2da3aa94504e1a7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7306-native-backend-invoke: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7306-native-backend-invoke.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"183b7ce2af92cdd13e1089d05824f167be89d8190d7669097f3dc3145e04fc44"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7308-owned-unwinder: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7308-owned-unwinder.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"272b60419438648dba98953831a9139652ba45385572aae3252f23ee7c9bd88c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7309-dist-profile-panic-abort: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7309-dist-profile-panic-abort.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"501daa9b44e26622713b4c0d932fa119985a35c0390b870303b48870e2e3261f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7310-native-seh-decline-and-corpus-refresh: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7310-native-seh-decline-and-corpus-refresh.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b789999cc2e47823afbe2abbac2167cb6a51da94a7b0e34d0eb10b336d9f62b6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7311-dep-scale-corpus-and-root-reload: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7311-dep-scale-corpus-and-root-reload.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18277cabf4f052c4a9c0b9a275aaabb62f6f4554d8234e8fe3bf2dfae74964d1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7312-drop-orphaned-setjmp-state: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7312-drop-orphaned-setjmp-state.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73561a8f3876f8a30cab04a4c07188f8858ece7f466e2780e9ca30d2c453c1f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7312-node-module-node26-parity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7312-node-module-node26-parity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1a51016c5188cd37bf963649fd833a516599bb20b4f1168d129e9867913d0c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7314-multi-operand-root-reload: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7314-multi-operand-root-reload.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c64f34d19d5a369726fe906c5a73ab85f2448be2715c7f9bd44e21081b35015"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7314-statepoint-native-roots: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7314-statepoint-native-roots.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1396d888943d14434ea6f6cbddd40ab7ed1ccbcf4d351a425358e2ab25949d65"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7315-auto-optimize-unwind-tables: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7315-auto-optimize-unwind-tables.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5445125b726b533315e535356ab2df4138d52df7c9252e0b66872208b120d02"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7317-plan-status-after-statepoints: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7317-plan-status-after-statepoints.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8081cfa78174ed37a27365b509d78224c9f189943154b45cb770912863bc5b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7317-seeded-gc-schedule-fuzzing: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7317-seeded-gc-schedule-fuzzing.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"397483beeda8a121586c307f354c794128ffa0c5fd553c53ac8628e557115540"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7320-loop-safepoint-purity-knob: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7320-loop-safepoint-purity-knob.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f343548da2e8fe16df07062d6b4bcbd92f6dfa8cdf7408fedcca19223753703c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7321-statepoints-aarch64-only: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7321-statepoints-aarch64-only.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e993d8bdcb4a495e5978e2d7b96c81a02941e6be609a1fd89469bb9e2e91dc81"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7322-statepoint-prerequisites: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7322-statepoint-prerequisites.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0659cb48ccc3963e70491fed35aea0b6f7a128c845ba825987a85b34963d1fdc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7324-statepoint-report-transport: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7324-statepoint-report-transport.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7952aba6b25ea279b9312c3f0241c5fab16f62ae78b35dd50bb11dc35729f4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7329-fp-offset-trailing-sub: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7329-fp-offset-trailing-sub.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85ae245c85cc8ed73ee7f7e4615300c5bcea40736c1275d829d4078a560f6c9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7330-bridge-refuses-invoke: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7330-bridge-refuses-invoke.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b02db6154e11c1e0eddab4c4df4e259eb137634f8907885ac7e0c2a29d83105"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7331-elf-stack-map-word-width: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7331-elf-stack-map-word-width.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee54fad13b724e5643909037f6e884f85d3a486d4afa45f654b8fed6894e8f7c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7331-rootless-combination-refused: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7331-rootless-combination-refused.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e97b36996a6b2a08f9ececcfceeeae943ae72689f0390d16fd39f28c8f2b69"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7337-bridge-job-probe09: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7337-bridge-job-probe09.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"924cae706e471adde3c30f8a912e4b621ab11bf7110f7daaa9d96b3221b73902"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7338-evacuation-arm-was-vacuous: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7338-evacuation-arm-was-vacuous.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df473aa204003129a13d5d15827eb874f3c7aec443651ceadf74011d7881d21e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7339-rs4gc-in-process: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7339-rs4gc-in-process.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc332e85e7721f2e8e53defd73f1cd816b7f7a9d39b6dec13551600b2b0b641"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7340-decouple-root-analysis: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7340-decouple-root-analysis.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"046138d91e47f23ae7b406762fbf45452d4a1d4d45901bfe9ad2d633060bd7a9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7342-array-store-receiver-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7342-array-store-receiver-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41aee61c27c7fc7144a706d95853894ce9be606552178977a8dfe9fadd04366"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7345-delete-statepoint-bridge: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7345-delete-statepoint-bridge.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0e5f08ea7ddcc32858c1b5275412f6d70ea2e0579214d435ac3663fd9ed7cc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7349-apple-platforms: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7349-apple-platforms.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ccede5f159ab4746c9e8fba74ab580154b025b522e4539aa36e392ad1a8954"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7350-statepoints-x86-64: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7350-statepoints-x86-64.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cc4c60d97587076e904f1e3ce00a2f220e0522b1e8a4a9960a441a93acd9b6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7352-windows-groundwork: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7352-windows-groundwork.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c1dfecdc647f237ef6e22a7f82531a1db527f5774aff07b17c8ffbce18e062"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7353-apple-cpu-baseline: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7353-apple-cpu-baseline.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e4e3fdf21a39431de2395e19d527ad9dafb08932c672afcc7f1a76ae25527b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7355-windows-gc-walker: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7355-windows-gc-walker.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2732f4e2a89c839329b5d6e066ab4740661ea71d077622c0d16920f75f62f382"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7358-string-borrow-across-alloc: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7358-string-borrow-across-alloc.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bb6522aa0baf30d195fdb3ccb35970cd8e45dfce61b92eb7ca7eed69c1f2f5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7359-deep-stack-collect-probe: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7359-deep-stack-collect-probe.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b0d56424f463e2adb10d1b4951104887ea7d4ea52d7cf1314f6c5e80266653"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7362-statepoint-report-dead-counters: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7362-statepoint-report-dead-counters.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73791e2ae8cf0378d04df25871bd0031631e35dd6b388a365801391390f895e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7364-apple-target-matrix: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7364-apple-target-matrix.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"968d9a711f75eae944e7408a055e7656880df7ab77d5c2e4c7d7e4ac56fa1423"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7366-statepoints-default: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7366-statepoints-default.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6857ece3bce70673f7184d88255347a1a25c4c646e2ee790604f217176dbb3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7368-statepoint-report-count-from-map: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7368-statepoint-report-count-from-map.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77391218039522e11fa64bb327d4ec1562e9c3a6cfd103f39994fa140bdc6d0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7369-gc-leaf-register-global-root: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7369-gc-leaf-register-global-root.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"354f582f25d4f2d008ab32089bc631f3062c762ecb87ee5918e6bf08f7515763"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7373-json-parse-stale-input: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7373-json-parse-stale-input.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b46d47d032ca7f779a906fd1e7daf315034096a893522d4c04381e6b1c54e5c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7374-regexp-flags-stale-store: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7374-regexp-flags-stale-store.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"315bfd55816201d2ba2cb25c8a910c42444cf02bc25eced9ecc2d57183f97781"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7375-await-promise-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7375-await-promise-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"305db2fff8f8a47c89b1514458c67655db6ee980be6a0631edf832d91bb6852c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7376-symbol-description-stale: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7376-symbol-description-stale.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a3050787843f3eb244984daa5611d4f8a3c8767be660e9afe8f3598de9e0d5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7377-nursery-cap-and-scavenge-default: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7377-nursery-cap-and-scavenge-default.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ae867aef669e59eaf4ceb876be2fb3f79ad8eef9912d925c6cee450679d039"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7379-assign-regexp-source: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7379-assign-regexp-source.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"341071a17316f000d679780db10869f970e69b2a8d1a9da4735cd11b02757a49"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7379-release-watchos-visionos: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7379-release-watchos-visionos.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"425f83154e847ff2cbf931be4465b8813cc85253ad6603ba90f9923e65e4adfd"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7381-mirror-static-write-refresh: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7381-mirror-static-write-refresh.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa2403dbda1916a912cae4bb0c397bb8def77b703ec4ea4730dd63ab1ab34a0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7382-node-vm-node26-parity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7382-node-vm-node26-parity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ffbe8760c950b46605a2010be1895fe0b2cd21f5bba1af2d283d5181043c89"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7383-mirror-remaining-sites: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7383-mirror-remaining-sites.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e9bf049598751c9d288416357596ecf817f6423773968ffbd10992445f6353"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7384-rs4gc-llvm22-prefix: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7384-rs4gc-llvm22-prefix.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef383a9ca02714131f45965ae1677c9582570ce6d5cc37771e32e7288ce554a2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7385-size-arm-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7385-size-arm-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"487e4d04dee1774eec6897836834c08366c57cff102a8b5c5b77aa1e91206ee9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7388-setup-llvm22-clang: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7388-setup-llvm22-clang.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d29a9158fe899e64cf072856284be6c9d50a5226471d54d9fd8c19781bbc9c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7389-raw-handle-across: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7389-raw-handle-across.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a818545261859409cc6ce886c1b54ce4f2454e846d29d17318b61de0085d28f1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7390-gcmap-elf-symbol-assignment: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7390-gcmap-elf-symbol-assignment.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3600a5402259669a2a389faa466d1a817420236ea4b7ef51ce96cfdafb4e8f13"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7391-new-construct-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7391-new-construct-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25acb4fb18ba7a1197e84ee5921c0fc80eb3fdde1216cd5779f99ced580b92f3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7393-gc-native-roots-concurrency: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7393-gc-native-roots-concurrency.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e196a0c62008f6ead31b33c189fb4a6593d77979aa22e1c64f6d2642a907f81"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7397-plan-update: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7397-plan-update.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0b83d5f6af6c23c2380966dedfde194c61882ffbc1045dcb192145af7901c0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7398-aarch64-prologue-shift12: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7398-aarch64-prologue-shift12.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7dc0e00395d609a975498658f88822ab8bcfcb37e0fd6cb02794ce8dce474c0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7400-native-root-walkers-aarch64: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7400-native-root-walkers-aarch64.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21410c43504182f06dae253b1d67313cb6860b19199e8e959f81543040ab0b58"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7401-field-set-file-size: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7401-field-set-file-size.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7254be742c90d38b5855343471926260794873cf5150423dc4a2bc414ece25"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7402-split-field-set-by-name: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7402-split-field-set-by-name.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a9d7427c67bd5fb88ae4052613147916b4aa3fd06dd23ab3700e771c3bd037"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7405-plan-speed-final: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7405-plan-speed-final.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5947129928b4ad71e9deb8194e265ce78d0cc0f69a4ff48e0c6d8b94d66b551"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7416-i64-integer-locals: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7416-i64-integer-locals.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2be61cdf661c240c840321d484692dc7cde40b44a3b35be2be801926b91056c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7418-windows-xml2s-stub: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7418-windows-xml2s-stub.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae67b275aba3369e00a238126fa8d48313466e418444eb8010d48fe5a7d70c44"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7419-windows-runtime-suite-green: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7419-windows-runtime-suite-green.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fa8e29bfac700469b7b17cef5c6d2525ae9ad37d30d4f07ee49b8c9cf31f61"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7420-linker-verbose-breadcrumb: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7420-linker-verbose-breadcrumb.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9061ced8b2d739081448c806fcfb5de74138c68a420a28909c5b229115130276"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7421-array-store-guard-inline: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7421-array-store-guard-inline.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ff59f46930a50e5a1a1fde4e8ad4a8db089f820ed2a2504d827bd4d7790e82"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7422-buffer-global-dispatch-arming: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7422-buffer-global-dispatch-arming.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76bc4368babb8fe96f51335f7c43d8c9789b440249fc4a286d8fd7422d690cc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7424-proxy-array-mutators-and-receiverless-thunks: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7424-proxy-array-mutators-and-receiverless-thunks.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8612abad0786f2a0da0bbd8dd437c15d8337cdf0702fcbb3ffff55e93f601816"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7425-class-field-loop-guard-hoist: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7425-class-field-loop-guard-hoist.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63e5af6e5a8834f5b9536522247c6c279c27e41be11dc02f24eeaffb85b0e44"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7427-bigint-tolocalestring-intl-gate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7427-bigint-tolocalestring-intl-gate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"860943fc7994c31470520376c5f24150cda5c71ca7580f67c8553c8f455ceb2a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7430-class-typed-nullish-field-read: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7430-class-typed-nullish-field-read.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc302475da38f9ec96f601ad845a9296f4aced25982ea0e8de9351875a1adacb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7431-regex-literal-non-ascii: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7431-regex-literal-non-ascii.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69051fcc7a29d1fdbe31bbb8637774a8c06d6c1f5238c9d5c3b4f139b7c4ff5d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7432-adaptive-tenuring-young-cap: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7432-adaptive-tenuring-young-cap.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4897aaf1d13cdc30fa2c2a4333163409de6995a4c2decfedc47b0baad41bf9d6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7433-gate-node-test: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7433-gate-node-test.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30c3da417f7edaa41688829e112ff427cdc7d60d0cae9361219823e916723fb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7434-read-pic-gc-epoch: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7434-read-pic-gc-epoch.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81af8196760bafc8039650d7b9526367660ad8abf634402cb75b22892e73fc68"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7435-gate-url-shape-probes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7435-gate-url-shape-probes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96f43398deca02e96d8ee609cf4050dc92a0b17953b8aa62df660ca649ae1aa"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7436-parity-streaming-resume: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7436-parity-streaming-resume.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b528a38d98ea8c185f0150baec92e16c54e0354691638b02fc3cbef4fbaa95"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7439-i32-guard-neg-zero: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7439-i32-guard-neg-zero.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f252fccabf0bef5c88b1c11340d8150ea87705759d869cb0420404fa148a23"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7440-submod-bucket-dead-code: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7440-submod-bucket-dead-code.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc9faa3b6ebd922a9e49953cb8962e2966267c03e2f4b3aaf99b7e4c6c9a80a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7441-unforgeable-clone-suffixes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7441-unforgeable-clone-suffixes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a0e1415f88541d06cc3e7a1e851157d02f7ec4dfc8c151b87aac30b6f37dba"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7442-fmt-after-7434: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7442-fmt-after-7434.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c919fd3c6a5ac29d164fdf70a4db406241d9c4ac8be30c3500d92ca0af46025"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7443-oldgen-hole-free-list: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7443-oldgen-hole-free-list.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc66189fb3607029565685bfd212cb22792f64e9b4f31c1d0f1ccd3bd035243b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7445-parallel-test-order-independence: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7445-parallel-test-order-independence.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b640b43c96ed937345275fc938d8d8011ee62a3da676bde1484c9f806c4747"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7447-json-subnormal-deref: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7447-json-subnormal-deref.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e54ad972c561a06ee188aad111d1dbb556a1bf3bfeebe7809b0081cb482505c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7449-recycled-block-pool: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7449-recycled-block-pool.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f2225e7fd7c9df5e088197894d112140966628ae72a4239a80dabcfcb743b8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7451-string-reflective-arg-coercion: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7451-string-reflective-arg-coercion.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c9eb44df998ec08115fa34765d4ce952cacb66a247981757c6008f57905a68"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7452-gc-root-dominance-corpus: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7452-gc-root-dominance-corpus.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c693f9d28b39229dd3625bb78015e12edf867526a10007af087dcfd36e5875b5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7453-url-ctor-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7453-url-ctor-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa26433910d1a116cc31716e458b53a35704431d2925579648f5268ca27e270e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7454-dominance-url-coerce-source: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7454-dominance-url-coerce-source.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a4e13f6b9842d3f7e0a3e7de4bd2fa6f5c9e64ab76f1b7538f4b08f58d299e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7455-raw-handle-debt: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7455-raw-handle-debt.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a40f55c2ce003bdf7d6cc2645a53008c7b1ff4bb6ee4428f966bd1502a910fb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7456-mimalloc-os-tag-pre-main: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7456-mimalloc-os-tag-pre-main.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3291241a35336bd645a698954c7534b4c3a7526ce6afc3a78f25a58ed9c873"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7457-per-module-raw-handle-ceilings: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7457-per-module-raw-handle-ceilings.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"665b4e6d8f5bdec2dc68815a1b065570a581d774cfe20055af5d56e3830afff2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7458-clean-three-modules: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7458-clean-three-modules.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"826df0c7736be85f76440c7f3c24007c76dbd7175dd17a7cc4e2c09ba48a0fc7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7460-dep-corpus-vacuous: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7460-dep-corpus-vacuous.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"858d2a4c9f218e92882bb7d52ef4e327a8dbb89c8b068a484df783304fdc61d2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7461-layer1-migrate-urlnew: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7461-layer1-migrate-urlnew.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0357ac6f7e1d4e17dfa231a196523ffb7b2b85562555a2cd0bae8a0ecebd928"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7462-searchparams-receiver-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7462-searchparams-receiver-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0946dbabf907f048cf4958ad2084a324fe0675ee41492b0acfbc27674d20dfe2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7463-searchparams-third-operand: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7463-searchparams-third-operand.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6412bc266e0f51740ce3b41cec2612bb32f2957573ea5e04f5ce0eb7c46e432"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7464-url-setters-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7464-url-setters-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"182eddca815df21da0e40e4b4c15800246dc8eabd8d6a2ce7dddbc56f15c26fa"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7465-child-proc-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7465-child-proc-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c70fe8cccc7350890d1c1cb16ac8ea4345fe2d3cf68b1ee05f075db0c674ce"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7466-engine-plan-update: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7466-engine-plan-update.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cc1a1a6a64bd22e31f1ecc13030d8e9abc134e5038b305aa420a9aedeced07"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7467-object-enumeration-order: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7467-object-enumeration-order.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1058a0f48eb41166a379d948d471dd3e240997949349eeaf92f19c4f8c8155f4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7470-boxed-wrapper-array-fold: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7470-boxed-wrapper-array-fold.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efda92a17f3f59cf3d679d331e5a312c0e1e21cf8b3091f186b6af84e5468d1d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7471-borrowed-array-builtin-identity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7471-borrowed-array-builtin-identity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b26eef21f33233eab25e4eb214228c4b7a998a055947327e9bc2a3e0b720b9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7473-stringify-key-admission: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7473-stringify-key-admission.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"017660bb6939f9ddf8db27eb7a1b84e06ea315e9956533082160be550159b783"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7474-hot-tls-alloc-path: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7474-hot-tls-alloc-path.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5f1d6dacb61aa5ca90190344d95126329fdeb691f32783c7c3cb3c88435dbf"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7479-plan-step7-json: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7479-plan-step7-json.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1bd62a3fbbbd05f0f83c6a0d3cb8ff48abbec6a67275cdd0ef2249bd5eb00d4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7482-plan-ticket-sync: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7482-plan-ticket-sync.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b36ffb3f1b58d5ce2f4a634c3935da97e60f176a1d018876f45694b6d38563"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7483-directparser-float-parity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7483-directparser-float-parity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e779dc5fae711a8ec13a19886ef3d4e9dd48c1ce8a094f75370ab3ea52934b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7484-plan-statusquo-split: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7484-plan-statusquo-split.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8522732197a09143cbf1134efb841ccc2f8da12f47ae7c7db827c30bbc0fa934"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7485-repsel-4b-field-store-elision: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7485-repsel-4b-field-store-elision.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9e3b509c330890e0aee54377dbd39aa59d49d26335c1059778401c06950a7f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7486-dead-store-elision: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7486-dead-store-elision.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0067c6ad2b9202c3e0286dcede9999e10820b8e1ece1f6cf2f2596376ec86eea"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7487-temp-root-allocas: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7487-temp-root-allocas.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd9cf7ca743c87841fd509fe40d5c90403447d10bf8346254a635afc8d5bdd6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7488-restore-raw-handle-gates: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7488-restore-raw-handle-gates.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd669ce50a1b788d80184e5aea0e79807fd8fc8ffc3546d32b026504cee62c5d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7489-engine-plan-4b-status: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7489-engine-plan-4b-status.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c867bae3519c0bf0712ce37ea412de109b18d96d55b7998d686fb31d217a83"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7492-typed-feedback-test-isolation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7492-typed-feedback-test-isolation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2fe01621bfc53f250da9fb97ff308de6b58c1ce33378358de36b84b1b1102d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7495-auto-opt-archive: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7495-auto-opt-archive.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d71dd562c0d60e58435053a56f4932af634ed71a05fbb5f132b071857c2dbda"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7496-element-shape-invariant: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7496-element-shape-invariant.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d76be4f1ce169649dc9a13457e22c95d87155f2b192ff5690cf872b05dfc3e8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7499-json-reparse-materialize: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7499-json-reparse-materialize.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3d7f546c85b1949cd9e37765674336f9da62a3770b163c6938e1c40da7e897"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7501-layout-declared-at-alloc: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7501-layout-declared-at-alloc.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2a6032b9a3a2a7751fa7f4abf0b738bcd440d932fe1f2156bc99832211bd96"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7509-integration-suites-native-roots: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7509-integration-suites-native-roots.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad6e91f950f27a1f0077046848e0310c9ba3da267ecfd3b87d2c1e475a0c84b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7514-engine-plan-allocation-row: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7514-engine-plan-allocation-row.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41705f5b3adf19beebae363a0ac9f4ba23e0fc00bfbf576bafe8e1a6b327f45f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7515-class-ctor-dead-field-init: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7515-class-ctor-dead-field-init.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed665682aea0a114bde4744e50aaeb2c0ca1d9066aae1085c5bc5637fe215ef"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7516-promise-all-chains: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7516-promise-all-chains.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"964441eefdaac6b752ec3ee0ab094d131be2caacc377581d9b104859b9fbb335"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7517-restore-claude-md: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7517-restore-claude-md.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6916ef2219b2f53c3c85767557a05e5651826b005309529668e836a157341d20"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7519-gc-store-site-marker: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7519-gc-store-site-marker.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a171ebbc479309770aa6a66586f8a29a08047901e2555dbfeb8fbe63576f284"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7520-eventtarget-subclass: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7520-eventtarget-subclass.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"295e34a1c25bc19ba214e36aa1a854ef17d4de3980b748c099a96878962df396"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7525-layout-tables-empty-fast-path: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7525-layout-tables-empty-fast-path.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb06ebb0e213d8bfce06748b0731058d5e1909609d189261ca1aa4fbad40caa7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7527-spread-symbol-iterator-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7527-spread-symbol-iterator-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef1f91cdaf96a415a6c060f2307db91a2dffe03f47d35b22a37c33ce4598677"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7528-native-call-receiver-reread: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7528-native-call-receiver-reread.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7b02cfe3560327a7b2bb25d3a22cedfee0d442ddfb96d995516b6446aed6f9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7529-async-result-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7529-async-result-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd9d7a05b7b31ab7ef2594e068630e95f64a58c752975de665d75fce1af38a2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7530-fetch-handle-band-deref: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7530-fetch-handle-band-deref.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"527a190321fc652d0336119b3171aeab45b2795b9084e69627b3d00232adfd8a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7532-typed-shape-declared-at-allocation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7532-typed-shape-declared-at-allocation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e155036d65999a3bf0acb8307d32f2c01875af3858c87e3070fc02318f3247b5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7534-plan-baseline-1299: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7534-plan-baseline-1299.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f690f1d1e5d90f1323bf5441d6ec73a8d94a0386b233012c893f8c2d510571"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7535-construction-shape-install: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7535-construction-shape-install.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffeec8099244a0a88bd2c715e875b9bb8ef4cad3169d9b772a67989cacf942f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7536-barrier-elision: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7536-barrier-elision.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7facfb85b28881a631b6f1d972add0186ddf40eff686b489574357c67dd921"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7537-early-batch-flip: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7537-early-batch-flip.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa308f9872afbe57efe8f86c724f2131f996bd43f61befdb14c0873131abb94"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7539-json-tape-side-allocation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7539-json-tape-side-allocation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad024e2b144577edea8b23f6842f3db467f4b6f42f5fd88c0638b48b0aa0935b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7540-dense-array-spread-fast-path: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7540-dense-array-spread-fast-path.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a9386531d6c21b74ce1dfc2a197e9d872637e992da6875f4d8158d5a110744"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7540-gc-root-dominance-rotted-probe: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7540-gc-root-dominance-rotted-probe.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a9c4a272ea037a094d2d28caed818b4dd07df39814d316ac79c09e439f6b30"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7545-layout-rs-file-size: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7545-layout-rs-file-size.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ce1084aaea3b0791f3191a906e96dd4467f2f0a4b74de60489fbd5cfc5a182"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7546-tape-overflow-key-loss: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7546-tape-overflow-key-loss.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed429457104b7e8ff786dc201a52cf163ba46862967777deb3a186bc7f64b099"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7549-cache-oldgen-liveness-assertion: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7549-cache-oldgen-liveness-assertion.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1878cd16d46a6dc7118e8f6e9328712446fe433db4422c648050aae670b088e1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7550-anon-shape-numeric-field-types: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7550-anon-shape-numeric-field-types.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c289695901dadacb9807f994634d80a907863ce2777583f1c7edcb8ec8df6b02"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7551-array-forwarding-stub-object-ops: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7551-array-forwarding-stub-object-ops.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ee363d670d0c67677e9c1dbf0c2dd819aa5636787bb140d34c1595da9237b8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7552-for-init-local-types: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7552-for-init-local-types.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb8f6bac1607fc71ebd159591299effe25f1f3358b58676b5f9f04e63f87d76"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7555-rkyv-audit-ignore: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7555-rkyv-audit-ignore.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"543d382cbc7ff052ba189a21676940ab061baabb19acac0c83a3c607d079e15d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7557-gc-ratchet-per-probe-gating: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7557-gc-ratchet-per-probe-gating.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91111c6664f8c2c481e322148e7ed39046463c1f089754abace041c42be8b8f4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7560-plan-tls-lever: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7560-plan-tls-lever.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8815b0c769a66f648306bebc9adfd9608aa9522e534379ccec588431685d5ef0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7561-map-view-for-of: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7561-map-view-for-of.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e597b3fa8bb9ef08dab39b9f15e4ea00396e52761154e8e67b960ef40f049159"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7565-tls-direct-tsd: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7565-tls-direct-tsd.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"694177acc6d921c127bd729d68c27f2592410a9107a2042a6fa5c1b1c71f8f89"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7566-inline-new-in-loops: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7566-inline-new-in-loops.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a768364a731776ecc8893153ab6b4f77b02617b57037ab2a99fea31e0cc2fefe"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7567-iterator-no-silent-truncation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7567-iterator-no-silent-truncation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fece91ddc3fb6f7ccf30905e5faba1e5eee5eaf00ee7729f47260e95a2fda72f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7568-macos-gap-snapshot-fallback: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7568-macos-gap-snapshot-fallback.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa3a40e35c46615e818304e73a6b79a64d860783678d7cd208218b0ec49655d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7569-array-iterator-class-id-confusion: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7569-array-iterator-class-id-confusion.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8be26711b43d7f3df6862f4f68f4fe89139c601fcdc8f5e7a2c02667aaf415"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7571-gc-ratchet-classify-retention: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7571-gc-ratchet-classify-retention.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4edf76b5cb4972dd4e0e16b92b5b7c2075f877c98a354dcd9c876d42749e2d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7572-plan-resync-fragment-numbers: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7572-plan-resync-fragment-numbers.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76464265996b307142f5b8fd1f61299651b62284bc5ba13f68bc62e0d67de231"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7573-map-set-declared-base-type-receiver: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7573-map-set-declared-base-type-receiver.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f3ad582755b25096a4b40077e718fe52700253d13be618b9674e9f2daaa6a4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7579-iter-result-one-allocation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7579-iter-result-one-allocation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bac1d2cffeb7b12bb97697e48503c87d7a5b4c36239cf4f9816ac32fe8a215d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7580-prealloc-boxes-module-global: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7580-prealloc-boxes-module-global.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d536183b6b0a0b3f548e907a02c6c3898f4a767383bea242706c8c3920f8c6d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7581-plan-profile-resync: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7581-plan-profile-resync.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6003406203af0e99ee09e364fbb09a3adf6f9072366d64e469f6af88dc6f330e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7583-iterator-helpers-class-id-collision: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7583-iterator-helpers-class-id-collision.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a69c15060d7d32860115907b0eec740ecd95129685b6324358ae317dc25032"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7584-generator-attach-prototype-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7584-generator-attach-prototype-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e20feefcf70e1c54e0af3d452a33fd6ae9ca389785df2add75d60a75f937c1a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7585-addr-class-mark-shape-shared: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7585-addr-class-mark-shape-shared.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eefa39d69201d507a4cc291dc60e757a732241b5d1bb5f5138b4977d7789f35"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7586-typed-shape-install-constant-folding: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7586-typed-shape-install-constant-folding.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21007b3e3de87ab2cf0e058312fd2262c660690d6dcb58515f110b3fe3881fb9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7588-retract-unsound-typed-shape-remedy: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7588-retract-unsound-typed-shape-remedy.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e79e83fcc9b321c0d5c9aa4063b182496a80734eec87f6af2a86192b34c8429"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7589-class-id-collision-gate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7589-class-id-collision-gate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c914e961dfe5a272280e86615b9879bb46503ecc14d6e7ac8ab1040c7643ec"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7591-discard-expr-value-leak: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7591-discard-expr-value-leak.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"437d7a938d8b1b387306d36f429fb93684937a1c56a75f13970a44bb3ddf0d02"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7593-public-baseline-v0-5-1335: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7593-public-baseline-v0-5-1335.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28707f251cf7f85a9dfe74103290bfdc033bce2318000382923f5ff74b69ae15"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7594-survivor-promotion-handoff-livelock: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7594-survivor-promotion-handoff-livelock.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee73f6c1ddbf6da6e1b99a91779f0f64d58522bfcc0f7c42264de5b10a906059"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7596-live-proportional-gc-budgets: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7596-live-proportional-gc-budgets.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b81443da7fa870c3f3e9fd5b204091f5587bfb5c412bf8c7a4e6443da715f94"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7599-known-failures-ratchet: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7599-known-failures-ratchet.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c496c558ea667b381eb1936c07c1a309c4a05a10fe0bbe732dbaeb08e4ad7ca9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7600-discarded-push-length-elision: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7600-discarded-push-length-elision.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3e4064df17607f02e755ec43548b3b67b61baa5430980e1243ca3efec7b994"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7601-inline-char-code-at: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7601-inline-char-code-at.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"414bc525df88bd296596293df13cd24c401ca70e86df20ba9d89913334baad84"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7602-array-push-barrier-parent-gate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7602-array-push-barrier-parent-gate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4fde5f8105c2d2a97f9953539fc938010431e1980937eb6abdb2ab1da62064a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7603-array-subclass-declared-base-type: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7603-array-subclass-declared-base-type.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c48a47bbc0c05e1960abb42a37090b38676fec488a7bcf4cf3fdd7714f956b4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7605-array-subclass-inherited-statics: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7605-array-subclass-inherited-statics.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a3bb85ce040839314c110ee4a06b733f1fb6642c1eddc9b3cb0f540f015cd4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7607-plan-sync-aug8: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7607-plan-sync-aug8.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f57a7eb01967e34ff7a42ab64c66f369300a67415c203ee947027de6d6b00eb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7608-element-shape-revocation-matrix: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7608-element-shape-revocation-matrix.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc2d75d963fed910ee5df63d8cfc2340a4a895fb19d80db25d38ca998635d96"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7609-gc-ratchet-fail-open-and-repin: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7609-gc-ratchet-fail-open-and-repin.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4664334582a3a430e23c1ca6131c88130e957e0b0b6cb55ef8e56ff8e448055f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7612-element-shape-loop-clone: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7612-element-shape-loop-clone.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26c14848d6b03cf05b1ef2acdc68b9a912c329a6ce8f7cb87779b4d579d7a09"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7613-promote-on-first-copy: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7613-promote-on-first-copy.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f6ba09adb9a43946c85666de3d44565056ad01a307f6cec3163db87ce68e06"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7614-plan-close-aug8: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7614-plan-close-aug8.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e365154ac4ad4b34cbc86368814341eeaea42111a40bac0330787c90d5d4283"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7617-layer1-url-main-migration: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7617-layer1-url-main-migration.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1512c1c0388d882f1b4709b755abdaf5bd3e30e0a59fb88e2b5284ce6691d64a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7618-layer1-slice1-array-method-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7618-layer1-slice1-array-method-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11182253d4f30e0411c8341b50c910c8320c6bca70cc9a2752aa165cde9bffba"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7620-layer1-slice1b-arrays-finds-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7620-layer1-slice1b-arrays-finds-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb670435ae74d19b3c9642f2f825b629a0191ea5c45adaa9f859b07bec921e55"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7624-defer-old-page-registration: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7624-defer-old-page-registration.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"579ff09bcef4b072edde4b1a306a1cedb6e67d64edf90b91bc26150b31ea1b52"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7625-codegen-determinism: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7625-codegen-determinism.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c32cec62819fdee94b37e5c1bd97513964c28e739b299d93a909475ffb8705"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7626-path-sso-operands: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7626-path-sso-operands.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ceb7ccbb74a838c93b736d0c9237ade74a55cfcd22a46511023c0690c1fe26b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7627-layer1-slice2-instance-collections-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7627-layer1-slice2-instance-collections-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c389fdad78e87b0b7138b08bc6f863038fb0a06babcd14ee5dd8a9c12adb5e64"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7629-shared-tokio-unification: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7629-shared-tokio-unification.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7861aa4dc4623a7941eab91e1991896d360af106890a2f7c1e6a5da5ea971e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7631-generic-class-instanceof: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7631-generic-class-instanceof.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3c5a103dfae2cc2088e7b3b3a19e87cfea71e36358f15da4a7fd3d242890ee"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7633-json-materialiser-layout-deferred: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7633-json-materialiser-layout-deferred.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3038a16dd4e6e203751d771066c701f547c5c99a0e716aec1d49bd439ce79db"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7636-layer1-slice3-literal-accumulators: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7636-layer1-slice3-literal-accumulators.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d13a5c70cff5e6cf83204a9fa80cdea123d7554daa45b3de4b10d5306e6d5dd"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7641-baseline-mini-regeneration: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7641-baseline-mini-regeneration.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e06ce48c817fad6917c9890c4421439ba3dd17855b2c4d3e7fa981754cfdee3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7642-layer1-slice4-computed-reads-writes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7642-layer1-slice4-computed-reads-writes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e62fc13a42ccffcb79e039d3b8257492f5bd2410698252468f176eed9d80b9f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7643-pointer-free-misdeclaration-detectable: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7643-pointer-free-misdeclaration-detectable.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd9904671d7e82bfd0103f41a4b9edc0a92943f458a2a6e14a95133bf2dcbf2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7644-pointer-free-hazard-probe: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7644-pointer-free-hazard-probe.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e5850320fa544e68c6fd33f4778a582bb493b54c9a7114a50ac0a2318f7202"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7646-gc-census-runs-membership: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7646-gc-census-runs-membership.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf5553a2588fbd9d6a89ccdfe7d3931a2a480529b53bf11d6561147390d9bc5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7648-layer1-slice5-lower-call: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7648-layer1-slice5-lower-call.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58bf94c08314f5bed3ecefd9d52b862ce6f3228b1f345a67b184b595df4856c6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7650-copying-minor-preflight-skip: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7650-copying-minor-preflight-skip.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dcf9c68a4a65149e954cf9077e99bfef073486ef52c64bf4e3016fcbfe2686c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7651-layer1-slice6-rooted-group: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7651-layer1-slice6-rooted-group.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f432a05f5c35886fd9fbc62f751f93a2a60566f3966a3001dd1f52be6bb8e8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7653-native-root-coverage: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7653-native-root-coverage.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c181d826ecaafa2a80e15dbcd30b7dd0132bcaa79429f04cb4c74de1c77e96cf"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7654-plan-close-7478-json-tape-scan: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7654-plan-close-7478-json-tape-scan.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96ed4028bf80bdde268e3a0e94f2bc87065ac548f6238125655a347a6e10a3c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7655-pin-object-ext-link: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7655-pin-object-ext-link.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e084feb12ed22c413bf054d13e5d5bea33de599061abf1be16aad599ce361eb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7657-gc-explicit-collect-precise-roots: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7657-gc-explicit-collect-precise-roots.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfa12a397c73ef1bd6d6d698e67f5cf62008198c4b89d91d744516553ba18c4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7660-element-shape-loop-growth-forwarding: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7660-element-shape-loop-growth-forwarding.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b04674e705ea8ad7b3c0dde47eaab63e6e1a3e5b49df28c55b33bae176360ad"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7662-layer1-slice7-expr-modules: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7662-layer1-slice7-expr-modules.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"785220e23e08e75cf983e7f0f0067b429bcb807bbff5f5c07f9b9371b206a39b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7663-statepoint-root-dominance-checker: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7663-statepoint-root-dominance-checker.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13b16c6fd67816c5313a839f25f9639678447894c2cee4420b31c528367ceeb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7665-test-isolation-global-sinks: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7665-test-isolation-global-sinks.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d3f75fea853fd814eb93c702643c8a97f6ff4e6866b6a853b41baa3ffb2d8e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7666-gc-ratchet-large-eden-arm-and-7056-rss-rederivation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7666-gc-ratchet-large-eden-arm-and-7056-rss-rederivation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabc0bef17ca984f494d67c5ef3c1e270c1e35a46b8398972e01dd36f5025d8b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7667-native-lowering-unrooted-hazards: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7667-native-lowering-unrooted-hazards.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5b348ba6853b9ea6bdfbbfefcc605f01d892bd61bac680b342417c376660e0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7667-ratchet-rebase-stable-provenance: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7667-ratchet-rebase-stable-provenance.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05af80b589610670b350add12bc7c7593e608231fdefc209183a8835929569e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7669-repsel-object-literal-element-shape: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7669-repsel-object-literal-element-shape.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7bbdf88a908f6720d3d259c4ccbd8e7feee314ce2e3c98f4bd7c5064c3990d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7670-layer1-rooting-slice8-terminal-condition: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7670-layer1-rooting-slice8-terminal-condition.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cfca7514305c709f454fe89ad63dbad2747658291eba44a6190899f1136803"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7671-stream-static-methods-side-table-race: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7671-stream-static-methods-side-table-race.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c40ed9a63f30c07e2942d2041a9167069866860a6988b0e12da422276a83b16"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7674-per-test-global-sinks: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7674-per-test-global-sinks.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1165df8e18e1d24d820ec57b22b7ca9fc39cfeebc51764e8c72d7c068f93afba"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7675-stale-codegen-test-contract: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7675-stale-codegen-test-contract.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50d40a10683479c3b795c59b2dca46eba7dee6d1d296c079e1a8b57d7da877e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7676-gc-matrix-collect-liveness: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7676-gc-matrix-collect-liveness.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abb1dc2cc341c61378ea04cb4ce9de71572348b278932d575a22e2c14adbbd1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7679-poll-reach-audit: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7679-poll-reach-audit.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f31d6be565a8e9baaa4561359f36695e59344e21fe6fcf3075176ee2370899e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7681-alloca-type-prefix-match: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7681-alloca-type-prefix-match.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8cc70007065191538e972ac58c68a2b069c2e569d15300d2544fa819d58ae8f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: an ALLOCATING loop, compiled and run with PERRY_GC_MOVING_LOOP_POLLS=1: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7684-evacuation-knob-liveness.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"092979c50ea221ddafc93ff6a8d6705ca73a0aee4df4978f38d2ac04739667c5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7686-pointer-class-field-slot-stores: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7686-pointer-class-field-slot-stores.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcea3c558a76fe428d30fea8a3e8e34450cbfc6ef4676ebb327622be55de74e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7687-alloc-point-collections-must-not-move: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7687-alloc-point-collections-must-not-move.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85cbc375bc483459ee19892fa429b0e2323dd76f2e3520b5e3b2c400e2f51108"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7690-polls-and-nursery-cap: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7690-polls-and-nursery-cap.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5055508afe9355bdf75fb1922b019d017e3aaa13123a4440a77c036f51c143ac"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7691-static-method-value-name-collision: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7691-static-method-value-name-collision.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a7f6a8d27805b1a0a3e8ca1e186561bba96d9e7bc050facd54e018ce54e992"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7693-readdir-options-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7693-readdir-options-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"208ac83f61d1f1ae1289c7c3094936493af44fa0073d370595b5d3b8ddd48aa5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7695-runtime-root-holder-gate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7695-runtime-root-holder-gate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"460a8e3e9611a1fb3ca16b8d8a2dceff305f302d98ee606238e56ccb842fdd87"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7696-spread-accumulator-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7696-spread-accumulator-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd41924a9fd628b5817640a5d3737e4236b2b042b6df26fb526eeae7a829784"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7697-symbol-description-offheap: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7697-symbol-description-offheap.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04411181f6fe2d65898a7bf2c3e22f6cd8b9f56107ed863f37c58bb8e244af0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7698-conforming-class-field-layout-note: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7698-conforming-class-field-layout-note.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7759b3dc850c15340198161892f2fcafa56dd87d2f0391e6d6c16e8f827cdb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7698-raw-handle-debt-after-7694: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7698-raw-handle-debt-after-7694.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38682cd6ae62634a9e288c4a10caaf26d987867ae9dd057f3629506fc43d3487"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7699-member-update-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7699-member-update-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff758efa637a71eb5e1c41693eabc5506fdbbae78e15819a8d8a993187cd85d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7699-new-and-computed-key-windows: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7699-new-and-computed-key-windows.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eacbc4928fcc9cd5c636b5bf673bfb8d274396faa1077868cffb446cf16a4027"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7699-push-receiver-order: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7699-push-receiver-order.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe6c863797f16cc9a84685e6e4270513197391778687f66a2d3a04e43ac2304"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7699-uint8array-get-pointer-classification: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7699-uint8array-get-pointer-classification.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80a5c3f839f30e72a976fa249a07eac4435b36c53fb143d9dad307d39de1eeb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7701-element-shape-loop-applicability: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7701-element-shape-loop-applicability.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e3560f27a970f3073a5c60322e94222649a0c0239c294de1547345efe1263e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7702-typed-feedback-recording-emission-gate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7702-typed-feedback-recording-emission-gate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56842d0a121a20e4990d5d2597a26f6c76767dfafd9f0679c1e36d7de0e116a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7704-raw-handle-debt-after-7693: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7704-raw-handle-debt-after-7693.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb4cdb3671acd6ee4cd1f2658094f6187734a716eff434b62e6e6d35a5e6d5c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7706-corpus-skip-ratchet: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7706-corpus-skip-ratchet.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3d9ed96d80332429070d79686214a5ac94ef0554171533b0f92e9bdfad58da"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7709-addr-class-bands: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7709-addr-class-bands.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b162678b247d20a28fc42c3851c86c522c7eb6f54c4fd963da23f3e94ac3ac7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7710-split-lock-sinks: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7710-split-lock-sinks.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a06ea07579def360c4239b992ecf841a396bef024b14d58e49e2426e43bce0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7711-parse-churn-layout-gate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7711-parse-churn-layout-gate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5489c257ae67f214a5bad3b350016d44734882a6439132b247230c490754d0c1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7713-json-replacer-clean-ptr: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7713-json-replacer-clean-ptr.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be0ea38507ec042f9c028b6448f832df4322ce7696d72fa69419c61e5df1147"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7715-element-store-barrier-value-gate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7715-element-store-barrier-value-gate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e8bee8ca43ec0f3f1126e4798dab68519d68402740bc44fb9f14405d4204c4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7718-ptr-shape-kill-switch: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7718-ptr-shape-kill-switch.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dccf814bbf3c5948de4f56308b94d61d9e9442e525c4b3a6380735dd04d926b3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7719-builtin-ctor-roots: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7719-builtin-ctor-roots.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a508a6046190919c7aa339224976451ada3922c4856c6fa626284c588db927e2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7721-gc-moving-loop-poll-default: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7721-gc-moving-loop-poll-default.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee9c5101cf7f2c5ca06df5f2b0d4709f7f59e4887240d3e1200ab09df3bf362"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7722-delete-barrier-scope: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7722-delete-barrier-scope.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"772d97bf2277341a974d639ee8cf562b49a1cad006a3775c6221dad751666cc6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7723-gc-gate-arms: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7723-gc-gate-arms.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7019afd62eea985f7ea7c4d024f85224af0362a4fbdf15f2cb4f3b92a0bb61b2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7724-native-unrooted-residue: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7724-native-unrooted-residue.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88597ef06225735afbbc726f0647e019e581fbfdde4f6bdaa6c539accc06a500"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7725-capture-bits-reload: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7725-capture-bits-reload.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92c743dffaf933a29ec5f81d644fb3661518549617131cf6eb76f7a0a78fdf9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7726-clone-keys-array-init: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7726-clone-keys-array-init.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9807a61d202755b834c38ead5bc587a99f252cc42fc4ba1f8b3b7e89d0cd7d43"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7726-native-module-spread-calls: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7726-native-module-spread-calls.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4233dd2af8bce77026165d4ccf44d010360bc281249ac523254688b34df2f27"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7729-gc-zeal-allocation-pacing: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7729-gc-zeal-allocation-pacing.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5fffcf4edaec4ebf7a1dae4e5bf8391a6263f7b5074f2bd99edfbc73a96bc9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7730-proof-test-contracts: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7730-proof-test-contracts.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0286342c9aee7c613af833f769fe180a6cfc41fcc76aa8faab66a5bab17192"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7731-generator-attach-pacing: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7731-generator-attach-pacing.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e174ee750418cde288e2563cf5271fc6fb9661dedc9f72c540fa2a1a616797b9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7733-retain-live-set-major-pacing: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7733-retain-live-set-major-pacing.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d727ae124645b6487abd065aa186031ee198475ecee184b7b0fec6641c464f41"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7734-narrow-spread-bail-querystring-bridge: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7734-narrow-spread-bail-querystring-bridge.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"039c2e2925fe3000d4eccc588455e60269c3effd4902a0ca7fec40864a531450"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7735-gc-loop-poll-arming-word: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7735-gc-loop-poll-arming-word.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df56f7476eedd639fe0993a99804d07dc57bb1df86967df1b0402233a2577ac9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7736-rooting-residue: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7736-rooting-residue.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a55c0076fca2747b0b8a57318a94a39c405e55c043aefc5a56fc6f08897beec"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7738-dominance-numeric-proof: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7738-dominance-numeric-proof.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"308b8a9850f1c62451abc393236b63fffa67c60860d8a4fa1e31ff9f8a914f5b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7739-gc-pacing-snapshot-boundary: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7739-gc-pacing-snapshot-boundary.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8d2213435f0af50102e2d5a41bc45f555fee1d4f20eaf593f880656eef6450"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7739-prototype-latch-drain: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7739-prototype-latch-drain.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6270d36c4ec5bffbac319eb96e7191afeb14a4fcbc9d2d1612f6654e830103"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7741-retire-gc-zeal-for-the-seeded-schedule: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7741-retire-gc-zeal-for-the-seeded-schedule.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf9911ac95838a723b1a44fa9d06035cb390c27ebc56230bda06c054da99208"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7744-gc-whole-block-in-place-promotion: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7744-gc-whole-block-in-place-promotion.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bcd4cbab5f9b3428a659ceb14a725660039e28e81ca5088d60a2a291381661d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7745-events-module-helper-dynamic-dispatch: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7745-events-module-helper-dynamic-dispatch.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f6bc555bb184e93fc5f7a50c040cb1f557b716ad3ecc105f488f9fffbdc3f9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7746-uint8array-nonnumeric-key: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7746-uint8array-nonnumeric-key.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8765950f12da4f071f7d7a9b030697c175f26d4ebf8f013720c850952e09992"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7747-buffer-bound-method-name-lifetime: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7747-buffer-bound-method-name-lifetime.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d968890ea8934393dd9409ea8036768238a3be8da3586a5f5ef44c87e15d60e3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7748-codegen-suite-coverage: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7748-codegen-suite-coverage.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"505336f4497d00a000fc98b3532e2413e0a4017fa8fa36e40b63bcfe704d3f41"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7749-update-config-surface: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7749-update-config-surface.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e338c46270b2b8b1e705b0bcf5e0d336448933b92aabd64200fccd3ce2afcfd6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7751-deforest-growth-forwarding: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7751-deforest-growth-forwarding.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa365aceb5db85ba02b822c1016ea01a9bfde7720bab39058a93b3e378540caf"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7752-positive-pacing-recording-test: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7752-positive-pacing-recording-test.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f50d01b57020f389f7ed98bac5332dd012aa0193425bdb5f821b9a8e53cf6b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7753-polymorphic-property-read-cache: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7753-polymorphic-property-read-cache.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b154b252d600acc8a7d46afa16f99185d573c8f10bea4b9bd85a6dece6bcf9c0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7755-registry-probe-latches: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7755-registry-probe-latches.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a9a4c70e601f8e1c1ee1b445e93fc8cdf6f6e7b0e1d62bad7eef7caf6721b2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7756-generic-class-display-name: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7756-generic-class-display-name.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e383a866e53259aa76268b40b70dd0cd45e26adf62e6fdc3c36b85e80ea20aa"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7758-tls-hot-by-default: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7758-tls-hot-by-default.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68db82856fdca3f07a4a4e7f6471c7f19cb480cd5f07a77b4353fcdb8bfc2add"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7759-array-proto-iterator-spread: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7759-array-proto-iterator-spread.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df14d0fd029e23e176280aeb9f0aa17a75306edd989132546f28753b6a5a3dfb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7761-array-proto-iterator-own-property: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7761-array-proto-iterator-own-property.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2fcd27e1292209ef61f2d63dc18adb87b1b4012b979b643b6be23bab22c7ca"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7762-generic-specialization-prototype-identity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7762-generic-specialization-prototype-identity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b45531b442a3a7fdf713b059762970c7601bd0b80fcb78046c408e849e2381"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7765-array-receiver-tag-gates-collection-probes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7765-array-receiver-tag-gates-collection-probes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bac1e34df1dde7b18bc8a6f4645969c23ee467995fc9bf6bd2390b8e9cb1dd"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7767-inline-strict-string-equality: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7767-inline-strict-string-equality.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d6b5c0db2e75525c2e380a214e6952aa7747ef550fbfcd6d4c7b1c032006c6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7768-ext-link-gate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7768-ext-link-gate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b36f2d9b5c5af9ba5061ddd93a5eef76b32b8f2c8ae9a9c0c64c8b796b5f83"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7769-class-dispatch-locked-hash-maps: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7769-class-dispatch-locked-hash-maps.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8506c723293d20829045817a03e9b07442654441ffdb4bb4a583f4ed4d3f551"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7772-stdlib-no-default-features: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7772-stdlib-no-default-features.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"050bef0ed54766d467d5f08ae8ed09530eead734347b3f63a443e1591663a67d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7774-element-group-numeric-proof: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7774-element-group-numeric-proof.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0fac9e565ef9968cbabab159c2948b3db3af9a4aad64a23c28b8bb290f714e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7778-element-shape-param-binding: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7778-element-shape-param-binding.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2905d55b9bd70667a3b0e18d2010d541cbbeb7fb7a6bafb936d99ba1129a7a5e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7779-builtin-alias-construct: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7779-builtin-alias-construct.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"880eee41f27793fac897bef30259a48d2bdadc617f89e308d2880d7d6c6bc331"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7780-element-binding-clone: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7780-element-binding-clone.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5520c1e1519a2829bf3e58ea30ef9c291695fbdfae240ed511c59954135e385"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7782-schedule-arms-poll-word: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7782-schedule-arms-poll-word.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e9b0c7897212cf1e3a76e4348c3f6aa12767cc3ac7c7501c2de624ec2b24d9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7783-grow-then-churn-probe: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7783-grow-then-churn-probe.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24adec532118f8e39462b877a7961d0d82134c38fa276edc1aa77d48b749acb7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7784-update-prompt-auto-and-channels: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7784-update-prompt-auto-and-channels.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"805f1fd2280ff73ae9e28d8935e8edb4f7747256994655153683db72479a96bc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7785-update-check-sources: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7785-update-check-sources.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"851b2ea30eee60a021d2d818d80237022badef0f13d5fd40a9b147ecf81baf36"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7786-no-cache-migrations: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7786-no-cache-migrations.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d94c012e7b51facd05d7aa1012af9a0b2af6c069bb7948311272448752b819d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7786-update-cooldown-skip-docs: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7786-update-cooldown-skip-docs.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be52a34774e3fad318a489e61c09c85407db2f554da33089c0d0bc3640db631b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7787-update-surface-followups: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7787-update-surface-followups.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"606751d285c44cf9ceb8efdf8cbbcc8b5f18f45b92e8e8f3ce31aff3fae31240"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7788-shared-this-flow-gate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7788-shared-this-flow-gate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2369e50bf6589a6834de927404cea5e2d7cbf210ad8efbfdb703e6bfa88d0bd7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7789-app-update-config: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7789-app-update-config.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f151f24c638a28521b0f74779ad5dba8104f9c3dd2b5c20249b19d1009994e5c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7790-forof-counter-verdict-tests: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7790-forof-counter-verdict-tests.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02d709e577c41c3c5ba34a1bd0485861de0182db40369b500ff562d5dd72abd"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7791-perry-runtime-tests-single-threaded: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7791-perry-runtime-tests-single-threaded.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b60331903fadd1a43df4a60e32f619169629489aaf74286c8683e3a5d0a7a0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7792-json-parse-nesting-depth: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7792-json-parse-nesting-depth.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd2778791e369de7f682876cf6ba46fb85e6c9466e2b73835ada2a0a5ade17e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7793-dep-scale-runtime-witness: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7793-dep-scale-runtime-witness.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7b4c0c4acc0fd14ba50252e8215a33bbeb5feb8f106bd08353b0d69c257eef"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7795-miss-path-probe-gates: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7795-miss-path-probe-gates.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"809598c1fb47e4e0df06b8c9533f7c86b6d12463c7c6ddd81cf5874ba5d69ea0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7796-symbol-keyed-element-truthiness: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7796-symbol-keyed-element-truthiness.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6ab3d2bde79f5675d81c15a25ba483bc7bc45869c098d2331a8ded0d0e528c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7797-locale-separators: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7797-locale-separators.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"572a0e01fa4554be22b0a95f5b0e2c58e175878e16cbcaeee1dc30301ae23eb0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7798-class-static-define-property: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7798-class-static-define-property.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2265c1787cb055ad9bab6667da3aa27d100d92a8c1c39119e47fcad68146292f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7799-retain-survival-adaptive-pacing: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7799-retain-survival-adaptive-pacing.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"296d91f2e59fe6273d6d419589f78f792970199890e0e3f6ada4ff0f83a06f04"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7800-class-dispatch-prototype-latch: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7800-class-dispatch-prototype-latch.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2cad2be3e5ccb8adf9cda617a98d7f3cccda2a238d1d800abb8138fbe5c1d3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7801-spread-call-imported-receiver: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7801-spread-call-imported-receiver.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4df20e2f1b515947ea44cce990b85067942fbf09fdb9fdddef8af4b8ab0839"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7802-android-json-subnormal: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7802-android-json-subnormal.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2004ab45b273aa0dfa530148716f7884d2f97aa43b6c254b503e8af646023137"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7804-addr-class-scans-ext-crates: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7804-addr-class-scans-ext-crates.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d5ea57f487f45a459faeaf90b127f17cbeae5d4d5ac6eaaff9a51c570cbd96"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7805-build-cache-codegen-env-keys: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7805-build-cache-codegen-env-keys.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"080f854a98056cb9b006033d592b520251ee91e7746a0c682472ee15acace6a0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7806-cap-salt-reproducible: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7806-cap-salt-reproducible.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3632cf6aef3d6ee6b6f34363400f577d6197ff82b83300bda7dc8b3acba2a9db"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7807-guard-failure-edge-property: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7807-guard-failure-edge-property.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a828ac7468db91b7ec8b5de1b00039386dae0551c48568a069cf279e8d504c49"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7808-opt-report-two-tiers: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7808-opt-report-two-tiers.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d793d00a5c7f58c6be3b3a5f6b5cecdbd3ecb6369740fbb6427a636a79c8d86a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7809-globalthis-bootstrap-layout-latch: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7809-globalthis-bootstrap-layout-latch.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a72399a1694c2166d17d692bf3bf85096c1ee82e48edd4e3ee9d1266db63a8c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7811-string-coerce-operand-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7811-string-coerce-operand-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1865a47e67757da0ce29b05217e6af81a571378be90837d319ee19cc2dc88207"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7812-single-slot-pointer-mask: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7812-single-slot-pointer-mask.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfe973e763cfcbaa7f37e10b1fe737a1b480415f357e9fdfeec4210ebefc3d6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7815-constructor-receiver-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7815-constructor-receiver-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e1a814b08fc080887bd946f37d7394db35b234a6d31d823e14ad499569330b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7818-opt-report-no-call-sites: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7818-opt-report-no-call-sites.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6456f310c850ce5cb51f8ab4a3e85c179af2d32e3fc61a8be5d48117b60eaf5c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7819-numarray-analysis-disabled-report: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7819-numarray-analysis-disabled-report.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"513619e7d0128c0f832099c749713ab90fa3a03cab2dfb2d17059cd5e0532d35"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7821-narrow-baseline-fingerprint: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7821-narrow-baseline-fingerprint.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d468be856963d67e020504d075a074aba4876db21566743f51b3c0bc758cd5a2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7822-dispatch-ic-retry-can-fire: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7822-dispatch-ic-retry-can-fire.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2003a008ecbea5ca4e3e68d0b0c34893dd019d680919dd404f9f1ac524a22aaa"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7823-tolocalestring-primitive-receiver: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7823-tolocalestring-primitive-receiver.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39a8597e244d439ab4e10fbda8e3a319f2b64987f648800f482f9b35908625c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7824-thread-local-policy-gate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7824-thread-local-policy-gate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab67029e63ad18040cfe2312c1a94d4ce057cb2a894faf7a0602d134fd0c39cf"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7825-raw-handle-merge-base-ratchet: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7825-raw-handle-merge-base-ratchet.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59bb0f5d4fae26a2ed51bc59a863114aef15dc251b2e6573d27e0069f4100e67"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7826-generic-specialization-constructor: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7826-generic-specialization-constructor.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"174b9d716bc743d16c774e3e2d086042f659ac954423eeda1a2a251934f789ff"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7827-typedarray-buffer-alias-hazard: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7827-typedarray-buffer-alias-hazard.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54a7cd227a7e3b8fe8350687e7b6e5e068916555f04a70d532070b8d6d67b77"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7828-proxy-local-name-collision: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7828-proxy-local-name-collision.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"434d34cd5b172015f9c9ec163e3bfcfb149c5a29ee7df19a8ed377fe77fd94a6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7830-file-size-gate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7830-file-size-gate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c093dc9a28c810fe3114a233c234c4b9e20ccf1f9ada3c5f2e2f9e9ef78f1565"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7831-declared-numeric-type-is-not-a-proof: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7831-declared-numeric-type-is-not-a-proof.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3f7ba537a6cae0c27eae27dc0f84bc8638c066acbc8e7ee54cedde8566938e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7832-iterative-json-parse: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7832-iterative-json-parse.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47716b517cdeeb12705ea080de73b2f9e26ea094572fd90c0f8a1d7011542256"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7833-prop-cse-diverging-guard-chains: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7833-prop-cse-diverging-guard-chains.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddab1d9a2fa2050b31c7bb79ee2a9c52e4e8accecf5a6d224cc26c4f84ed7168"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7834-alloc-band-typed-shape-bake: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7834-alloc-band-typed-shape-bake.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67bd33fddd80584200c44f763bb92e540d608bfa23d7085a37b41ed60ed13a08"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7835-declared-string-concat-and-static-field-store: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7835-declared-string-concat-and-static-field-store.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"343b347a09328dab0fc013f9481f696c8a794dcb8d6c5544deac8cafe2c53e17"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7836-async-step-roots: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7836-async-step-roots.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2517f646855d0e3f982533d11f28320d5e11a9fb0ee5c3763df073e9802908ab"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7839-numeric-push-pointer-tested: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7839-numeric-push-pointer-tested.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be7237807f43a912c60fc8fda1a4d886bf324054c07f6248be01cd57239cfa6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7840-raw-handle-debt-across: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7840-raw-handle-debt-across.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7852a15e835e8b7123582058c21086c2714a7dfd490fd7a795b92048e0126889"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7842-declared-string-is-not-a-runtime-proof: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7842-declared-string-is-not-a-runtime-proof.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d85f6fd1c832da37a320a3fdbeafe95725e8b6ba89dfdd48cf7d1d82dc0ccb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7847-deep-recursive-consumers: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7847-deep-recursive-consumers.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf580805ea2b5ccadbe4db7d5fbee77754715e5abb5817398dcab1adcbe0dfc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7849-buffer-view-pointer-lifetime: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7849-buffer-view-pointer-lifetime.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b338e7878d037b662c47b3b5a70c1a1f3ee01d87c02da9d100932aa872b835f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7851-pshape-add-result-coercion: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7851-pshape-add-result-coercion.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09d9caa979dafe4367522f26d8d3d381359f3fd46bbc6dbbccdbb9191d20b2e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7852-generic-alias-specialization: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7852-generic-alias-specialization.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d469e4b8e879ef963611a212d5d3e4c47d3b68a25efbe4271b20f147fc24880d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7854-interp-round4-store-precheck-arguments-latch-declared-array: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7854-interp-round4-store-precheck-arguments-latch-declared-array.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e8078b9599350156fd4245dcab6e3d3d94b3473033c2aa9cc325762335193e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7855-array-isarray-reassignment: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7855-array-isarray-reassignment.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab61733c660598dec05b3bf8738eff20b4d0301b9d306e5dd2b3a435f1ac595"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7858-push-barrier-cfg-census: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7858-push-barrier-cfg-census.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1719e5301e4259f5487c1f226fd39e783894a07780a19f60740c580fd05cfa00"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7859-retain-promotion-latency: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7859-retain-promotion-latency.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0901a165ad195463ed86921d1bb4e679b1a7894529a1bc5dd6116c04add128"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7860-ci-gate-starvation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7860-ci-gate-starvation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3b0a6eb6e9ab2f2efdf2dded8688d9f90866ee607334335d15e7bc7ab70800"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7861-class-field-subclass-chain: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7861-class-field-subclass-chain.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca052673d45bbcf68c5793376fbbf913b01f417e717910c8fb2b0fc4d6e7947"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7862-declared-array-length-fallback: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7862-declared-array-length-fallback.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4def2c56fe2a91224bfa79392b9c947070f43aaaf7f42e5f51ad21bb2583a5b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7863-barrier-file-split: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7863-barrier-file-split.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba8b6ca11921f0299e861ddef275abfa90c09abaf7b558f4a5842f802a45245"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7866-any-string-method-dispatch: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7866-any-string-method-dispatch.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"655b6f1d418580ba138690968bda5e43bb22418fb70ef9cc42f772a289fbdaf1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7868-header-directed-probe-dispatch: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7868-header-directed-probe-dispatch.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc3d2aa35e063ec23fe92efd76ba9f84f14259130dc37365c341753e2ba23fd"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7869-gc-pacing-escalation-reading: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7869-gc-pacing-escalation-reading.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffa83d1c2806fb071ed0604d48a3925ba5d890a307f3a6e14cde43560373ec5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7870-ptr-shape-prefilter-report: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7870-ptr-shape-prefilter-report.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"652417e63a1d367c5c8de02e3ee31ab4fc29e1dc878d5121022ffc319c81a45e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7871-interp-round5-alloc-and-barrier: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7871-interp-round5-alloc-and-barrier.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfcf45ae7d272cf7cc1df1bcfc3ff47c736917e87b64b824cc4f32aba866cc84"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7880-dyn-index-header-gates: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7880-dyn-index-header-gates.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e97e5f94550ad3c1bdbe7ff9afb43df5a8cfe2825777bf812cd002a32d79f64"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7881-declared-string-self-append: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7881-declared-string-self-append.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9d95ce581d7c95006cf8797061b004f2b00ff3ab23c94bda4fd953e5f05e1b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7882-ctor-free-construction: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7882-ctor-free-construction.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a7dfd57e78c1aef701030bd3993bf2688e609bfbc53ce46073dd867ffc5258"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7882-windows-gc-audits: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7882-windows-gc-audits.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b6a2dc46d97b23be39020530a3df9f08614bf7af2ec51751970d53d51d6dab"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7883-current-gc-docs: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7883-current-gc-docs.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"706a3d1f3d3f7cb22ed737a29aec8e4be9502f4ae64404bd15736d2f1c323540"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7885-fixed-per-call-costs: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7885-fixed-per-call-costs.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6597e9f2519f75447c3d34f7446e52f62d0671e870876025d7e500b250b7547"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7886-live-heap-accounting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7886-live-heap-accounting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"294dcc2af8e0b05aa75bbe79d0f0a325c2741c7e9decc6eace968f75406aea80"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7887-pget-guard-branches: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7887-pget-guard-branches.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"649312ab9f18cb3dbc74da8ee64b49b57d1cbb0434f3a1553e2cb5c2598d2c36"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7888-untraced-whole-block-promotion: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7888-untraced-whole-block-promotion.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9baecead19db706a06dccda3ff708cd30c06979dc4e9d5c0249f556490d9f93a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7889-block-pool-pressure: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7889-block-pool-pressure.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11af0312de8d510b78eae75aca893efbe54b0416ce887ef04b1763f42eccb31"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7890-declared-array-claim-element-reads: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7890-declared-array-claim-element-reads.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b764e5d4f0bb4ce78c6497406d044765f9d979886f919b28a2d278d81706a2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7891-declared-array-claim-string-key: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7891-declared-array-claim-string-key.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b35149b6ddff573a7c6a40fc3ba6fde9cb4d4b95dfdc2fa4686f82e89b1eed6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7892-slice-weak-processing: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7892-slice-weak-processing.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb2718a2a4619b552969ec2aeac9c19f10d9846867f9c51b9387b52a8efa644"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7894-layout-latch: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7894-layout-latch.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2da0167e7ba849f9904876ed51c945fc6c257b4ef127d95fbc708916d5fbdc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7895-born-tenured-pointer-bearing-threshold: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7895-born-tenured-pointer-bearing-threshold.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc703b09ab0501bbc7d7f2261599dba04e25b79c6ffc4cf37f715c526327d9a2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7896-boxed-concat-poll-reach: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7896-boxed-concat-poll-reach.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff1d7e8494be9c5af3cd2dcb6f2242cae8abaf0dc9b29e98aaa96c746451b74"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7897-header-gated-property-tail: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7897-header-gated-property-tail.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82fcbe2c6e06d9be62351445d1d78b47fe57b3e1be0371b0b650a4bf2021ae8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7898-set-symbol-probe-fallthroughs: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7898-set-symbol-probe-fallthroughs.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3eec4ccfa894a5c805cd02de380f83de0d0a24ba81df5fe611c277b008672e3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7899-guarded-for-of-element-facts: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7899-guarded-for-of-element-facts.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7deb73face9505bd73215b4c3039452469f4dcaa308b1b98ce4fd3e685fd3a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7904-declared-array-string-index: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7904-declared-array-string-index.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e739e001695e29302efebdccee699b4de81fd59cd09174d29b408498abd6e2f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7905-dynamic-string-length-generic-tower: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7905-dynamic-string-length-generic-tower.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7b5eecb5967af785376e6a9292109d80905c4a5a9d0f15cc99ba902335de7f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7906-async-box-registry-cache: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7906-async-box-registry-cache.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d00050ef93c1abcdf39fdb91fbd03cd80f190b1264711068764e8727c843cab"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7907-pic-miss-token-block-dominance: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7907-pic-miss-token-block-dominance.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5068f57b306e41e0ee4678771b2896cc5a1624e7de4778f6ef79393e11c44358"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7912-concat-chain-no-collect: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7912-concat-chain-no-collect.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fba42778d85b29dc4f826684d0a0581471f5e31f3d0b976a68aabc8fc17c85"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7913-old-defrag-contract: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7913-old-defrag-contract.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f770e6ac0a62fbe73bbf0fed02da4c6a88abc40b4388f0f3e47a9d37e45cdf97"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7914-promoted-page-run-description: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7914-promoted-page-run-description.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49cbbdbdcde26bd1260e9eb7a2976e26f2f913c337d067f281d9b7a091ee0635"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7915-root-scan-attribution: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7915-root-scan-attribution.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3987b95c08cc650c505723204389d4735439516ef01eb1b59d23c4a3141fdc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7916-eager-class-shape-stamping: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7916-eager-class-shape-stamping.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0052b654cc345815f0c9f7557f116ec608d7fdd759f551f3c702492a6c08192a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7920-windows-ui-archive-dedup: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7920-windows-ui-archive-dedup.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"398a3bb6b271514873dc8ae5b096f89f0ea4c871731b4dd63b7a625365c2403a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7921-gc-ratchet-repin: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7921-gc-ratchet-repin.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5a6435c2265e3243bfba7e7e3b7a7eb5e51b9545fd7a6a778833f6917f20db"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7922-old-defrag-default-off: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7922-old-defrag-default-off.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15dcc0aa6a6fd007139d0ddd7f104774032af7252dbd15d310e9eb7f17dc9cf"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7923-gc-incremental-cycle-stall-instrument: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7923-gc-incremental-cycle-stall-instrument.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aedd0fcdf7da8625971a1e7bcc949db41e22c24085371898b843e04dddbe3a6b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7924-promise-all-fast-arm: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7924-promise-all-fast-arm.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a149ce2c308728dc7090658d7d0c2e3d997ee29d8a92054c0d8938f40e2dcd6c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7925-indirect-closure-inline-new: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7925-indirect-closure-inline-new.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cb2dd55617ba8abb7d7b74ef259ab8105cfd99d7a99cc2dc748113ae9cd3d1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7927-thenable-probe-fast-negative: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7927-thenable-probe-fast-negative.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2956e00b7a0abf2bd13826db302060c36cda3aea7939ca7ca662c9dc997441e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7928-inline-slot-floor: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7928-inline-slot-floor.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86c598166df01c1d0e6e8ce718bfd079e39cecdc74da3bcd6ef82b4a8385ddd"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7934-stream-tee-buffered-hop: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7934-stream-tee-buffered-hop.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25bf8bbaaedb3e4175bd207c4ee70cf045b39a0dbf0dadb6140cd25bf5346e3c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7935-barrier-gate-ordering: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7935-barrier-gate-ordering.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc7c096cbf1223fbc4ce299c3edbe40724cf955f3ca1eebc18e207b7074c971"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7936-gc-doc-claim-gate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7936-gc-doc-claim-gate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fc1b05c4fa0b9cc292e47f46f0057b0b9037273b54d53adbfb7a9a875d67ee"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7937-first-cycle-promotion: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7937-first-cycle-promotion.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c18f71b5891d3c7b9cdc6a0e351d023db1d4f2e63f40ff129391b59788bcad"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7938-bounded-budgeted-step-work: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7938-bounded-budgeted-step-work.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a51f9c6f8428c1ba88e763cfbd42370b0ab68ce41b79b81be858db72c184cd3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7939-async-box-release: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7939-async-box-release.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfcf79f6245640eb6a05562db95458dffdbb4716fcbdc96395e24fc55303e49"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7940-typed-array-header-dispatch: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7940-typed-array-header-dispatch.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be8c3e7c75bd28c780e6d38f8e44cf682a0ab218234cd1ecfbc1d54135e6948"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7941-weak-steps-sliced-doc: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7941-weak-steps-sliced-doc.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"013fcd029de50c2d59d21cd883f8c9d45bbc6b079e6f98093c265465d825048a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7942-weak-read-barrier: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7942-weak-read-barrier.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7b9bd92bf63e85b4ff54fee885f0458ea918069cab1d895edf6235cf19e886"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7943-live-from-space-census: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7943-live-from-space-census.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0aebd6daf992f9756b1400199aebca8f88fc6b11e272b06ee35fc2fdcaf6c2b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7944-untraced-promotion-bound: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7944-untraced-promotion-bound.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a13deaf3bf548ad2836f3d0febd16b563487b272891c111cbd15b99b57d5048"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7945-post-link-resource-copies: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7945-post-link-resource-copies.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ffce136e728d9dcdd1a8adb9d98058e6d6bb56a988066338b71d31a43cb52d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7950-string-coerce-rooting-tail: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7950-string-coerce-rooting-tail.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c18ef8e07062b2661a3bdcc9560d802ebba9d45bee015ba64310c83b42a6feb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7951-float64array-spec-abi: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7951-float64array-spec-abi.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f9b60a15cba69298868311c0cbd4f3e42d477a72ed76bfab02f611238c982b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7952-ext-feature-union: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7952-ext-feature-union.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af690e7f1cb17786b20c148296f0cbca93f1162ccba5b3ebba9756c21e8b6b5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7953-weakref-receiver-shapes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7953-weakref-receiver-shapes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b63a11d47b20906605f2cb158c853503cecf9fa7248ded5f7fc04dddae4491"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7954-runtime-suite-flakes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7954-runtime-suite-flakes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ab28cebebc84587d84c9dfc9cb43053ac94da2bafd778be94a83b7571b8459"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7957-opt-report-source-locations: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7957-opt-report-source-locations.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4eacc74c1161f03730a15c147d280fb3d66558444417b8e789df78039c2b77"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7958-public-baseline-inputs: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7958-public-baseline-inputs.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e4c85bb1e05bce01bb50d0f23b733e27f0fa6b16b880efb05fa931c680eb89"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7961-gc-object-denominated-nursery-band: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7961-gc-object-denominated-nursery-band.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"221f39b1e3389d2bcc97a153f21367da2371d7c4fa201bc3e42304316a8b8e65"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7962-root-container-values: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7962-root-container-values.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"500ea71426b098a2e34ff802fcc044eb211520fa28916ab166f750e35dcf446b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7967-node26-everywhere: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7967-node26-everywhere.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"283ea3ec16cfb18ad61f26182d518297d7371fac8b12cfa4ca97d97d4287e6cb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7968-old-reclaim-baseline-credit: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7968-old-reclaim-baseline-credit.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8462d49347c20a7f22197f408b34f246e5af61e054c23291ce10e481b25c34b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7969-gate-starvation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7969-gate-starvation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf798c6702c9b6918c8ae5d777b40a05c2c26f72b20be937c8eb292bfb957be"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7972-gc-nursery-cap-budgeted-deferral: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7972-gc-nursery-cap-budgeted-deferral.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacfe81a3347b4fcfcafcba31377ace1e1873470c041c7177c0c704d8176c27b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7973-repsel-loop-accumulator: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7973-repsel-loop-accumulator.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b834f598917b5ee482685edbabe548b5a63f7114cc6df19fba48603d882662"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7974-runtime-suite-flakes-7955-7956: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7974-runtime-suite-flakes-7955-7956.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcde4cd496a6b037785af30c86a7f5e3e32a9ac23c2d70c98b6b5d6f4432cad3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7977-lint-red-gcheader-cast: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7977-lint-red-gcheader-cast.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64a4ce4956fdebef60f56a1aba55c1f43aa90cfcb5c5d0b4ed3e72da57119fa"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7978-define-property-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7978-define-property-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36b4ea93bc561bf4b4c45db7f2561bd4d9f0b318fa5d79c2aed6739058f91e1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7980-zod-star-reexports: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7980-zod-star-reexports.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8661d8803839ad9808fbb5a1861f2d7e6008aa89e3ce18023c929c769a3d237"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7981-thread-parent-class-id-from-registry: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7981-thread-parent-class-id-from-registry.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"745ecb789893449bc936853a4f7c28cc4ba5f5e1c7184063549578ee6383beb4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7983-6759-rung1-uniform-shape-word: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7983-6759-rung1-uniform-shape-word.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e621e5123dbf60cf3f13dccfb05aaf53163a97b26ddc84d81a5cd7526de1cae"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7986-ci-gate-repair: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7986-ci-gate-repair.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf15cc00b7c19a3a9b16e202f0a655bb037ea44a0820375c1324b264cf9c15db"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7987-dead-owner-side-tables-realm-bootstrap: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7987-dead-owner-side-tables-realm-bootstrap.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2bc1b76afd2a1aeb8b5df3ff0f00233f8412a3396ed3199a9f95ff7a14ac799"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7989-zod-corpus-triage: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7989-zod-corpus-triage.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"820787c49b5fce9d91e634bd5f3c3638923066e51e65172ab631dc9d917afd06"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7993-gc-diag-knob-value-parse: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7993-gc-diag-knob-value-parse.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"801b273b70bb09a8a96b276627bbba93baaf4821d5e40ed46520d0f6809b1f1e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7994-per-realm-prototype-addr: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7994-per-realm-prototype-addr.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c82a788926cbd4b4b710941c83b5080ab43dffe4c4040fd8ad357878a38235d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7997-verify-walker-report: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7997-verify-walker-report.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b661d53313969123e6f2092611e5554dbfa22c11afbd7241f4bc2dbc20381a8a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 7998-native-addrspace-and-corpus-currency: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/7998-native-addrspace-and-corpus-currency.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ca4ff8f5f0a26a048a56ef984f0690760d9475e64d66a8c4b8ca0bd4a5a66f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8000-gc-strategy-define-header-pin: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8000-gc-strategy-define-header-pin.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2c2b387818467474469cb4fe17ce1086a7cdeeb0f4aea93bcbeeeab2f467b0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8001-agent-local-class-registries: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8001-agent-local-class-registries.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b257be6e51cbde169d2d856dc7733a2303c63c9f2b41222ece7e88090db3d5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8005-ext-zlib-raw-sync: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8005-ext-zlib-raw-sync.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d48b190b06d02cfe5a1864966a013f5031729a5a1a89847b3109c5222e581e8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8007-conditional-return-shapes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8007-conditional-return-shapes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3c1b1a0ec664d38f84419f82410df0ba8586e200c97d26ea4d45ce7c367c08"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8010-class-shape-uniformity-gate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8010-class-shape-uniformity-gate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"419752691d5b01e0e8dd63370a093feb0e73523ec29de2aa0b844c8fb3ddf1b7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8011-root-comparison-operands: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8011-root-comparison-operands.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0d762a3d2baa169daabc6665df1a6a2b84f71edfad7e9fc95e3eb10da146f3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8012-async-control-cells: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8012-async-control-cells.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5345d9b122adabb9c8b795956fba8c2434709e25a0bc15b36c07000c83f413"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8013-computed-access-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8013-computed-access-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4568c70acd3f4a01188d8f9ad71ee3dc04710c920f8f24dd1077c4c0f33b1ade"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8014-tracked-view-backing: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8014-tracked-view-backing.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed456cc18496f6472d5a16c0fc59007bae9717bceff1f02a5123105ba8d0f40"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8015-logical-return-shapes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8015-logical-return-shapes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49acf0897034d3f7fc179ced8a19566fef0fb05f02f4c4eb21ba8cc4802323d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8016-json-tape-exact-spill: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8016-json-tape-exact-spill.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"782505a39631611683159ee8c787935bd48962d425531f2a7d96c398a7e9f402"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8018-windows-llvm-runtime: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8018-windows-llvm-runtime.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6beb11c6123e4a6e3e1867eedf7dda0d1386591d731822d66b259135c94a4b0f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8019-exotic-expando-runtime-state: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8019-exotic-expando-runtime-state.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"accee02179cee5947940dc465f8e144ddd10f5457b5b14aeb871521b2ac2ed0d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8020-windows-ui-message-pump: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8020-windows-ui-message-pump.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a27de753b8c8aeeee2d9f2fa53a1d18e78757ba843ba1e02ecdda1d47bdbe6d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8021-7990-map-comparison-regression: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8021-7990-map-comparison-regression.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7d2e100a4e3df05bdf09850f2391a9c2fb5c70c3df0e76559f32a05b948202"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8022-windows-ui-coff-exports: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8022-windows-ui-coff-exports.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbd53b9f3065de357516997a93de5900126c1f4c543b5595f4815fb27ff6fec"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8023-typed-store-header-proof: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8023-typed-store-header-proof.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3307cccba4d60ac967ae07569413536e65ebe0d0651a262113751cbb41b7f9d1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8025-cross-module-return-shapes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8025-cross-module-return-shapes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedad34e789e4926ea4e494b79f3a266e3a0d68db71933ea6d10806a5c536da9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8026-static-write-poly-tail: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8026-static-write-poly-tail.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fedfc859a83b57551a1e68bfc4dc9e59a7d8fc65e37eb7b9c90d8f65144c2e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8027-windows-arm64: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8027-windows-arm64.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50953968619c5fd650356b57798b1e2712d43bc4076cc1d93cfdb9b2ac4e0509"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8029-method-return-shapes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8029-method-return-shapes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa1825d092e5b408ac64e91a9a89e178dd0e44603f58cda9fbdb7c2a14a4e24"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8030-scalar-method-field-write: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8030-scalar-method-field-write.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9d78bb57b451bb44f74a5178ab89b1a5f2d27dcf85f2ff9509e10d5082c110"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8031-boolean-native-numeric-ops: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8031-boolean-native-numeric-ops.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbf22e84d052ed68004d5496a42e41b2ac2e502fd8a629cd5b514ad12283567"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8032-native-value-profile: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8032-native-value-profile.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e8e0d0a6cc7b40a66c3092d50452797375efd7cfa27b1498359981da59d5a3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8033-local-binding-runtime-proofs: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8033-local-binding-runtime-proofs.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"220f506fe7c0795ef3d5565920be347fc48a20edb7cbcf9b61c61ad38a6236ef"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8040-runtime-relative-chunk-require: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8040-runtime-relative-chunk-require.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d20860ab7694c1c60b22aa923713e36e72e7c78921ca8aff6e5e4af9e4f5e49"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8041-array-growth-forwarding: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8041-array-growth-forwarding.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0406b0cbee028885fe5b5a7a1bc22aabf7ce98d006987276f736a0a014367c7a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8042-next-route-async-local-storage: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8042-next-route-async-local-storage.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"950ca80abf12036dde4833c6a82abd15ad40110777e50c1e2f1ad8a8c041bfec"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8043-next-dylib-lazy-path-modules: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8043-next-dylib-lazy-path-modules.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1560c9bd410c9172ad788b8ba63d439f305c926c9cf3335b608961c489dee2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8044-next-request-import-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8044-next-request-import-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a886212c895ce3d94d3c8f6614cd99c039ab7d87cc8f5bb88c1c5c09b7f459c7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8045-next-response-cross-module: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8045-next-response-cross-module.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad421eeb8ea48929abbc2cb3adb4522fcb52d922d42c464bab49fa3d3c1d4ae4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8054-typed-parse-rodata-symbols: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8054-typed-parse-rodata-symbols.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba0ae2f854c988c355ae97edadebfecf2d49d89c850e43f6242fd144f91e0d5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8055-agent-local-realm-roots: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8055-agent-local-realm-roots.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a6cd6ca656246c5d8bdf7b46277e799768f29f01d48be0f4347543fc3ea94d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8056-copy-minor-liveness-evidence: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8056-copy-minor-liveness-evidence.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dbe6e8e9921a2317bc7459424224eb9616a180d8625c68d365cc243a8a561dc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8058-split-native-ptrtoint-constants: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8058-split-native-ptrtoint-constants.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df77d997510fa1ee8ab630dec1bbfead61c0b846d43903ed93313d55a5775fa"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8059-promise-keyed-operation-gates: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8059-promise-keyed-operation-gates.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fdd1f300e2a8e63381fdc177bbbf29c25707d629fa4988a5894bc835f62ae3f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8061-collection-index-before-array-clean: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8061-collection-index-before-array-clean.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c032e2d2fde910669d7d41c2734dd88151f7510b7ae8df58d03f22fc7ad856"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8062-native-rs4gc-root-lowering: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8062-native-rs4gc-root-lowering.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06c60708a1d7405aa94dca3b3be8007dd175df9060c476f08ef0f42f1acffe0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8063-llvm-inprocess-liveness-pipefail: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8063-llvm-inprocess-liveness-pipefail.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53d3ef48730c9496d3fc8df43b41f5e70ae535a005f5c7ae6ede236e47c8cff"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8066-tls-asyncpipe-profile-liveness: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8066-tls-asyncpipe-profile-liveness.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd1ba04169f4ed3dbb839214ffed4b258b330459649c82c6ddf1f9677bbb1f2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8068-rs4gc-constant-fold-order: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8068-rs4gc-constant-fold-order.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3f2221d0429beb8b017667a4afb28bd8e142074bb51b850c12228a777e7583"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8069-gc-ratchet-attribution: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8069-gc-ratchet-attribution.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3611e04ac435c8db09e3fe7171a8bc1ff720a3389ab6dd2f22fa56e91c556cdc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8071-split-native-root-workers: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8071-split-native-root-workers.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f9866e957edc6c6656ba6e7e321ec4148c835ce4d8448d0b0be9897a12694b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8072-inprocess-scratch-dir-leak: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8072-inprocess-scratch-dir-leak.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55f0ebde7d5c170567a925b9f28f868385b3505dd95840d432c1b0d81b320c3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8073-npm-staleness-detector: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8073-npm-staleness-detector.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf91afa222f7d5d65afda2bb579013d4be26ea89b1c5058ca12e906744aedefe"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8074-authoritative-shape-descriptor: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8074-authoritative-shape-descriptor.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9655abb66486af08f208e5f7334af2f3f44ed1c75d639e3869810a7808827ff1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8076-class-field-runtime-layout-guard: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8076-class-field-runtime-layout-guard.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ada313bc364671c628b5cb9b39a93c1a0eef21a3570652d89c2a21a9a36647"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8077-proxy-locals-binding-keyed: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8077-proxy-locals-binding-keyed.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1e9e609d0e2e08657ba90875e6aaddd7673ae513880d4638734ff44d3a1e26"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8080-android-picker-callback-and-json-extract-pointer: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8080-android-picker-callback-and-json-extract-pointer.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb12f3fd50afa7383bf2e49b6a67957449d9ba7d3ad5471fb79acb0192e822b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8081-provider-gc-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8081-provider-gc-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f658f3703e1b55439b02d2570433d94d09d5cce0bae56a0ca4af79eb3bb2e67c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8082-next-production-app-route: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8082-next-production-app-route.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9320b178a1dd196577e0c8c13f42598529208e46f4b470f3d7b4e69219de99"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8083-dataview-aliases-typed-array-storage: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8083-dataview-aliases-typed-array-storage.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfd5df958cac1769e03ffae34a487a4d75d996cf81d3bc5fdaad0f9b8c4b0bf"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8084-gc-7803-diagnostics-and-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8084-gc-7803-diagnostics-and-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a15f31d78a95e8e1a2c9bc47ee81c6b95a412cd4cb507a469f52c2ee947dbf"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8086-authoritative-shape-guards: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8086-authoritative-shape-guards.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a730d2447b56c083e858f8a6563eba268430111efefc82364be2f8ab53e619"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8087-release-readiness-gates: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8087-release-readiness-gates.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6907572bed4a9bd70d8806de15540a99b925d251b44a190cf223739b5b9a34b7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8089-next-response-provider-dylib: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8089-next-response-provider-dylib.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5b0d73dd7c3f75e546c8d087445193148b53365bbf6fc2f81e5211fd6a6e72"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8090-typed-array-mutators-no-op: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8090-typed-array-mutators-no-op.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93b350f3a20d1c3e9fac462858466b96ca147c2be842536b171a7045cd002d5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8091-build-cache-compiler-identity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8091-build-cache-compiler-identity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e57dce229194624c57086154312e6ecef45b9313a81828a46c9cd6e9176a95"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8094-guarded-parameter-specialization: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8094-guarded-parameter-specialization.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1953d51737604fad5542080b308c4ab3e9b20aff10a1445d0fb9e9bb938819e5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8095-elf-object-source-identity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8095-elf-object-source-identity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb9349d63608ad9f19ec9a714bb2d38c390995126058d550ff3efb0ba10c5c8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8097-keep-ir-statepoint-object: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8097-keep-ir-statepoint-object.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc75369a2707e56af13e48f683e95b2c27f2f311a99c8b7c41900238ced55aaf"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8103-array-callback-shape: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8103-array-callback-shape.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a04f39bdbc179a015230675966188f2bb51b0701a6ba2ffdaec066d1d4095ca"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8106-root-reload-note-slot-symbols: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8106-root-reload-note-slot-symbols.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a4e2df20f2b0aa388a384adbc288ac8e37971fd39336fd031095fe6010caf2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8109-typed-array-read-receiver: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8109-typed-array-read-receiver.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a7c78f1fab11f5d4b4e3d394369bd58649108fc07ae313f2004fbefdb9d456"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8110-shape-census-gate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8110-shape-census-gate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d3a33bad2894321d03d79a295cb120aeb9dd1bb7dec17afbbbbf9734dcd3e8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8114-nonempty-array-literal-all-pointer: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8114-nonempty-array-literal-all-pointer.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ad1a80fd79c16f5cb33af52e894b5089ce346a4b43d595ef1813f237e498fc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8118-json-parse-write-fast-paths: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8118-json-parse-write-fast-paths.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee6d113b1795b277a261c35e38ac05b1cfdb0237fa6d599da8950368c50cacd"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8119-typed-array-immutables-and-sort: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8119-typed-array-immutables-and-sort.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c426dc93a34744ce9dc38cb5a77313d9c3d268194a518e5716e2f90043a8c5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8120-uint8array-specialized-dispatch: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8120-uint8array-specialized-dispatch.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de44fcefa7cf25f66c9926f18ea7e93cd82cb9d952060bc6eff48a2310f3bd6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8122-object-header-shrink-56-to-48: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8122-object-header-shrink-56-to-48.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6add236fadc3864d3a58b2fb10e445d69bca11c4ae7bfdd6e3d3f7161315347"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8122-recover-header-shrink-instruction-cost: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8122-recover-header-shrink-instruction-cost.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2328f9a67430ec971b7e6dc3fe5512da1b2177c8f9e308311f17f65bba70823"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8126-loop-poll-guard-cfg-assert: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8126-loop-poll-guard-cfg-assert.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c35916ea55a102cb42f14121e0cb622b02492dcadd706fbfd74d803e1d14851"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8127-elf-provider-runtime-exports: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8127-elf-provider-runtime-exports.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce306859cf7857e7b7d8354ad8246b5c77fe53ada841510af11b48db86d708a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8128-rs4gc-inline-asm-and-compile-blowup: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8128-rs4gc-inline-asm-and-compile-blowup.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6d693e0cdf8d4049b03d117f036666fa3170a579ef3c05305cfcd43802f9ea"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8130-fused-foreach-collection-reroute: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8130-fused-foreach-collection-reroute.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4a4ab6f51eda917c166a70d130726a051dfab8d91ed99900a8afc6a3df794c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8131-moving-gc-rooting-sweep: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8131-moving-gc-rooting-sweep.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5b8c2986a1fe567437f5a44d2c88f97f413187ee7ca2625521d0f7998b36a7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8134-poll-reach-buffer-constructors: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8134-poll-reach-buffer-constructors.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebe6dbfa673aabfb056a02c07c1d2f92e94059c6db065abee2d42cbfe5ac6e3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8136-buffer-own-props-death-prune: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8136-buffer-own-props-death-prune.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b565841a73229f91ac0e5fb2482d4055b6a191b7b4ec56df78af22d52bc86acc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8140-buffer-receiver-array-iterators: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8140-buffer-receiver-array-iterators.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2e939fdc714711fc3beab66a04a3a7f55423793f664c284d173362fd9817b1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8141-buffer-receiver-own-key: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8141-buffer-receiver-own-key.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a686a33956f9c47c2f85b6fb70e46b6eb822f38535c7fc0fbfe39aba35ceca09"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8142-clean-arr-ptr-backing-comment: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8142-clean-arr-ptr-backing-comment.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a83980ad9127ab328584a50aa6759e97012b46f3d5a3d54a8a37d593616df8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8143-rs4gc-boxed-slots-leaf-accessors: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8143-rs4gc-boxed-slots-leaf-accessors.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c9042c07964bb1e9ccbc7089588d6f092978c991dcbfdc6c7ef071ab7ab2a2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8147-panic-profile-all-workspaces: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8147-panic-profile-all-workspaces.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea139f8ec665ea6657faba44dcad162d1157ab3cafb83cd433597097f149260"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8148-typedarray-dynamic-index-header-owner: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8148-typedarray-dynamic-index-header-owner.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79510fbe957067649d1b72e5ca9940f69ba3bb128e64c46029ddb640b63a4b07"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8150-number-by-construction-locals: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8150-number-by-construction-locals.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2cc748d047ae2f3567c84089b12429753b7e728d69605037782d9f2de3c911d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8151-sso-string-receiver-index: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8151-sso-string-receiver-index.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a1a29b09e96ed94257447c4650a6e8532eda555456b6abfde1b8e418311053"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8152-deforest-profitability: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8152-deforest-profitability.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44987efed91fd1cb6ad034e8bac0736aa799a77614a12fc66e47d4bbcc896e2a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8153-nested-class-name-shadow: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8153-nested-class-name-shadow.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad6b685d9707ea44118f1df56100543f63d0276d2066212b05f9f96be7214ab"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8157-shape-descriptor-siphash: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8157-shape-descriptor-siphash.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a346f51e24d5d8fddef981e766c6c2faf5d113850d1a7d09942af2dfb834cb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8161-next-app-route-fixture: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8161-next-app-route-fixture.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10030498ace410db7a36459ed384057f8bbf2086d62f8fd30dce0e0ddb7f151c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8162-class-method-arguments-object: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8162-class-method-arguments-object.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eac7f6680a72f8f4eb21fc37bb2dd9b29e3384743b1a82dea3f72db7ed9f0a2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8164-stackmap-trace-knob-polarity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8164-stackmap-trace-knob-polarity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8968735ca8a3c80e63869ec7221cb44d0dac581867b30e0ab8337f4810734af6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8165-class-typed-parameter-guards: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8165-class-typed-parameter-guards.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1259737df99a95997ac9651dc88ed0db64d22f1f73b52e514b58f39898572b99"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8167-spec-clone-self-recursion: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8167-spec-clone-self-recursion.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fd78c1cbe6ba0484bbd5642d5ea9d2de4b46ac62e0b639e922a967a1664883"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8168-function-class-id-dead-key-prune: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8168-function-class-id-dead-key-prune.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"361933a1e0fa2d518d78cd0e0abcf998df95be96f937da2bf6c9df5a26caf452"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8170-statepoints-npm-ci: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8170-statepoints-npm-ci.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"199244527d48d93c95aef9aff88b73171f304f4d473b3df3ff4977c9887c9416"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8173-buffer-receiver-fused-array-callbacks: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8173-buffer-receiver-fused-array-callbacks.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0d248b265ccca64e66c5896a53cdb2f1d932f2e322fd2ef65abf23f9d4bd81"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8176-unused-doc-comment: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8176-unused-doc-comment.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9604a55270a539840017bf6ee406271836b2a25ddece72803017f5aa536094"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8177-handle-bound-method-name-static: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8177-handle-bound-method-name-static.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe3d24f7207a7a3e396be8da215a1c3eb04a039fd53645e8b48a2342f68b7dc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8182-typed-layout-intact-residual: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8182-typed-layout-intact-residual.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f80be558699e66c34a95ecf1d2a9fec05cac299873dc33746c4c0fff6021220"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8183-dyn-ic-reference-store: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8183-dyn-ic-reference-store.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d431c76e541215021e6d03bcf7af64207d88a0b4c4ad6a5338615ad202ea9f5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8186-buffer-view-receiver-kind: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8186-buffer-view-receiver-kind.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3ea18ff1b2563009b726a9032375bf5dcb54378c66f20ac0f53ef8dd597153"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8187-ci-tiers: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8187-ci-tiers.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0189a46376580938e4b6607b0d5b6bc1a9a524e2cb7223aaab77a6aa3aed0103"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8188-uint8-callback-rooting-and-hoisted-dispatch: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8188-uint8-callback-rooting-and-hoisted-dispatch.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"292f19dd48090dab31ceef99bbf2f3c4b51d95e626323fe0d525024a8c784dfa"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8189-write-pic-barrier: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8189-write-pic-barrier.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26cfc91628bd721be902598565163867ad455c1bd74cbbb3b9a54e75a6dec144"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8196-gap-gate-unreachable-node-fail: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8196-gap-gate-unreachable-node-fail.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee2dacf4a4f00e4da7376cb4419c2728736a0ed85ed2e8be6ef89b803b18664"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8196-rekeyed-side-table-custody: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8196-rekeyed-side-table-custody.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec6270c281dc6d60a941b619c1387d145460f5723252b92d7daa3e0415df7d0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8197-ext-fetch-test-link: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8197-ext-fetch-test-link.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1dd98c08c094d0604808f76ca7a4219b2b0e38f1b258fa790762cd62030def"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8199-thread-locals-lint-red: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8199-thread-locals-lint-red.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff3bc74ba19cc1e01a3fb5f90fd4e9433c7e083fee37da327c198ff2799c770"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8201-scalar-param-guard-leaf: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8201-scalar-param-guard-leaf.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2414b08512ddec5bdbfa307fb2070e72251eae4fcbbbe7f540de05662eec91"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8202-param-guard-per-object-probes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8202-param-guard-per-object-probes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb37279398d391d5562f939f46a50a80afc14f5442ee4729d2749a3efc65615"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8203-spec-preserve-none: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8203-spec-preserve-none.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"831b3824fc2f30f88274112e0675d706c574a68aaab1bee9658cdaa94bba953d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8206-gc-store-site-claim-verification: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8206-gc-store-site-claim-verification.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29a902c6757782ddd1333b03d06c5d27c59533380cb2daeae7fbb5e8c333952"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8207-root-dominance-c-unwind-abi: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8207-root-dominance-c-unwind-abi.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad3a79f804e3e7cb8ccb3b9bfff5e136c547c57aa6a01d08a42fa2c1fce369d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8208-async-box-release-reuse: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8208-async-box-release-reuse.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4289f39760274275128e8ee46a13d6b2497271022c98e84afd4d7cef5e2660d0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8209-next-gate-c-host-two-level: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8209-next-gate-c-host-two-level.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4049fd55fe8bde2f9da260be934f363f7af4e35de9eb3ec67eb36b3c88dad08f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8210-release-next-fixture-guard-knob: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8210-release-next-fixture-guard-knob.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fd447649e46a2f84f4eb2b627c5a4efa8be6febeb189f1cdbc0ef17ddd4c77"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8211-gc-8163-forced-evac-holders: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8211-gc-8163-forced-evac-holders.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2d432e2f01f08c6a6ad97ba5f81168789d8ab17bd484c2ca466713fee7be60"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8212-file-size-cap-split: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8212-file-size-cap-split.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e707acbaa9115c03b6fed7d209f45b9eb046f3dd61528239716329cbc7ddd2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8213-next-async-box-closure-lifetime: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8213-next-async-box-closure-lifetime.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"908933716a1369052861ae1435c2d9aaaa2aeb7bbdbdc5ea7ac0bed30fc7a96b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8214-ratchet-selftest-full-repin: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8214-ratchet-selftest-full-repin.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dacc4eae1d3cb94e2e3e1db3045eaeb800a2a0e9ee21de91b97a476d70c18a09"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8215-next-route-warm-soak: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8215-next-route-warm-soak.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b832abb9f510c8852ce985f3b4cf3c0fd3322b672483c9762e8141c2cf5ce65"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8216-gc-root-holder-census-ffi-coverage: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8216-gc-root-holder-census-ffi-coverage.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99bc048a452271036dcde33c5bc5b732ccd077d9ff5021b4b27bd7a3572420d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8219-proxy-id-band-exhaustion: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8219-proxy-id-band-exhaustion.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7469cea80a14f65d1b8d08c0f069361e9694d79df4058360006fabf4f0cd1b45"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8220-gc-headers-frame-roots: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8220-gc-headers-frame-roots.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d3069c3f09b45c75aa3714ac2699cb00dab9e2cb2540cb385f00a0f9443063"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8221-descriptor-keys-edge: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8221-descriptor-keys-edge.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1b4a2bd457e393bf3ba466ad885082939f462f6fb467b151fc0dc92a0b7e77"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8229-perf-hooks-histograms: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8229-perf-hooks-histograms.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e81a22502c4c67a5a415f91b8657d41d0299255a2982d6b8cc1dcc81ff38c69"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8233-unrooted-local-shape: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8233-unrooted-local-shape.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8662f141fbfc567995b9ddc6749e9075979196f4150f0b58db04fa9b4d0c7c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8238-param-guard-visit-tracking: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8238-param-guard-visit-tracking.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c14af79f0c72de7ee578832af47934a09b61c05bdff32747ce715898533748b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8239-windows-static-literal-identity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8239-windows-static-literal-identity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d783b4e7840de6dfbee0173ce203a10c3f141a1c31a2abc34201f39d6d680f28"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8240-narrow-callee-rooting-window: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8240-narrow-callee-rooting-window.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5731d7ce9c3385a4a2696c011a84b13179ab3f8ee7863dd8d13a6fb2029e7ec6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8241-dialect-vector-instructions: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8241-dialect-vector-instructions.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fe0bc5db68d5a9c3f2f126347450d7a38ec6436d0f4707a8cc59ff36704b5e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8244-parity-shards: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8244-parity-shards.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c67ce52c59555960e9c08c8aa7990297ece70e66825f0a5e46f5c611b8e795a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8245-proxy-registry-gc: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8245-proxy-registry-gc.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4408cd7c6d5d5ad84affd3ba438a2fef8b64beef2ba193238753e6345dab35"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8250-structured-clone-graph-identity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8250-structured-clone-graph-identity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a922ad7a455b37f5d0043d37615469117424a40bc3d87e40db763fd5fa0122"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8252-remove-this-set-diagnostic: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8252-remove-this-set-diagnostic.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ca56b4ce3be6d9846afe1b65628611a02d1216ec56706bb9ba19eaaba68779"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8254-perf-hooks-class-prototypes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8254-perf-hooks-class-prototypes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"958874ee1782fcdb48bb6e870e4bd2879705f545ee6d19df382a798eafa7e776"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8262-gtk-canvas-init: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8262-gtk-canvas-init.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8839e0b1932c62af7094cf77496aa1f71b2f0f2291737c913c12f3bac5dfaaf"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8263-loop-safepoint-purity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8263-loop-safepoint-purity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bee63103706029f5e9dbfba6efdfd6bee48fb788ba5d592e81b2c88b4c2875a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8265-net-dispatch-custody: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8265-net-dispatch-custody.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c1ba2cdf36ee6fb8412a08939a6ec8f1690c77da8f84ced7ff76a0ae81569b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8267-operand-rooting-misc-methods: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8267-operand-rooting-misc-methods.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae819f13968ebf7314d38191ebe8793c400b25872a1fce1bcf5dd2ef0a969ed4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8269-native-module-object-enumeration: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8269-native-module-object-enumeration.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5842fffc65453fbc87798c918042c4b7a4a8f0249a39104337fa3dbab1421f9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8270-windows-mapview: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8270-windows-mapview.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a92cd6eec5690be05d7864aebd2701c4b8200a802d01ad86567a8d738aa8e37"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8272-parity-crashes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8272-parity-crashes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de76f21d99b085959e1a1269217a294eb90d3695507bce47cad38dc149f026c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8273-parity-debt-baseline: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8273-parity-debt-baseline.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fc52e491587c6764ba514088153a715356f0d28f7c3f0e271aa41c1dac5cae"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8274-next-gate-native-backend: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8274-next-gate-native-backend.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e9d778319a6581adc01a9e0a82d5b9a21d995dffa37128322d880e7931c550"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8275-static-wrapper-builds: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8275-static-wrapper-builds.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ca003d7c780582624fe193a1066a78ac559b408190381c9f57b9214e9c2184"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8276-perf-hooks-timerify: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8276-perf-hooks-timerify.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ec6b4b68ef787abf7d68e6091ac7f7b3e5737513f3beb0274fccbe4c790e7c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8278-aliased-native-constructor-proofs: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8278-aliased-native-constructor-proofs.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b269bc773be37636bc91728ccd2dd1c0d58165a15abf943de8a3c491ff36cba6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8280-typed-array-method-availability: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8280-typed-array-method-availability.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72886fb03a3e993eddbcd67cfe01656c05ad69bdba70282e84436a6adea6bae"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8282-dynamic-object-rooting-process-emitter: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8282-dynamic-object-rooting-process-emitter.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf9ad4325ab6fd50ca2ebb6ef62e19f2e106804c287f339cfe40ae1cac9abcc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8283-bound-llvm-scratch: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8283-bound-llvm-scratch.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0dc0b86ca40cc10382c8290f0a6318ffc6d8ad8d74c6101c164b30b2a56ca9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8284-static-handle-method-names: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8284-static-handle-method-names.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0207c6c0c1e38b9e6397911c84203b8c661b80995a73cc4788983079e541f1e6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8285-native-scalar-conversions: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8285-native-scalar-conversions.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b340b3e56d14588daf26a67569fb7fc61654af8fbad5f606a3634d6a1697448"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8287-alias-construct-featurestrip: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8287-alias-construct-featurestrip.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6765496ab50ce3a69b721a5588b6e85ce2074582b04ff13bc5cc58faea769051"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8288-enumeration-raw-handle-debt: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8288-enumeration-raw-handle-debt.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fe42f322e9b0ae0a1266298a94cf237b4c4f139ba89055004f7a679cfb4151"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8289-polymorphic-closure-dispatch-cache: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8289-polymorphic-closure-dispatch-cache.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ea37221c40110c9dd6f7599df6a77b02db34f31fc830a686edd03469984d23"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8290-tier-b-self-recursion: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8290-tier-b-self-recursion.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"133a4b00dd84d4279dbdddb009205513c0a4e515232718dec44abdee18355966"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8291-node-version-26.5.1: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8291-node-version-26.5.1.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63be55d74e183fd243992919f34904f8d47c4e688b46d4ecc678c4087a7aaa07"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8295-native-region-proof-gates: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8295-native-region-proof-gates.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f998cfae0a22e31fc4985fc3f5c1ef333550a1eb36df2636dcfab08e152914"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8295-process-emitter-scanner-registration: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8295-process-emitter-scanner-registration.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b42a3aa16c2866b6678a5bbca4a2c67b7cc91a83b1058478c23cef83211541"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8296-bound-structural-guards: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8296-bound-structural-guards.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"900fe8d6596861a76bc7b81ae1be1f0a3bc5e97af1bab08165864d726ba3734f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8297-map-only-object-start-stamping: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8297-map-only-object-start-stamping.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94001962d95d252a59df0912e1e2db3d36fdaca8a7186ffc98f95e2518aaf3d0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8299-wasm-esm-imports: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8299-wasm-esm-imports.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c933ef22a1527e49e97606b316152f971e700f7608f24aafe1105870fbc9af"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8300-warm-soak-classify: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8300-warm-soak-classify.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b93b048583e4349b0a83a393390611ebce0abbb6081ee56df4f22a934bb572"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8301-shape-id-typed-layouts: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8301-shape-id-typed-layouts.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c47383f6ba4b64ffb339582b1b71da71589190531760b1a94fd88f6ec49de15"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8302-native-abi-evidence-proofs: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8302-native-abi-evidence-proofs.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d40507cee44757f887da7139ec5cad3fea1a904514c4f47c33f642c6bacec7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8304-threshold-floors: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8304-threshold-floors.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a7c823d5bc7b9c96a9fa12b121512aaaa78edd4acc78ded348b8fa937a3c6f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8305-webassembly-raw-handle-debt: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8305-webassembly-raw-handle-debt.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c51bca5a1333451ee6259534533929164686a50f29398fe1666cdf4acf48d96"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8306-run-lint-gates: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8306-run-lint-gates.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe22f41784dbff44cc2f77915677ff24f813d527600604698eae18c538bfad0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8307-ui-wheel-picker: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8307-ui-wheel-picker.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01ec4499a8f3faaf03913fc5ac8948f94ccaabf1abc30672802d397429716ff"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8309-mkdir-options-object-regression: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8309-mkdir-options-object-regression.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96b7c4dd80f870447b3dd79f097c0f72f412a09caca803652924e4e49a9b04f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8313-object-header-40b: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8313-object-header-40b.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"792417be474b9c3a938f92f740eba3aadf78d2682c20d27af455b20f59e15d5e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8315-native-pod-conversions: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8315-native-pod-conversions.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98328db97b96400aba04a2d8fbf4578eea67b8fa8d35882ab5e8cca8dbb10372"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8316-native-stack-scan-windows: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8316-native-stack-scan-windows.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d040c79b06bbbac1fed851e48a046e5f40d95795142356407c204b2fa67904ef"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8317-imported-default-ctor: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8317-imported-default-ctor.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"339e5afad0fecdf61eb07277acd016dc53893c6a1b02dc6f21da1cf34e61dccd"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8318-windows-fork-ipc: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8318-windows-fork-ipc.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2c3312b960e21ca843f6ebc8c1ae9ca8f60424ef8a9016258bdeb6dc907f48"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8319-sloppy-member-updates: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8319-sloppy-member-updates.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d191cc1cb5ee0a7389e10ce5323327bdbce27a2abe77e906df9e523c1e7f3f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8321-restore-buffer-views-coverage: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8321-restore-buffer-views-coverage.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"246ee9aa43ed539ee552bfd746deb8f5dc705af91ebcad3098aafcd0c58717b4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8323-elf-provider-export-surface: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8323-elf-provider-export-surface.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a675625f46ef00331dac4326eb08bf0a3272bd0738feb274419c5217b9522a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8324-stale-shape-recycled-address: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8324-stale-shape-recycled-address.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edcacbeea872d6b7fb390e9de5c19c10c0c42c4c98830493fc7db51ba2fdf76c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8327-worker-channel-listeners: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8327-worker-channel-listeners.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67492df4ffa9ad03c06b32f047bbc3f25f401ae57e6c93f1b32d41ecc94aeed3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8328-async-hooks-scheduler-lifecycle: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8328-async-hooks-scheduler-lifecycle.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc4b4253944c61a19d8669edcec9a2b16c930723d1f5ba6039926bcc7ffef68"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8329-bun-ffi-memory-views: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8329-bun-ffi-memory-views.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f8565be257fcf36000ee21909a8675fd7391639b6331ab256243de8091682d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8330-native-u8-profile: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8330-native-u8-profile.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ec5e3084d3288684b3bd2293acbb8353743164326c8bbce823e6bd98e7298f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8335-close-8264-exclusions: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8335-close-8264-exclusions.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"972d6759da19adcbfdcd1725c6115981129f486984628345b9a3b65bc1b73370"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8336-staged-publish-pipeline: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8336-staged-publish-pipeline.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aab94578445430aac673bf57d1aa903943d744f482695c52c8daf45ac2abb6a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8339-codegen-dead-code-block-body: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8339-codegen-dead-code-block-body.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6949e9634bbac8c273558f713b775c2f8bb589b803feb0c9480b3ec786542ed"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8342-release-gate-regressions: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8342-release-gate-regressions.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0288240b701b01dd9fcee94ee0ff096618520e0a7277a62b0580c018a14a964d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8344-run-lint-gates-compile-tier: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8344-run-lint-gates-compile-tier.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ed86ba6eea0226428ab2c6599d8423997cc9de8a1f2015000a1f7425e3443d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8347-message-port-ref-state: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8347-message-port-ref-state.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e7daf6bc283b2e6e511d85ba344a0281bd537f574ae4dfbac36e8ba344b80c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8348-missing-relative-namespace-diagnostic: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8348-missing-relative-namespace-diagnostic.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f55232c1fcefc3d01be0aae014c9a3cb362fe033ec403c62e5e81f2f715a0ca"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8350-old-glibc-linux-artifacts: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8350-old-glibc-linux-artifacts.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c38906f2f3fef481b45ff9b43e2cc203e8d2c0501437ec5204ae2c4e671170"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8352-object-define-properties: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8352-object-define-properties.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e307a6418b9827c3c9c779f3a2e808e2c6ffd354b874f7a823c9cd9dbb646926"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8354-fmt-after-8337: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8354-fmt-after-8337.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be321fe4678e1f537d3288bc1ee6056e3d6b3107303a279387f947ec4c0f818"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8355-split-timer-tests: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8355-split-timer-tests.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d877b1f7ecc6a97ca8b4256b58b67b94119081fe3f36c2e90f682cbae6f7d2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8356-fmt-after-8343: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8356-fmt-after-8343.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92653caedac81f70797c86602a1bb8686cef2a2716fcc571a223a477bed95847"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8358-inline-asm-leaf-emission-regression: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8358-inline-asm-leaf-emission-regression.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fed66c834f3dfb51d2270e6c525692af8bd47b87e3c96344f0c5c458d8a859"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8360-node-test-mock-times: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8360-node-test-mock-times.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72960c751a6c1c7e56a446ddca5869139c275e45a554cfa0a016fb36bec7a650"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8360-sweep-schedule-backstop: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8360-sweep-schedule-backstop.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f9a8b8a64d6c8cd8bde431c60509f7906f5e9baf53c56e66f104778037b4d5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8361-datetime-format-range-partitioning: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8361-datetime-format-range-partitioning.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb58b8bc654cd78ea7c6cfc83c8c78c8dc4c9c58b4550f38475f366438feef43"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8363-mixed-layout-constructor-stores: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8363-mixed-layout-constructor-stores.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1bf15d6fcab053e35159976865b4af9a06f953f09beac8d2c88051ebe276847"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8364-intl-segmenter-containing: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8364-intl-segmenter-containing.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6640700c75c0688f6ee4c794a8be9c882e7d871498568a4e98118ce72c2e53cf"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8367-ctor-prologue-store-audit: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8367-ctor-prologue-store-audit.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee12bd029bd5cd4b970e39e8a93348596fdc6ec0660831a9947688d103f7327"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8368-push-pop-raw-handle-ratchet: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8368-push-pop-raw-handle-ratchet.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c2a0820d0730dab75173785e0b21ce164b55b66fa40e85b6c4825624730be2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8370-buffer-pool-size: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8370-buffer-pool-size.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb0fe14d18ca5fa7d2e15e0a5b9e7c62b16e0f2a4a633e5fcba852614c12ff5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8371-ffi-promise-booleans: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8371-ffi-promise-booleans.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0509d789550b6ec951d58536f8ee2a34747d86e3eda541eabb1774aa16db0817"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8372-mock-timers-dispose: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8372-mock-timers-dispose.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"377f07314b84094f866e78486d2147b983b6390dd49bd81bd83090c048bd9414"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8375-segmenter-raw-handles: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8375-segmenter-raw-handles.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed40535d72b2a08a8f7d468a670f3f9419d7fde7360dfec66ae88973f8b3dab9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8375-zlib-unzip-crc32: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8375-zlib-unzip-crc32.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a034683dd702e6afe400fe493d11ac8ea861ad0695535d3a08e862ac86b6e82b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8377-next-app-route-dylib-cwd: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8377-next-app-route-dylib-cwd.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"773233edcf67e34c0704ead8587cc5de71c3b8f1a84f5dcb8a53b1e587a9c203"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8378-codegen-exclusion-validation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8378-codegen-exclusion-validation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9f46b0b2418f5a577c0b74ab7be207274a9137e4f530357309116d8e6976f4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8379-noncallable-locale-string-methods: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8379-noncallable-locale-string-methods.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cfdbf10ac2d2b3021c39640fa5b853cc402b802e4f7d204a61d52f4737823b9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8380-cjs-wrap-builtin-coverage: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8380-cjs-wrap-builtin-coverage.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"373535e78e8fd18f2f387d6d4097cf5d420575a48e6acf91b706fa1c90ac76e1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8382-fmt-after-8380: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8382-fmt-after-8380.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a174cf28c77dcaf8f26c403e90f3d6fa4e8bd2f239eb2f96452d00d5eb6e33"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8383-opencode-source-graphs: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8383-opencode-source-graphs.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a80dcb637f19906bb41b95bb1954b69024ff96bff0a99a2d1ae25091d8a1dc9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8385-zlib-ext-gaps-stale: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8385-zlib-ext-gaps-stale.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0cd933706d76a6662820577fde61abd31d9ff9bc36e3399b2aa7b5b81fa7d3f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8392-async-box-frame-cost: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8392-async-box-frame-cost.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a776fbb39f6cae36ed223007ce4062c1962c07758de996ae8f5b6ef98af53d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8395-relational-numeric-fastpath: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8395-relational-numeric-fastpath.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b8bc37df6f4ff331596a46137c8c2b8c1eed1076ecbbfd678855952d85d16c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8396-prepared-archive-cache: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8396-prepared-archive-cache.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c734406a4a3caf661a8a79481e38b5bd2d091f106dd01509d15c82047078d7f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8397-builtin-closure-gc-metadata: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8397-builtin-closure-gc-metadata.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11145194de8d1332a60aaeb79e20d40c2081a55f6d04860c3824d9044696533a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8398-fmt-after-8395: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8398-fmt-after-8395.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dadc5ced0f39de92c333171a06af7f27122cbce552f383066964624102a32872"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8400-array-reverse-exotic-indices: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8400-array-reverse-exotic-indices.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"692cf37d0f67f3a25ce86a5ef5959e6617d71de24804bcd2bb90915b6c5b8528"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8403-native-module-name-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8403-native-module-name-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b55284494b82856b12ca8d41f779ac4bbf5ad6ae254f3890c0b773aea0f945c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8404-h2-rustsec: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8404-h2-rustsec.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3232d05dca2cda40abfddcb37caa80c0dd009004bcb4c8d1f3cd1155b599209e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8406-shape-header-reads: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8406-shape-header-reads.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e050408fbaf11b777e67063ca235e654a0f2799244ed061b54d0d5535a9ffc6e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8407-inline-integer-remainder: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8407-inline-integer-remainder.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5192577205ac4712b68e2bd6a5520b34bc032bc9eddfa35af32a87f13a435e1e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8409-async-event-path: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8409-async-event-path.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc69fc17446554e8afa4f8c764402729d1ab7a27a875ce9feca28135c8fdf00"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8409-redundant-microtask-wakes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8409-redundant-microtask-wakes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1693a814f9fe86ba79f5d04cb9cf5ec83045002afecca26ca2aa5b35a114c2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8412-shape-classification: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8412-shape-classification.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a308dc3d221cf1fa270a55e88f385cadc5bb3043263b1fe30fbe63edbbf5300"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8413-pre-register-typed-shape-layouts: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8413-pre-register-typed-shape-layouts.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4164f7181eded0bf6bfd826a3321a5847fee4be79845c063c557dfd3aa0f6a7c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8414-element-shape-locality: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8414-element-shape-locality.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6c3f1c53fda6efdd92ddd1abf00c12079a3a7ef55a451279852ef1e30fa483"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8416-function-apply-linux-unwind: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8416-function-apply-linux-unwind.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9235192d8d9002e154b40679eab26570b708b1693b61229ad426775726b7c883"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8417-string-accumulator-chains: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8417-string-accumulator-chains.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb930f4b107c003d024c623428b4696cc4a11ad3cf53af3ef5f79e4d174172d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8418-generated-bundle-size: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8418-generated-bundle-size.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f57e43497622952b7777fe26ad12bb9b9b0516950b7454831a9453751624b27"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8421-ts-friendly-compiler-output: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8421-ts-friendly-compiler-output.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"867a03d6467d8ed9bcbd3870e2913555304311696402611b3b9af4efc9dfa981"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8439-gc-safe-string-copy: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8439-gc-safe-string-copy.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d167b38a681d81c24b9679d1149cbe5b119a140efbb57ef56d52482a36b0154c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8439-size-opt-default-on: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8439-size-opt-default-on.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9881c4470f321a59e70d5b85a6c4bad7b2b781f226976a72732e920de01275df"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8440-punycode-owned-string-bytes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8440-punycode-owned-string-bytes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d326b497f24dee1792cfac61b5e068f35732fc89b897208c6a5c0ea394b85fc3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8441-remove-legacy-compose-ffi: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8441-remove-legacy-compose-ffi.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"375d3932fb11c6055b0f4a24783deffaac22abddf56dbcace01f766b8c6649dc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8442-string-header-abi-tripwire: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8442-string-header-abi-tripwire.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7404f1ad961139b9dff2b7102979c6b36eed34ce2d81e76df763186f7fe8247"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8443-string-repeat-reentrant-count: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8443-string-repeat-reentrant-count.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff50814fbd12c0ce2b26b7072854ec330b05feb4e95fc96b152520319f39643b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8444-publish-pipeline-hardening: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8444-publish-pipeline-hardening.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a67fc48f71cd509b1c11221e6a82c07bd12960dbbb419e5a8bef5d14d9e358"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8445-string-payload-access: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8445-string-payload-access.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61bcbb6ed87952966d09e1faee85b2b68ea5ee93ae6e6644d7130564e5e68f83"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8446-regexp-lastindex-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8446-regexp-lastindex-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97a66657a6a73ded5028f5241c5c6406f2127a2395d66ee91e692ec62b9ce68"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8448-centralize-string-readers: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8448-centralize-string-readers.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"867ccfab0cdced3079727ae0606f65c4d12401c3d0e95435071163ebc7c1f456"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8450-string-concat-chain: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8450-string-concat-chain.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ff9332bff4d61c75aa6e8ce40e017d6f03b704c54ea207614713be0d94f343"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8451-normalize-form-coercion-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8451-normalize-form-coercion-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f7f6fc1c39dd1417349274ee28b6e809be12a71156ab75761149fa37fb8437"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8452-ambient-require-declare: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8452-ambient-require-declare.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bea993406c00f13c4842f33e58ef9731ff6382c8cec23c584813153e25b159"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8453-owned-ui-strings: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8453-owned-ui-strings.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb983b779d6b03aefcc30207a6cca05bd38fe8317542893f7e229ec258bfd46f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8454-string-accumulators: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8454-string-accumulators.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c65932f366bb6e366831cf400a489515338a60bcea25de2c06645a9086dbac5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8458-ui-link-evidence: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8458-ui-link-evidence.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bdd82a9623326039f332aea9ddba5e99c779a690d7cc302b045c6e4aab695aa"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8459-abi-control-static-barrier: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8459-abi-control-static-barrier.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2e89aaf2e3475a994dec4ce617947aaf3d306ebfecd655b9afb4b5a93b1d94"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8460-array-join-capacity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8460-array-join-capacity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce0051ae857bab97f6f689f09d3af431b4958861e52d5d51798dc2328be6be9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8461-matrix-baseline-ratchet: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8461-matrix-baseline-ratchet.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"828fa683855e7232ea21a10829d07ad821fbbe5ddea00f11287cd25b97ffe20b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8461-register-dark-gc-tests: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8461-register-dark-gc-tests.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b931ab6589465efa8f44661603bfb66dfdabd5ee81e51aa7c95e04cc7bbb564a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8462-full-tier-timeout-margins: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8462-full-tier-timeout-margins.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ad46e7a2761d5aaac554d78133e21fa99e7c4725f5fbdd9c543bb16f949c26"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8466-create-require-not-a-shadow: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8466-create-require-not-a-shadow.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10453cb4086f4cf4d39b3d38fb2b1c6353c11e08a8a084068e8f51ac5bff58ee"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8469-llvm-download-hang: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8469-llvm-download-hang.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f6137bc53b487dc37426503153420305923dabe4486e35269e8b1690c58e20"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8471-non-reactive-animate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8471-non-reactive-animate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec71321f5e1b378f896caa3f576caf050a7730a0353af0df3bb42446e327c312"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8473-strip-dedup-rustc-path: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8473-strip-dedup-rustc-path.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef119079eb5ec4be9a0c1102f8ba35048924676712836977ed95e2a2287a106"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8474-doc-perry-extension-imports: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8474-doc-perry-extension-imports.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"faeec899f7c9ef3ce9501fe041628b803d2615684fe98a825debc140e9efbc37"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8476-fastify-doctests-exclusion: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8476-fastify-doctests-exclusion.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"619f22a0c099b32597fe0780e09ea151dc8b45189fdf29f8d825c9cdcc863e82"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8478-object-locale-self-recursion: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8478-object-locale-self-recursion.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff8032e712af663a800820d883f062b6edbcb898269d138fcb598d1cc384a1b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8482-array-join-gc-safety: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8482-array-join-gc-safety.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9446d06484d3df1c4f261990d3d4df11aeec963795ba06a07dbf736c8ad8e37d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8482-revert-c-unwind-family: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8482-revert-c-unwind-family.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f2d916ca958c6972a8a6de533e8388a91f798ddbee447179adb0877d23d7d4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8485-remove-c-unwind-guards: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8485-remove-c-unwind-guards.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"092a8e6a909b5ce6c344a01d21c8083e71df20daf661137a9ec5d29a0db49b0e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8487-empty-accumulator-identity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8487-empty-accumulator-identity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8254483e26c71d5c459eb3f60a4beb4f759fad12d57147923dc901f08b48644"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8490-vectorization-allow-control-flow: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8490-vectorization-allow-control-flow.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1d6c4914aa23327981c6eaff0ec6a360dd094a9f788340dab2b28bb464e7e6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8491-numeric-envelope: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8491-numeric-envelope.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fa146c78d7e5b07670b1a13e7a731dfc2e2dcdbd107efd2267774788baee98"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8491-test-runtime-panic-strategy: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8491-test-runtime-panic-strategy.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47244ed41cb1005106de879669133013dfb36eaac828f7d3fc502b0b8d8989dc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8492-function-apply-release-runtime: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8492-function-apply-release-runtime.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eece80370624700fcf6dde0ccca9e5bd736e79844d5b8617c8dad7797b31195f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8493-raw-handle-iter-methods: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8493-raw-handle-iter-methods.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1455450e37c0d37899ff25d1991e6e026b0d7afd4f43c19f8c2730803f930a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8494-redundant-glob-imports: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8494-redundant-glob-imports.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1c8e1848c1de5fdcef7d80b9c5b1f797b2d0365266c2df4d4608feb1ddf712"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8495-glob-imports-sweep: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8495-glob-imports-sweep.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6ff6b2a3176b799649a3aef418d36ed0ef31bdc335e9328407362e41d40855"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8496-putvalue-stale-operands: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8496-putvalue-stale-operands.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a09ae6f2379491a041900368d6015aaf06bf415355137f44aecd3f726daeeed"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8497-string-append-chain: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8497-string-append-chain.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"171ba4a184bc21680984b57765d68580a2dadefc4fb2139102ab42276a3a5ad3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8500-implicit-this-direct-access-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8500-implicit-this-direct-access-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ce5d1c9563a4695c3ddd66b0a3a462bf395b1c0ddec67b7bffb8201a3616a4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8502-string-payload-ratchet: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8502-string-payload-ratchet.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b6848eb1d3208443574dce43ffd66e0eaf41074d675937af3672b3e0d582c4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8503-taffy-013: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8503-taffy-013.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"542430f8e8184783fd17458ec02b41d111d12fa734c26c6d950c783ca7af6024"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8508-wasm-bindgen-live-state: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8508-wasm-bindgen-live-state.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56eeb977cc6bb4424f2b796f8b636b242e94ad9df2c6205362cf320414f379b1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8508-wasm-instance-constructor: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8508-wasm-instance-constructor.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee15caf1db801fcf988279357ef7917c81728d5ff26056c098ba262a7615f1c5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8509-web-worker-aot: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8509-web-worker-aot.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2182ac9b832c22c91ad9fbdb5a59f6857baedc84fbe1bd272d5cf271086cc5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8517-opencode-assets: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8517-opencode-assets.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a0382974ee44e0d330b2c9ccda8c95675f14067b14667cf10a4284789481cb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8519-implicit-this-two-line-forms: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8519-implicit-this-two-line-forms.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8f390a6862e18a18876f7ce2feb050ed4c8d37b2bec8a3d4c3d996b906b2f3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8521-async-hooks-track-promises: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8521-async-hooks-track-promises.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"738c031e6f35ca45a7f290b9d2b53a1e4d89ebb9875b7b0667e4cb6db77b4426"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8522-bun-ffi-callbacks: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8522-bun-ffi-callbacks.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7b32c541034654f458a5a82ed006939d2329f03223b3d1be06f4c1284f3d16"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8523-node-api-host: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8523-node-api-host.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd32baffc463073d06a7ad3031def534cab8b32c98452e28a91a2962eddf8001"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8525-bun-sqlite: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8525-bun-sqlite.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10704b19c778aea37d4746c5dc29314647761e4a39a937da3c23f83133c1b048"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8528-module-path-registry-per-heap: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8528-module-path-registry-per-heap.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55acd5111a845fa95dab84ac592873f253051475cd310f8294bedaca639c0e9b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8529-aot-reachable-js: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8529-aot-reachable-js.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a54673bd3bb2b5fbb5d95fe85802a4da5b54913f99fdb54851770e2aad0b79c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8531-child-process-writable-callbacks: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8531-child-process-writable-callbacks.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0abe24ae294432557ea3eab2ff6c6acce9bd59e5137c3c8c9eb23f2e82fc80"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8532-parcel-watcher: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8532-parcel-watcher.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a279a22cdefc824b5edb8c8fa22a400aefc161caf0b84e978f722676282ed77"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8533-package-instance-identity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8533-package-instance-identity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63c1ef9ea013f57067b7f209bfe825db89f221b13bcf530ce67c64804e5207d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8535-typescript-transpile-module: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8535-typescript-transpile-module.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8c092d5d0bdc8b3332c716fa14e76942e37314bdd35f4766cfb6ce0221ad25"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8536-udp-multicast: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8536-udp-multicast.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"feba6af27548c64a627457ca36015f5a2af2f73cb15676ea1605cb4756172e52"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8539-interp-small-layout-mask-cutoff: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8539-interp-small-layout-mask-cutoff.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7c566c03a8e3d735a7718a85b85e75ab7acc830e1d6f6ae4c20ab1c2a06af6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8540-number-local-root-slots: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8540-number-local-root-slots.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a38e966436573333f57baf6656771e9358313e40c99286ec3f35a5133f248a6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8541-raw-handle-ratchet: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8541-raw-handle-ratchet.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80072e923fe31a4303a66b842311fcdf49c3a0ae3cec678bb54bbc48cf908c59"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8543-import-meta-direct-execution-guard: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8543-import-meta-direct-execution-guard.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5945ec82a2b110f2f65486720f3523da41e903ba6838dd92ab1dc92dee39c14"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8546-multi-app-fetch-scanner: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8546-multi-app-fetch-scanner.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0933c27b9e2c2968f0f079b9580d0ebaf6f0d4adf516120114f692662e4759"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8549-revert-require-stdlib-link: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8549-revert-require-stdlib-link.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35aa6a2ce5ffeb426b12c6641fda1eb832f7f314c301e1a8976ba6284dee42fc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8550-rust-1.98.0-pin: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8550-rust-1.98.0-pin.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32899f8899ee87fb8615ed07e454621b8337d6c882a4554e5b6f72992af23da"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8553-require-stdlib-link-with-isolation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8553-require-stdlib-link-with-isolation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d6c897de65d42a90b26c86467bb2221821f5ac0ddb85457edbbce80ce9c0f6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8555-regex-owned-captures: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8555-regex-owned-captures.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7685a3c26695e23533ad86d976fdbbb1a2534383616d9205fa3fd3a549de9347"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8557-pin-scanner-latch-holders: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8557-pin-scanner-latch-holders.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b69f7f457001f3fe9a490fd2fa4b6d37e33e73e14a5322246ba0c90c282e229"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8560-regen-api-docs: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8560-regen-api-docs.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e86e77f2a14c8a65f38572126bddfd6715f26c9bb575f86ec7f7638cf621e1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8560-scope-read-pic: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8560-scope-read-pic.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a36e74fd0a058f178bc6d04f881e012363f32f8031ff86ae6ae2e933e1096b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8561-rust-toolchain-file: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8561-rust-toolchain-file.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0815bd3f5e7f40bfc5ba6b01dc75b3b41ec235abeeec2436a7beade031f0acc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8565-native-async-test-isolation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8565-native-async-test-isolation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45878c6f3430e6f1e068f822102429d6d1dbd878135e2ff3ddb57242b25bd42c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8566-e2e-scoped-drift: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8566-e2e-scoped-drift.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3e6839a4968954f01515b16cf48466298b62bea4b8f437f54060699e7d3a62"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8569-next-dylib-provider-host: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8569-next-dylib-provider-host.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2061b77ddd119aa5c34bbbe8657ab17772ef2ceba5000e2d337c92ea4e83b9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8570-ic-miss-raw-handles: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8570-ic-miss-raw-handles.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef9ecfd1997c772d0d00516562c83d8da8d5dff3d2a950e1ac0a30c6ef3ceaa"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8573-fmt-ic-miss: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8573-fmt-ic-miss.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"331855f165c61258c072196ca778a86735b228c5fd2e576db38b5bcdf7564ecc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8573-inline-method-shape-guard: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8573-inline-method-shape-guard.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d89706f5f3816c7974990129a5146ed2260debe1b64c494ed0a98b71207370"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8576-report-size: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8576-report-size.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b383f01efa0c3e685a14bf74c5f92d71591d1796355059cdbfe3c49cca8886f0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8579-report-size-enrichment: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8579-report-size-enrichment.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c5a8263dc81645c8cfcd7c23805e1220c2e122496a16f026543b094502d880"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8580-nonnegative-index-method-clone: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8580-nonnegative-index-method-clone.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d77209621433481bd41b332f534fd4d5a89c3822bc3c3375d0b2199cf2e4f5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8581-8434-join-and-builders: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8581-8434-join-and-builders.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"059560a58b1503831fc4ca2f8707c4bf114a9c47680f2cff17d36afe3e974687"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8582-validate-forward-target: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8582-validate-forward-target.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44dd1344acc4aeab24683ca80bc5bd7b3be18485a53fe2eb6b781a7a4796dcaf"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8583-count-store-safepoints: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8583-count-store-safepoints.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4019961b51eb52e0ff096ea6fce9392043f1049487792d664662de42bf6b9e1c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8585-precise-roots-linear: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8585-precise-roots-linear.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1708c792a67640620f20d6b466c2f160904e58711b36c046c6e811a993840d01"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8586-rs4gc-budget-assert: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8586-rs4gc-budget-assert.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e74db6078a76204aa5996844e77302be264ec71d58c1357da0ad0bb4f7f259"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8588-pre-statepoint-inline: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8588-pre-statepoint-inline.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffed6dda4936720f4543e12db7bdb4b61802a0a297c4864805e5c2d20df4454d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8589-root-spill: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8589-root-spill.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d57177a0de6d145d5b2049154d24b2cfba4926c239eb6f14b11b6b556cd8f7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8591-pic-hit-path-shape-token: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8591-pic-hit-path-shape-token.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8888d7d636c3e8559536834f050370ec39f4dd8066cabe2e438fd58b212fdf88"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8592-pipeline-function-calls: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8592-pipeline-function-calls.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b43808cdda15500e09377694948fb7e8a2d27160cfb4f57a47b6e8f25ca6bee"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8593-native-unit-workers: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8593-native-unit-workers.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"267e19d71d523ba616844fe440b5696cd3253904b2714621c8536c5547446323"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8594-prefix-update-index-ranges: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8594-prefix-update-index-ranges.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b42d005a3292d00b5b526fe319283cbad23c308dc4cb0b48391d4835094082e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8595-entry-outline-analysis: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8595-entry-outline-analysis.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fef89d00a84144bcf6f8c3268b5b70acab7a14032e24e9f0cd01fb39e167f79"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8595-entry-outline-default: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8595-entry-outline-default.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9dbd0b20e592f3d921c259ac91f4371a45ed2a2b6b693e608b41fecf1f93fd2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8595-entry-outline-transform: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8595-entry-outline-transform.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf29b906096fbd827f057dbe0c950272545eb06977939dd52517f7a133b4b7d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8596-leaf-classify: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8596-leaf-classify.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7248c3a6696ba4f77eaecf4b08dd2977e69e342551020f6ba5e6a08f6d75c25"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8596-transitive-leaf: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8596-transitive-leaf.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89381c1e1ca391c1ab5d38f5374c694375923deab0e8533414f06c40f8a00bc2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8597-short-heap-string-equality: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8597-short-heap-string-equality.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2607b17c407dfb2734c5b08975ba4eb5321561d3dd29e00ce7548d82baedb707"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8601-zlib-async-symbol-ratchet: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8601-zlib-async-symbol-ratchet.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2952365bafc66aafccf9281f0e125051dd0b5cdeb56fb051470a5e6c1036fa4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8603-transitive-return-class-metadata: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8603-transitive-return-class-metadata.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"023db3a2a8e2c5cdce409a3b6521a2627316ee7191e1a3285bcdc89a8b98abd2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8607-pipeline-null-default-add: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8607-pipeline-null-default-add.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf492069fa99928665279141491bcf22b01082f3f18d5feb448ca09016f9a66"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8608-http-agent-keep-alive-timeout-buffer: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8608-http-agent-keep-alive-timeout-buffer.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01fda93db7f71f6f494a09bce10e184a36d3b976b894942892456e497e1cc20"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8609-ios-touch-scroll-mutation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8609-ios-touch-scroll-mutation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3c69e4415a2161a5e98c9888be5dd3a81ad42c720019a293d3059316fabff9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8613-guarded-array-i32: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8613-guarded-array-i32.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf272d0b092c505edde79f4ac3cca5e1dbb0d9993b56add649316d0c43b8bea"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8615-http-agent-lifecycle-followup: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8615-http-agent-lifecycle-followup.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1736177435b52a3ad35125e8304b20506bebb0a9cf1cfa3775d6a708959dd703"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8615-ta-module-global-read: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8615-ta-module-global-read.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6570b3d67e4b4f5d33095f9ee3eebf557a1fb54bbd9eb2d4cd3788a84c56a3cf"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8616-hoisted-arrow-callback: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8616-hoisted-arrow-callback.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9345315493f9b9543e84fd4017ad8a920351fe8e2bf6b09ba3a6f5801c441566"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8618-recursive-arena-state: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8618-recursive-arena-state.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a4a4ca7cf70cce97e5c53a88f7b2757d261ff63d63d041aa5ee8a4a3c2e524"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8621-web-textfield-callback-strings: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8621-web-textfield-callback-strings.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd50686154d04b542ea08b010605e3a8e85ce4a176a89dff0f28a9c8926f196d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8622-prebuilt-stdlib-http-isolation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8622-prebuilt-stdlib-http-isolation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"789d284b04c9c24d8c7fde04dc02f08ce29f6372a69406a7ff91d36706a5cba9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8623-fmt-module-global-ta-test: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8623-fmt-module-global-ta-test.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f415e4525115acd0d185892242bcc5313c9ad88a369c2d3c0492f7953ad9897f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8623-root-spill-threshold: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8623-root-spill-threshold.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a83703a0e33e6d0e999bc60122b0fb480627a1300288ce44a6583efa4c7d637"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8625-ta-view-param-number-by-construction: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8625-ta-view-param-number-by-construction.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb51ee7f5f6aa5aa32b18c71a3bfc314bfe288b4955493022f4f1b1a4b78a57"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8627-report-size-duplicate-body-accuracy: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8627-report-size-duplicate-body-accuracy.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02c117c7ba23e1f37cb82d75d9b71409ba0bf2a7d35f805dc3a8009362e2652"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8629-prune-tolerates-missing-deps: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8629-prune-tolerates-missing-deps.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57aa9d35b0aa8ade2eae4a17517684220ef4fab3fea3dd22ca83d36014950b45"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8630-class-semantics-tail: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8630-class-semantics-tail.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"465012e29fc74f9478e22d811349f7eec7ca3a590dec640f7d8f0682f104b663"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8632-http-https-parity-tail: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8632-http-https-parity-tail.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5244352e00d24a0e421200a534fd5d0d153bae7abdf421e7cc67eb837cdddbd0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8633-spill-inline-aware-estimate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8633-spill-inline-aware-estimate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad1449638c935ba663051586e3448b48507c185067137030c81172da6131f23"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8637-http-review-followup: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8637-http-review-followup.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5e5a78c8a7bb232e84666f5b4e28a0bd1a8905ab544932a5d56c6c6d798456"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8638-node-test-runner-parity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8638-node-test-runner-parity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"670d95caf949e9c9e841ca6c69af4960ac2f3381380a7cfbde070d76619a27b2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8642-trusted-box-callbacks: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8642-trusted-box-callbacks.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55014b015243a6dd464318b863615fdec6f07dfef571e0e0640640badf96b6e9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8646-computed-property-reflection: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8646-computed-property-reflection.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7f8df00831369edf97b746e65514f056ceba4c94cd7a97b1992f2bcab72f0e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8647-const-array-descriptor: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8647-const-array-descriptor.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56378493a9638cde047db7eac0faff586f3807901057583e4548d8879b24cc7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8648-class-field-init-fast-path: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8648-class-field-init-fast-path.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"422bda82bd3029ba6e0190a875f9fcefd25a5cbada2610b6cea47311713c9be2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8648-ctor-symbol-returns-undefined: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8648-ctor-symbol-returns-undefined.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"234cdcf82e93c9cd8b7b1c16e78a2b82049dc438090fb5f6422aa7f4f1d13aee"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8648-derived-ctor-super-scope: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8648-derived-ctor-super-scope.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22ff50ed47db7254aa02f11006aad3e40f53e4def1d7b241bf4199d41d1337f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8650-test262-builtins-misc-tail: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8650-test262-builtins-misc-tail.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2485325fda172106f722a037cbfe188de453ef49967989d116be0590a82e694b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8651-array-growth-generation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8651-array-growth-generation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d9fa0c2a67d2c128683b5f0f032fd397a1ff28e031e5f6528b9036ed742e54"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8652-diverged-block-guards: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8652-diverged-block-guards.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35df9f8fa298622bf25bc024f7e0006692579ffa36418fbaa96edac0670453e9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8656-collator-compare-accessor: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8656-collator-compare-accessor.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b335be0d915f629527a3c89da494bdca6cafa4443df4ce12d8aa30faa88fc18e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8658-restore-lost-unary-pos-assertions: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8658-restore-lost-unary-pos-assertions.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b7156da20cd150cf68a72de65760425a71d621094c5a7b85c77efb1d9dbcbb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8659-follow-up-review-fixes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8659-follow-up-review-fixes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad32a3412c4aa0e5c5a782c7f0873dc9d2bf34919eed2077bcd7927f96c19104"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8659-intl402-worklist: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8659-intl402-worklist.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a1e34db5f0ac8f45a83554736bac6dd6e177f987f35de970979f2402ab130d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8660-regexp-repeat-matcher: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8660-regexp-repeat-matcher.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a48386ecf16bf240cec1315c607947ffdfa6f95d5351c22f08b1a4b17ccdd8f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8661-effect-advisory-cleanup: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8661-effect-advisory-cleanup.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69950621a7c5f8c6137e74d008abc8fc0ef9b9440ff79c9cd21201680aa85441"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8662-5895-review-followups: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8662-5895-review-followups.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db0ee03fbe6d515ec8c04807dcac7d6c157433cc623798432b4dc9a4d2663da"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8663-node-tls-parity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8663-node-tls-parity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c664d9c8ff952ba88cb975eba55005c7862041c8e9f07eded799eb430902e5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8666-imported-static-update-share: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8666-imported-static-update-share.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e440d8912f8837c6f2b5659db350a795a81d9e0a2351195d54a5b2f24776198"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8667-regexp-repeat-matcher: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8667-regexp-repeat-matcher.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f1f7ca8f56cbca33c50aef6455c96765e8eca03a7c3eb457f4f5e13df683b5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8668-array-subclass-indexing: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8668-array-subclass-indexing.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60444d8d53f7e70a545fbabe5f4d3d3e2b0834a88d7ad6cc0a274cd5aeab8081"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8670-refresh-rooted-arrays-iteration: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8670-refresh-rooted-arrays-iteration.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7adb1778c143689878026e65630abf1c5dce7ba33818fbf06a0b88452d0faf45"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8671-async-hooks-parity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8671-async-hooks-parity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f217a60f511df0015ff28d386110807489f0a49f2dfc4d724aa475c6e7d38f25"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: Restore method-scoped prototype guards: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8672-method-name-prototype-guards.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b94fd4e061b4804d8d66571b92fb7274b455113141b021050bc3ee0ed7006d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8673-report-size-std-internal-filter: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8673-report-size-std-internal-filter.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"076b18ab908271c135502f49daf449ad892dbd74ecbed80f031b0a4bda0dc99f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8674-array-forwarding-path-compression: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8674-array-forwarding-path-compression.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"085056d689ba9cc883a4c503f560089d7d998b6f6b4edb18538a28a461e3e165"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8675-dynamic-add-tree-guard: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8675-dynamic-add-tree-guard.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3afc071916408102fd81d09a15c3f294ffc4b6e1e2c3ac96a20425bf335446"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: Pack monomorphic method shape guards: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8676-packed-method-shape-guard.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b048ab3d4d4070af29ea78d62ae8709594cfd193b2c4b614bdba70b4e2bd4f3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8679-rs4gc-budget-spill-retry: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8679-rs4gc-budget-spill-retry.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d987f2f5bcdf21532fa2218d7172490b5e846f175744a5db2b6e96506c09377"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8685-fix-main-red-lint-cargo-test: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8685-fix-main-red-lint-cargo-test.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7eec46bd11294f55c7c3868dfe8359cab7ea4062a1fc08a8240c302566d277"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8690-loop-versioned-packed-arraylike: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8690-loop-versioned-packed-arraylike.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"230ca4886e76076352823a0bc2c8541a29a85d694bde704d0f6ff9b5cd2fc167"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8692-guarded-uint32-rmw: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8692-guarded-uint32-rmw.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"945a2b2f78f00303a6bb2f0d00b6c9f3b11cb7c9a21950ea804bd0421f320ca6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: Specialize imported methods that capture this: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8693-imported-this-specialization.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6aaa9b746493c883d6257be2539f43a63deec7ebb3bd35641370271d5286d5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8698-strict-eval-legacy-numerics: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8698-strict-eval-legacy-numerics.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bedf80945c36a141b96b9b7d91acef3af41832dc792d117174e5b46843d306a4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: Inline trusted boxed capture access: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8702-inline-trusted-box-capture-access.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f40cbb96a0a7b1785d0dd28956f5abc18752ea0e5dbb427956f7c2a2acf0d5b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8703-scalar-aggregate-calls: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8703-scalar-aggregate-calls.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"983cdc824a799932e0b669212d527c2b00d74f48bf02a31b882926db4a710b51"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: Complete Bun and Node C-ABI FFI support: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8704-complete-c-abi-ffi.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8074c43c43ad23f09c9d20ea63a13823fffd434c4f6d2593c10371d5adab6c2d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8707-await-in-catch-blockwait: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8707-await-in-catch-blockwait.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a798ebb93a11d4776e26ea240b914507d963e4e888e3e3eade7a3a55102e9d42"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: Reuse stable one-key for-in snapshots: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8709-for-in-stable-keys.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79999c6ad62dbb451a861f457f5c22de808745a1676d12c496f6939d577315b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8713-ui-callback-gc-roots: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8713-ui-callback-gc-roots.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"027b28eaa634311a759f6fb791f5ef6942eed74d7c54b0b9d83f437a282aa62a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8714-array-tostring-dispatch: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8714-array-tostring-dispatch.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4add2b1288326a2b61f01dd1c5da81da9e7d2722cf36387184daa2416deb3802"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8715-async-gen-finally-await: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8715-async-gen-finally-await.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6eb04aef7308641ca49682babdb273ec9f2ec0dd24f4825b113807dacc5027e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8717-windows-pdfview-native-render: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8717-windows-pdfview-native-render.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4134910b365ce03b620a6fa134201d3b329c00ac0644662e715b6b536306666d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8718-named-pipe-unix-socket-ipc: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8718-named-pipe-unix-socket-ipc.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fed070ae712187e81c0517d9e5a6b378297f8edf4c1bf810f635e0dc416711"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8720-native-value-profile: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8720-native-value-profile.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de98ef756f253e6b089c1afb45aea7bb2b8e56ea2dac7a35bf06068eaa3f940c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8722-windows-winui: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8722-windows-winui.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f297af16796473d0c4f111aea03f5258a464ea5676a5840f55166ea3189c4608"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8724-captured-arraybuffer-construct: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8724-captured-arraybuffer-construct.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c286325f1be5b096cfd334d5b96b703b2252d77b8ed45ba9706092e3a28d7790"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8728-probe-dispatch-mirror-unowned-read: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8728-probe-dispatch-mirror-unowned-read.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4341bd629e07030d34568baa516a38807c22be95fc29a24ce9ec69c396414fe8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8729-symbol-identity-equality: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8729-symbol-identity-equality.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7dc2aecc0072cb8da89017a7e60a2a1f10cd759903a5ba4560263b13582bc41"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8730-aliased-native-class-new-resolution: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8730-aliased-native-class-new-resolution.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be7a6d40710fab404a8786c161f07a6610619b82187ed0a62dd43927f735450"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8734-winui-callback-indirection: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8734-winui-callback-indirection.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"254390f82e164fd53a1f668eb0b75bdaa44312610e43759b830e1f4820745976"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8735-dense-subclass-seqlock-fence: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8735-dense-subclass-seqlock-fence.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3643e8a77075035151855db6553caba78b140311b0a6a72fb73f30391782b9d7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8740-guarded-undefined-method-param: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8740-guarded-undefined-method-param.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcecb95a7a48ccc15af0305b5a76d52260fc50dbcd92f622e76094660ddceb7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8742-regenerate-api-reference: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8742-regenerate-api-reference.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca1838e1dccf5589e761e4440e8d8322260c29c3fb74a0558ca7f8759bd693d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8743-function-var-shared-binding: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8743-function-var-shared-binding.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"665c51f6a48bb317d8da0f57719ddcc6dc02a0423cc14aa279518ccc2d08d62d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8750-ext-error-objects: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8750-ext-error-objects.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1860df1617fc87b657a8a6a72e22c8074599f9dcda7fc2460cab2fb5a66d6e86"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8751-native-qs: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8751-native-qs.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3da8a8ff15fda4e673d749607a52b384f4b474e5eec3fdba24f3273dbcdadf"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8754-external-http-tls-preflight: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8754-external-http-tls-preflight.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"924c61ad19c6b3aa51835e02113bf4ad599fc204b14266380121cf6a246bb229"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8757-datetimeformat-locale-options: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8757-datetimeformat-locale-options.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b703ad7b6a27c50d971d6e059fd6c927748f3ccd38972b6436b484f553e845"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8760-class-extends-native-constructor-prototype: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8760-class-extends-native-constructor-prototype.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b78d8af80c9b7ea9927f09ba31bf8f6b1dade8bfe87d3ec8fecdc8b4d5081a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8761-array-shift-exotic-indices: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8761-array-shift-exotic-indices.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b06eb7153f9e1c4985c69b4cf77c5c288d97a188f94efdbc7633a66a047573"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8765-mysql2-request-scoped-statements: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8765-mysql2-request-scoped-statements.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9afda0802b6f5c5395a298cb66314fd7493f5e294f5ed1cc9d6303c30156d33"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8767-forwarded-arrays-versioned-loops: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8767-forwarded-arrays-versioned-loops.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0c4f1822b58bbd5f91f1a12ad8d9b1c15b3a6435bd614cd05abd9851079f23"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8768-runtime-parent-function-prototype: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8768-runtime-parent-function-prototype.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd52f7454b23d82238f74534974af0eb6c5b8ab850cdb5836eda64f1d8b488a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8769-http-ws-reactor-scheduling: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8769-http-ws-reactor-scheduling.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0a59facd73b21ed9a49bd027ae0a1958e8ea7faca2504d66d23511bfa8baa7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8780-class-instance-object-prototype-read: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8780-class-instance-object-prototype-read.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43cf0a8d0957eb269d76f24f87e082381c3fc5afd241a5a4bc7de6bd4ac13995"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8782-pod-copy-native-proof: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8782-pod-copy-native-proof.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f7e524d6376379b293fd64f02de852880749b94cfa16418e298bdaf02776ed"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8783-exact-callback-versioned-loops: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8783-exact-callback-versioned-loops.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"402c74357df399b2c99d2b71a2321038a3a874c12739da6eb2d1bae06bf8f26b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8785-imported-object-method-specialization: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8785-imported-object-method-specialization.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ed6239aa2c04cd6d9a287af248602540cf5be5a1bf2f0703b01d404a61c688"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8786-closure-captured-packed-loops: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8786-closure-captured-packed-loops.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5678909bf218e38ebb22e8a510bea5cdb85c4bcae70f2d249be190a62605d2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8787-argument-shape-clones: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8787-argument-shape-clones.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cc3e1959bf643e1d31ca0c1cb6d6955a934faf1d9346e786ef8aa80b74e4c7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8788-short-packed-spread: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8788-short-packed-spread.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0a0df87a17ba10a324e35187c2726404dd8467ac4dc4ea593320fcca90556c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8789-release-sweep-regressions: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8789-release-sweep-regressions.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62991e37e3cde0addb950ef4450b66ea2e520a11322170fc65c2e2dbe8059f8c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8790-text-style-overload: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8790-text-style-overload.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc18647c8e3523cb070215f0b49a770447f55724f3e0a560feb78e03a1078ceb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8791-npm-oidc-only-release: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8791-npm-oidc-only-release.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"984db330e3e070d1e586ef0b9f1b0806f245d37218109cf035e5f8334852af74"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8791-web-stream-global-constructors: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8791-web-stream-global-constructors.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6453a2158e19a1f29add991452a8b33dcdd9cb243afe166a5a0e3f70af049bd5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8792-captured-closure-cache-hints: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8792-captured-closure-cache-hints.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9937569e70fe2a784ddfb927e3cf9d23ed15bf3d577a3b945cf27602ac04d1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8793-static-method-object-literals: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8793-static-method-object-literals.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf6b45a2fcf1ab6456f6e347173c8ced875271274fb12c09f0669b23ceb09b2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8794-shapeid-transition-cache: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8794-shapeid-transition-cache.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1112354e427f8a9ff294315b37480e45424f228ebf802518e7db46fb9dbd6d3d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8807-arguments-length-only: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8807-arguments-length-only.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"251298207e35b1b2633975f661de90ba30e776a2e2a3531863fa783d0529ad6a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8809-gc-root-dominance-late-roots: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8809-gc-root-dominance-late-roots.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c889068d267e60f09afbfedc028bf47de1b7b2729b47119a09c962e96a8c630a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8810-gc-root-dominance-corpus-no-link: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8810-gc-root-dominance-corpus-no-link.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8173aef20dd248903e62ddafbb7c67831a592b918a423c74b4c1ffdeb67fc7fc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8812-native-async-warnings: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8812-native-async-warnings.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ae3abf13424b7420a6be89e3240d1470add3f5a03fa1d9e67349076f38fd1f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8813-map-ordered-delete: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8813-map-ordered-delete.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71eae3e34bcd28ba23cf043fcda34652219e8338d02155924906627a90f426d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8816-runtime-library-build-stamp: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8816-runtime-library-build-stamp.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6589fde89aa7499bcd3b106bd83f5085da5ed1e98c81fda3eaa5a4e6e4b9f59a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8817-compiled-package-builtin-import: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8817-compiled-package-builtin-import.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1e4577e822f5caf059eb962fa72a28667481766627fa7907f9f014d174b40a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8818-sharp-create: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8818-sharp-create.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d3c9e562b08a39f7af2d714c2c821e9269d493a3c5cedb101e19f6fc20fe10"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8820-call-return-array-stores: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8820-call-return-array-stores.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1324da6087af20c49d8bf62d1e06390679adf01b2bf2f8a69ebaf34d9987ae10"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8825-async-hooks-lifecycle: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8825-async-hooks-lifecycle.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dcef897c09bd8258bbd5e6b800bc3e5863e4eaf7af012b9213ae59c6ae65a00"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8826-readonly-set-has: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8826-readonly-set-has.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9d13c6756255171377825ef709992e5f650e44ca8031dad4b030991b87a476"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8827-safe-wrapper-link-fallback: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8827-safe-wrapper-link-fallback.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22372f0dd46f1555ea0f938ddb745ae84601853cfab90e6e04baa560d1a8c90a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8830-declared-map-get-dispatch: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8830-declared-map-get-dispatch.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fcb274f356ca33291b8ad72c7a15686d7a049bbb83a02147f1345403464221"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8831-release-net-abi: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8831-release-net-abi.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ec5a5527d51ae568f1942de85dc1c58443facfdf8800e4ee00977432fad731"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8833-argument-route-guard-invariant: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8833-argument-route-guard-invariant.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2a18d6181fde18e149f478005b6d85b53d62ffb36d360201c15296395e7219"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8833-ecs-integration-followthrough: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8833-ecs-integration-followthrough.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"501582a3aaf72cea824120d8029e939df082537b8a3ea4472ff151231439ab1f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8834-windows-doc-tests: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8834-windows-doc-tests.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cb317e641d6bdb7c35c65a9d1dcebd2518ecb50fad8a542bd9635ae82ae762"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8839-guarded-ecs-entity-index-cache: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8839-guarded-ecs-entity-index-cache.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c8bbab96e00cfc7a46ee1a801a45312a1aea880b94f1982f94e32a7740a920"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8841-release-parity-budget: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8841-release-parity-budget.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aac5aa5f3b44547ae23912de70db14a8bbdae434a39e28fb9ae657d6b58c068"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8842-release-r14-blockers: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8842-release-r14-blockers.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64dabd1c1a4d4a936c48dfc5b244ac05dd185c2112f9fd34ea25d28820142a9e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8844-windows-icf-test-identity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8844-windows-icf-test-identity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa79b8fd5832157fa9923a158f323a634ffd2080213e80da1ee93df31efed44d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8849-array-length-truncation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8849-array-length-truncation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f776ee92094c000c0b011c6cd7c2514ef51e7927cde07f28889f1fdb59771b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8850-node-api-host-core: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8850-node-api-host-core.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc62ea9ea51eac3ac2f077291701ff4a5d78fddefc8110540367dcb73adc472"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8851-release-main-warnings: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8851-release-main-warnings.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"026af877f38ffbcd34678b98a530327af750eb699538400377f991f84786df05"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8864-release-r19-blockers: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8864-release-r19-blockers.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5d4d71f4ada93af74746f078fd6fc12851642c1d57db570f089024408d7db0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8867-dense-numeric-map-index: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8867-dense-numeric-map-index.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"831265376e36b32cc1260bcd2234fbc073419cb9c6476a4e247d8c21f0a12a97"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8869-release-throw-abi: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8869-release-throw-abi.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb0d708272ed67e6b01af884ffe6c423fedba124ae63570b8c323ace5f65197"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8872-ecs-cross-module-dispatch: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8872-ecs-cross-module-dispatch.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e3f3337f07641fa628cac06bd23899645f6cba8ae7795b2fbca32eadbd53a5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8873-release-construct-unwind: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8873-release-construct-unwind.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dde9c052d3d130bf81b92b3598067e2f430bb917b715dbd19024190b9a9e0a9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8874-release-r22-blockers: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8874-release-r22-blockers.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b110bf0e30887421206c57d531ddc5f82965af94bbb80a67eddcf56ff5adfe"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8875-descriptor-owner-index: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8875-descriptor-owner-index.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4025400ab101cf53459ef60bf4596208a07f63daf2043b1d703a6291957b2129"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8876-ecs-forwarded-store-inline-tiers: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8876-ecs-forwarded-store-inline-tiers.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14399605cf06e436861e4c8a05f95ae4633f92d5de9d6d21b37359af4ca91b9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8877-release-r23-node-function-prototype: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8877-release-r23-node-function-prototype.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f12e01792be121b5f5d55b17cc0d657777b7059e42396da157f59d486b57b1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8879-release-r24-module-relative-inline: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8879-release-r24-module-relative-inline.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a490331896fb9a617d7e74b9cd285ff9a962b3fea92b6fd9991e3f1eacbb25"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8879-stdin-end-provider-arm: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8879-stdin-end-provider-arm.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"568cacf3775988aefc77ec8197c40d9064d678718fc23ea447bd9812524a48a3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8882-late-bound-class-new: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8882-late-bound-class-new.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3399fcbd423a1e0484776813cccaa1e34dc2de4d7c5fe5bc3d556e1fd76895e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8882-shape-facts-hasher: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8882-shape-facts-hasher.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd5ffa07987be6f6296d7bffa9b01bd84377866a78e846bbad651f3b573be0d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8885-ecs-followup-gc-bookkeeping: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8885-ecs-followup-gc-bookkeeping.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fcfa8faeecdad6a05e45935e1e03f26c7f7325584f5c326553cf6a21604ebb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8886-release-r25-split-coercion-test: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8886-release-r25-split-coercion-test.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a818ac0a822708feaf01f56db4b23b4c0106fe86c6a8663b74f4ba6b2038a162"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8889-error-own-properties: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8889-error-own-properties.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fd344cc382bff25ab2317628b277361f8bc130c4af89f8f917f2f93f182393"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8890-claimed-receiver-brand-gated-layout-note: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8890-claimed-receiver-brand-gated-layout-note.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a71489d073aa1e8383c68d5707d7b92242d724dd0bda9618931998562e5afcd"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8890-header-unification: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8890-header-unification.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf2ea9367da835f430d85a094fcde9a435b01385b0f1b0284b7483cf3b4defe"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8892-shape-scan-probe-memo: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8892-shape-scan-probe-memo.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5001f37dd69c0e6d631a3a4d8092886ceddc00fed1adff3bc5e2ea96c03209b9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8893-class-registry-per-image: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8893-class-registry-per-image.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"498caedf5a1986f90da77b37196d370e4c0911f1fa0c52df9d08b8b2f9fa61e1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8896-class-capture-refresh: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8896-class-capture-refresh.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9712643e5703adffd46a3c8b6baab3a8f3cde09f927e9a91ac6cd31922e05f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8897-ecs-round3-field-push-inline-append: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8897-ecs-round3-field-push-inline-append.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dac425d301523058ac77dfd383424bc36194cb5a16188cd672dd26eaee0ee2e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8897-field-push-writeback-handle-bits: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8897-field-push-writeback-handle-bits.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b33d42ff792c2f2926507d121f48902dd81d64c24b323543e6f03a326cf7af6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8900-transition-cache-weak-target: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8900-transition-cache-weak-target.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfcd0dfb7abcbcdaf41c3dc6e1f86df187cb0db193f775c17898936bc993241e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8916-barrier-dirty-page-early-exit: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8916-barrier-dirty-page-early-exit.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e63e72501ce08e44e8e5f6818b8e30ffc116b8e0d3f50ad4cc25b09a7a9cb55"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8917-shape-lookup-cache: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8917-shape-lookup-cache.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f119eff133369046722b8a987246f537159221dd5e185803a09fbb6dc5702d9c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8918-census-carrier-pin: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8918-census-carrier-pin.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06dac73f132453a10614f5466e4b295f8bd901f934f2f7e3418223be48bd0678"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8920-net-listen-host-boundary: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8920-net-listen-host-boundary.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8630985e9b80286ded77ef5802b0c728b3c36d664da1c6c1a4124202c03f3121"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8921-proven-this-call-args-subclass-push: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8921-proven-this-call-args-subclass-push.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06540d77adc3de8089eb8e6ddfeb36e2de98f2d06b96a373e16f909977a38737"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8923-runtime-warnings-clean: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8923-runtime-warnings-clean.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab79f84c73df884282dbf06d3f529e2f4864227c8b0118f6e96ca72638e7a48"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8924-capture-stash-after-super: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8924-capture-stash-after-super.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b739999b4d4e1886a39efc839878a40b6caddf7a2ed886a9fdd0e540a137d96"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8927-recursive-type-alias-resolution: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8927-recursive-type-alias-resolution.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47fbb275488a0e956f288efb5c7b62ccb0f14c73651cfcaab8738a8ddf15b5f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8928-full-cargo-test-shards: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8928-full-cargo-test-shards.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8da619ec47cd68a19b252e3aa238a8b037cd124828a776d7cecbfd5f03ae04c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8930-dynamic-key-scan-kill: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8930-dynamic-key-scan-kill.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0061e6903006a491234b52865295c0947500ea48a8987104d418cc7df5637d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8930-elf-archive-group: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8930-elf-archive-group.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba592b2d00e45386e7a103f0adb23ea4fd467286452dd8915a6e4e6c1d3862e2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8933-inline-some-const-fold: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8933-inline-some-const-fold.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf24815a1208d096dfa1c4f899a50f88af5ea2c3b08504087a77b7b2b2084856"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8934-map-set-lanes-empty-pop: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8934-map-set-lanes-empty-pop.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5faf6ca5da77ea9cdb90a8d0a629928f35712f71ec3170b989024597db8019ab"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8935-inline-hot-tls-leaf-barrier: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8935-inline-hot-tls-leaf-barrier.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84077f2cef44e49485be1d6cf7ae232a4dc5883cc96422a13ebb16a63ad9ed8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8938-map-clear-fast-paths: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8938-map-clear-fast-paths.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c03c65b5941b95287195fa63427fef7be284cd38d0682e0b17a3c1b2ee51b2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8939-bundled-streams-link: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8939-bundled-streams-link.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"643fe535d81b8b2450654313cac1e60e93fec786fe7f0fffc82c8ad2cf9d1a9c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8942-elf-split-unit-string-constants: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8942-elf-split-unit-string-constants.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13e1431bf360839a42f662556cdb3c034626f527673e4d276b5d8eb345e2da3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8943-length-zero-header-lane: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8943-length-zero-header-lane.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4933ef582c1dec6c699d17a21f3f32af5fc50da1376310c6f4811c512006f76"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8944-inline-array-pop-tier: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8944-inline-array-pop-tier.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"070bd0bea11349dee7f62f4297d7da8874b6267a83be40f946a8dbed27652567"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8945-pointer-overwrite-lane: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8945-pointer-overwrite-lane.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac21a1d220de9ed97f3ba5df8d66683ce8551f12d9f59f48bd7d2ac2f5085ae"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8947-inline-method-shape-probe: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8947-inline-method-shape-probe.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b3316a79ee79944eda4b847d9148ff673183fcc703b6d4e9330ffd402ddf0a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8947-read-scan-kill: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8947-read-scan-kill.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b81cce099f37b02bade2c76c73ee34e9b3e2e01c150ecd4d95a8e054007f2c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8948-gc-map-keeps-personality-directives: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8948-gc-map-keeps-personality-directives.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4113e1b0439ffe1eb9ca0625b2d31de491004fc072251fc6042ab6b408cfdeb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8949-barrier-cache-mirror: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8949-barrier-cache-mirror.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0cc8fe9f7f04c1d15917955047fea18287d69da0b85f39f382456fc9ad36f4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8951-external-slot-cache: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8951-external-slot-cache.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c34da88a82264b821c35c291c4af601566b763995bfadc40e962f4d3a363e4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8952-closure-arrow-set-leaf: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8952-closure-arrow-set-leaf.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca4810398eabc62ec086766faaafa2fafb7fce7e0ccc39210a31c77bbd2d95a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8952-sso-computed-keys-write-stub: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8952-sso-computed-keys-write-stub.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99239bcb82fb9c1d60893a7cb6e35a24ff086cd987f7a0b8cd224829a49916b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8960-map-entry-inline: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8960-map-entry-inline.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c483aa4c24339a450d04fb04fe4c1f63d038e62e7ac07035919ed17b604598a3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8964-inline-hot-tls: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8964-inline-hot-tls.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92671dd646d7ebdb81e096539fcd4ceac85a8e988f8d5789896f40ed8cc2d33f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8970-private-member-name-fast-reject: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8970-private-member-name-fast-reject.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fee0c8426b83f038aea925f4f86006f115bd7630bdc729fa5f538812c5f1c46"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8971-key-scan-kills-read-lane: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8971-key-scan-kills-read-lane.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"016a7ae262519bd7ae02aaa0e0541c5228a5994cddd8a11046994a35b693013d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8972-array-subclass-fill-args: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8972-array-subclass-fill-args.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b75fc53df9756e70b93028acb034899c25d49eada5b1a89e758da1e32fe64d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8974-array-subclass-elements-default: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8974-array-subclass-elements-default.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f961c58d938372913d7232ae6cf519f905614bd7c651709f4e28b25560de015"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8975-single-shape-lookup-per-ic-hit: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8975-single-shape-lookup-per-ic-hit.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8366aa82d05420bd1cedfcdb18085329f8d8433dd0c5bfa0f4b902bb9c4028b5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8976-elements-loop-guard-kind: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8976-elements-loop-guard-kind.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5876d9f557b68d00557e29cbe4da1a866b6a4774fc54f2c8343a413bdd03d5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8977-write-stub-two-way: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8977-write-stub-two-way.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8fd79442733ee3dd186f6b8a62d2c100c41390ffd668b1d125fe355ed3944e1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8979-run-directory-entry: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8979-run-directory-entry.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0abd29338b57dc1796f1b2f55a37e0b5124942531bf954bd53e8cb9b3307889d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8980-private-guard-call-site: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8980-private-guard-call-site.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65daeb86ea172858cc4a14f757c53b1b45a4d3e907ade8b2849a3ae46863bb3a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8981-dynamic-function-refusal-unwind: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8981-dynamic-function-refusal-unwind.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b979fecbe7c88f3c5a949fa766906b57db4c748ae92b320584e470b1029c3255"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8982-hono-response-state: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8982-hono-response-state.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f8e7af831dd97615d110945c53cf0da3c7d4e38aa5d4d140b385a5b9ad91c9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8983-feedback-gate-and-shape-field: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8983-feedback-gate-and-shape-field.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c00188c6117234f6d6cba4264b2e2fb3fe591d73c07da6e7a2301ee32dabd20"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8984-private-field-updates: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8984-private-field-updates.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da91589a7bb88548350efc3e0ad8f6c8bd4032931a4e58bc1112da75b811f4be"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8985-elements-lean-push-pop: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8985-elements-lean-push-pop.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0acbf1643971fb897e82873d59d451bce5699d0baa559d83102f1f12c14cca24"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8986-imported-private-brands: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8986-imported-private-brands.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39317b83d80f5c41a20198f6fbbe70d4fd37439bb67ccdcf650b7e52a4a10fcd"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8987-array-subclass-enumeration: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8987-array-subclass-enumeration.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"994707a6c44a37fd7130917c34f6ef7e62b89385b4a05c564eb0bf375ac4da0c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8988-read-stub-cache: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8988-read-stub-cache.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"085e4118af069d090a4eaf244f5da33a92929386ff834afcf5c13fdf0f6384d0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8989-regex-literal-unicode-whitespace: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8989-regex-literal-unicode-whitespace.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d180d299ad981891d2bd362e883d4c93b4bb99fd9745533058620dbc8717e6b8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8990-url-search-params-header-probe: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8990-url-search-params-header-probe.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5c6977de698f14e671eb0ee5114ebf56e43c3eb6012b63de7a9795f0ed2795"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8991-plain-collection-iterator: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8991-plain-collection-iterator.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"792715f7403389933dd67ddb0b0cd5e1b54e4ee69528879913105fced8ddf73c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8992-node-api-entry-verification: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8992-node-api-entry-verification.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc954563e8098e39e9079b1d8f55b5f6848554718aeeae502a10023d8900ca9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8993-set-delete-index-repair: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8993-set-delete-index-repair.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f728ef8826fc0c04330f17d90359d70bc516876b6be85169ea8f81d9ecd1fcde"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8994-namespace-erased-names: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8994-namespace-erased-names.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d212b5c7034a59bbfd22dd8ded425ff048696093725ca29993c29e88890d5845"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8995-compiled-package-regexp: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8995-compiled-package-regexp.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01c434c7b41ec6d82ee28b33cbbde92377c7f71bdf0b7d8d477f1dbb5065583"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8996-elements-inline-push: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8996-elements-inline-push.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20ba3119b4a747584d3258282f9493c6e2cf5041eb199c526eca7187fae033a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8997-intl-locale-timezone: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8997-intl-locale-timezone.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fab2832ddc976725a7f3f8a284b736c6b2aefcf7fb55a4097529795ce008e9e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8998-narrow-iterator-latch: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8998-narrow-iterator-latch.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"095384d36f85aecdd9c6796331b3612d428df983e946eae6ed47fbaf245fb935"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 8999-release-receiver-probe-kinds: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/8999-release-receiver-probe-kinds.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f50eeb72adf9093907baa735aa2a9badff8337723f04edba014de47068562b3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9000-delete-path-hasher-memcpy: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9000-delete-path-hasher-memcpy.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37934025932c298cc4ea00bda5c1cf6a2706f406a11b3cba6157ac67151b10ca"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9001-shape-index-inline-slot: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9001-shape-index-inline-slot.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ef931f34d70e64dc0d44574b5f85a9bf6ef8f63ae53e8ee28d111b57613db9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9002-index-migrate-on-delete: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9002-index-migrate-on-delete.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"074f7653bef247554fe38cadb80823f4fdc17d2b683eaef9556ba591e285cbe5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9003-delete-shift-bound: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9003-delete-shift-bound.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f36ab70da92e2758f34b56ffa0879825aec739cf94678cd16e171f39ec94bd"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9004-deterministic-ext-gc-root-tests: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9004-deterministic-ext-gc-root-tests.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1267fb0b1017b90df82700e1d1be5b78563778cc09d6bfa0ed30aa92f06ed4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9005-keep-migrated-index: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9005-keep-migrated-index.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc84b1336480f0566ab22057f23b81e37cee497562c465a7094a19a6671856c8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9007-gc-matrix-fanin-layout: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9007-gc-matrix-fanin-layout.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafe1f948f98fc00613290478214e048af1ff33150868704315452d6c2953a70"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9009-lint-gate-ci-only-expressions: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9009-lint-gate-ci-only-expressions.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30e75a35c7f5dc7409fd15b6d824b62db78e4036411cbc3bb1fa3d2024b418f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9010-changeset-fragment-number: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9010-changeset-fragment-number.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e1c2c9a694fd42a1f60685b8e442799d21e1df90aaebf4a87755dee790c866"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9012-poll-reach-audit-in-lint: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9012-poll-reach-audit-in-lint.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"348257b7189bc87be30e23ba46b33ff4db3ae93fad58fd18ea16db054d0b6c98"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9013-delete-inplace-owned-keys: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9013-delete-inplace-owned-keys.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6cac2e7ee8e2111f00f25851f989868beca2d9e505ccbdd4cf968b7bd7dd8f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9015-untyped-uint8array-store: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9015-untyped-uint8array-store.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ce54a0f02326ee5033f0f8e4fce6ee78e8c73ed9aebb903ff7c39b2631533a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9016-guarded-preinline-source-small: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9016-guarded-preinline-source-small.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"047e4c74c22719cc82cc0c95441df2ebddf79a1493766538414ff5c8950b1fde"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9017-fused-for-of-next: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9017-fused-for-of-next.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7067e57aa2cdec2eab52d2b34acc05d1ad98a633fc3dcda0351e9fb7690d101b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9018-update-number-by-construction: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9018-update-number-by-construction.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2755dfd2b48c0c601391b6701c58a0371197d7e693a3190af49016a63f8d692"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9020-map-tombstone-delete: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9020-map-tombstone-delete.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1b50120155d87dc2917d5d30ede14e706056cd5e96626481fafc95d5a5f4de"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9021-computed-read-by-value: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9021-computed-read-by-value.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ffc6f9921b4fc509c45d08ab54733373a2c632e762760e347cbc613a3472c1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9022-ic-hit-immutable-facts: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9022-ic-hit-immutable-facts.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca8e884c1edafd1355b8f6bc15539b88c0bf99d1781e749b4cef168be8c9621"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9025-set-tombstone-delete: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9025-set-tombstone-delete.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f41cff753ed24a2a3c5b897720061bfa357d1b88ee2bef22e89f1ba054d015"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9026-box-capture-entry-cells: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9026-box-capture-entry-cells.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c697eb5e0c0d0aa3be98f5703651a002974b61d19f3a46e5af07c1456cfb5157"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9027-generator-loop-resume-temporary: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9027-generator-loop-resume-temporary.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5051539dab54815c7e86d0c18bd3f523cd5f18103842648295cae9b67bfc9c77"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9028-scalar-replace-new-field: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9028-scalar-replace-new-field.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ad8973199b79a6e58fd87806564db405483bc0b86bd5f6c1b93167570b0921"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9029-object-tombstone-deletes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9029-object-tombstone-deletes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe090e85644fcf052d3c6bd14c2bebb390ac45a27af488501601f78bcef71110"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9030-dirty-page-cache-ways: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9030-dirty-page-cache-ways.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"306c90fbf61d4d6f808862a31b801574d1b1b616c9cb6cb6073b122d1aa868af"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9031-eval-global-var-declarations: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9031-eval-global-var-declarations.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d7d4e610074a280c7e7fc238b562ea5959810a4cfbd3a9e313910cb56bf2c1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9032-truthy-object-inline: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9032-truthy-object-inline.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53cad3a6106ade2a4e84985a1d33e3add3cca4032d48c52a6344dbe73d71b7ae"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9033-push-typed-inversion: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9033-push-typed-inversion.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c17a01838938743ccfc97857b804104c380035b10656f8b4538b0249b52aa1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9035-builder-fold-prototype-descriptors: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9035-builder-fold-prototype-descriptors.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd0bf9725fec198b954b7ca32ed15da9b1e0042da4c600e0b83611a9c3c1b64"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9036-chained-array-ctor-type: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9036-chained-array-ctor-type.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d8cedfb5ad8e0ff8486a600be5fbefd9ba70402e79d02b2f8681303f2c7984"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9038-object-tombstones-default-on: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9038-object-tombstones-default-on.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"854c5f90c66e05c467731485d796f5980c9968490cdf825ea0b331393a1d8a6c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9041-store-receiver-lanes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9041-store-receiver-lanes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"808d252905bfa829decac24965ab85f6a3939c9f9a2460b3d0c41380daa25cf3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9042-gc-time-share-diag: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9042-gc-time-share-diag.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c29ad09beb263d928eab37af3a17e7ff9305b5126d6f270acb84b14efb44ab"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9043-default-derived-dynamic-ancestor: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9043-default-derived-dynamic-ancestor.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56dce606b9ab6fc907c95d20dd1fd6f906ef76415f34c2141468873eb2b3d392"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9044-build-cache-codegen-env-vars: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9044-build-cache-codegen-env-vars.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc7ff1b71109f2ed5e04c48384ce677319269c257c6fb6ea82fcd57000e75b8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9047-telemetry-master-opt-out: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9047-telemetry-master-opt-out.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f263c018082974275be6b451ef20a172a0e7dc29e0080727533ee2b697c526e2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9048-scalar-aggregate-closure-reference: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9048-scalar-aggregate-closure-reference.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d571cb6d2f324d1e83c12d464b67e4704f2e9dcdee971b197ca8f148876448f6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9051-extracted-math: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9051-extracted-math.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2acab54fe06e30631b5d39bdb9d2b77ec26838528b4818e6ef997c0e6f289160"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9054-preserve-exported-aggregates: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9054-preserve-exported-aggregates.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9eac4ac5b401570fa83963651488fced485e8cc7d94bcba8033744d24d1dd5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9060-packed-loop-numeric-accumulator: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9060-packed-loop-numeric-accumulator.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc1f97a93c1c95ef066633c26f63f8baee154f33cefc66a7913ed436ca09d37"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9062-lexical-for-head-order: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9062-lexical-for-head-order.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f96bd1af275caffaeed3200465bde1a60a784c359866b9548a0ac3bdcff70f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9063-masked-window-dense-stores: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9063-masked-window-dense-stores.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42eb4ab4878a6453d64869a3cd63bedd49ee52ca76c15b5b9aa204151206f787"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9064-stable-delete-ic: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9064-stable-delete-ic.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"246fdd8b0d0ac32376247cf42501b031ebc9ad37eb77b9196b70da630b8be235"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9065-small-object-churn: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9065-small-object-churn.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"422f75b2e14ff7e802836c45fd2cacad0668ffaad97e102dfa1bdc260fcb019b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9066-iterator-reserved-floor: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9066-iterator-reserved-floor.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a146a9ddae3ab047933f1c8559ce07caa51feccf1ae6f00d137ccab85f721ad"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9067-preserve-shared-delete-index: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9067-preserve-shared-delete-index.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c4af79974a602ae79731fc1ae3033e4cbfe0440500ad9b2b7541736e94e85f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9068-iterator-helper-next-read: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9068-iterator-helper-next-read.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4287b17f4f16212a7225abd62a7fd25b240012613dcedb5469e287bedf381d4c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9069-all-vouched-guarded-add: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9069-all-vouched-guarded-add.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a2ac71f27fa996071428faee3e983276e26512232c7a24c05e90d887d357f8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9070-versioned-len-hoist-masked-arith: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9070-versioned-len-hoist-masked-arith.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51655571c28db021fd6ca9b1681bc1c793d98f3fd11e0e33cc57f87bd5672b3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9071-callee-binding-resolution: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9071-callee-binding-resolution.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf182b9911ec9b4d23dbb2fedc2a7ef238c03fa92294e73384f642eab21894c9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9073-dynamic-parent-ctor-field-init: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9073-dynamic-parent-ctor-field-init.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f115b58f684b3508d86571020090a60b97f201c565704f8023cc5b75fd0b79"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9075-iterator-own-prop-reads: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9075-iterator-own-prop-reads.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd0e86933d52f7ad45ab416f851a83843a93a7a4eb0a8825b8f606a492ed80d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9076-map-set-foreach-tombstones: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9076-map-set-foreach-tombstones.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d5441fcad281d88191b5a692c3c7cb4be33c2c6e51b24df87a1167192c64fa"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9077-byte-read-oob-undefined: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9077-byte-read-oob-undefined.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1633168507536ad0caa08ffda5e0228660d59fcfc868da686b5a2eb70935da63"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9082-map-set-foreach-compaction: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9082-map-set-foreach-compaction.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"157b5f44628bebb7c86087ff05f00821269c43df73aae2547e0379881a3e433d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9084-packed-loop-read-admissions: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9084-packed-loop-read-admissions.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5073d1ad0342459446d83901f2db8903f8dda11797f6705a48efb20657abcf54"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9089-class-expression-self-identity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9089-class-expression-self-identity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa2cd65b264f66c75f31dd90f6095d08b8f147e1d74d6016b6fe7514afbf869"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9091-unboxed-clone-accumulators: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9091-unboxed-clone-accumulators.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dbaa374f7a63d6139373d92302e7895109d9a3b9213ac2cb2444ae5aed555c7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9092-archive-cache-test-isolation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9092-archive-cache-test-isolation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e399b7f8420cea77e973dffe6788c0c4e64e628aea0e6f7454afda97c636f86"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9093-collection-iterator-control-methods: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9093-collection-iterator-control-methods.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb4e48eeeb1e0f7c45f2dcb8934d59b0373e6b9d8d234623ee4b5b49c4cb646"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9102-inlined-ctor-body-locals-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9102-inlined-ctor-body-locals-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0985a59a4c5d0799b4c24039ff7f08a3ab214636931af64b2c20f9cebd9098f9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9104-named-class-static-arrow: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9104-named-class-static-arrow.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4b0b4b7f36cb43025f04b31526565fe17e8d598d928be78abbe12f34fd90c9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9106-for-head-counter-keeps-init-slot: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9106-for-head-counter-keeps-init-slot.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63399cd95ef1e6c3ccd5d8c34203bb1a2450c585d18375201d7cb2eddd40946a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9111-packed-clone-endgame: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9111-packed-clone-endgame.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30965c94ca95062eddf584f04ca80a679888081dbb920430fd2ee830a751510e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9121-futures-channel-wrapper-provider: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9121-futures-channel-wrapper-provider.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"221a5cbaa25c39fbbcbab610676f027eaf5727540e2ada395f74d4b980d1e111"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9123-prototype-method-delete-guard: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9123-prototype-method-delete-guard.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c706991c0f2ddbee58d0d8b44c588c8b00f5ab498832e4dd8ce600ef6ccc2d72"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9127-collection-iterator-close: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9127-collection-iterator-close.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac996baf1174caa1df6b36be834e7b404cd93803d50e784e3b63bd99783c67ea"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9133-opencode-source-compat: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9133-opencode-source-compat.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd89d46d3470459c6c90f423b6da2d1a6cb32b92e81708d98a1bea7d4a40c6c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9135-coalesce-unknown-left-gc-root: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9135-coalesce-unknown-left-gc-root.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b59b8c8d21ef68628fa02e29e00180705a663e303a0e14494cb4dc8c3220bb6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9147-followup-class-registry-fast-hash: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9147-followup-class-registry-fast-hash.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a6a3ed44d59a0c13acfc218257b74dea17621a5dc5c7d8f24c6346e6b51c7d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9161-packed-clone-foreign-counter-reads: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9161-packed-clone-foreign-counter-reads.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85eeca14c5d005868228045ab499c23718383618a7e531c64f2dc4ddae7f78df"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9167-function-expando-order: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9167-function-expando-order.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1469b495216268976b5ea4678e9cde2ecf7ebb31717f3acbba17d0c3cdb818dc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9171-string-array-length: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9171-string-array-length.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4afc8c5bf4b2cbe93d112b41755d9739ace5d6b639c437988de886631d9c74"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9176-registry-probe-prefilter: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9176-registry-probe-prefilter.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1014c924a161681aa3e9d08873d6f47034987e9f1b659707bdb7cc405e741b70"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9177-symbol-registry-range-filter: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9177-symbol-registry-range-filter.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46335c8c8611c157f341bf02128928f86e3d760ba2f897dcfc778a30263b6bf"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9178-lazy-regex-compilation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9178-lazy-regex-compilation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"654a56339144973fd19037583049c5b9757a13b6f7c58293ae0a0b2f06140b4a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9181-uint8array-fixed-size-allocation-keeps-its-view: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9181-uint8array-fixed-size-allocation-keeps-its-view.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6185639692522d288e322935f6dd8802ab1b9fa657f3958bad08819b59b5cc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9182-native-root-scan-fails-closed: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9182-native-root-scan-fails-closed.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8bcb098a1060595e666bd7e8dfc4b4fb7298e926592e64b4bed49834992281d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9185-throw-keeps-packed-fast-path: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9185-throw-keeps-packed-fast-path.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d8a176364c6ae531acaf7db676eff06a180f1d234597121f3a0e49561f5d18"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9187-lazy-fn-metadata-utf8: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9187-lazy-fn-metadata-utf8.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65235c81a34dbeddd3ac706f9d62053968c69a38b2a21518d81c73cf1b88535a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9189-labeled-switch-break: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9189-labeled-switch-break.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd595a30fcb174fd03f7648618afeecc9fed4fb4b1dab4f426d1264a3d86d6fa"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9190-receiver-own-key-probe: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9190-receiver-own-key-probe.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2861a81c4d12ebbffe8e2101d4ff16aeb6748e449feb39d953506f058dc36625"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9191-lazy-stack-map-index: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9191-lazy-stack-map-index.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8bc921965705c1c7930ca2c784492647e33c6df7ae2ff9b88c40f8a403f8a9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9192-array-object-prototype: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9192-array-object-prototype.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ece774b0d855414cb0f6560b50722897b84cec3d077a8455271e384a079881"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9194-loop-property-hoist-stack: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9194-loop-property-hoist-stack.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e4ff3853645822915ccf7c6bcb009389259931e5c59bfc596c25bd7e027182"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9200-tombstone-delete-default-off: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9200-tombstone-delete-default-off.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a0167bfeff46c7a78fc768662e8fd30d65d0cd9c3a59143d1a2ab968559ec5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9200-tombstone-oldgen-keys-root: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9200-tombstone-oldgen-keys-root.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cd0802dbc8c230f8098241b685f8a919e4cdce5c5bba09412ee92a485f54df"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9204-packed-loop-trace: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9204-packed-loop-trace.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d92421760b6b90d63cd9b735840b159e8fa576127d7f0d96bc4d7bc5aff6600"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9205-buffer-isbuffer-uint8array-brand: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9205-buffer-isbuffer-uint8array-brand.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bb98680543368dd317c5164d296cf2c05a5c2e6d5d4df97f1bc177167d519b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9207-dynamic-function-panic-abort-transport: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9207-dynamic-function-panic-abort-transport.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa770295bb31f75a28c4af909fd000d5bbd1e79340d25ddc0089d474265abb1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9208-raw-handle-debt: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9208-raw-handle-debt.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0d97f7feb764d06a1ebfecfc0ca6fe2038794c3aa1a7c0297463f2297a2152"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9209-ws-ir-only-tests: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9209-ws-ir-only-tests.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e9a74d36e1e6f1cbb52bb1666f7f60177394b816d94e4a49b597134626e18a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9211-runtime-handle-tls: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9211-runtime-handle-tls.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d522c5f36931e2a3dc86aaa76d059d99d27fa30c655e3f3c4a3af8f2f8e4a72"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9213-buffer-prototype-chain: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9213-buffer-prototype-chain.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b516f82070a4f93b3bd059074ad7d188e8c101a5d9da6bd601affae83b3962a3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9214-decl-prototype-reverse-index: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9214-decl-prototype-reverse-index.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d22cea9baad6596066ebdfa7f0a8d039496b0862b3765eeff189d3cd25334c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9214-regex-any-char-no-fold: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9214-regex-any-char-no-fold.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2652fa10a3147eb022654acdf15976441ffe68d37601a6c53f57b09cff8d92"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9217-9218-regexp-ascii-word-dot: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9217-9218-regexp-ascii-word-dot.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c676278c87db4d030368372a4851abda6c16d1cef75b0c66b16c958c1e770b6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9220-array-prototype-index-paths: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9220-array-prototype-index-paths.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"041514c34324879757494ed5485d2cb5a6e47204875089ef36a0b69ef511a2c5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9224-json-parse-single-pass: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9224-json-parse-single-pass.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e66d83355e547a58f7abb34837d63e2e9cf1d928cd044749cd402d11b8015b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9226-class-prototype-own-keys: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9226-class-prototype-own-keys.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fb5274cb6b1f7182f5715d43bd743d5918ca63b55f68655d83aff7db1a74ba"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9228-assert-regexp-matcher-input: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9228-assert-regexp-matcher-input.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc3517bce77b431688cf17788bcb8806dae86c646e810c496a40e8dc3b35d08"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9233-release-ci-blockers: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9233-release-ci-blockers.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8348818efd1454fc656e6a15e3670a139e747d088427a2c2d6efb9aa18374040"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9235-packed-loop-throw-fast-path: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9235-packed-loop-throw-fast-path.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"752b89758d87db73b14bf906e0f2f92278bc0c55082c5e17f3eb3c31795ab40a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9236-dynamic-import-walker-alignment: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9236-dynamic-import-walker-alignment.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d670644416be6788a74ca9a05ed3a82993af25270f5a1e89f11c75119f327c2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9242-release-parity-blockers: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9242-release-parity-blockers.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca243a80b45a293af634407c33f212c341cb1f0a11eb4d926fc55a1a05336fc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9243-ext-http-cgu-link-regression-test: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9243-ext-http-cgu-link-regression-test.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3872c5a19f2c10a98e96d0b096de1ac56c106d978951d80e265034a056203e62"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9245-stack-map-index-in-cycle-constructor: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9245-stack-map-index-in-cycle-constructor.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbec7174d64c023929879cfc139bb6072d21fa48428d5d810bc5e701fefd173"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9247-prototype-override-consumers: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9247-prototype-override-consumers.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"893961e2eccdafb6e828c126a129b6d8448323d5aa9ee992a016bdddfed4fc67"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9257-receiver-region-model: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9257-receiver-region-model.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0fa118c88829392de082a4cdc8f9d4409629f402a1f3a6f1782d0c7b269573"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9260-release-legs: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9260-release-legs.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc70447d8cedc4ac5bbf4df8cd4be20f1f9d4ff4c8cd16dcc78b2406139a962b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9262-release-leg-runners: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9262-release-leg-runners.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18908020c82c8a57734826289b25c1664c987cc27986829047d533521f90dc78"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9270-stable-packed-forwarded-receiver: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9270-stable-packed-forwarded-receiver.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfc39673b071eaa501ae3a23b57db574d6343295ebdd3fe66b41983cc0bafd8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9274-length-bound-offset-reads: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9274-length-bound-offset-reads.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86f6a03daab9d5011a1aaef9948f1bf426e65e24c53cde47693cf05c04d8a38"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9280-fetch-request-registry-test-isolation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9280-fetch-request-registry-test-isolation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"723434e848c1c6f0d1a51896e37ab3a13420ca3ca44d35df4b1178dffa56d5ad"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9281-perf-hooks-prototype-dispatch: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9281-perf-hooks-prototype-dispatch.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b805925c58353ef1fc8b69c8d8750c7f05b3d82c97aec85f7d73d383387cf4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9282-node-api-host-buffer-brand: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9282-node-api-host-buffer-brand.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9f038a0b97261ed6996d50773e092dd97a3bdbeb682b6e455e4e69e7337a24"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9283-preinstalled-shape-facts: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9283-preinstalled-shape-facts.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73052c9fc309aadebe479b5954aaac43a628627e12a0d1f798d790e1674e8dd"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9284-cross-module-shape-barriers: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9284-cross-module-shape-barriers.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cd63a9140add437a94c36bd02aff34ad51d02833c22acfbeb9c1fe8600154a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9286-stale-known-failure: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9286-stale-known-failure.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c070d005c5d04010fee39d2b8c5110367f7e8d5262c7593248460561224fdf1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9287-overflow-slot-ic: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9287-overflow-slot-ic.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8d28b12e7531b3c618563645267db36569b7afe8123e129b31f88283169031"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9287-transition-pre-scope: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9287-transition-pre-scope.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0c7f1a8cab92579ef34c5eb87e8b97402df3189f15c4e9609baa6106c9bb85"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9288-range-tier-conditional-body: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9288-range-tier-conditional-body.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0e6660440750d8aeea0767d0beacc8218a5e0c4673c8caf84543e0cf437775"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9289-scrypt-params: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9289-scrypt-params.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf82d429ee9c836d548b705cef9ae1e11038cafe50ac870ac60ad0dda480c53"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9290-compile-smoke-ext: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9290-compile-smoke-ext.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81390c100d17185c6e102fba2a788f16e3c913a6703f0f6f535c92b2e8eefb25"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9292-winarm-android-staging: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9292-winarm-android-staging.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f35e978c6afc3827d258bd65c2651fd06e585af62e61e36e4e5eb39a12ecdef"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9294-affine-range-index: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9294-affine-range-index.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c630365b62ae2c406ac1ee9ba13820ca1b777ec5cd81046c626d8fbd8f06f7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9296-renamed-namespace-constructor: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9296-renamed-namespace-constructor.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23fb6ee788275cb7fb75827671d929454f3d2214e491ef7e159cb2c3a688d051"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9298-musl-llvm: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9298-musl-llvm.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b52885f84711a5a85f64d9054c32dae77e3d504b958aa32f4c6196f5c9b851"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9299-elf-section-table-bounded-read: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9299-elf-section-table-bounded-read.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0fb8c5d15bb25415cbd7fa8de1cd360efd98af5766c2a778fa7a456be97f50"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9300-gc-map-per-function-stream-offsets-checked: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9300-gc-map-per-function-stream-offsets-checked.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6546c802f0f2d6c176e29f49c2088b4ade78536c862a51bed308bf60fd45f0b2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9300-gc-map-v5-lazy-per-function-index: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9300-gc-map-v5-lazy-per-function-index.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2767834e88b3086968420d2d0f1cfec3eafd8988308cec808b84cb5c7af28aa3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9301-statement-lowering-stack: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9301-statement-lowering-stack.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"364073481a6fc6870a5dd366cb16fc19181487048110bc12f06bec357b57d3ba"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9305-fancy-ascii-word-boundary: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9305-fancy-ascii-word-boundary.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9713a5ee708685b18f77d612cf29829b398ada9f239b2c4989a6f08fef9211ef"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9305-setjmp-c-trampoline: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9305-setjmp-c-trampoline.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"611ea150c688486e275f1b195e31238b949cef2e747dd62b4517b984cce3fab3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9306-gap-snapshot-oracle: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9306-gap-snapshot-oracle.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de305011d0cc9186fb45bf59d7db51cea69e9b0128e63a733d91da19ee41ee91"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9309-drop-legacy-index-get: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9309-drop-legacy-index-get.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc8c832246709382e98064fe16e316c7e750c08aef83f7d5b50d860575d9366"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9310-mysql2-param-binding: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9310-mysql2-param-binding.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9cc1b79a306e0f8fb0885196090f9a2b8c208ac72d185dac87f1472e46a8b7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9313-train13-followup: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9313-train13-followup.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67bbea6a67b9a2ff33b11dd0907aaa70439fda100d49b262bfc0d8884ba0416"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9320-train16-followup: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9320-train16-followup.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e04ec37fb7ab5b28988029c01a8987106a0a0953416bfc773c6937b72269a2c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9322-main-gates-after-batch: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9322-main-gates-after-batch.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f897ba506216925c4436ae627e8aa0f191d1e52ab5111bccbfc175109ca7893a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9324-hono-close-path: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9324-hono-close-path.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc76086465cfc1f0dc4d9f40b5dd7fcd01b41020b16c5cb088942e6353a7c9c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9327-macos-x64-cache-prime: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9327-macos-x64-cache-prime.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13043022cda35bc1d9f8267deeab5e2a3410b748287399127ea7ebf0c7e02e5a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9330-9329-followup: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9330-9329-followup.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ebff5ef1b0199a9d30fb262a1f59113aa334f7c52e0b5a6842fc1b6f4349a8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9330-tombstones-default-on: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9330-tombstones-default-on.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1651a9095ce7b80aa9b2cd343fcd0d4597162b03093185868e41ce7362af99e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9332-final-link-replacement-evidence: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9332-final-link-replacement-evidence.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"416a8a6620509d8b61536ccd1fc0a3861300af2a4eeefdb9898549e6dfd39e88"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9333-user-prototype-override-signal: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9333-user-prototype-override-signal.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cfe4fcc3524164fe30299ded027a9b00a1fbe88dc723e84be158df9b85e6f4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9338-ws-table-split: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9338-ws-table-split.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8718cb0980ae17c97e4f2d0ebe216cb922e024a656d9162488f469e487cff135"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9339-array-prototype-define-property-index: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9339-array-prototype-define-property-index.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a653749ed6eb1aff85ffeef92012ee59224c8373ae2bb08700dd7b351ebe01e1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9340-array-growth-prototype: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9340-array-growth-prototype.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"890590ec9b542d78e742f29b94eb020dbf4f69166b7a5b9769a1efb42681c352"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9351-unused-c-int: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9351-unused-c-int.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"629602271a59daeccf9b8bd033082bec5c0befef776a6c47ca0ddd231b833871"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9352-mysql2-json-fold: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9352-mysql2-json-fold.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f894a6dd2a2981203da3e3121dfff94e18c6c354ee059b45195172525e7d0d03"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9359-copied-minor-liveness-probes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9359-copied-minor-liveness-probes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc17ce311ff9d1df47babe1022c10cb3b0daf08ad8bff975a0ddc39bb2eeec8e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9360-u8-byte-reductions: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9360-u8-byte-reductions.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44b982ff8e4fc00cf9c8f6cc9e079d0951b9cc56a642833f6b18d81b1084688"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9369-static-this-is-the-class-not-an-instance: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9369-static-this-is-the-class-not-an-instance.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2536e334695eadc0eea9bc1e7fe4baa0c0da84fdb0bb2e6310740a5268ed55"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9372-iterator-vtable: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9372-iterator-vtable.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c253242c509ffdddeff0f3f09afa907c20bc67e5b21c102eda903ac67385b44"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9375-wellknown-predicate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9375-wellknown-predicate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e181b11ff714273eea1ad0e11e59808f70d169b1174b0116b7e3a4f641d2371"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9376-large-presized-array-fill: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9376-large-presized-array-fill.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe21ce55f9266a0269ca9e3e79e504902c1f39d4ed20f009b587d872ffa3d35"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9380-buffer-conditional-index: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9380-buffer-conditional-index.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2fd35f129221461f24fabb8759c300b8640482237111f84980433994cc40d8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9383-symbol-filter-test-isolation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9383-symbol-filter-test-isolation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a32d39a48e0c0380bbeb24b667e1c70b2d4c8d94defbb0061130907d1cbbdf5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9387-receiver-descriptor-consumer: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9387-receiver-descriptor-consumer.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ed10dc87a62c03cdb16aebc4914ba0e124a825801700bdf0f3ba15064aa648"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9387-train28-gates: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9387-train28-gates.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3af5ba481ef585dfbf058bcde929262f72ca2f3cdea11d000e4d8440a779b16"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9388-util-inherits-class: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9388-util-inherits-class.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"061c40a0808bdf9646d37bc862d9b0c44aa62cbb953ea4038c8640dd38e7e8bb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9390-filter-isolation-and-thread-local: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9390-filter-isolation-and-thread-local.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec4a0ca57149c8c0f9487d88135dbc37e75f7fbbaf4f56451837e36f093796a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9394-sloppy-array-element-store: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9394-sloppy-array-element-store.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa13ebede495e3e00ca6d9c19a8da197b25a84251cd838ff761ce046b1f13ece"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9398-json-pretty-tombstoned-key: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9398-json-pretty-tombstoned-key.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7708e9307ee4f9e31e7864233b5c21cc60fbd380e7046c129649f1f498c56e07"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9399-stdin-data-chunk-bytes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9399-stdin-data-chunk-bytes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acfa57475aaad29bad9c3f6b8f1da2718797457f5a676dc92b95c720808d0254"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9400-stdin-async-iterator: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9400-stdin-async-iterator.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3648de2617bcafd693a96dee20079194937122926d5fdfbbc91815e8a0a7026f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9401-non-utf8-argv: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9401-non-utf8-argv.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d60ef85d30c3200547ea43395e3480325d406fcbfb1cac8fe93cb2dfcb9def9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9402-sigpipe-ignored: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9402-sigpipe-ignored.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"422ac668b670df27088d749797e26cad7f15776c27609400fd06b8b35a167d13"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9403-process-exit-event: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9403-process-exit-event.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49baac9cd60e783893b424ff02e53595217d7eeb75f042723d87515f3ce22a18"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9404-static-this-is-not-an-instance: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9404-static-this-is-not-an-instance.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c62b6cf17da6a8db2a05743c14933f6787d63683d276f60e298c8e6b1399fec"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9406-dynamic-heritage-super-per-evaluation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9406-dynamic-heritage-super-per-evaluation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e3ceff564ac63fce8fa8337b1c6f8d8e57b557077b628093a23c456b85b64d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9408-multiline-anchors-lineterminators: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9408-multiline-anchors-lineterminators.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70228241a1ab4326bd4eaf057702a0a4d761a338c0d45068c98c16601b0628d3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9409-split-empty-code-units: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9409-split-empty-code-units.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cafc6c2b7b81daab68f3a359aadd7d98cbbe16fbc5ee4920ab1d9f9aed860a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9410-error-subclass-stack: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9410-error-subclass-stack.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3122da7b2adb22641198b7b9caec010e4a588d165dcdb5846e223aac3975ae46"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9412-cjs-entry-next-tick-order: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9412-cjs-entry-next-tick-order.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33d834fd1ae46a0864ac5765c391d4be252b5e7c72b675f74406a06280a29fe"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9413-class-name-and-source-text: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9413-class-name-and-source-text.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4564abd6822546e74d683a80b20512115f7591b613a3491a5f85eac282ddaaf7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9414-slash-separated-date-parse: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9414-slash-separated-date-parse.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88a5f46972cd84ea900d7e1ebe704b5b34919cf1ecedf078beb0ced9e0f173e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9414-tolocalestring-locale-and-options: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9414-tolocalestring-locale-and-options.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46d75aeac048a623cab3ba8d12332e18be0a80187c5fd245983f00dd2eec143"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9415-inspect-class-hole-promise: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9415-inspect-class-hole-promise.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5889a16c054b103d43921e77b425a78384cc8988c7841f50adeeeb6873d385"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9416-stdin-only-loop-liveness: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9416-stdin-only-loop-liveness.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"843c74ec7e96954786f32a63ac6764097d5b3ba38b5cb0d79b4862ca1d680235"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9417-accessor-implicit-this-restore: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9417-accessor-implicit-this-restore.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb493d129ac42d191a0ba95d3c46c5036c4afda95ab893476830a3c7c583a56a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9417-dispatch-receiver-roots: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9417-dispatch-receiver-roots.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bbbdd43c6303961c735c6b443a3e9ffde90008345067711734d9b118346a15"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9421-append-file-promise-reject: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9421-append-file-promise-reject.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4befc185e03c84b41ecc9cd8cb42f207e72a75fd6808f97e4bae403c25c511f6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9421-async-output-flush: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9421-async-output-flush.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5ed1b18c3839ff5e45219ae52f5be9fe56a758de9e88f88493098073afa5f6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9421-write-file-sync-throws: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9421-write-file-sync-throws.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9464bdda1894b30fc3ee5654bd835a4f1193448c68615b0d589391acb7bbec8f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9422-strict-array-length-store: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9422-strict-array-length-store.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5af887c83d5612ae1949bb936eb66184dbfd27ec9d162278cf590d2997d154"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9423-esm-module-init-strict: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9423-esm-module-init-strict.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46d7b5a18f8de3f98b67ef426c89610d5fef9dd3f742033340f701cf9213a49"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9429-regexp-exec-lastindex-context: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9429-regexp-exec-lastindex-context.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69a9142765e6b60d2b2d20d0537c5dce326464ea883eb7c2fe94cb5e6e2341b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9430-global-scan-empty-match: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9430-global-scan-empty-match.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5e7d56ec43c7129e7642558f171c2cede8f0598980f064f0470103f1c9ec8f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9431-array-from-lone-surrogate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9431-array-from-lone-surrogate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36a00372d48abee96cea541e249f257ab145afa3f51c658560f90027ef70c2a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9438-fancy-regex-split: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9438-fancy-regex-split.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8857618495e06236464d2d2781d8fb80cd37c2f17485ca609b41d1b8fc5ae9be"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9441-idle-exit-latency: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9441-idle-exit-latency.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5dcbcd7d566abd2c67fdd520f1b8b777f4259aca2946e5791777e1e3b16248e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9442-process-exit-abandons-async-fs: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9442-process-exit-abandons-async-fs.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"045bd780fdde6f87d0556f44db533f0a13a3201a7a941a6790ef109e54fa72ab"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9445-implicit-this-restore-sweep: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9445-implicit-this-restore-sweep.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"158df0525d4547b1684166ce6575f0e4854e819e1b62f8bd6673027e3a6f2540"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9446-trampoline-unwind-frame: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9446-trampoline-unwind-frame.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2da1c6aee2738747a61e92b497f48e6aaf00582364e9d98daebb1d42642aed"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9449-iso-datetime-local: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9449-iso-datetime-local.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fcab3563148f946ffaf5dba4907e02bde3ec26cfe86e5f0c2c4cc4a818d45d4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9450-intl-locale-grouping: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9450-intl-locale-grouping.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14b8bb98a8be2a9c3485c30d1526cf0664cec6425157837dcf248691a623ec4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9451-9468-intl-method-source: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9451-9468-intl-method-source.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8317aab47e4cfa6730e29f44c0eeece9e3cd3ea2bac6beb5955aa5533efc806b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9452-tolocalestring-infinity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9452-tolocalestring-infinity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c7febc777f588746f83be45cef1e62b7696ad7cc4ee82f53c9755766308a19"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9459-sloppy-property-set-strictness: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9459-sloppy-property-set-strictness.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d98bffaea9eb8f0f6a3b805d3ada901d40879cb1e3f80eb7bf92779e30312c3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9460-unread-scalar-field-store-segv: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9460-unread-scalar-field-store-segv.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"814f55275e817122a204cc3478c260963a55286338865f685dd7b39464f673b3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9462-hole-leak-family: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9462-hole-leak-family.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f638e586b897dc968a5721c4ded95b9956cc7ed49395853d5bddd1a9db62e02c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9463-util-format-s-o-policy: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9463-util-format-s-o-policy.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"448b3ff8eb00f527b044a7fa8ea868dfd36e316895061cef52b382eb26846e15"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9466-scope-aware-class-disambiguation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9466-scope-aware-class-disambiguation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4304cce1d908784fb1ae4b7de6016060e8f6d451bb35c6de847d793d4eac34"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9480-dispatch-root-windows: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9480-dispatch-root-windows.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9e49882da6c342dd4c80b7dc3510d13e692008e9de9100952694962bf5bd6d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9481-9249-strict-mode-store: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9481-9249-strict-mode-store.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa8534593d524638e15e509147659bb7c9712a3b5e0f87802dda400d9bb15d1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9483-ignore-linux-deopt: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9483-ignore-linux-deopt.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c682c3d94711409776824346b3f53cca47dc5bcd9be7d5fc670e721ec46da6ea"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9485-cjs-default-namespace-method-call: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9485-cjs-default-namespace-method-call.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee1e9fe5b88e2a772adccd0d15b823c449a0bbe4ad3a075b4106113e5f4f3b3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9486-error-stack-frames: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9486-error-stack-frames.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75531a24c4d98da54fadc862b290adf71e0a0ea3fc252cfd66f1a8bf3d22310"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9489-stdin-chunk-boundaries: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9489-stdin-chunk-boundaries.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"033d539bcfac6f7e0b957d38f0349930605fff31d34ad9444e22f343f7c1f560"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9490-stream-utf8-decoder: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9490-stream-utf8-decoder.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea8eb9d4282b780967bcffdd20e7f7e6d796a3aed1b950eb8255404ddce51d6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9493-deferred-stream-writes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9493-deferred-stream-writes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e96d292335314cf7856ea753b0a63cb543fc2f2d59ed2f8d8c94c2c9e19fdf"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9495-strict-inherited-property-set-prototype-walk: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9495-strict-inherited-property-set-prototype-walk.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4801245c399eae81aed2b1396e21880563b4c21bf8c152c49f93d3b6f8b71343"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9496-decorator-target-prototype: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9496-decorator-target-prototype.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a6e09587800e36cb1e728678e7bb4e9d4263b99b7f6782e6e8dfff25ec08ff"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9499-root-reload-relocate-identity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9499-root-reload-relocate-identity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09e7d2af3245265b883dfad785a46873d9f6a7b3e9bb2184bbc288f4d5e6d36"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9509-date-parse-tail: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9509-date-parse-tail.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f32358775d3cf39402af52932533a94a64c67b2cf214c3110467355831ee0ec"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9510-quoted-llvm-label-block-boundary: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9510-quoted-llvm-label-block-boundary.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7604a12435c393b144102039cb05c0bcc1cef7be56b0ef76de41069d9f32e805"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9511-error-name-ownership: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9511-error-name-ownership.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca836543bade93b214d0f7e0503ea1c035f434be43db4826ed4e5618d79d67f7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9512-destructured-native-shadowing: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9512-destructured-native-shadowing.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae1ee97f88653c1f2307fdb95e5d8421a06f70ec2c20424973fd9e304ca50c5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9513-map-set-iteration-compaction: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9513-map-set-iteration-compaction.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acabbce2638b391c227bd8de8e7215194b615c375ac2a5621c2041b8c7d952bf"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9520-native-async-nonmoving: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9520-native-async-nonmoving.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ec47b1e3938c42aaaa8eb97d7e9b2fe81ff3910ccebca0861a29e2e086f527"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9527-doc-tests-timeout-240: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9527-doc-tests-timeout-240.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6dc3c3d3b8f98adc27f7a0a5aa01269074004b669f4d9987cb471d2b6ddef3f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9531-cjs-default-table-mcp-logger-exec-order: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9531-cjs-default-table-mcp-logger-exec-order.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b2e7cc5b959b4a485226064f4254ec44436a8e3a2abef548f57eda8f0cf417"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9532-set-receiver-root-across-value: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9532-set-receiver-root-across-value.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"729b4744ab439831bcf9cef31537071071feca7ab9b498b58fc89f374c7030fe"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9542-object-index-set-stale-root-reload: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9542-object-index-set-stale-root-reload.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7479fbf93d0c7115f667888e4a945793878748681a3c19dcc63e5e9e848697aa"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9548-loop-class-captures: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9548-loop-class-captures.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d954edabfd58507bd342da8acc298dbfd6cefdbaad3d4923a01277cdbe0b41a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9550-error-diagnostics-follow-owner: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9550-error-diagnostics-follow-owner.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb86b6269ade4221a17f1317d35d58a2a9397a067be7713306dd9a864fbf0c7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9551-function-poison-pill-strictness: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9551-function-poison-pill-strictness.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfc2383a5368ad574958bf8641e50b5b0be90945a40b2cba14309cde66570a4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9561-foreach-live-index-read: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9561-foreach-live-index-read.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65858b038e4b163ea8ed8e4f91e4d1c0fd1fbb905eb948d08a9150b4ea7d8f0c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9565-cross-thread-promise-pin: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9565-cross-thread-promise-pin.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b1c93a0ed926e1fa684baedf93eabc0b167d11c18c7a1915a6bb3b61c4788f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9566-linux-callback-deopt-runtime: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9566-linux-callback-deopt-runtime.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ae35451ac20e7b86e01e8081002f2a2f500346c1f347f6197a55ca024c07c0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9567-mixin-of-a-mixin-dynamic-parent: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9567-mixin-of-a-mixin-dynamic-parent.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b988a807d57e9c201463c96ff081c4a749e1e6bf31b4d2f129675fb1264c186c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9568-child-process-null-bytes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9568-child-process-null-bytes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa22386dc07d789386ba08aede301434324425df8f3fd3a763646b700f22c27"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9570-release-gates: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9570-release-gates.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"813836d6dd8a9a5ff3becfd6bf1c2c431d004c314ee1892111d0578ecf31194b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9577-auto-opt-shared-tokio: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9577-auto-opt-shared-tokio.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee2369e0129b64e3ddff2cf274f8f450627f20aec8153a38bac641e5897e361"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9579-array-expando-growth: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9579-array-expando-growth.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6721e5ea0bdd102e52ee3c0860888cbc3f4c9b7d82eb0e1151d2fc64c58817"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9582-fetch-url-transport-errors: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9582-fetch-url-transport-errors.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08b84178bd2dd0b4db75d038e30c9d516fc38d661d38d2162d7e456388792ac"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9584-restore-musl-release: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9584-restore-musl-release.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10155ebf638cebaccf7054950ea31a7dca7ef1a0fbcd6a55915e6702e3e1c760"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9588-readline-reader-wakes-the-pump: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9588-readline-reader-wakes-the-pump.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5094b9e211cbeed36c0f42a9529278ac6b1c85ad4c00a77e6e79c7f0b07c9f58"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9589-gc-idle-reclaim: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9589-gc-idle-reclaim.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2454767e7727c2fcf683d167d410951da02c9e613300a9f744fdbeed1249f58"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9589-idle-reclaim-productivity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9589-idle-reclaim-productivity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d388de7531c090cb243c7dcb400d2aeb570be76545cfe373c695a5f388f60ac0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9593-readline-escape-timeout: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9593-readline-escape-timeout.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce4bdfcd4b5667eb2c720fe6feb4a4fb0926dc5b4e17a28f6c48ddc18957499"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9595-thenable-assimilation-wrapper-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9595-thenable-assimilation-wrapper-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69026c3e366440256503c5724e3901e3cbe10c692f36638ea66f87a9519147b9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: Bun platform global namespace: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9599-bun-platform-global.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9383187064ec0e882c91c61480c09ad2bc1c9fb729bd67ed00c2d32a01a4cddb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9602-bun-runtime-compiler: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9602-bun-runtime-compiler.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17782e3bd32f371f017e47ee7f37a126ead659356d01840d74fca46463087f3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9607-bun-ant: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9607-bun-ant.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e3d10c86f6b04855ae670a6beaf3b069186eeacd1b21b10128643da3b627f7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9611-llhttp-import-context: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9611-llhttp-import-context.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e74d247565810ca08c76a86c7a4e16202d45e12de27bbd1834a66b470e1404"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9613-fs-watch-os-events: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9613-fs-watch-os-events.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"078192ff1b94a6be9a8f7784aa95c186bf2ca0dc3e6a2c86d3204df4f06de972"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9614-bunfs-root: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9614-bunfs-root.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3126f294f45d09321e2bef39e55aadb87ce90c024df934e4ceca2322bd33f92"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9620-wasm-zero-copy-linear-memory: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9620-wasm-zero-copy-linear-memory.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f92133e2378e25f26f16530069f1466d7630275cc00e06afce99c8455bbe8bb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: Bun subprocess and terminal support: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9622-bun-spawn-terminal.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e60b9138985d75074d537f0cdeed9d8b49bb9999e4f64bcf6c4e47c78344db9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9625-bun-serve: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9625-bun-serve.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"200f2cd51cfa364fec74927320e22e7d85e2568d52bedd7ce6ac891c60189f90"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9628-9629-gc-retention: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9628-9629-gc-retention.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4033d2b12fdca7d776d5b56053b59a20bbdb4ea382229d005c7cb14d050a178a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9632-bun-project-node-addons: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9632-bun-project-node-addons.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a3ca077db063178b1bc260d3ccf1bb44f0f84d7c3e38e5d577798a51fc67a3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9634-bun-sqlite: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9634-bun-sqlite.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68a0c65e9d790b547a0c175d0bc14792841b7dac2061d7fff9d99a512d8f210"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9640-child-timeout-threads: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9640-child-timeout-threads.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"573daa1918e6a6bad80b9f8594101fecc2d2fc18d2b3e0971d43478b3f2840d6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9641-readline-close-pauses-stdin: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9641-readline-close-pauses-stdin.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58bde8736687ed72c161f170139ac8d3b1f7cb2593bf6b34b341cdb979d8b695"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9644-gc-idle-compaction: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9644-gc-idle-compaction.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b823f8e9e1e46ae6972354d49ccc4f68eb5a6252d0b2ce30009aaf789167d128"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9644-oldgen-defrag-quadratic: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9644-oldgen-defrag-quadratic.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2bf34dfe70abc4a03cb753ea71e3bc249fbba4235197e71bba0c63d9e1c8ec6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9648-declared-static-compound-assignment: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9648-declared-static-compound-assignment.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7929d49fd70025cfbd204b0b31899a67b4eed3185dc783077babc7e6252c6e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9652-native-backed-own-properties: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9652-native-backed-own-properties.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"857eafed180849ee0b12bbc9edfa24d3d8c5333625c7bacec8d018a350467ccb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9654-unlink-parked-write-order: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9654-unlink-parked-write-order.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1ae6fa87164390bd12ded4ad51df576d9ebb326551c7614a137d3357d36506"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9657-explicit-resource-management-syntax: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9657-explicit-resource-management-syntax.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a837efcf02fc0f9cbe5ea2f0ec2a2aa10efc0d0e7b378f7baeedcfc925e125e4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9660-readable-to-web-fs: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9660-readable-to-web-fs.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd62b49d5237247911fd3d90103a4237bbfb32f9927514c07f01a4f23831b0f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9662-web-adapter-gc-roots: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9662-web-adapter-gc-roots.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7be91bc83d3b4e0720b22d3bbe28ca4c5d24f46758e567fd0ef6db01c7c2da"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9665-method-pointer-store-inventory: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9665-method-pointer-store-inventory.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46367665beac3c5e6bc02389a614a152106fdad7f61eee9a8eeca3f1783fae67"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9666-await-tests-ancestor-gate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9666-await-tests-ancestor-gate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40943801f57d59bd2bc62167664d1ac1d170861b995b517eb431116ae2f822d8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9667-multipart-form-data: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9667-multipart-form-data.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9bd2c65cd185d701e895d64347093a68e31ef0350bf288ef645ea8ff88adef2"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9669-compiler-output-step-liveness: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9669-compiler-output-step-liveness.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49908bd0709c7c59e8907ea42753ace5407526b484140e8131efc7e2fadbfc5f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9669-drop-unused-apt-sources: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9669-drop-unused-apt-sources.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5272536904f3af207b8e7a4ba8251c7fe35fd467c176f2feb74257e368e37353"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9670-derive-npm-tarball-set: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9670-derive-npm-tarball-set.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53a2147a96797228fb09c8282b5568ada90c4a9250e2be624ef176030d73549"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9672-verify-platform-visibility-before-wrapper: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9672-verify-platform-visibility-before-wrapper.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc22a49395b11de9a56f24320609fd0d7cf31dba6ed4c0ff4215f50b6d1beb3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9673-array-callback-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9673-array-callback-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edb716b2484f448035f359a6617bfd2fbd73e0419c32f2cfb40a846c622916e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9673-release-notes-cap-and-tag-reuse: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9673-release-notes-cap-and-tag-reuse.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8a24b328741a9e90ced19e5a6d7bb7a2429d715c69f5cd50dbed968748a2f6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9676-stdin-unref-ref-keeps-reader: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9676-stdin-unref-ref-keeps-reader.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b04abe2eb969f783148ebf04670b940cf374b84dfa89d8051460228402d2305"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9684-regex-program-finalization: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9684-regex-program-finalization.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a8e6222c2756f1ecd3823e8205b61e30ab83d04d05bbb730315dd8c050d2bf"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9686-async-yield-star-dispatch: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9686-async-yield-star-dispatch.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cd52379803c615c7c66e72f6d5decc22f1e589573495aeb9c4b49fd254cf8a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9688-proxy-array-callbacks: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9688-proxy-array-callbacks.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2e6171126c2c2a015ea7bcbc9e6bb98647bf3137ff44c444786b159a71f2f5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9689-aliased-native-class-heritage: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9689-aliased-native-class-heritage.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65199676d708d196ad4720681b10d79cdafe99ca2ef40dddb6bd7510ef8018e8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9693-readline-listener-snapshot-gc: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9693-readline-listener-snapshot-gc.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0edb688d7d556f29a70cc6f1d340aa8d640266036b7f489986c90441628d463"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9697-shared-stdin-reader: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9697-shared-stdin-reader.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a28a4d47951b49044e695cd7c408df0dd2b33f37fd4e5a1782c3ab393fae31"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9698-bare-receiver-entry-decision: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9698-bare-receiver-entry-decision.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f01e254416d3f4b0c04cd1aeabfc96ae38151d6d63bcd18788f530c6fe77b5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9701-nested-object-array-method: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9701-nested-object-array-method.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b59c1f6f862c29c53bc18ddcb0139c0ea0fdf0b3646a274b16207a8d9df3ca4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9702-labeled-for-of-await: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9702-labeled-for-of-await.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d53456a6ce173b8dde7e127da63ced5e6b7dfb9be9c440704b9c892c6bb409e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9704-fresh-instance-prototype-replacement: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9704-fresh-instance-prototype-replacement.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dbefc7ced81a02b4b15b265505f07cf7448eee2ce4c73c669563bc54806285c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9705-fn-metadata-static-entry-points: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9705-fn-metadata-static-entry-points.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1189038d39061a117c0b1e5b6d463696d48101250feb02c8d32d61efe55cd89f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9705-plugin-image-string-lifetime: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9705-plugin-image-string-lifetime.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ef32a9db93b1edcd2211325456278ec026d151bb3340895fdc1c6e673c3585"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9706-merge-guide: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9706-merge-guide.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ef35eee7b124a41cee50c3c03eb5b5e9a3760868acd2b91a9c48bf258a7f64"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9710-typed-array-buffer-miss-consumers: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9710-typed-array-buffer-miss-consumers.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96a304e29903e42bbdfaf2c92fde6454705da25d41936c07e88532aa966d65f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9712-receiver-descriptor-counted-loops: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9712-receiver-descriptor-counted-loops.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b41b8eef7b6f0184a685e610154bffa23593bc1e53cbea510e78420a07f3b7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9716-receiver-descriptor-table-retirement: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9716-receiver-descriptor-table-retirement.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5a10f8f7bb5002e78338ec5e0515b8fb68221c79d56d84370eb11b5daf3d98"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9719-bun-bridge-symbols-without-web-fetch: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9719-bun-bridge-symbols-without-web-fetch.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3f9011ee781df2c682fb1e21e0abef246c7883647019760b62ace15053cc7d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9720-initializer-self-binding: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9720-initializer-self-binding.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1466706f2e69a9843bd9f82b2939f715dedfe0094635a477d89ee97b09395a3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9722-closure-body-registry-record: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9722-closure-body-registry-record.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"603131792c24a11ea0d8be0957f063db43624b4f2561516b20a73733b6a605a7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9724-stale-tls-allowlist-entry: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9724-stale-tls-allowlist-entry.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f93be36813dbfaeb310a1d88c4d8083b1b5247cd05725e2fba71f07168f5ce"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9728-dynamic-number-tostring: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9728-dynamic-number-tostring.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a794460f498c44b5e2ccd6dbceedf769d6fb3e48e4b4c881896aa62fa821045"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9729-lazy-inline-cache-slots: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9729-lazy-inline-cache-slots.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe1af7c1a2de3f7e20b67d95b985404d3572828f4fbfbca71fae8db63b62afc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9730-labeled-escape-nested-loops: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9730-labeled-escape-nested-loops.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e2b7e615c58236507823031aa4b07eedbde116eebb5b5dc36e1e06c908fc63"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9731-arena-right-sizing: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9731-arena-right-sizing.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbda5709001e47a550d3b5e21e1e901e5e6f4e3a34633d1e4ec047373b887c9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9732-followup-diag-counter-verdict: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9732-followup-diag-counter-verdict.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01283b1d8029b922807d1ff12feac798b6c99be715c29be5cedebf6b5534830e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9732-idle-reclaim-growth-stub-membership: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9732-idle-reclaim-growth-stub-membership.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"904e2b932165e678cec927dd33fc237566617c9a82aa47eb5e1f68b71feec31b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9733-uncarried-shape-descriptors: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9733-uncarried-shape-descriptors.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"102a21c4fbb2132421821e0d3dea90b44e1a519901750cc183a10752dda99cfb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9738-merge-guide-stale-head-audit: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9738-merge-guide-stale-head-audit.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f3ac7927745b8516b6e7b8ac434a8d2664b86c25c5c2310e49a249d9295aaa"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9741-hot-tls-for-recent-declarations: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9741-hot-tls-for-recent-declarations.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3d5c49d512104331051abfbf506cc67c9cef1b3b26d6dee324cf1571a07b2c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9746-number-radix-formatting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9746-number-radix-formatting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"498268bd11147d047aa5a14cec609461b85919c680af6351514b96abe2e9a092"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9747-tombstone-default-comment: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9747-tombstone-default-comment.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"962915386f7bfe06ea74d839880045e341f14e5411ff6f69922f4d079526181a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9748-codegen-cache-guidance: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9748-codegen-cache-guidance.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f073a64d62beefb6d368f4b681826b0d2e98a4263754fb230b98855167921825"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9749-dynamic-heritage-this: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9749-dynamic-heritage-this.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55472a8d9d042a5d81c1a5c5a79e89a4874fd685a18a796d0eec8c54acfba4d3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9750-raw-tls-holder-audit: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9750-raw-tls-holder-audit.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad9e09ef61284cc2d1a9b3ca9ec99f7ad47de6acb0f9dfd617e46ee88662914"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9752-linux-pthread-stack-attributes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9752-linux-pthread-stack-attributes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab143c1d6d1f1417b0e3b5f1b54b14f415b8b5445e48a4e073b8aac2d47a308c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9753-factory-class-heritage-identity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9753-factory-class-heritage-identity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbf2dc4a89259725a869fab1f113f545087b0026c244b3e00c4cdc106895457"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9754-bun-global-diagnostics: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9754-bun-global-diagnostics.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7243f7b30b5e6de0fb0b3df645e2e4d826dbe892e63db1c3faa546c159fce80"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9755-gc-side-table-young-logs: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9755-gc-side-table-young-logs.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86ff28d19b5632ccbc8ba02a83b9bda7b90bf6da9b0add2b05e874b22450423"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9757-ordinary-prototype-stores: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9757-ordinary-prototype-stores.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a353e3e8a7968ea2270390560e92f6f825b4977a8a08a81f38f34242286e73d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9758-imported-class-expression-prototypes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9758-imported-class-expression-prototypes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56ada90dea44dc5f83c4b9c36513ea72b245482cca22d1b80ef515cadf8198e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9759-static-worker-url-helpers: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9759-static-worker-url-helpers.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73255ec18e3f8be89cbc5f8bbc426b2593e26f43f7f51bc900ebf5cd2f93a692"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9760-bun-jsc-heap-stats: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9760-bun-jsc-heap-stats.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"feef9d882e7a502ceedc35a88aeafc04cc9c053cb1da1ea754532d3ec260458f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9761-import-meta-require: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9761-import-meta-require.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c209aeea12166b37c2cecfcfec68f0a51d3fcd7d16b67d2e8cd5bc794c014e17"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9762-forward-const-tdz: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9762-forward-const-tdz.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"883fe193f70e190a20c5c747b1f8235aa7a04205fa4db5e47bc5d26ef300931b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9763-websocket-server-upgrades: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9763-websocket-server-upgrades.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ee084a2c82283e5a7196e4b887b174270d9d1c197ed91d9714675b19c7b329"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9766-transitive-class-inlining: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9766-transitive-class-inlining.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3932aef83b0a0085dd5a6ea82e00998c25982b553fe2d45047990b48e9d82e83"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9767-isolated-runtime-fixtures: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9767-isolated-runtime-fixtures.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"926ede710e937caa1cc71695900881866c13b7c51ce0948e07afe147e78c0122"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9768-train124-gate-followups: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9768-train124-gate-followups.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4037475d9e99f8774af1c58cf9295f1b01e8f18e3f6e52983efc252243b05a41"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9770-macos-http-link: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9770-macos-http-link.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ce1b8675936f92bd2b0e6968558ea96d94b63fd767e14a6bf3199e7d4b9e05"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9772-idle-compaction-block-selection: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9772-idle-compaction-block-selection.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fc9733c0258fee38826538931f7c5d498fdea22f6bd1e0bec22f6137b34e83"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9773-typed-feedback-profile-replay: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9773-typed-feedback-profile-replay.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a229c1138b873a426276f5a385b12fe3a646cfb61f89910e7397deb3f3008ae0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9777-build-cache-concat-site-cache: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9777-build-cache-concat-site-cache.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9799c4345f932597564a1a20cc8f5e22a282ef54dbead4a1b53683731c771f3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9780-bun-tcp-landing-followups: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9780-bun-tcp-landing-followups.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1190a2d117e9dde17ff94021fb35828aa0e8220f08f1b75d88b4c399348a28d3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9782-specialized-typedarray-lifetime: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9782-specialized-typedarray-lifetime.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb34c799660f7beedf2583bfbe677bfd5a6b8336defa652f004d44d038f995a8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9783-stdin-fixture-handshake: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9783-stdin-fixture-handshake.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8dcd085b8528d6daf03514084d5e7fb7db7353039c52e6286d9277b68693a6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9785-9786-array-prototype-chains: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9785-9786-array-prototype-chains.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb86da6bcd8c59c674f3d4da10d7b706b1ef65d390ac45de65872d5e80ffada"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9788-iterator-prototype-symbols: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9788-iterator-prototype-symbols.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"534a1fa040d50938b6c52a26589be37621d641bf5e7a91cf4ed9866bba732284"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9790-gc-ratchet-array-growth: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9790-gc-ratchet-array-growth.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78926557240859bd6dee7c9e74ecf4e9b4739600b250d0fb9c7117938cea7876"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9791-provider-stream-constructor: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9791-provider-stream-constructor.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf375cff971c833cc9d3191c01d33013e4526355bc8dedd1da167dc96c2e522"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9793-cc-parity-gate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9793-cc-parity-gate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9325a8290fb6f96033aa6c39c82cde6264ba7437015ea2e91dae92a362035162"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9794-alloc-primitive-string-path: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9794-alloc-primitive-string-path.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48088d313c866ed24dca891491c63d9d98da2b9e73114eabb4f593d035b512e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9794-gc-churn-attribution-diag: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9794-gc-churn-attribution-diag.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7f0472224f28f28b0429cdcda5ffbb14009e7e3761b0cd5199dc3605d154ff"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9795-string-code-point-at-dispatch: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9795-string-code-point-at-dispatch.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d5a1bd16d949fcdc7609cdd512e7ca3581679db3e3a2c198b033638f52048f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9796-regex-backtracking-cliff: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9796-regex-backtracking-cliff.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec21a7e4d937e2eb929422f6363ea154b3b2dbb8f80001961dc1e7475a52dc0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9796-regex-borrowed-cache-keys: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9796-regex-borrowed-cache-keys.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2fc4f6dea5d40a326a51a8352c5f240248d5a16d08c96a05bec17bc8b9208a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9796-regex-engine-prototype-switch: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9796-regex-engine-prototype-switch.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a2dd929e6ee7f3695eefb52203a8dd43ec229d868f3c0cd3aeeb3ae60e4e78"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9797-array-hole-inherited-setters: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9797-array-hole-inherited-setters.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca493acccb9b9927dea812f12d451e1394d8419ddfd49f696014ff642c7f17e8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9799-train125-gate-followups: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9799-train125-gate-followups.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aade0503d8dad2f3d9ab9841dd7dac2add2c86d6dba71d9959d09a74e9462fe"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9801-regex-program-cache-coherence: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9801-regex-program-cache-coherence.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"468d0a6e4c835408492038cda86319fc7aeacac8d3e8f466fa4373362d9df2b7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9802-outlined-ic-monomorphic-hit: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9802-outlined-ic-monomorphic-hit.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57120914852113537f61467d064bb3bbd4e79a8e5cf82b7ae411bd6a25c5bb95"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9803-module-presized-array-growth: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9803-module-presized-array-growth.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c39093210db47ff69a8720296c5bd4ca3fbf7464b9c16184e6cd4572057303d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9807-layout-prune-single-pass: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9807-layout-prune-single-pass.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b15dd130094058695ea0770c8697b2fe0cfe9b368895b2289ea64cf571392d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9808-element-shape-transfer-gate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9808-element-shape-transfer-gate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3cd911c429246d63a8efe8a9de2716ebf465c8f854e775bf9e96d2fb141bc5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9814-train126-gate-followups: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9814-train126-gate-followups.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff69ba8a45a848dbcb135ac44bd618e4683f2a89c30b8a4fbf5e330b19b3d8e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9814-virtual-string-indices: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9814-virtual-string-indices.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24b86e066ac4bc1d08fce1c95c2105f4bd9a73b9eb4aae95465d0dc1887792d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9816-for-of-array-iter-result: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9816-for-of-array-iter-result.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aeccfba54518caa133d2d030368bf93646994e8399922fbff594d1cb2d115d5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9818-primitive-string-property-reads: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9818-primitive-string-property-reads.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e03346bc706c6f129bc728266ac1710826697e83ce10b11f0b259ce05871c4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9819-regex-flags-no-alloc: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9819-regex-flags-no-alloc.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60233b68a961ecc8d021bad8f7b64262b43fb9ef72e78ea7fd2ddfc00441a58"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9820-fastify-doc-test-coverage: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9820-fastify-doc-test-coverage.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f226c4f6c4c082cc3a83b463c50a005ed11bbda407e8e3f9e92941c563e5f322"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9822-retained-growth-verifier: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9822-retained-growth-verifier.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cb9df3203fdae75268dd89881104d8cb1764b47d4c57d398a59f0629e7f034"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9823-for-in-deferred-shadow-set: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9823-for-in-deferred-shadow-set.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e329de38aaefaefd2ae510575aa325e40ddfd91c6741c202ac29206160a53e1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9825-solid-native-renderer: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9825-solid-native-renderer.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"143657e9ed13576b54035fde4ff4a0c8a6bf791a1bbf4010090607f47ce6931f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9827-gc-trigger-path-hot-tls: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9827-gc-trigger-path-hot-tls.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3be106c5ca0a475c122d8444253c528f8fe60f22e5b500827b04dc782b2314"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9828-buffer-registry-addr-filter: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9828-buffer-registry-addr-filter.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f14700625d845348e1533b53051789b6ba4128161839ff12ac77900f7d9696c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9830-gc-trigger-path-hot-tls: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9830-gc-trigger-path-hot-tls.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c56065dd3edd38ac4180a82513a81866b5b87e9d8940f570e69aafdc2f9960f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9831-idle-reclaim-elapsed-rearm: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9831-idle-reclaim-elapsed-rearm.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d385c2448eff62f14165a5d14aa90ecbca228e2d685c27d28395fc9943ac95ca"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9833-probe10-margin: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9833-probe10-margin.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4611bd6eaf8788f87bfc40c8b5925372112dec1fca7fde6137cb9e15bd89c9f5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9835-dirty-scan-presize: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9835-dirty-scan-presize.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56b1bb04d9c5e7b4d882e795cf00e73e300f15d2d0bbfd8286c0b03a5f830be"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9837-gc-ratchet-recovery: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9837-gc-ratchet-recovery.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d722ad407fbec8a6d7ed9bf96f7e58f916e9ddfa4fcf511a22a972ca361f213"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9838-tiny-parse-pressure-pricing: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9838-tiny-parse-pressure-pricing.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c334e3d653014eb3414a38700ae23538bf0a9ce343614971b6c05d010652abf0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9840-arena-trigger-rebaseline-symmetry: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9840-arena-trigger-rebaseline-symmetry.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78271963f35cea2cc2030ff1f6eea3c2caef24fd9bdb3076784251e3700541e1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9840-regexp-header-nursery: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9840-regexp-header-nursery.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb4381524f92b9b74af1ef3193dfc6809fff4335d471813f5f9a60017292e9b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9841-layout-prune-young-log: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9841-layout-prune-young-log.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e75197ba2570a0f1d3d3e1fa32c06a2eb9eb002f350a0aae546b27aa8cda59e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9843-segment-view-for-of-matcher: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9843-segment-view-for-of-matcher.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"101d6aa34874382a763c861e3dcb6f1514fd97d44a62cb25454988e540628f6b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9845-gc-page-class-direct-table: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9845-gc-page-class-direct-table.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e671d2f69037812eb535ee0e4b7a9c093b60f7c75953e211ea01b7d91374b25"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9846-iterator-next-override-probe-allocation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9846-iterator-next-override-probe-allocation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"620640d51d71ac2386cf4a3f854f3f634e506fabcf8c6a505dd920ff9e016f1f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9847-nativeinst-registry-diag: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9847-nativeinst-registry-diag.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af0364cc10ab1a69e5861ba5346b5b20d51cebc6aa0dcb120961d3bf9053e8f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9849-json-depth-scanning: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9849-json-depth-scanning.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4342455b06b65bec48af95c0b091dc6b7ae314b943bc9a03e7c2f583a86fc030"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9849-json-parse-stringify-fastpaths: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9849-json-parse-stringify-fastpaths.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ae33cc9aff0d85db4fb44cedc4c233c38e0a2da62dcba0f654c83852ab6078"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9851-lock-rates-one-cohort: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9851-lock-rates-one-cohort.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3869367277d9c21e215dd2acb9ddb84f04eac8624eedbdee4271c6eca7ee5f84"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9851-occupancy-may-not-promote-on-first-copy: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9851-occupancy-may-not-promote-on-first-copy.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b15c9608d8b8a02abb3d0614c53ea4a29c30f277d829f6c40cff9f42dad35a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9860-intl-segmenter-view-mode: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9860-intl-segmenter-view-mode.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5644a4f948798cc02b9a3acbfe3d5285b2e445dd29394b05dd6ea3f7d149d5ef"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9864-for-in-callback-roots: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9864-for-in-callback-roots.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b291b962928423d4efc71422e10f7622ab1e27946bad80d2f9797fb3eddbce"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9865-solid-jsx: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9865-solid-jsx.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"903b9754598fae38996de3db309d2a043fe15fac733786a0e0f5f890916ce375"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9868-formdata-upload: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9868-formdata-upload.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec814395e9249815e1916f71c34e5773908f0f3bb1458c7ee04c05d31b94738"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9869-visited-levels-rooting: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9869-visited-levels-rooting.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae729a8fc179184518ad87ffcf0f2c46384ed92876efb784488099a28971687a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9872-mock-timers-validation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9872-mock-timers-validation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9feec1a9598ce982a56464e0db43b5510ece61df203b71a174bebd2ef29bf0d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9876-v8-constructor-validation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9876-v8-constructor-validation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a9632e71527100900488cb4539f5598c42d09b96b216557476957a0af47803"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9879-dynamic-import-live-bindings: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9879-dynamic-import-live-bindings.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3648c0790e5ae7c2e3df4d1ec8c870e4a7e62585ada9fa4a045fc6f5efaa0a6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9879-gc-family-list-swap-remove: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9879-gc-family-list-swap-remove.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5531b444cee410d5481d83b5b4dd9f532f6720215c7e64b141517523597e1154"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9882-util-mime-setters: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9882-util-mime-setters.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c9aefcdfa2f022e07954900f4e2bb9f02a157d3a51ddf542f55f031fb92907"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9884-trace-events-descriptors: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9884-trace-events-descriptors.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffba34c0a51d568cf91a39b394389d226b7eb7c40a393cacab69e04b878db0c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9885-perf-hooks-default-export-keys: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9885-perf-hooks-default-export-keys.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f18a6fab53f549907232029671805e01e34a1358db2590acebc9318d5792ca"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9885-regex-newborn-barrier-gate: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9885-regex-newborn-barrier-gate.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb123e02aed962c9d6dab56beb6eee3540130c62997d8c89fbc835633e30ace"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9886-regex-literal-site-key: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9886-regex-literal-site-key.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e27b49d43b4c2830f3bd6e7c031d46170ee21b740a7cb213b31da8c6e08ce7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9887-fs-promises-namespace-identity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9887-fs-promises-namespace-identity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce78a686db09904f3605a18a30067e8a002d53fe564c4312aab6255c663a20cf"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9894-perf-hooks-validation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9894-perf-hooks-validation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d42a7c64b45120a1da8b738db1ee0f2b0847c6db3dee1b35ae67b2ebb24bd1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9896-constructor-lowering-artifacts: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9896-constructor-lowering-artifacts.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"015e9eea9c25939c7f03b8c39c20237a5f510d8732aea67d8392dd077af5fa13"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9899-module-namespace-descriptors: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9899-module-namespace-descriptors.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c3c0314592fcf347aa24aa3c07470e790621336515a491eaf8da8fbbf14f07"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9900-dead-string-wrapper-diag: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9900-dead-string-wrapper-diag.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"330f07343b0ba911679fb9482ecf76d0f17df4759e568abdd6ca33ba5c377dda"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9904-native-instance-assignment-scope: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9904-native-instance-assignment-scope.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b891c6d7f2d891ca26555b6b2af724e84b355c1cb837422c0c288ffb8e27dd"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9905-cluster-default-prototype: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9905-cluster-default-prototype.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5dc6f6d2939f19590e51401f6223712ed5e9088221db900f36a09b1b741005"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9906-stream-finished-duplex: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9906-stream-finished-duplex.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09ec43e9c2cf4bb16539aa1aa9c5bee20f63bcc99215a02fb65a84ff8366a69"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9909-sqlite-iterate-exhaustion: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9909-sqlite-iterate-exhaustion.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1cf8931fceabec62837ac032bca3db7ca1c9074388539219cf47a4780f9511"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9911-tls-peer-certificate-dispatch: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9911-tls-peer-certificate-dispatch.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8124eb3e86a0abd14a255c790653c9ebd4babdeeb55fade60275b3bb483a124f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9913-test-mock-prototype: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9913-test-mock-prototype.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"950048512f1e70cf19366785703e8edd97400f716f51bdba4caa1bd325f7cee7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9914-test-reporter-directives: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9914-test-reporter-directives.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff9b93f6989888466a31b8afd4e4d3d0daa36544933628d4fcf67932b692de8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9916-test-reporter-nested: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9916-test-reporter-nested.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04bd3148004190afb340a337d23fa47135e55d1d947fd26a6b72dca013d4ebe"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9918-regex-cache-eviction: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9918-regex-cache-eviction.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"349b56eb0c8d3a03dac043528da17b60a04f6619c2777ec2aece4d3db73d3609"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9920-gc-native-roots-platforms: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9920-gc-native-roots-platforms.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"038fc1aa214f2cdc78a7256187ed49012d5f6db8b8e3c3b6d7fc6ad1a788d385"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9924-gc-promotion-rollback-young-logs: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9924-gc-promotion-rollback-young-logs.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f25bc3be5783c7da60eb566bc6a19d4bf78eb1a8eb4f7fdf30d6076fcc6639b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9926-child-process-parity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9926-child-process-parity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e364cad0628383acc824b59a1520862c1d4e6bf73ba444166f167050c8fb707c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9931-class-expression-typeof-self: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9931-class-expression-typeof-self.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a72b210027a2c46368f0853114d35569f07c50dae5fe93b3d9c2929264d41d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9932-typed-array-own-property-order: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9932-typed-array-own-property-order.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05a403f4dd54dbb85f49c015711408be3f17488dccd7472e6a8b4d562e70c70"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9933-util-inspect-lazy-error-stack: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9933-util-inspect-lazy-error-stack.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1567ddda054c7cca89851bdc40ea5246cc711d47d5d5bbf7b5b9a4131ce172"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9934-module-builtin-inventory: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9934-module-builtin-inventory.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1911971a86ad8eb683ac83056f7af48a0db5a5490d2150c7cde75888b3dd11"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9936-module-constructor-parent-arity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9936-module-constructor-parent-arity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"641d44898d7e851826629949867672fbcdd127b8d6249e4916f83fa2c97f9555"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9944-module-sync-builtin-exports: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9944-module-sync-builtin-exports.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"476b4e425541c3e70c0183e26abff8554bf1a7bd80bfd92dc31f2a61da3505da"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9945-embedded-fs-metadata: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9945-embedded-fs-metadata.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc5c4c61f7ac603092d0a4ca4cc4cea49e9b7f606ebc44cb3dbb4235eeda891"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9946-compile-package-error-identity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9946-compile-package-error-identity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cddb6bdcb3f441b3e086094685b50c1b6c01590d3a5272a9b7081735a306313"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9947-linux-incident-capture: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9947-linux-incident-capture.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f0b83f28ea8c15fee240b5a880bf2548deb3c4b7e415fa846b9db7ede196cb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9948-drizzle-sql-prefix-probe: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9948-drizzle-sql-prefix-probe.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3687baf6fd7903e6228a3216fe94c3dc8edee1327cf3387d2e779fb812e75e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9960-apple-widget-padding: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9960-apple-widget-padding.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe5799a80360f8b6dca96e7532ee6bb0e4cffe67511ac1eb5bc391ca40a3bbe"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9962-padding-api: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9962-padding-api.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2705e72c9835cc34ed33b59d51a0b14e634f4464e56996d8aec8f881efcd4412"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9963-ios-foundation-model-promise: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9963-ios-foundation-model-promise.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d8c1bd40d79f4af015d824c44ac1a118d6b30cc37a4fabfe54d04623bb56f1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9964-linux-npm-ui-link: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9964-linux-npm-ui-link.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"289fb74669c5b7fa34d97d2e89a1fa8fa9812c323144fe87954977a01213a439"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9969-lint-gates-extractor-loud: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9969-lint-gates-extractor-loud.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab228199f95d482e000adefabb59f0e82d33b0712c3acf5033d88c14bac004ce"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9970-product-warnings-dead-code: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9970-product-warnings-dead-code.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"470553c02b671ff0b5591dd37b1be95c7e15cc74255a88a89be09fe64cf30a4f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9971-segview-build-cache-input: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9971-segview-build-cache-input.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4567ff18fbd33b749f6642b4b0f24088257a219a24af631415a21b6fca05a2bb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9979-frame-symbolizer-bundle-only-index: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9979-frame-symbolizer-bundle-only-index.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"300900c99b087331e1e4abccdfa4e19e06ef39925238a21ebbe16210a602f59b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9984-net-pump-callback-identity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9984-net-pump-callback-identity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df5c123e83dbf552a413207a0fdef8f33cc83d2e6a9715dc22de8460189c24a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9985-codegen-scope-padding: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9985-codegen-scope-padding.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca596ceee1e5c8f7238f1aee1f7692112fe808b0f554654a1190a6e5e52e264f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9985-export-function-alias-identity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9985-export-function-alias-identity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5fa18bba9c708ff8e09541e41de9723c137898206aae805b4fd50ce77d616a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9986-namespace-getter-binding-identity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9986-namespace-getter-binding-identity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc84906e45aa0bb3fe1f8fe2cd176dcd47ee5c018891107b7a29ed65d0f6bd7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9987-array-species-result-slots: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9987-array-species-result-slots.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c815962929af4cf7228172aef5ffa85f43d5b45ed2149d436f2729f0b7ffcf"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9987-array-species-test-isolation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9987-array-species-test-isolation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3ea73d6eb59516288e495c569716580405a293fb006321954ed9f561032a53"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9989-bun-text-modules: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9989-bun-text-modules.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71dc5f3f14488ea229e97c6dff01bd860cd22be16e30d62178d1ee8a714321d8"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9990-import-meta-require-value: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9990-import-meta-require-value.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bba5487e365b522e34db74524a82ce6799d9e8d53694fe4d1015ef8af92cc5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9990-require-ci-preparation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9990-require-ci-preparation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eeec71ba0d754fa08c0af95e142b87ef0852f3fbd4c01880ba5c1da6b076257"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9991-exported-local-storage: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9991-exported-local-storage.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be66999effa652895b79de2127c2fd1dbc60a6e6c415caa362d745aedec4098"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9992-imported-value-class-collision: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9992-imported-value-class-collision.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e070fbd0ed9cf7de3c8f2ad8d5ae56cfd241a7455bef92df9642b78f2c5c5d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9992-native-fixture-diagnostics: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9992-native-fixture-diagnostics.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb71d99d3090174e9701b3533c0928314d7103c35041725a95de3b31e908ce0c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9993-object-array-methods: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9993-object-array-methods.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83779c53936dbb97cca34a491954ab86335d7cb1ff0bec9322ffab7fa9fed5f7"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9994-string-static-spread: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9994-string-static-spread.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"844e11777a8504bc86111082d8f71e2c053db621e86c945938cc3b8f168e33f4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9995-generated-inline-budget: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9995-generated-inline-budget.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28821c661d98db2d9bcd37ccc43ba88dee56f566d444064a94504f714bc8c447"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9996-llvm-size-attributes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9996-llvm-size-attributes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e363b47e57ee0179130aa60a7cd2a108500137581e9df49591eebc6f7a78ed1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9996-size-policy-test-compatibility: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9996-size-policy-test-compatibility.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5705bbff95db63a940e2e32f99c8458756ce241cbc187626e609eb4886fccc5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9997-llvm-unit-checkpoints: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9997-llvm-unit-checkpoints.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58e9014ac01c496473051eb6e74e5f60f24d89eb9faf4c72d42297ffb1b7af1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 9999-typed-feedback-test-isolation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"changelog.d/9999-typed-feedback-test-isolation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1e2312843913532b566ea6b886219680556a819392544173577da02df9e9db"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: skips body: Skipped \u2014 switched off by test.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/skip.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc95bc9dd4f804ac884bdddbd852528d91886fc3fcd7da822f4dc6f3700719f5"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: injects path properly for case #${index}: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/actions/configure-pages/src/config-parser.test.js"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"206d2096fcb8913b66a8b898f4c04bb60218f44add95f9923131afecdcd0693a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: injects path properly for ${staticSiteGenerator} in ${configurationFile} to default configuration file: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/actions/configure-pages/src/set-pages-config.test.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"807fa8f441eabc6f437ba0846bd9dcfc503951a6c2020c61f6a7821cd01674e8"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: injects path properly for ${staticSiteGenerator} in ${configurationFile} to specified *${fileExtension} configuration file: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/actions/configure-pages/src/set-pages-config.test.js"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"99786e8479dc94627fb632e551121d617960872ca441ee60a54cb2b9abf0a9fe"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: context helpers: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/context.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e835e9a898c001dc6706617694a66e4204f4f5d47ad9178072172d428219b3fd"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: async callback: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/registration/async-callback.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7828f0876c771f754c844ea7a81e221386ba0736ab5d3ca24311ec7ea01daaa"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: (unnamed test): This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/registration/callback-overloads.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a60049d18ef160e462baf6396932ebbb60f04011ecc4b87b5d222b30c99cc1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: name-options-callback: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/registration/callback-overloads.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"2110a244b00e05b431e90f41aa23d17ee9190b6900c5a8516381f7e06620989a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: callback completion: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/registration/done-callback.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a080b10d3975e41ee38340193584efb833596c6adfcec0fd98241ea866677c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: parent: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/registration/nested-subtests.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"0341273d0446bf898f131ad6a088b37877b9af5e310f5f5842be3950b708e60c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: parent completion: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/registration/parent-child-completion.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"36eecec296a529a6010b8aaa58853d90a1d71eea1f9db4e83dea23c8aa692c3d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: nested test: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/registration/suite-nesting.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"84dc4668d2cb5a2a163cb3fcfdc6dbbb97f9d89f8a9c3f8dbf7bdfea77026a53"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: top level: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/registration/top-level-order.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e94b8ce516724c5baaa9c104992e5349849ed7f91350c4c1e31f5c41a90663"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: body throws: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/hooks/after-each-after-throw.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b75d0c90bf06a88905963b4f22e378f2682b0fd6836c64f7622ebbb6c2bd0f7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: blocked body: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/hooks/before-throw-cleanup.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f88f6c7c82bd32d527cc19640615ae98570bc47ced25619c4ade04bdc76d1a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: throws: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/hooks/cleanup-after-throw.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"7275e03ccb3e570667f0084a2780b19c516f7c0a88c6a2920bc9e95734d616a9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: hook context body: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/hooks/context-name.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ba62e422618557ad92d16c29bc5d537872ae5a7ca53c9d2ba0382162ba03d7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: ordered hooks: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/hooks/multiple-order.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b11446f3f378b7b50e2842316c829238a9e6a0de19a9dac5dbbab1af91e914"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: blocked child: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/hooks/nested-before-each-throw.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd7ca115c02271787b0de1b9cc01241924bae742c404f4ed86074a4dc11dc6d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: child: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/hooks/nested-suites.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"06df7c25b492b45301c7b39a9b17df6f99fac19af8e29688bc3ef95fc3b8c26b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: first: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/hooks/top-level-order.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f76ee75e37979db0249a685d08d8c304d9571974d816f061057313de4d8fee"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: second: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/hooks/top-level-order.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a11142019a89956f4e44c7acc5a49010f603540847d3a1aa125e007f0b61d9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: assertion surface: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/context/assertion-surface.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc57b0cc3c751e8b2d7044af28ae62fc78b85df456cf54f8f8d0b4357f5fc1a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: multiple diagnostics: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/context/diagnostics-multiple.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"958c16ae264875de39b14038f0517a60395c8bc8050ae0e7b5c5676ba9ab56ad"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: parent observes child failure: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/context/failure-propagation.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cf25ae1dae338a3424309542a2a31d4e3d755accc22741248ffac7c2062b76"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: installs local mock: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/context/local-mock-restoration.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"414b3fd15a853241822d399166d0b3d04039d29b0d8f89b6e2d3be33897405c7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: local mock restored: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/context/local-mock-restoration.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ace8aa07bffac3c8d5327c79263a787e41e874cd8446e57baa9d247aac91fb1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: named parent: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/context/metadata-values.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf6a653dbcd4495ef3bb55a3eebea898f5a380c6875e38e7005cfe42f974373"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: regular sibling: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/context/only-registration.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e76d4dea6aeb9fcf132b0b28c785f5c2d4318c0e42a1f607603228f1eb4d751"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: marked only: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/context/only-registration.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb7f5b1ced4ab5c7f3e8c9e80c171912953c0ee8c61b9a6bd9e9345b6931d65"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: unmet assertion plan: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/context/plan-mismatch.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"948c43cf95de6e4133136a6d77e2ef26727c54263c3d10a4478d1a166c744d08"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: subtest satisfies plan: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/context/plan-subtest.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ed813cb8f037ce37c41fe8675e1abccd08308914734c64b84214d4155f5adb"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: zero assertion plan: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/context/plan-zero.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7f5e4587f43bd2a80fad10529f782dd4c25e306b7b4089a477f34334ac7d1d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: runtime todo: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/context/runtime-directives.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42bbd6ccfa5fca39a2a9d7a2089c66b286447cdbb3bdd1a6a88ca0b6e66143b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: directive parent: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-parity/node-suite/test/runner/context/subtest-directives.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3f266a0dec1fca8f643c52467b70e71bc9edcf7508680638e150e57ddfc173"}},{"ruleId":"D13","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":"eb4b0282233c84c8e3fcbaa1d5bd175cc6b9fffa68718d435f5f4ff8e40b3fd6"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","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":"79f19575e6c28b8a2e70d4a9720f16e49190e5d8a005682eda20eb523ed47148"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","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":"cb4e50eab29ad7803553a942cfd5b790ceb5bbe9f5286327ff0f9983e361b783"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","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":"258ccac021067dd5498720ce726fbc0f1a1df7946553f6dc550a23856351385a"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","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":"e929035bed1ec0f0281b85269c2100f7e5caa5e50d85583a5d20d5eadeebcc5c"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","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":"2b88b8193d3ec50bcfcb040532028d21ba175ca5d4a6612e3703d12376d5a8f3"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","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":"8b21c6084adc2310ecd45847db939ba25254fe23774774985003cd178cca4396"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","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":"0637688e395514686cc1b455a91048147780a6b16c04357b03d986d39ed9ce59"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","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":"7c05c0e48232c5b6e45bda1627683d33d2a72348889e85c6f214a9afdaa2a983"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D14","level":"error","message":{"text":"Banned license: dssim-core: \u0060dssim-core\u0060 3.5.1 is published on crates.io under \u0060AGPL-3.0\u0060, which this policy bans, and it is in the SHIPPED closure of this repository\u0027s Cargo.lock \u2014 so it is compiled by everything that builds this repository, not just by its test harness. The expression was read as SPDX, not as text: an \u0060OR\u0060 is a choice and is only charged when every branch is banned, while an \u0060AND\u0060 binds you to both operands and is charged when either is. Replace the crate, or record an accepted exception."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"aab943e79235e707386359f12a60211e2c0607767368a4295b1abc503655b6c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/run_pipeline.rs: crates/perry/src/commands/compile/run_pipeline.rs changed 173 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 936 in perry::commands::compile::run_pipeline::run_with_parse_cache at line 565. 43 of those changes were fix/bug commits, and the other 130 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/run_pipeline.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/perry/src/commands/compile/run_pipeline.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"06630f36c444b0626ee3d3759472e6ed7f270b9f042d1cb106be5bd58b904bcf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/mod.rs: crates/perry-codegen/src/codegen/mod.rs changed 184 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 365 in perry_codegen::codegen::lower_module at line 606. 26 of those changes were fix/bug commits, and the other 158 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/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/perry-codegen/src/codegen/mod.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65327394a5b4642b169e361133b1bed4201ac62316bec4c70a94e3f76b4248c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/field_get_set/get_field_by_name_tail.rs: crates/perry-runtime/src/object/field_get_set/get_field_by_name_tail.rs changed 79 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 319 in perry_runtime::object::field_get_set::get_field_by_name_tail::get_field_by_name_object_tail at line 8. 16 of those changes were fix/bug commits, and the other 63 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/field_get_set/get_field_by_name_tail.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/perry-runtime/src/object/field_get_set/get_field_by_name_tail.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe3e6f184b4ebed692479bdc1cf68bc83b2951ee8e9a0fe9ac697b3c7dbc176"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/stable_hash/expr.rs: crates/perry-hir/src/stable_hash/expr.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 659 in Expr::hash at line 31. 10 of those changes were fix/bug commits, and the other 20 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/stable_hash/expr.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/perry-hir/src/stable_hash/expr.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6d17df19dbd534161d7c5a34c3fe60ec274ebbb257643880e1d920c7d75681"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/method.rs: crates/perry-codegen/src/codegen/method.rs changed 136 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 142 in perry_codegen::codegen::method::compile_method at line 135. 19 of those changes were fix/bug commits, and the other 117 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/method.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/perry-codegen/src/codegen/method.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"327fdfb1fb7c1505972051892650bbf02b2d123cad56798d08f683fb7eafb303"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/native_call_method.rs: crates/perry-runtime/src/object/native_call_method.rs changed 112 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 150 in perry_runtime::object::native_call_method::native_call_method_tower at line 1228. 28 of those changes were fix/bug commits, and the other 84 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/native_call_method.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/perry-runtime/src/object/native_call_method.rs"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"a276ee76fc50a0f0adc5fe04fa47fe15963e07cc8e6c66ab20389be62af88c75"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/collect_modules.rs: crates/perry/src/commands/compile/collect_modules.rs changed 73 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 230 in perry::commands::compile::collect_modules::collect_module_one at line 167. 18 of those changes were fix/bug commits, and the other 55 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/collect_modules.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/perry/src/commands/compile/collect_modules.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc3c8a53903766548356d51d0cc1f1593c3d05aa995473504b1bba93d1b0bf4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower_decl/body_stmt.rs: crates/perry-hir/src/lower_decl/body_stmt.rs changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 288 in perry_hir::lower_decl::body_stmt::lower_body_stmt_impl at line 105. 19 of those changes were fix/bug commits, and the other 32 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower_decl/body_stmt.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/perry-hir/src/lower_decl/body_stmt.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f145386aeb02bba62e2ab7888a1811f54ada07559ccf2eafcc52eedfe5c1b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/function.rs: crates/perry-codegen/src/codegen/function.rs changed 141 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 103 in perry_codegen::codegen::function::compile_function at line 614. 14 of those changes were fix/bug commits, and the other 127 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/function.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/perry-codegen/src/codegen/function.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e83bc32b07a177b20c9533f5afedf07679c307f91a19f310a674cf8e5617190"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/field_get_set/get_field_by_name.rs: crates/perry-runtime/src/object/field_get_set/get_field_by_name.rs changed 72 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 177 in perry_runtime::object::field_get_set::get_field_by_name::get_field_by_name_past_data_probe at line 600. 16 of those changes were fix/bug commits, and the other 56 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/field_get_set/get_field_by_name.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/perry-runtime/src/object/field_get_set/get_field_by_name.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc906d5c2cbffad6057bd36edfcefb5eddb4fcfe1514ae6d2c1f5fc6f680500"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/property_get.rs: crates/perry-codegen/src/expr/property_get.rs changed 91 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 139 in perry_codegen::expr::property_get::lower at line 72. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/property_get.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/perry-codegen/src/expr/property_get.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f092a9639cc6d3a27caea165dab6c2b4cafc689cfad8b0adc9d8f9c6648289"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/gc_root_dominance_check.py: scripts/gc_root_dominance_check.py changed 84 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 140 in gc_root_dominance_check.self_test at line 6812. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/gc_root_dominance_check.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gc_root_dominance_check.py"},"region":{"startLine":6812}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb52b0c3f384210070a8784a82feebe5ba78b9f860b4be8ad9bace1a41a56fff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/mod.rs: crates/perry-codegen/src/expr/mod.rs changed 280 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in perry_codegen::expr::lower_expr_value at line 4392. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/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/perry-codegen/src/expr/mod.rs"},"region":{"startLine":4392}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5a5479b17d9d9b06eebc6e748a825cac767f956630af6e10d3997f4e325f45"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/string_pool.rs: crates/perry-codegen/src/codegen/string_pool.rs changed 75 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 138 in perry_codegen::codegen::string_pool::emit_string_pool at line 58. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/string_pool.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/perry-codegen/src/codegen/string_pool.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a96d2e48639798b995abc5cda9f180affe49dfab8dc4beafb68cb6d73ce92ed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs: crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs changed 62 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 164 in perry_codegen::lower_call::property_get::dynamic_dispatch::try_lower_instance_method_call at line 156. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/property_get/dynamic_dispatch.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/perry-codegen/src/lower_call/property_get/dynamic_dispatch.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3320ca2220e3cb59dc882a6ce92ebb7a6e86c1f6d5d4048802ac15f829f77af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/closure.rs: crates/perry-codegen/src/codegen/closure.rs changed 131 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in perry_codegen::codegen::closure::compile_closure at line 441. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/closure.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/perry-codegen/src/codegen/closure.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"0613cbae85cddb9ff1de19b330d0e6b493b77cac404c0c0221b27d530be8060a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/stmt/let_stmt.rs: crates/perry-codegen/src/stmt/let_stmt.rs changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 187 in perry_codegen::stmt::let_stmt::lower_let at line 22. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/stmt/let_stmt.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/perry-codegen/src/stmt/let_stmt.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13a78fc74f38c9f2a7c708d0b1d66c430217af26f36c315de54fca0bd37842a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/module_decl.rs: crates/perry-hir/src/lower/module_decl.rs changed 43 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 228 in perry_hir::lower::module_decl::lower_module_decl 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/module_decl.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/perry-hir/src/lower/module_decl.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c8e17e084b9128e1467d150764f1ede7674083797778faef1797446f8a1aef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/entry.rs: crates/perry-codegen/src/codegen/entry.rs changed 139 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in perry_codegen::codegen::entry::compile_module_entry at line 105. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/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/perry-codegen/src/codegen/entry.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebf4597b614de08881b5b9905905b8dc1393f7351e0b12b1ee9b1f381ec27b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/new.rs: crates/perry-codegen/src/lower_call/new.rs changed 65 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 149 in perry_codegen::lower_call::new::lower_new_impl_inner at line 229. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/new.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/perry-codegen/src/lower_call/new.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe16a5b5ba02e981d609eaa8b0d2662b894813ffd7a0a98ae3e8217c92b128bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/field_set_by_name/tail.rs: crates/perry-runtime/src/object/field_set_by_name/tail.rs changed 64 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 147 in perry_runtime::object::field_set_by_name::tail::set_field_by_name_object_tail at line 39. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/field_set_by_name/tail.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/perry-runtime/src/object/field_set_by_name/tail.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b27c8120261d7f6196461e5ae42a6ae539ba3e910c4b7bf6fb08c7a270ed536"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/object_ops/prototype.rs: crates/perry-runtime/src/object/object_ops/prototype.rs changed 59 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 152 in perry_runtime::object::object_ops::prototype::get_prototype_of_resolved at line 264. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/object_ops/prototype.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/perry-runtime/src/object/object_ops/prototype.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"2155fcbc6111e556127813adfbf672964f443ce652a03966ad20131f91b6e55e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/instance_misc1.rs: crates/perry-codegen/src/expr/instance_misc1.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 207 in perry_codegen::expr::instance_misc1::lower 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/instance_misc1.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/perry-codegen/src/expr/instance_misc1.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"5649a21b4759a76ef56a7fb7c875ec747fa39221741ddbec4f49990369010b7e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/descriptors.rs: crates/perry-runtime/src/object/descriptors.rs changed 64 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 127 in perry_runtime::object::descriptors::own_property at line 226. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/descriptors.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/perry-runtime/src/object/descriptors.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"49fa45b4a6f1bb4e5fe619c35d8a2d98789ba5c7959910ea9d8e19c541723831"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/link/build_and_run.rs: crates/perry/src/commands/compile/link/build_and_run.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 269 in perry::commands::compile::link::build_and_run::build_and_run_link at line 17. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/link/build_and_run.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/perry/src/commands/compile/link/build_and_run.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4e5606e7c481e6f1c57eccea37bfef0de43795497e29ce9704f2f7cd6fb853"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_member.rs: crates/perry-hir/src/lower/expr_member.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 303 in perry_hir::lower::expr_member::lower_member_inner at line 241. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_member.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/perry-hir/src/lower/expr_member.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71b7210551effef9ad55f7a11cb3002d34137b09c14986bf68597f23b209f9f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/symbol/get.rs: crates/perry-runtime/src/symbol/get.rs changed 54 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 136 in perry_runtime::symbol::get::js_object_get_symbol_property_with_receiver at line 529. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/symbol/get.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/perry-runtime/src/symbol/get.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac05a84d16c6773a189b02f909f63e0a458f8b9bc0f38dda30464ec9d34cdcc0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/walker/expr_mut.rs: crates/perry-hir/src/walker/expr_mut.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 332 in perry_hir::walker::expr_mut::walk_expr_children_mut at line 6. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/walker/expr_mut.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/perry-hir/src/walker/expr_mut.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"375ef9c09314fe1893b7822bc3794417a4f08cc5379a64ef67efd11e98458a98"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/walker/expr_ref.rs: crates/perry-hir/src/walker/expr_ref.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 332 in perry_hir::walker::expr_ref::walk_expr_children at line 7. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/walker/expr_ref.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/perry-hir/src/walker/expr_ref.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15ad09858b9e8ccc8754d84acaaaa63be327f702f02cb36182cbc1af8693155"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/delete_rest.rs: crates/perry-runtime/src/object/delete_rest.rs changed 83 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 87 in perry_runtime::object::delete_rest::js_object_delete_field at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/delete_rest.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/perry-runtime/src/object/delete_rest.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"43532261a414ee931cc8d8d05900b6ede2bab4da67ef95756aaa3c25ee7990f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower_decl/class_decl.rs: crates/perry-hir/src/lower_decl/class_decl.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 163 in perry_hir::lower_decl::class_decl::lower_class_decl at line 111. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower_decl/class_decl.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/perry-hir/src/lower_decl/class_decl.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed481faf4db4c090938c76928b98b1ad20103a3a2d65b61630e9bd78c35cb916"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/stmt/loops.rs: crates/perry-codegen/src/stmt/loops.rs changed 96 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 72 in perry_codegen::stmt::loops::lower_for_after_init_impl at line 7176. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/stmt/loops.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/perry-codegen/src/stmt/loops.rs"},"region":{"startLine":7176}}}],"partialFingerprints":{"codehealthFindingId/v1":"0514c6235449ac73aa4258a0fbcdb49afe772c5354502e4f3c02fbe307e077b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/field_get_set/has_property.rs: crates/perry-runtime/src/object/field_get_set/has_property.rs changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 135 in perry_runtime::object::field_get_set::has_property::object_has_property_generic at line 248. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/field_get_set/has_property.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/perry-runtime/src/object/field_get_set/has_property.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34d5629d8c9a4632375eafa5b31ee8cc47f49340d787899809cc6e3f3e51c6c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_new.rs: crates/perry-hir/src/lower/expr_new.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 217 in perry_hir::lower::expr_new::lower_new at line 37. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_new.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/perry-hir/src/lower/expr_new.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1fe1b4cc0f79ec34b08ea19e3387f0f7de6b99488587f9566957eda3da47bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/gc/copying.rs: crates/perry-runtime/src/gc/copying.rs changed 80 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in perry_runtime::gc::copying::run_copied_minor_attempt at line 1016. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/gc/copying.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/perry-runtime/src/gc/copying.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e93b26840c8563c19ee63764dacb1ea5c035c26816d446912e10078717d27e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/cjs_wrap/wrap.rs: crates/perry/src/commands/compile/cjs_wrap/wrap.rs changed 46 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 135 in perry::commands::compile::cjs_wrap::wrap::wrap_commonjs_with_addon_paths at line 280. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/cjs_wrap/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/perry/src/commands/compile/cjs_wrap/wrap.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f0a5d072faa2e668ffa7973e466e88b174c6685ce7609ab64ba36a95abc8b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/native_call_method/handle_methods.rs: crates/perry-runtime/src/object/native_call_method/handle_methods.rs changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 154 in perry_runtime::object::native_call_method::handle_methods::dispatch_handle at line 56. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/native_call_method/handle_methods.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/perry-runtime/src/object/native_call_method/handle_methods.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b978cfb8b47259a24d4f2561cd6a76215c4090f8c9679d4f816f103876862ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/method_override.rs: crates/perry-codegen/src/lower_call/method_override.rs changed 57 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 105 in perry_codegen::lower_call::method_override::emit_guarded_direct_method_call at line 764. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/method_override.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/perry-codegen/src/lower_call/method_override.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5f093812e7abd54dfb58c21ee9fe4de604ac7adda9e75af766dc5637db65aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/artifacts.rs: crates/perry-codegen/src/codegen/artifacts.rs changed 66 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 90 in perry_codegen::codegen::artifacts::emit_module_artifacts at line 33. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/artifacts.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/perry-codegen/src/codegen/artifacts.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b14e9e887338aba8f29f03bc7f97c03515cf9031ffb61f5107cfa669358e51"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/stmt.rs: crates/perry-hir/src/lower/stmt.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 172 in perry_hir::lower::stmt::lower_stmt_inner at line 483. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/stmt.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/perry-hir/src/lower/stmt.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"e217a32f0dec0fc32ff2c0f7bc8fa283adaa1507568e5ea10d25893b1a8f1d1f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/logical_collections.rs: crates/perry-codegen/src/expr/logical_collections.rs changed 54 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 107 in perry_codegen::expr::logical_collections::lower at line 548. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/logical_collections.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/perry-codegen/src/expr/logical_collections.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62df88bb7b0582d3585cd6f4a8a684fec12e9d7ced44bc3af10f996bad2f45b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/lib.rs: crates/perry-wpfacts/src/lib.rs changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 155 in perry_wpfacts::compute_in 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/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/perry-wpfacts/src/lib.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8497aa5be3ea8919be761936dee7f035ad9298c56cc96ad4dba832000922ca"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/object_ops/define_property.rs: crates/perry-runtime/src/object/object_ops/define_property.rs changed 48 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 117 in perry_runtime::object::object_ops::define_property::apply_property_descriptor at line 291. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/object_ops/define_property.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/perry-runtime/src/object/object_ops/define_property.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"8369e6194d774ddfc18e3353dccb84335c41078c484c57001bc67b3d74ec81d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/lower_module_fn.rs: crates/perry-hir/src/lower/lower_module_fn.rs changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 150 in perry_hir::lower::lower_module_fn::lower_module_full_with_platform_globals at line 889. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/lower_module_fn.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/perry-hir/src/lower/lower_module_fn.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"120c4d7613ac173ba48553d8b94a4a320547b2dd7dfe998cb0896e7de53cbc29"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/literals_vars.rs: crates/perry-codegen/src/expr/literals_vars.rs changed 49 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 112 in perry_codegen::expr::literals_vars::lower at line 348. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/literals_vars.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/perry-codegen/src/expr/literals_vars.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca80cec1c23543a57dae63e3f8a521b86d9310b2ff8b32e5dd527405df9aa5a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/builtin.rs: crates/perry-codegen/src/lower_call/builtin.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 161 in perry_codegen::lower_call::builtin::lower_builtin_new at line 166. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/builtin.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/perry-codegen/src/lower_call/builtin.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e7bcbb12cd159cf3d4d837205e87dc01475b8e6020f5ef820ac1c169f99d4c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/this_super_call.rs: crates/perry-codegen/src/expr/this_super_call.rs changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 139 in perry_codegen::expr::this_super_call::lower_impl at line 201. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/this_super_call.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/perry-codegen/src/expr/this_super_call.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2e368a6068e68919e776ba97c9e782aeed3a3755ce08edde28be2c6b111c8e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/index_get.rs: crates/perry-codegen/src/expr/index_get.rs changed 70 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in perry_codegen::expr::index_get::lower at line 826. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/index_get.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/perry-codegen/src/expr/index_get.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"245d3fb0db059fe713f4ccd66cc051d16077ea8fd67cd19f288573c0734235ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/field_set_by_name.rs: crates/perry-runtime/src/object/field_set_by_name.rs changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 100 in perry_runtime::object::field_set_by_name::js_object_set_field_by_name at line 46. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/field_set_by_name.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/perry-runtime/src/object/field_set_by_name.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb242f6e8e645ecc5c68a413fb1fc457c209bb0721095eb2f1c42f2876031e8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/shapes.rs: crates/perry-runtime/src/object/shapes.rs changed 182 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in perry_runtime::object::shapes::scan_shape_table_keys_mut at line 6009. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/shapes.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/perry-runtime/src/object/shapes.rs"},"region":{"startLine":6009}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e2235287cbdc49550798992bdb0094c460dadd63314552fbb9752e0c4a51c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/global_this/populate.rs: crates/perry-runtime/src/object/global_this/populate.rs changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 93 in perry_runtime::object::global_this::populate::populate_global_this_builtins_inner at line 73. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/global_this/populate.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/perry-runtime/src/object/global_this/populate.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8a35677e74b5cc6422475b383877d550e0de2450b989eff087c34755748834"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/native_module.rs: crates/perry-runtime/src/object/native_module.rs changed 86 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in perry_runtime::object::native_module::native_module_property_by_name_impl at line 834. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/native_module.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/perry-runtime/src/object/native_module.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69f7a7382eb6fda646aa635b4f0a9e19f67062aca1a5cbbf19b69d43d8d578a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/gen_rest.rs: crates/perry-wpfacts/src/gen_rest.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 168 in Gen::expr_rest at line 136. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/gen_rest.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/perry-wpfacts/src/gen_rest.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"08538a72a1fb1893c16cef9174130b79b10100b30135faa60ac9c05776f17f00"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/global_this/fetch_globals.rs: crates/perry-runtime/src/object/global_this/fetch_globals.rs changed 48 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 90 in perry_runtime::object::global_this::fetch_globals::js_fetch_or_value_super at line 606. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/global_this/fetch_globals.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/perry-runtime/src/object/global_this/fetch_globals.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa7e355e70a3f6e9c684baf5d6934a12510cf19a52f2330a51607ebd03601df"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/instanceof/static_dispatch.rs: crates/perry-runtime/src/object/instanceof/static_dispatch.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 189 in perry_runtime::object::instanceof::static_dispatch::native_instanceof at line 210. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/instanceof/static_dispatch.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/perry-runtime/src/object/instanceof/static_dispatch.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b6bd8e8d076da447e262dbcca543a0fa6748ba467f448534cb09b896f11928"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_call/module_static.rs: crates/perry-hir/src/lower/expr_call/module_static.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 261 in perry_hir::lower::expr_call::module_static::try_module_static_methods at line 53. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_call/module_static.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/perry-hir/src/lower/expr_call/module_static.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1358870aca3c3c9ee0125ab6eefe19e290f9c83b5db9f987ef57a5a750aba01"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/native_module/constants.rs: crates/perry-runtime/src/object/native_module/constants.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 243 in perry_runtime::object::native_module::constants::get_native_module_constant 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/native_module/constants.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/perry-runtime/src/object/native_module/constants.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e73bec48b33326d71177ad3e8663bc769993fe415879bc316120341ad8de3c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/class_registry/parent_static.rs: crates/perry-runtime/src/object/class_registry/parent_static.rs changed 78 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in perry_runtime::object::class_registry::parent_static::js_class_static_method_call at line 1378. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/class_registry/parent_static.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/perry-runtime/src/object/class_registry/parent_static.rs"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"b775c5b8de54b2a5fb2147f79e68877fd167736048658877e58caa4cb3d1da69"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/buffer_dispatch.rs: crates/perry-runtime/src/object/buffer_dispatch.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 180 in perry_runtime::object::buffer_dispatch::dispatch_buffer_method at line 473. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/buffer_dispatch.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/perry-runtime/src/object/buffer_dispatch.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3be3b4f6029e5b19e670972d03702215dc4fd639168d230a9e445edc0f13399"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/field_get_set/ic_miss.rs: crates/perry-runtime/src/object/field_get_set/ic_miss.rs changed 114 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in perry_runtime::object::field_get_set::ic_miss::get_field_miss at line 230. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/field_get_set/ic_miss.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/perry-runtime/src/object/field_get_set/ic_miss.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4dab8ac78f7efe6e23039f3a237f16df029d76f3525e3e61e9060bc8fc8f59c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/class_registry/construct.rs: crates/perry-runtime/src/object/class_registry/construct.rs changed 68 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in perry_runtime::object::class_registry::construct::construct_function_impl at line 79. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/class_registry/construct.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/perry-runtime/src/object/class_registry/construct.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ce0722eef030d90d8a5a92d0ddd62de8b2c9c376cd376910507a5c845c32e4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/module.rs: crates/perry-codegen/src/module.rs changed 73 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in LlModule::layout_codegen_units at line 1269. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/module.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/perry-codegen/src/module.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"584fcd5b4bfb82b1c67c5acf9cdee904161de262a3ee4568cd9db4c2f384fcb3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/field_get_set/enumeration.rs: crates/perry-runtime/src/object/field_get_set/enumeration.rs changed 65 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in perry_runtime::object::field_get_set::enumeration::js_object_keys_shape at line 1207. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/field_get_set/enumeration.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/perry-runtime/src/object/field_get_set/enumeration.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c82cba377f3c72e55112175e3e8564785f77baf2e8a8c82a7c232d5992ff233"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/runtime_layouts.rs: crates/perry-runtime/src/object/runtime_layouts.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 126 in perry_runtime::object::runtime_layouts::runtime_layout_word at line 1538. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/runtime_layouts.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/perry-runtime/src/object/runtime_layouts.rs"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"d642cc9b54c6efb1dd54f24e1250b4ea3efb5ad3f1d88330fe83b448948d023c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/gen_expr.rs: crates/perry-wpfacts/src/gen_expr.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 146 in Gen::expr_inner at line 425. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/gen_expr.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/perry-wpfacts/src/gen_expr.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ffd998e2321fd1e59d88a125d1f00c93433043b64dcf8a0e80c95fc7428432"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/index_set.rs: crates/perry-codegen/src/expr/index_set.rs changed 47 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in perry_codegen::expr::index_set::lower at line 519. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/index_set.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/perry-codegen/src/expr/index_set.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"119d426e61c8268d15e0368a19fad1839fb6eea92d9c8f40df62dc2d8d31e9bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/solve.rs: crates/perry-wpfacts/src/solve.rs changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in Model::cons_line at line 1694. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/solve.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/perry-wpfacts/src/solve.rs"},"region":{"startLine":1694}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8e963192169b4b708e6cc29c38caa59fa7dcb0dbd4a846f24fc5632c67d102"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/model.rs: crates/perry-wpfacts/src/model.rs changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in Cons::kind_name at line 893. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/model.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/perry-wpfacts/src/model.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec18ceb86bd1135e1a13de19f7b13e467b2ddb685ff858045af3b91f6928f640"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/root_reload.rs: crates/perry-codegen/src/root_reload.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in perry_codegen::root_reload::apply_to_function at line 486. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/root_reload.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/perry-codegen/src/root_reload.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41de6cc5799cd06aa1ec163fa4035abc17e7a211fed1cb8be0b93dbbb5acbf0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/gc/layout_slot_visit.rs: crates/perry-runtime/src/gc/layout_slot_visit.rs changed 52 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in perry_runtime::gc::layout_slot_visit::visit_gc_rewrite_slot_descriptors_with at line 326. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/gc/layout_slot_visit.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/perry-runtime/src/gc/layout_slot_visit.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a20c286effaf2c73cb1189d43c4b8486f55340d500123ac351faade1d4ac444"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/stmt/mod.rs: crates/perry-codegen/src/stmt/mod.rs changed 66 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in perry_codegen::stmt::lower_stmt_inner at line 424. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/stmt/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/perry-codegen/src/stmt/mod.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"921276665c61f7cad67421dc5020296706e730f82d3986b8d522616808288205"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/object_cache.rs: crates/perry/src/commands/compile/object_cache.rs changed 76 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in perry::commands::compile::object_cache::compute_object_cache_key_with_env at line 311. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/object_cache.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/perry/src/commands/compile/object_cache.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedcf12a42f558a5c1cad96890dc6439430419edda65994182824d2b0658faa5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/property_set.rs: crates/perry-codegen/src/expr/property_set.rs changed 64 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in perry_codegen::expr::property_set::lower at line 440. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/property_set.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/perry-codegen/src/expr/property_set.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"8233930224c198f89c8563be3d0565a680052ffd2494de34b6aaf0d3b57f8e17"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/binary.rs: crates/perry-codegen/src/expr/binary.rs changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 74 in perry_codegen::expr::binary::lower at line 1287. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/binary.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/perry-codegen/src/expr/binary.rs"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"540a9d171301d84abd6d24e64e0a10b6b024d9ce6ac32169fd0c7eac2adc3cc9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/static_field_meta.rs: crates/perry-codegen/src/expr/static_field_meta.rs changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 74 in perry_codegen::expr::static_field_meta::lower at line 163. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/static_field_meta.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/perry-codegen/src/expr/static_field_meta.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b7b7d98ceaedf5cf62b1decdf3ed1d36df032466adb04b80447b603f746bb3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/analysis/value_types.rs: crates/perry-hir/src/analysis/value_types.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 189 in perry_hir::analysis::value_types::infer_expr_type at line 551. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/analysis/value_types.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/analysis/value_types.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c28f78aa51fc5f979c9c3c07d4660914120d8277d385e3aa7be0f27c0d1ca28"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/collect_modules/feature_detect.rs: crates/perry/src/commands/compile/collect_modules/feature_detect.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 100 in perry::commands::compile::collect_modules::feature_detect::detect_optional_feature_usage at line 522. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/collect_modules/feature_detect.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/perry/src/commands/compile/collect_modules/feature_detect.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"851bf4291ba4f2cb8ffe267fafad0b6cf7f10d255651d0f95998d5748b0c2154"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen-wasm/src/wasm_runtime.js: crates/perry-codegen-wasm/src/wasm_runtime.js changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 331 in wasm_runtime.buildImports at line 137. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen-wasm/src/wasm_runtime.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/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"4643acda27adbf773d3e4008608e7a68aaf730c040aed18fddfa7b1b463c09fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/proxy_reflect.rs: crates/perry-codegen/src/expr/proxy_reflect.rs changed 49 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in perry_codegen::expr::proxy_reflect::lower at line 817. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/proxy_reflect.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/perry-codegen/src/expr/proxy_reflect.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c5eafcc600f8692b16e96398cea803f15fa960599fedd868e6c63381b0b531"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/instanceof.rs: crates/perry-runtime/src/object/instanceof.rs changed 60 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in perry_runtime::object::instanceof::global_builtin_constructor_class_id at line 188. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/instanceof.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/perry-runtime/src/object/instanceof.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"1091234c171f3e3926a74b2440b66352e6407f21d9f08d97d02f2c393bf19044"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/compare.rs: crates/perry-codegen/src/expr/compare.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 97 in perry_codegen::expr::compare::lower at line 1292. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/compare.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/perry-codegen/src/expr/compare.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d021b066fb1bdfb774a68982ca4f06e2010ccedc708971788a9844f4a11bca8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/instanceof/dynamic_dispatch.rs: crates/perry-runtime/src/object/instanceof/dynamic_dispatch.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 132 in perry_runtime::object::instanceof::dynamic_dispatch::js_instanceof_dynamic at line 85. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/instanceof/dynamic_dispatch.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/perry-runtime/src/object/instanceof/dynamic_dispatch.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5710483a9546eafd984b6fbbf3c8d6d426ee76e1868d36d51343532d26addd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/native_call_method/primitive_methods.rs: crates/perry-runtime/src/object/native_call_method/primitive_methods.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 102 in perry_runtime::object::native_call_method::primitive_methods::dispatch_primitive at line 167. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/native_call_method/primitive_methods.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/perry-runtime/src/object/native_call_method/primitive_methods.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"754c70b134d6701ccfffb246bbda76cfec795438b15049481d30b5bd712b4514"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/solve/apply.rs: crates/perry-wpfacts/src/solve/apply.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 303 in Model::apply_inner at line 4. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/solve/apply.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/perry-wpfacts/src/solve/apply.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04c2c872c93db48af2164bc1e05f6293337090ee5f741ff56bbc6228be24d7d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/stmt_loops.rs: crates/perry-hir/src/lower/stmt_loops.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 149 in perry_hir::lower::stmt_loops::lower_stmt_for_of_inner at line 654. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/stmt_loops.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/perry-hir/src/lower/stmt_loops.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"15165fcbc63a25646e784abc21cc5c81ac7103cd93dc21490805ed4fd4c1b6b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/arrays_finds.rs: crates/perry-codegen/src/expr/arrays_finds.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 95 in perry_codegen::expr::arrays_finds::lower at line 429. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/arrays_finds.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/perry-codegen/src/expr/arrays_finds.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ada1ffce0bb517c7202cae24b56d798a1b29f0ecef90bebfadb09aa7a3a218e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/build_cache.rs: crates/perry/src/commands/compile/build_cache.rs changed 88 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in perry::commands::compile::build_cache::eligibility at line 582. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/build_cache.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/perry/src/commands/compile/build_cache.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74fb05372f4bc37a09cdccb36f588d8c62a4b78b832a971f81ed62caf891812"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/value/dyn_index.rs: crates/perry-runtime/src/value/dyn_index.rs changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in perry_runtime::value::dyn_index::js_dyn_index_get at line 170. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/value/dyn_index.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/perry-runtime/src/value/dyn_index.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0762bff60245330730063ee861a16ea9d94c8cb3006f3463a7e6977e0a6188f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/closure/dynamic_props.rs: crates/perry-runtime/src/closure/dynamic_props.rs changed 57 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in perry_runtime::closure::dynamic_props::closure_get_dynamic_prop_keyed at line 180. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/closure/dynamic_props.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/perry-runtime/src/closure/dynamic_props.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"35654397f41008eaa80da15ac225970d964082d385e64705f93158824f6fb624"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/object_ops/keys_array.rs: crates/perry-runtime/src/object/object_ops/keys_array.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in perry_runtime::object::object_ops::keys_array::ensure_key_in_keys_array_inner at line 80. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/object_ops/keys_array.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/perry-runtime/src/object/object_ops/keys_array.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4bb497be772fcca2ef66eb62895c6747539e71ea0e181ec0fb0cf210bae37e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-http/src/server/handle_dispatch.rs: crates/perry-ext-http/src/server/handle_dispatch.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 106 in perry_ext_http::server::handle_dispatch::js_ext_http_server_dispatch_method at line 258. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-http/src/server/handle_dispatch.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/perry-ext-http/src/server/handle_dispatch.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9757d6c8e9dfbf9cd7ed548dc2ea9aefd1f20bbcdd22194a065184d0dbd217d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/type_analysis/numeric.rs: crates/perry-codegen/src/type_analysis/numeric.rs changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in perry_codegen::type_analysis::numeric::is_numeric_expr at line 178. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/type_analysis/numeric.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/perry-codegen/src/type_analysis/numeric.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18ce47065303041d8f89fa512ee749c136991c538a3e4c0f05208bc7a50cb96"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_assign.rs: crates/perry-hir/src/lower/expr_assign.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 95 in perry_hir::lower::expr_assign::lower_assignment_target at line 675. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_assign.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/perry-hir/src/lower/expr_assign.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"713cffca5e4ae684e7adbe05fd629f60a269ad894e5e4b4260b85d90381e2188"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/builtins/formatting.rs: crates/perry-runtime/src/builtins/formatting.rs changed 43 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in perry_runtime::builtins::formatting::format_jsvalue at line 588. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/builtins/formatting.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/perry-runtime/src/builtins/formatting.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2cf1f4822467158b28bbde5ed79809001f29d41f898806c4f189e2fd710831a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/array/push_pop.rs: crates/perry-runtime/src/array/push_pop.rs changed 63 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in perry_runtime::array::push_pop::proxy_array_mutator at line 351. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/array/push_pop.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/perry-runtime/src/array/push_pop.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1f7aafd0452acf12a052a17c230e1878cbfa36c5979bde90be66417198ab59"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/promise/microtasks.rs: crates/perry-runtime/src/promise/microtasks.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in perry_runtime::promise::microtasks::pump_protected at line 426. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/promise/microtasks.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/perry-runtime/src/promise/microtasks.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"5738e5bb44e11f51e8d07a2e2243b6308913e9965d0ca1265ff60269f9ba28dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/property_get/generic_dispatch.rs: crates/perry-codegen/src/expr/property_get/generic_dispatch.rs changed 64 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in perry_codegen::expr::property_get::generic_dispatch::lower_property_site_tail at line 501. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/property_get/generic_dispatch.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/perry-codegen/src/expr/property_get/generic_dispatch.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d0fbf90bbfc4b95957219a29a9b65f2de8ce199fc65b725cd7341c20f1ecea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/mod.rs: crates/perry-codegen/src/lower_call/mod.rs changed 65 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in perry_codegen::lower_call::lower_call at line 593. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/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/perry-codegen/src/lower_call/mod.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fb4f4641752c8e8ce60754c43ae54a25094579fb361e39a10c68120ce065ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_call/globals.rs: crates/perry-hir/src/lower/expr_call/globals.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 161 in perry_hir::lower::expr_call::globals::try_global_builtins at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_call/globals.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/perry-hir/src/lower/expr_call/globals.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0447f50e4128a42aaa45b894904f8f7c2b0e60b6ff96ed573491b20ad701669"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/descriptor_state.rs: crates/perry-runtime/src/object/descriptor_state.rs changed 83 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in perry_runtime::object::descriptor_state::plain_custom_prototype_may_intercept at line 662. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/descriptor_state.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/perry-runtime/src/object/descriptor_state.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"79452fb2a8ed15725a999c168926da1cad521dde586dd66c26545d4b9305aae0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/builtins.rs: crates/perry-wpfacts/src/builtins.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in perry_wpfacts::builtins::tok_load at line 559. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/builtins.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/perry-wpfacts/src/builtins.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6aa858ab8b77a95a7a3ccba3c30cc5c27732498a271922ada17ba004e12d01"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_call/mod.rs: crates/perry-hir/src/lower/expr_call/mod.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 87 in perry_hir::lower::expr_call::lower_call_inner at line 286. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_call/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/perry-hir/src/lower/expr_call/mod.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d683b44d3363c868d7b7ef494bd4c4c39ea17e245e7194f4ae42c18e2f93a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/param_type_guard.rs: crates/perry-runtime/src/param_type_guard.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 103 in GuardState::matches at line 509. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/param_type_guard.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/perry-runtime/src/param_type_guard.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"962dd61357361693feb1a1c35a29760a10aaf34ec2d39b65b6026de1655b5860"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/escape_check.rs: crates/perry-codegen/src/collectors/escape_check.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 180 in perry_codegen::collectors::escape_check::check_escapes_in_expr at line 227. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/escape_check.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/perry-codegen/src/collectors/escape_check.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5caf5fce1772e28270730044ff6096332aa635228cf07ee14ac3b8243a8b697"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/hir_facts.rs: crates/perry-codegen/src/collectors/hir_facts.rs changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in ArrayFactCollector::collect_expr at line 1534. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/hir_facts.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/perry-codegen/src/collectors/hir_facts.rs"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"967b36334ecc0faf840abd6aca8f646b36083fa5bde29c609cbf305a367bc68d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/class_registry/prototype_objects.rs: crates/perry-runtime/src/object/class_registry/prototype_objects.rs changed 50 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in perry_runtime::object::class_registry::prototype_objects::resolve_proto_chain_field_inner at line 597. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/class_registry/prototype_objects.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/perry-runtime/src/object/class_registry/prototype_objects.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7117711548b37d590ffd514a987a22f449db21e555588f77a071374cc9e300"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/value/dynamic_object.rs: crates/perry-runtime/src/value/dynamic_object.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in perry_runtime::value::dynamic_object::js_dynamic_object_get_property at line 320. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/value/dynamic_object.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/perry-runtime/src/value/dynamic_object.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e9313344f108b0cf887f9c5f992b1342e79d749443c6cdd91a82ea1a1eb042"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/child_process/reactor.rs: crates/perry-runtime/src/child_process/reactor.rs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in perry_runtime::child_process::reactor::cp_reactor_pump_inner at line 1176. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/child_process/reactor.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/perry-runtime/src/child_process/reactor.rs"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d1bc7f38f401337f53989a222b080d45b714b15376bc241f6be2e6f28073cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/new_alloc.rs: crates/perry-codegen/src/lower_call/new_alloc.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in perry_codegen::lower_call::new_alloc::emit_instance_alloc_inner at line 409. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/new_alloc.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/perry-codegen/src/lower_call/new_alloc.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ff64c9f76250f4b42530b75a8f4cfb1e63eb8b89b504e0075e578959ebb0fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/host_config.rs: crates/perry/src/commands/compile/host_config.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 188 in perry::commands::compile::host_config::apply_pkg_and_toml_config at line 114. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/host_config.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/perry/src/commands/compile/host_config.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"49fee39049e2c5155b3c436c3bd54ef2c20ce11cfad63271bf87b7095f2cf9d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/global_this/proto_methods.rs: crates/perry-runtime/src/object/global_this/proto_methods.rs changed 49 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in perry_runtime::object::global_this::proto_methods::populate_builtin_prototype_methods at line 434. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/global_this/proto_methods.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/perry-runtime/src/object/global_this/proto_methods.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"f741fc33fdba2ba3025b985bf8e7b0fa030aa91da6bddb4712dffdaf625d8f00"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/monomorph/substitute_expr.rs: crates/perry-hir/src/monomorph/substitute_expr.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 227 in perry_hir::monomorph::substitute_expr::substitute_expr at line 4. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/monomorph/substitute_expr.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/perry-hir/src/monomorph/substitute_expr.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"319e536dc5c88ef4dc40fa4a3d86defcb5ab4b048f9ddbcb6487f2a8e36ec4b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/class_registry/state.rs: crates/perry-runtime/src/object/class_registry/state.rs changed 92 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry_runtime::object::class_registry::state::reserved_native_parent_constructor_value at line 1476. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/class_registry/state.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/perry-runtime/src/object/class_registry/state.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1038acd573466fa31b6f295dbbe72040d182854fbd060db2d2c3cb5213abaa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/gc/policy.rs: crates/perry-runtime/src/gc/policy.rs changed 88 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in perry_runtime::gc::policy::gc_check_trigger_evaluate at line 3245. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/gc/policy.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/perry-runtime/src/gc/policy.rs"},"region":{"startLine":3245}}}],"partialFingerprints":{"codehealthFindingId/v1":"84aa37a4f9b5357aee4e9cb4b076c586630d341400d0963c95e1e83d84b78eaa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/early_branches.rs: crates/perry-codegen/src/lower_call/early_branches.rs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in perry_codegen::lower_call::early_branches::try_lower_closure_typed_local_call at line 378. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/early_branches.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/perry-codegen/src/lower_call/early_branches.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e079c716871f534145b576154556d9e53020a8b939b000ca412aa0ce3e83df5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/shape_descriptor_census.py: scripts/shape_descriptor_census.py changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in shape_descriptor_census.assert_authority_surfaces at line 425. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/shape_descriptor_census.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/shape_descriptor_census.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ebfff8794a849bb29289fc1d27861002e31e332e10a3bac2c545fed4d85c18"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/field_set_by_name/fast_paths.rs: crates/perry-runtime/src/object/field_set_by_name/fast_paths.rs changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in perry_runtime::object::field_set_by_name::fast_paths::object_set_field_by_name_transition_fast_impl_value at line 740. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/field_set_by_name/fast_paths.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/perry-runtime/src/object/field_set_by_name/fast_paths.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbaa964a10019b708db12178338a580f16e8e5e568bc8b7baacb4b8d1c52171"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/ptr_shape.rs: crates/perry-codegen/src/collectors/ptr_shape.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in UseWalk::walk_expr at line 1417. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/ptr_shape.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/perry-codegen/src/collectors/ptr_shape.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c01d59a96a45564c8d0f82160485522651c3f042a41ad2555f7330945d7239"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/pointer_locals.rs: crates/perry-codegen/src/collectors/pointer_locals.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 139 in perry_codegen::collectors::pointer_locals::collect_pointer_typed_locals at line 197. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/pointer_locals.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/perry-codegen/src/collectors/pointer_locals.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d9f83fa024a2ea89fb79ad88f50a242bcb561d746572d3dd8cb06d903f8226"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/summary.rs: crates/perry-wpfacts/src/summary.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in perry_wpfacts::summary::map_cons at line 231. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/summary.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/perry-wpfacts/src/summary.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b097681e8e8972c7a28a87796c0383cbca7e320faea6af2433fe18c08431e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/dispatch.rs: crates/perry-codegen/src/expr/dispatch.rs changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in perry_codegen::expr::dispatch::lower_expr_inner at line 40. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/dispatch.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/perry-codegen/src/expr/dispatch.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3738759b44ee6e697e3def3bcdd44210d877de06361f9aa549ede597ac05f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/helpers.rs: crates/perry-codegen/src/codegen/helpers.rs changed 72 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in perry_codegen::codegen::helpers::resolve_target_triple at line 927. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/helpers.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/perry-codegen/src/codegen/helpers.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c94e6fe8a041e42a4bbd108076174a1d08e8673c4c6ab72d6dd33f013e2dd6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/crypto/random.rs: crates/perry-stdlib/src/crypto/random.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 74 in perry_stdlib::crypto::random::js_crypto_native_dispatch at line 305. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/crypto/random.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/perry-stdlib/src/crypto/random.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cf7e855d560eacba12d12ca0d18a1fef88bc1644212320eecad1a5a6064d7f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/native_module/module_keys.rs: crates/perry-runtime/src/object/native_module/module_keys.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in perry_runtime::object::native_module::module_keys::native_module_enumerable_keys at line 1248. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/native_module/module_keys.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/perry-runtime/src/object/native_module/module_keys.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0eb0afc91d838822c16caa5981028727dd9d2f15404e7f5fd06cd3f60d3c1d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/json/stringify.rs: crates/perry-runtime/src/json/stringify.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in perry_runtime::json::stringify::stringify_array_depth at line 1023. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/json/stringify.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/perry-runtime/src/json/stringify.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22dc5fbfc1594282aaa482ff97154ca9d3bf31c7d609e866b9e9cd2b14ff702"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen-js/src/emit/exprs_more.rs: crates/perry-codegen-js/src/emit/exprs_more.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 303 in JsEmitter::emit_expr_continued at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen-js/src/emit/exprs_more.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/perry-codegen-js/src/emit/exprs_more.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d0bba1b9fa5ee8c92ccbc8bd60676ee45764fc1c388b324f01e0bdc4d8f0c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/class_registry.rs: crates/perry-runtime/src/object/class_registry.rs changed 113 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_runtime::object::class_registry::class_registry_census at line 251. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/class_registry.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/perry-runtime/src/object/class_registry.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"274ac30bb5111d67d2c58218375baadee874297c1bddaf77848ba823107a42ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_call/local_array_methods.rs: crates/perry-hir/src/lower/expr_call/local_array_methods.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 138 in perry_hir::lower::expr_call::local_array_methods::try_local_array_methods at line 162. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_call/local_array_methods.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/perry-hir/src/lower/expr_call/local_array_methods.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6f5b67140f4d71ab87fade68f64249213da3e7c946ee309da0564eee7d0adf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/native_call_method/common_methods.rs: crates/perry-runtime/src/object/native_call_method/common_methods.rs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in perry_runtime::object::native_call_method::common_methods::dispatch_common at line 5. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/native_call_method/common_methods.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/perry-runtime/src/object/native_call_method/common_methods.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3f84cf8de9789fba53528e6b0e22a09eea44462c941ccf66c8105278a441b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_object.rs: crates/perry-hir/src/lower/expr_object.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 98 in perry_hir::lower::expr_object::lower_object 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_object.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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfa4feb45cb7fcea71ba53e9e7621d6b16b8c06fd97696cae00b03e57aeb262"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_function.rs: crates/perry-hir/src/lower/expr_function.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in perry_hir::lower::expr_function::lower_fn_expr_anon at line 594. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_function.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/perry-hir/src/lower/expr_function.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6cc97fe23b9ff1c491814a8afe90cb7f07643a1905170b9263866c302dacb4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/stmt/element_shape_loop.rs: crates/perry-codegen/src/stmt/element_shape_loop.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 87 in perry_codegen::stmt::element_shape_loop::match_element_shape_versioned_loop at line 850. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/stmt/element_shape_loop.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/perry-codegen/src/stmt/element_shape_loop.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"9291a6bcc6ab2c5bd080fab6b2432d8f6cad0f1279996fd54ea4d4c91b0b44bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower_decl/class_decl/from_ast.rs: crates/perry-hir/src/lower_decl/class_decl/from_ast.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 102 in perry_hir::lower_decl::class_decl::from_ast::lower_class_from_ast at line 10. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower_decl/class_decl/from_ast.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/perry-hir/src/lower_decl/class_decl/from_ast.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8e922232ab1ea30f5aae339e6dc903710e721a35aadd294bdbfb745ffb78c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-transform/src/inline/mod.rs: crates/perry-transform/src/inline/mod.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in perry_transform::inline::inline_functions_inner at line 280. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-transform/src/inline/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/perry-transform/src/inline/mod.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c56ea0c2695c839136a13ccf2dec10b41f089d5b0e768541c16399a3d110b9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/map.rs: crates/perry-runtime/src/map.rs changed 57 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in perry_runtime::map::find_key_index_cold at line 1504. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/map.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/perry-runtime/src/map.rs"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87666058a5c92d85645dfa2ed8877870e647504b785420280d910c727f8f6bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_string_method.rs: crates/perry-codegen/src/lower_string_method.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 90 in perry_codegen::lower_string_method::lower_string_method_dispatch at line 488. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_string_method.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/perry-codegen/src/lower_string_method.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9bec537fae65877739c22aec4e080484bbb49384d3387e12c5f2180dfdffda"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/json/replacer.rs: crates/perry-runtime/src/json/replacer.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in perry_runtime::json::replacer::js_json_stringify_full at line 1310. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/json/replacer.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/perry-runtime/src/json/replacer.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec7198d7c84725629200820894393aa7961ad1060b77c699af6821a295207ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/class_constructors.rs: crates/perry-runtime/src/object/class_constructors.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in perry_runtime::object::class_constructors::js_super_construct_apply at line 600. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/class_constructors.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/perry-runtime/src/object/class_constructors.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f7d73527c382711d7079b683fc943e7f3ca4749f1f32f203303f497f0d83db"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/module_globals_emit.rs: crates/perry-codegen/src/codegen/module_globals_emit.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 82 in perry_codegen::codegen::module_globals_emit::emit_module_globals at line 187. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/module_globals_emit.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/perry-codegen/src/codegen/module_globals_emit.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccfe5a95eed0edc10680930ed21f28c89b5a512158b9851aa17656c1807b7626"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/native_get.rs: crates/perry-runtime/src/object/native_get.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in perry_runtime::object::native_get::try_data_lookup_key at line 132. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/native_get.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/perry-runtime/src/object/native_get.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"781dbc5dbd7912ada3a6a1cc82461408686abbc74f2b03b836a0d66de4fed24b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/native_emit.rs: crates/perry-codegen/src/native_emit.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in perry_codegen::native_emit::compile_module_units_native_with_workers at line 431. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/native_emit.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/perry-codegen/src/native_emit.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a3760db5c198fe731e52a62e2e217eb9b8126fcc89457650c813fb3871a06f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/array/indexing.rs: crates/perry-runtime/src/array/indexing.rs changed 56 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in perry_runtime::array::indexing::js_array_length at line 299. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/array/indexing.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/perry-runtime/src/array/indexing.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"e311b9c566660e4247bb9d5fc7bfdc901fec4a8fa7b44639e52224509bcf3851"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/object_ops/has_own.rs: crates/perry-runtime/src/object/object_ops/has_own.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in perry_runtime::object::object_ops::has_own::object_has_own_generic at line 83. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/object_ops/has_own.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/perry-runtime/src/object/object_ops/has_own.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6416e0ca12a0601a1a77b4892296ab9515e54bdec2ff9cda6afa7498537842ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/console_promise.rs: crates/perry-codegen/src/lower_call/console_promise.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in perry_codegen::lower_call::console_promise::try_lower_console_call at line 35. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/console_promise.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/perry-codegen/src/lower_call/console_promise.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"603e43bf2f37918eacc810a9b634c103479520871a1b86a2447dd9b31390e888"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/type_analysis/refine.rs: crates/perry-codegen/src/type_analysis/refine.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in perry_codegen::type_analysis::refine::refine_type_from_init at line 409. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/type_analysis/refine.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/perry-codegen/src/type_analysis/refine.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f52405dc8f9a13ec05a1eec6795a4de6d164b6e95f0118892b695ad2bc4955"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/prototype_chain.rs: crates/perry-runtime/src/object/prototype_chain.rs changed 80 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in perry_runtime::object::prototype_chain::object_set_static_prototype_impl_with at line 361. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/prototype_chain.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/perry-runtime/src/object/prototype_chain.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3e94105fe5db893bb6f2d50f637f6975a7b89901410bfff459998f165b9a78"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_member/member_tail.rs: crates/perry-hir/src/lower/expr_member/member_tail.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 123 in perry_hir::lower::expr_member::member_tail::lower_member_tail at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_member/member_tail.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/perry-hir/src/lower/expr_member/member_tail.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"adedbae15ad4b0b6b014bcc6aa962b00376bc48730a5539f5e43cd81dcf995ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/value/to_string.rs: crates/perry-runtime/src/value/to_string.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in perry_runtime::value::to_string::js_jsvalue_to_string_impl 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/value/to_string.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/perry-runtime/src/value/to_string.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"3235ff5e7137ff47efeea191a8940670be3ddc5f090c4973879627a04877f081"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower_types.rs: crates/perry-hir/src/lower_types.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 100 in perry_hir::lower_types::infer_type_from_expr_inner at line 417. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower_types.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_types.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0abb4378a9a5cf122272c226b282ce23fc17a2fafd3f08709ed3ea192d51c49"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/publish/mod.rs: crates/perry/src/commands/publish/mod.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 297 in perry::commands::publish::run_async 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/publish/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/perry/src/commands/publish/mod.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b222302a52cf5f153a7abe902007767de39ec3bb8f97030216461f1676bf64"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/assign.rs: crates/perry-runtime/src/object/assign.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in perry_runtime::object::assign::object_assign_one at line 666. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/assign.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/perry-runtime/src/object/assign.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea25d02fd42b289da065c033a626c35d846abaf8ddbeba778fd8ef17d4ec808"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_call/array_only_methods.rs: crates/perry-hir/src/lower/expr_call/array_only_methods.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 110 in perry_hir::lower::expr_call::array_only_methods::try_array_only_methods at line 415. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_call/array_only_methods.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/perry-hir/src/lower/expr_call/array_only_methods.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f08a6d7c8d4dd259aa9c4dda767f3aee3d68b96f8d1f330b9130a8bd79e7cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/gc/types.rs: crates/perry-runtime/src/gc/types.rs changed 75 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_runtime::gc::types::validate_gc_type_info at line 1458. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/gc/types.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/gc/types.rs"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da8d21f9c39a5e3cc12ccf7a04a1531b084b5d027cf3b69f96f79acc4269cac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/typed_feedback.rs: crates/perry-runtime/src/typed_feedback.rs changed 59 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in perry_runtime::typed_feedback::js_typed_feedback_array_index_get_fallback_boxed at line 2251. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/typed_feedback.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/perry-runtime/src/typed_feedback.rs"},"region":{"startLine":2251}}}],"partialFingerprints":{"codehealthFindingId/v1":"658998a3fb367548d6e55c020fc1eb0ccf2482a26b42ed6c6135b796aed4cb17"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/folded_builtin_override.rs: crates/perry-codegen/src/expr/folded_builtin_override.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in perry_codegen::expr::folded_builtin_override::folded_call at line 94. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/folded_builtin_override.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/perry-codegen/src/expr/folded_builtin_override.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"98db06bc9df4d6d2f34cdc2b89b042f8fe004986ec68cd802d522d8805707d99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/js_transform/imports.rs: crates/perry-hir/src/js_transform/imports.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 156 in perry_hir::js_transform::imports::transform_expr at line 537. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/js_transform/imports.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/perry-hir/src/js_transform/imports.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"936dff85c7f3b1b61579ff72c77cd5e4a665764c803720dbb84d536e5f67261f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/closure/dispatch/bound.rs: crates/perry-runtime/src/closure/dispatch/bound.rs changed 43 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in perry_runtime::closure::dispatch::bound::function_bind_observable at line 840. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/closure/dispatch/bound.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/perry-runtime/src/closure/dispatch/bound.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d9bd7671d93d0dfc3fa73511766ec01b22c964236f6363c76e1130461bf93d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/array/iterator.rs: crates/perry-runtime/src/array/iterator.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in perry_runtime::array::iterator::array_from_spread_value at line 896. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/array/iterator.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/perry-runtime/src/array/iterator.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc48d4f365f008885f444bab4d332e559dc681930dae2e26f7a5993ebcfce479"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/array_object_ops.rs: crates/perry-runtime/src/object/array_object_ops.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in perry_runtime::object::array_object_ops::define_array_property at line 300. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/array_object_ops.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/perry-runtime/src/object/array_object_ops.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e108794da785da9e8061d8d270b40cfc10c8deb2cabd1f4371e415d898e1621"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/native_module/callable_exports.rs: crates/perry-runtime/src/object/native_module/callable_exports.rs changed 48 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in perry_runtime::object::native_module::callable_exports::bound_native_callable_export_value at line 39. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/native_module/callable_exports.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/perry-runtime/src/object/native_module/callable_exports.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"52fd778b57ba149e839979d8ae37d68126561a0124a840a07d195bcf5689f619"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/stmt/region_loop/mod.rs: crates/perry-codegen/src/stmt/region_loop/mod.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in perry_codegen::stmt::region_loop::lower_split at line 1031. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/stmt/region_loop/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/perry-codegen/src/stmt/region_loop/mod.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"776d4a25dbd9c8bbe669203bcf7d470b3f1334595ba10080e6b3cfbf3127a2af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/closure/registry.rs: crates/perry-runtime/src/closure/registry.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in perry_runtime::closure::registry::dispatch_with_arity at line 450. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/closure/registry.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/perry-runtime/src/closure/registry.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcc2ab1927aea2b146af14c19df445564d5188fd633e3a73073901bd3279efc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/dyn_extern_i18n.rs: crates/perry-codegen/src/expr/dyn_extern_i18n.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in perry_codegen::expr::dyn_extern_i18n::lower at line 618. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/dyn_extern_i18n.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/perry-codegen/src/expr/dyn_extern_i18n.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd691a0a1f8ee8fcf837e9bc175517b80313f60d3f17a6d39d66dd8982fa94d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-transform/src/generator/lower.rs: crates/perry-transform/src/generator/lower.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in perry_transform::generator::lower::transform_generator_function_with_extra_captures at line 301. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-transform/src/generator/lower.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/perry-transform/src/generator/lower.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ee7aafb56491fdf3fa25d6054e2df923cc43d3a1b9e8cafc756be094a37c65"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/json_tape.rs: crates/perry-runtime/src/json_tape.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in perry_runtime::json_tape::build_tape_into at line 176. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/json_tape.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/perry-runtime/src/json_tape.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"00712e6ddd5332c4d4300556fa1afdd758e87f039283effa9413964f5a56e964"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen-js/src/emit/exprs.rs: crates/perry-codegen-js/src/emit/exprs.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 319 in JsEmitter::emit_expr at line 65. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen-js/src/emit/exprs.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/perry-codegen-js/src/emit/exprs.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da2ee258fb7ac0a4ab7310cf09d251c46dcc7eaab881488c76592f24db1d283"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/gen.rs: crates/perry-wpfacts/src/gen.rs changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Gen::reports at line 630. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/gen.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/perry-wpfacts/src/gen.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"255a8368296e559cfa0b5bd08801e9b22574c12e16714a1bc50e52c6e4bfb0d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/field_init.rs: crates/perry-codegen/src/lower_call/field_init.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in perry_codegen::lower_call::field_init::apply_field_initializers_recursive at line 630. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/field_init.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/perry-codegen/src/lower_call/field_init.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bb72b2b336a6247daf6af5292af1d3b3bac0312d8beb7280c962cfab919411"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/optimized_libs/driver.rs: crates/perry/src/commands/compile/optimized_libs/driver.rs changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in perry::commands::compile::optimized_libs::driver::build_optimized_libs at line 42. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/optimized_libs/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/perry/src/commands/compile/optimized_libs/driver.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f709996ec7f5e17616b965576da63ca26bb733deb0e685090cbd894cc8c305c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/gc/barrier/mod.rs: crates/perry-runtime/src/gc/barrier/mod.rs changed 54 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in perry_runtime::gc::barrier::scan_dirty_object_slots at line 176. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/gc/barrier/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/perry-runtime/src/gc/barrier/mod.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe1dc6cb7206e97b6de069cbe54138237ec8cf0e3fd2eb598dee26ed5e5fd4a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/analysis.rs: crates/perry-hir/src/analysis.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in perry_hir::analysis::replace_this_in_expr at line 1147. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/analysis.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/perry-hir/src/analysis.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb05a189ed48059392eae241ecf236734dc9a114c6d7d2e8b4af5e49e4fb1ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/gc/oldgen.rs: crates/perry-runtime/src/gc/oldgen.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in perry_runtime::gc::oldgen::legacy_sweep_with_age_bump_and_old_reclaim_targets at line 802. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/gc/oldgen.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/perry-runtime/src/gc/oldgen.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8cb1f6899ef470b97148c2f77b29d98404baf8b9f1192a8265d3ac0b896eae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/extern_func.rs: crates/perry-codegen/src/lower_call/extern_func.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 93 in perry_codegen::lower_call::extern_func::try_lower_extern_func_call at line 626. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/extern_func.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/perry-codegen/src/lower_call/extern_func.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1aaf060c5d355ef6d9683b36e74997bf6483ce103b39c97f1bd8f3651a8d37a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/to_string_tag.rs: crates/perry-runtime/src/object/to_string_tag.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in perry_runtime::object::to_string_tag::js_object_to_string at line 148. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/to_string_tag.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/perry-runtime/src/object/to_string_tag.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"59505e021a7ed44bb15e48870fb16317c74699579c4353ccc8f7f54c7a5f5612"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/refs.rs: crates/perry-codegen/src/collectors/refs.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 150 in perry_codegen::collectors::refs::refs_expr 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/refs.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/perry-codegen/src/collectors/refs.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"7724b6a4e368c4c3bac17e8b88dc6441417a362de83198af2856ded5888fce92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/func_ref.rs: crates/perry-codegen/src/lower_call/func_ref.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in perry_codegen::lower_call::func_ref::try_lower_func_ref_call at line 828. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/func_ref.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/perry-codegen/src/lower_call/func_ref.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7805d38202d77151989082194e4f00c00e3ae882d996e2a00ef2def9c688168"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-zlib/src/stream.rs: crates/perry-ext-zlib/src/stream.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in perry_ext_zlib::stream::create_stream at line 762. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-zlib/src/stream.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/perry-ext-zlib/src/stream.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"8791f261270b74f5de7f261a02a419649b55bad378b770958d2d6c1d8271bb6d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/gc/layout.rs: crates/perry-runtime/src/gc/layout.rs changed 79 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_runtime::gc::layout::layout_note_slot_transition at line 449. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/gc/layout.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/perry-runtime/src/gc/layout.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cde72dcca2e14772a618377a2f540015abe52a769bbe85ae9912e80fdbc76e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/resolve.rs: crates/perry/src/commands/compile/resolve.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in perry::commands::compile::resolve::resolve_import_with_bunfs at line 1580. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/resolve.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/perry/src/commands/compile/resolve.rs"},"region":{"startLine":1580}}}],"partialFingerprints":{"codehealthFindingId/v1":"472371c3a025a549502beb38eb0e6a1715953c60997ccff619f79bf35b55aea5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/gc/cycle.rs: crates/perry-runtime/src/gc/cycle.rs changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in GcCycleState::step_reclaim at line 1669. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/gc/cycle.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/perry-runtime/src/gc/cycle.rs"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d383741599da412a5733334188849b75580864b39c525e4def5e074578b2fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/entry/module_init.rs: crates/perry-codegen/src/codegen/entry/module_init.rs changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in perry_codegen::codegen::entry::module_init::compile_module_init at line 6. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/entry/module_init.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/perry-codegen/src/codegen/entry/module_init.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1d72e14cc5c1a38a1903a7ce110af7e72561b3265b273beae467fcaa34cacd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/object_ops_frozen.rs: crates/perry-runtime/src/object/object_ops_frozen.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in perry_runtime::object::object_ops_frozen::object_integrity_level at line 549. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/object_ops_frozen.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/perry-runtime/src/object/object_ops_frozen.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"7603310a6d392135ac1c8bcefec258ee39942600d8ea397696e6ade732bb9af4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/static_constfn.rs: crates/perry-codegen/src/codegen/static_constfn.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in perry_codegen::codegen::static_constfn::collect_literal_finals at line 124. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/static_constfn.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/perry-codegen/src/codegen/static_constfn.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bdf6bb8574b504372bcf26463e0202c4b9e3997076c9d3c1ef83bc29375fd54"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/alloc.rs: crates/perry-runtime/src/object/alloc.rs changed 63 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in perry_runtime::object::alloc::js_object_copy_own_fields at line 1141. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/alloc.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/perry-runtime/src/object/alloc.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba35dbaf4a0931158a2f26e89472b0c4b58e1b7a88459b8de38b7d8cd5af8bfd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/destructuring/var_decl/native_fetch.rs: crates/perry-hir/src/destructuring/var_decl/native_fetch.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 141 in perry_hir::destructuring::var_decl::native_fetch::register_native_fetch_and_streams at line 20. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/destructuring/var_decl/native_fetch.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/perry-hir/src/destructuring/var_decl/native_fetch.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20a87702702c84e896b1083f9acb6f295add90e3f64e3950b9006c1328e3d1c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_array_method.rs: crates/perry-codegen/src/lower_array_method.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in perry_codegen::lower_array_method::lower_array_method at line 227. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_array_method.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/perry-codegen/src/lower_array_method.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f1291e3b8ecfe9b6d6fb0ad22cc229e44c196894ee2c59d8c7011af54f8d1f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/closure.rs: crates/perry-codegen/src/expr/closure.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in perry_codegen::expr::closure::lower at line 144. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/closure.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/perry-codegen/src/expr/closure.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3da9f0b26e37817291713217d22eb1fc265707136c8c7bbd905933019caa6ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/layout_desc.rs: crates/perry-runtime/src/object/layout_desc.rs changed 54 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in perry_runtime::object::layout_desc::image_matches at line 1156. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/layout_desc.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/perry-runtime/src/object/layout_desc.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"f475fd4be8bf98300e5c354d181d6838d06ec2b82e921f8b7318c34e1d8c0973"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-ws/src/lib.rs: crates/perry-ext-ws/src/lib.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in perry_ext_ws::js_ws_process_pending at line 1548. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-ws/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/perry-ext-ws/src/lib.rs"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b6cda91375eba45f5d56a604ca6fa59181bfce520e499c545ad87d64745cbc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/layout_desc.rs: crates/perry-codegen/src/layout_desc.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in perry_codegen::layout_desc::emit_module_layouts at line 819. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/layout_desc.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/perry-codegen/src/layout_desc.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"9938bdbf570b15c8b25be7ac57c077b4c85a76e4e94976d76fc7e4fd9526b79a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/array_push.rs: crates/perry-codegen/src/expr/array_push.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in perry_codegen::expr::array_push::lower_inner at line 804. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/array_push.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/perry-codegen/src/expr/array_push.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"0783cb27e5bd6e32c21bb8f0a73c106740439abc7dd30c5e8f825f8786ee3410"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/call_spread.rs: crates/perry-codegen/src/expr/call_spread.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in perry_codegen::expr::call_spread::lower 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/call_spread.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/call_spread.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"22db8e4c93ff4557841c462cf27ce77a8a745e77d5919cfb0e10d2cce721cf85"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/array/header.rs: crates/perry-runtime/src/array/header.rs changed 58 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in perry_runtime::array::header::clean_arr_ptr_resolve at line 534. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/array/header.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/perry-runtime/src/array/header.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"3873364077061acabe3c849626df898563c584f2cb0a581b0f35dc5045ce0a5a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/write_barrier.rs: crates/perry-codegen/src/expr/write_barrier.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in perry_codegen::expr::write_barrier::lower_stream_super_init at line 974. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/write_barrier.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/perry-codegen/src/expr/write_barrier.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefafdd85995af0b9a23c752b8f7994ac7c32fe5a80dfd12dd6a5ef2c06f1922"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/gen/export.rs: crates/perry-wpfacts/src/gen/export.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in Gen::nested_fields at line 1635. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/gen/export.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/gen/export.rs"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d42af2662de7c1f577573b843964b34ae45d209a160fdd6269e1f60f6b26a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/function.rs: crates/perry-codegen/src/function.rs changed 54 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in LlFunction::define_header_with_size_attrs at line 1058. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/function.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/perry-codegen/src/function.rs"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6e1e7f41f0277b20b4bd595722cb7c95ee8a851bd7a1c54854660687e1dc4d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/json/stringify_shape_template.rs: crates/perry-runtime/src/json/stringify_shape_template.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in perry_runtime::json::stringify_shape_template::try_emit_shape_element at line 331. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/json/stringify_shape_template.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/perry-runtime/src/json/stringify_shape_template.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a31c4655be6f3f9bed776cacadcd58da42c1bf1fe3ad0803bf1f84b8feff760"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/layout_probe.rs: crates/perry-runtime/src/object/layout_probe.rs changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in perry_runtime::object::layout_probe::probe_has at line 1597. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/layout_probe.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/perry-runtime/src/object/layout_probe.rs"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c36aebfe485a8e2bdcf4439c04d545ccb4d132bfbfcc461e3f0ead64036ac8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/escape_news.rs: crates/perry-codegen/src/collectors/escape_news.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 126 in perry_codegen::collectors::escape_news::collect_used_new_fields_in_expr at line 231. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/escape_news.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/perry-codegen/src/collectors/escape_news.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab8e07cb6bd3a04fc31254dac268272c9d199c5d95992341b13854adcbd4a64"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/typed_array_proto_thunks.rs: crates/perry-runtime/src/object/typed_array_proto_thunks.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in perry_runtime::object::typed_array_proto_thunks::dispatch_uint8_buffer_method at line 750. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/typed_array_proto_thunks.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/perry-runtime/src/object/typed_array_proto_thunks.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"02161cbe63c09b7aef4be998258acd580579337cab7967b1897b97b0be425101"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/json/stringify_object.rs: crates/perry-runtime/src/json/stringify_object.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in perry_runtime::json::stringify_object::stringify_object_walk at line 160. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/json/stringify_object.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/perry-runtime/src/json/stringify_object.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"970cd992a9e3fc44fa5b8d7756f31b16eeda997d9b9a27307bea5558b4995679"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/bigint_set.rs: crates/perry-codegen/src/expr/bigint_set.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in perry_codegen::expr::bigint_set::lower at line 434. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/bigint_set.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/perry-codegen/src/expr/bigint_set.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afc9396be5cbb3fc17330b6e30ece6ca94d4c54be251c7ed471ebe3a7980c3f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/wpfacts_recompute.py: scripts/wpfacts_recompute.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 121 in Solver.apply at line 311. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/wpfacts_recompute.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wpfacts_recompute.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4dd05148fc4fbf9a19432f0ffd9dc74f50b51854b335d99e7c28416382e47c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/thread.rs: crates/perry-runtime/src/thread.rs changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in perry_runtime::thread::parallel_map_impl at line 679. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/thread.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/perry-runtime/src/thread.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e1a6ae635716abebd209f9dd2c93c41563618186852b2c93663ae69e50de4f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/native_module_registry.rs: crates/perry-runtime/src/object/native_module_registry.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in perry_runtime::object::native_module_registry::nm_module_index at line 77. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/native_module_registry.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/perry-runtime/src/object/native_module_registry.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df6e8f74abfcd9107ea2de6f407ab563554e03a253804e81abe2a4adc11fca9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/solve/call_and_construct.rs: crates/perry-wpfacts/src/solve/call_and_construct.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in Model::escape at line 776. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/solve/call_and_construct.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/perry-wpfacts/src/solve/call_and_construct.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed2bd93ccb86a3fb22c0d1e6c1745917c0d02575e6a0634fb413cef901ef7fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_new/member.rs: crates/perry-hir/src/lower/expr_new/member.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 87 in perry_hir::lower::expr_new::member::lower_new_member_native at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_new/member.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/perry-hir/src/lower/expr_new/member.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c4ee90af61d0e6dd2ae2b46fbb58dbac22e1a967628dd5175484c9ac91e0b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/symbol/properties.rs: crates/perry-runtime/src/symbol/properties.rs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in perry_runtime::symbol::properties::set_symbol_property at line 284. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/symbol/properties.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/perry-runtime/src/symbol/properties.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57aa71fa822959090b7a419e9ee9cbb09cef7d13ee050df8231528d28fe00dc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/field_get_set/class_object_props.rs: crates/perry-runtime/src/object/field_get_set/class_object_props.rs changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in perry_runtime::object::field_get_set::class_object_props::instance_constructor_value at line 587. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/field_get_set/class_object_props.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/perry-runtime/src/object/field_get_set/class_object_props.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b31a8ad5159b271cc40c027588cb2bb60e8150609b560381a5d3a9c3d690402"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/object_ops/define_properties.rs: crates/perry-runtime/src/object/object_ops/define_properties.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in perry_runtime::object::object_ops::define_properties::js_object_set_prototype_of 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/object_ops/define_properties.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/perry-runtime/src/object/object_ops/define_properties.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee5017328e68e56c88060951e22c95dea61b50f8fc182adf2186ab536fc9eac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/new_dynamic.rs: crates/perry-codegen/src/expr/new_dynamic.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in perry_codegen::expr::new_dynamic::lower at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/new_dynamic.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/perry-codegen/src/expr/new_dynamic.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c3b741b279b62e0a94b5ede0ecd405444cb95e380aee859147cd6cf0f33319"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/method_static.rs: crates/perry-codegen/src/codegen/method_static.rs changed 54 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in perry_codegen::codegen::method_static::compile_static_method at line 13. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/method_static.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/perry-codegen/src/codegen/method_static.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"789dfe407d57160c6a691d142d1f1cc0287294d09e0040ea23d8a91eb8f2d4e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/options/fetch.rs: crates/perry-codegen/src/lower_call/options/fetch.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 153 in perry_codegen::lower_call::options::fetch::lower_fetch_native_method 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/options/fetch.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/perry-codegen/src/lower_call/options/fetch.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0870826c73e7230eb8dd9a3fe13c5543b06b6da0ac96ebaac1a496cb51066f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/module_require.rs: crates/perry-runtime/src/module_require.rs changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry_runtime::module_require::js_require_resolve_node_modules at line 1416. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/module_require.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/perry-runtime/src/module_require.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94766f09c8143b91ab420266ad556bcc8e38d63b80bb53b3af3daa733183292"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/gc_runtime_root_holders.py: scripts/gc_runtime_root_holders.py changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in gc_runtime_root_holders.self_test at line 1621. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/gc_runtime_root_holders.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gc_runtime_root_holders.py"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25f48bf82462098f458a13e4bb0f67053b46242e06af0e6bceb15c80e9b5226"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/crypto/cipher.rs: crates/perry-stdlib/src/crypto/cipher.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 112 in perry_stdlib::crypto::cipher::cipher_step at line 793. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/crypto/cipher.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/perry-stdlib/src/crypto/cipher.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"57dda2ff60c83cccdcd0ad6f3782355d8216e1c7c883f9ae1fabb2c26182ea70"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/static_method.rs: crates/perry-codegen/src/expr/static_method.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in perry_codegen::expr::static_method::lower at line 183. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/static_method.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/perry-codegen/src/expr/static_method.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f36eb89717283a1145179c72b7358815f556bba9091b159c2661e715982a78"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/builtins/arithmetic.rs: crates/perry-runtime/src/builtins/arithmetic.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in perry_runtime::builtins::arithmetic::js_loose_eq at line 74. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/builtins/arithmetic.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/perry-runtime/src/builtins/arithmetic.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4820b8364c8b696d3a5ed39ce000168da47f0352ca301334420303b9c5b522"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/worker_threads.rs: crates/perry-stdlib/src/worker_threads.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in perry_stdlib::worker_threads::js_worker_threads_worker_new at line 1412. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/worker_threads.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/perry-stdlib/src/worker_threads.rs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"744142fc65d070662d2881f061e46a9a12e7a30ee691e33346e31ea1c3ff3edf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/context.rs: crates/perry-hir/src/lower/context.rs changed 55 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in LoweringContext::register_native_profile_type_alias at line 1258. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/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/perry-hir/src/lower/context.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d4180599291e05d8d4e2ab2b95ec123141cecd8d98b80cc14d2f7bb104e9a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen-wasm/src/emit/string_collection.rs: crates/perry-codegen-wasm/src/emit/string_collection.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 124 in WasmModuleEmitter::collect_strings_in_expr at line 453. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen-wasm/src/emit/string_collection.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/perry-codegen-wasm/src/emit/string_collection.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda6cdbd4af6b6f5ea4348d3d09e6668b242b59b0ce45f1fe30a6109c8b59d78"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/units.rs: crates/perry-wpfacts/src/units.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in ClassContract::join at line 511. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/units.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/perry-wpfacts/src/units.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3e9b6e20219e0cb8dd5cf75313585c14927807b8d7c86ed34352e9a7d0be17"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/array/subclass.rs: crates/perry-runtime/src/array/subclass.rs changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in perry_runtime::array::subclass::build_dense_layout at line 246. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/array/subclass.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/perry-runtime/src/array/subclass.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2cb91d44ec427e09efb946aa69bf4fed6371f0b6b79baa1acdfff59a82f3e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen-js/src/emit/calls.rs: crates/perry-codegen-js/src/emit/calls.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 172 in JsEmitter::emit_ui_method_call at line 125. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen-js/src/emit/calls.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/perry-codegen-js/src/emit/calls.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5965ce6f439e7814fc9789d6ea0a64f0641816ef4b85c1a70a2660e9fc28ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/node_stream_constructors/builders.rs: crates/perry-runtime/src/node_stream_constructors/builders.rs changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in perry_runtime::node_stream_constructors::builders::init_transform_kind at line 577. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/node_stream_constructors/builders.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/perry-runtime/src/node_stream_constructors/builders.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21c986b74f58f44c56db991af8d8d8c0a6bc2b810e4283b02be78df195a8c65"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/strip_dedup.rs: crates/perry/src/commands/compile/strip_dedup.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in perry::commands::compile::strip_dedup::strip_duplicate_objects_from_lib_with_evidence 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/strip_dedup.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/perry/src/commands/compile/strip_dedup.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"1255142f186b66de6123c71639d5bd968d15175e2fbe89ca783a1822b92b5e7e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/native_call_method/string_methods.rs: crates/perry-runtime/src/object/native_call_method/string_methods.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 93 in perry_runtime::object::native_call_method::string_methods::dispatch_string 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/native_call_method/string_methods.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/perry-runtime/src/object/native_call_method/string_methods.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbaaf6686dbaaedaf0ec29b44af31cf50640322fcdea2682817d751fdc575c7a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/arena/page_meta/mod.rs: crates/perry-runtime/src/arena/page_meta/mod.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_runtime::arena::page_meta::unregister_old_objects_batch at line 1438. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/arena/page_meta/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/perry-runtime/src/arena/page_meta/mod.rs"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"5612ee57050d2352f9704fdc3035a1f9e7e8b93a9d1676c420609728c950b158"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/layout_families.rs: crates/perry-codegen/src/layout_families.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in perry_codegen::layout_families::own_keys at line 572. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/layout_families.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/perry-codegen/src/layout_families.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"deadb01246fa1bcb68c9e8918785fc6e0cc42f6c39db5161c70d2921ab686ba3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/symbol/iterator.rs: crates/perry-runtime/src/symbol/iterator.rs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in perry_runtime::symbol::iterator::js_get_iterator at line 211. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/symbol/iterator.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/perry-runtime/src/symbol/iterator.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"63396eba654b2d25dedda0f06061011a2192c8f4aba3a9c912b5a52e94635c66"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/destructuring/var_decl/native_new.rs: crates/perry-hir/src/destructuring/var_decl/native_new.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in perry_hir::destructuring::var_decl::native_new::register_native_from_new_and_calls at line 15. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/destructuring/var_decl/native_new.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/perry-hir/src/destructuring/var_decl/native_new.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa389292cf7730742b892952fa6b2c4b60fa04bab48172d8b759ab92a29583d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/gc/roots.rs: crates/perry-runtime/src/gc/roots.rs changed 55 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_runtime::gc::roots::mark_mutable_root_slots_step at line 1565. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/gc/roots.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/perry-runtime/src/gc/roots.rs"},"region":{"startLine":1565}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeca6736f5d2c272368cacb1160f220e2a3b077af7a66fe473e231ba7d51f3da"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/i32_fast_path.rs: crates/perry-codegen/src/expr/i32_fast_path.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in perry_codegen::expr::i32_fast_path::lower_expr_native_i32 at line 1330. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/i32_fast_path.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/perry-codegen/src/expr/i32_fast_path.rs"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c959fd98d8e165d90cfa167efeff3ac052ad07d98c1e0d1d1149699e04daa2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/lower_expr/arm_class.rs: crates/perry-hir/src/lower/lower_expr/arm_class.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in perry_hir::lower::lower_expr::arm_class::lower_class_expr at line 8. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/lower_expr/arm_class.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/perry-hir/src/lower/lower_expr/arm_class.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e43d1745f2301f38a1cd928f44b3f2570bb0d83a7aa19fc366003045a51fea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/native_call_method/collection_methods.rs: crates/perry-runtime/src/object/native_call_method/collection_methods.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in perry_runtime::object::native_call_method::collection_methods::dispatch_map_set at line 80. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/native_call_method/collection_methods.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/perry-runtime/src/object/native_call_method/collection_methods.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c1506771ea08f85c00ede7d6ebba460477de828b77cf5c05cffc4eaba624f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_call/native_module.rs: crates/perry-hir/src/lower/expr_call/native_module.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in perry_hir::lower::expr_call::native_module::try_native_module_methods at line 337. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_call/native_module.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/perry-hir/src/lower/expr_call/native_module.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b548975b2202cabb28eb035b893d875119f02b05afa357d054d0db63a10e4f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/field_get_set/accessors.rs: crates/perry-runtime/src/object/field_get_set/accessors.rs changed 54 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_runtime::object::field_get_set::accessors::ordinary_object_prototype_property_value at line 485. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/field_get_set/accessors.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/perry-runtime/src/object/field_get_set/accessors.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c969e65b918816d73c2c0c8c87938922c050eb13e8909b3d06c720414407c25"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/slot_rep.rs: crates/perry-codegen/src/expr/slot_rep.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in perry_codegen::expr::slot_rep::collect_canonical_str_ineligible_locals at line 721. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/slot_rep.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/perry-codegen/src/expr/slot_rep.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"22bab4c7824c6902c79ffa34c24405f8093536c6ae36c241d7e5b689562d56fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/polymorphic_index.rs: crates/perry-runtime/src/object/polymorphic_index.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in perry_runtime::object::polymorphic_index::js_object_get_index_polymorphic at line 139. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/polymorphic_index.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/perry-runtime/src/object/polymorphic_index.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0b692f9f7c255a8ba117d1cda67395ff9411f42d09c165e0960b4d49bff6a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/gen_call.rs: crates/perry-wpfacts/src/gen_call.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in Gen::runtime_extern at line 466. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/gen_call.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/perry-wpfacts/src/gen_call.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"9675a22be6bc549114485757674b1f9af7a362581fe5109bde1bd2a0c33f5405"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/webassembly.rs: crates/perry-runtime/src/webassembly.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in perry_runtime::webassembly::call_wasm_import at line 855. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/webassembly.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/perry-runtime/src/webassembly.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab071f1f1fbb2824c3ef49da9eb1c845f7492caec59ae023e67b036bd7759fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/json/parser.rs: crates/perry-runtime/src/json/parser.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in DirectParser::parse_number at line 1258. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/json/parser.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/json/parser.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c5b3e27dc41a52ba8e352d63aa2e1ec3d589cc7db8306af45b56e5949aec68"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/native_payload.rs: crates/perry-runtime/src/native_payload.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in perry_runtime::native_payload::export_class_id at line 1782. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/native_payload.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/perry-runtime/src/native_payload.rs"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0fe6fec49c522b4c864b1d8273d4b3e963ef11d846af9d19a7b65c857cd50d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-transform/src/inline/factory_specialize.rs: crates/perry-transform/src/inline/factory_specialize.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 110 in perry_transform::inline::factory_specialize::specialize_captured_class_factories at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-transform/src/inline/factory_specialize.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/perry-transform/src/inline/factory_specialize.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4100420687c549500375e9b5b4ffbd5e8ce8a16a47becc8be1980bca0309fd74"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen-wasm/src/emit/js_fallback.rs: crates/perry-codegen-wasm/src/emit/js_fallback.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 110 in WasmModuleEmitter::emit_js_expr 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen-wasm/src/emit/js_fallback.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/perry-codegen-wasm/src/emit/js_fallback.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb14d4f92d33a99d21258fc0e69b5e00f53a22e1e59a32983c461434008a2f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower_decl/class_captures.rs: crates/perry-hir/src/lower_decl/class_captures.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in perry_hir::lower_decl::class_captures::synthesize_class_captures at line 297. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower_decl/class_captures.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/perry-hir/src/lower_decl/class_captures.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"8747b3d6f2b2a764d6e6c4dd11c4c90f6a3cb664557728408337cda745349959"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/js_transform/local_natives.rs: crates/perry-hir/src/js_transform/local_natives.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in perry_hir::js_transform::local_natives::fix_native_instance_expr_with_locals 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/js_transform/local_natives.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/perry-hir/src/js_transform/local_natives.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a71c6bfe0b3a7f3f45ddbe2140c1373fb53b3cd4ff9e54ff51219517092b5a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/node_stream_readwrite.rs: crates/perry-runtime/src/node_stream_readwrite.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_runtime::node_stream_readwrite::drain_readable_from_events at line 870. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/node_stream_readwrite.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/perry-runtime/src/node_stream_readwrite.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"daeb8a688a62159ad159889c654497227752dcc806647a91df23acd6f6d19d1c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/array/flat_clone.rs: crates/perry-runtime/src/array/flat_clone.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in perry_runtime::array::flat_clone::js_array_clone at line 474. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/array/flat_clone.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/perry-runtime/src/array/flat_clone.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"286c31054ebabe63120071b3d8f918f7ae3c7c6f7994a9ff77c33890d8b7ac23"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/misc_methods.rs: crates/perry-codegen/src/expr/misc_methods.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in perry_codegen::expr::misc_methods::lower at line 144. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/misc_methods.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/perry-codegen/src/expr/misc_methods.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"990f5184e7f42a68adb42888852343f4e3d9b9750ce5504e644ea090d12446e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/stmt/region_loop/plan.rs: crates/perry-codegen/src/stmt/region_loop/plan.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in Planner::expr 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/stmt/region_loop/plan.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/perry-codegen/src/stmt/region_loop/plan.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecf32846334dd6242385b98350a9a6e7a3d6f8f490047bb67c999a809c5fa5e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/process.rs: crates/perry-runtime/src/process.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in perry_runtime::process::process_metadata_property at line 800. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/process.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/perry-runtime/src/process.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe24e333b1be99100ff033f62465186477017144d1aaaed8948c525ee2c292f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/gc/verify.rs: crates/perry-runtime/src/gc/verify.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry_runtime::gc::verify::restore_surviving_dirty_coverage_impl at line 433. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/gc/verify.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/perry-runtime/src/gc/verify.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef277258de8808a90aee3faf3ec5038e2e2b3c1757373f7a843f68fe36681a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/gc/roots/stack_maps.rs: crates/perry-runtime/src/gc/roots/stack_maps.rs changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in perry_runtime::gc::roots::stack_maps::fp_chain::visit at line 1601. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/gc/roots/stack_maps.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/perry-runtime/src/gc/roots/stack_maps.rs"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86041cd351c23693fa1647fcb35152db033148d581f9057720e59cec8b27123"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/index_get/guarded_array.rs: crates/perry-codegen/src/expr/index_get/guarded_array.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in perry_codegen::expr::index_get::guarded_array::lower_guarded_array_index_get_with_index at line 324. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/index_get/guarded_array.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/perry-codegen/src/expr/index_get/guarded_array.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07f16a04877d241e9bd632ecc5dd2098956999023830a4e61e671862d6703ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/destructuring/var_decl.rs: crates/perry-hir/src/destructuring/var_decl.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in perry_hir::destructuring::var_decl::lower_var_decl_with_destructuring 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/destructuring/var_decl.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/perry-hir/src/destructuring/var_decl.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1f2893419e04b104bbca71c8a42d0ff4d4882f4d16f575d54ffe5be055fb7f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/field_get_set/class_object_template.rs: crates/perry-runtime/src/object/field_get_set/class_object_template.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in perry_runtime::object::field_get_set::class_object_template::record_class_object_template at line 694. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/field_get_set/class_object_template.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/perry-runtime/src/object/field_get_set/class_object_template.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ab40ae0cacae9dc580310d9368ab07f7d1b621f8bcd32efe251f10d40e1adb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/intl.rs: crates/perry-runtime/src/intl.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in perry_runtime::intl::make_instance_this at line 1015. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/intl.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/perry-runtime/src/intl.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f44dad183e9ee354a9a72930573da6f269289ec22af548f5415e606b98b4f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-zlib/src/lib.rs: crates/perry-ext-zlib/src/lib.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in perry_ext_zlib::js_ext_zlib_native_dispatch at line 427. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-zlib/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/perry-ext-zlib/src/lib.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e1032c9734e2b233f342770e88d0a79567306a6462ac53faf9463db99b172b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/gc/trace.rs: crates/perry-runtime/src/gc/trace.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ValidPointerSetBuilder::walk_census_block at line 1105. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/gc/trace.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/perry-runtime/src/gc/trace.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"689a5fc130798a513cdfda78bb9f98c469a5331b8a333d2c96538e2835e79cfc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/lower_expr/arm_unary.rs: crates/perry-hir/src/lower/lower_expr/arm_unary.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in perry_hir::lower::lower_expr::arm_unary::lower_unary_expr at line 9. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/lower_expr/arm_unary.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/perry-hir/src/lower/lower_expr/arm_unary.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0a9b37444e3cd88fb811c865092def87f5d6a197ba9322bce7c867da55f850"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/derive.rs: crates/perry-wpfacts/src/derive.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in perry_wpfacts::derive::judge at line 792. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/derive.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/perry-wpfacts/src/derive.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfbb78a2b69eb15be13e0a1d1dd4673de76f3d40faa64b0d7709d5c33f0eeea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/node_stream_event_emitter.rs: crates/perry-runtime/src/node_stream_event_emitter.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in perry_runtime::node_stream_event_emitter::own_data_slot at line 494. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/node_stream_event_emitter.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/perry-runtime/src/node_stream_event_emitter.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fe64eedfbc33b45dc4f7ac21d9f0557010d14329ebff5e89458ed5d07c429a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-transform/src/generator/linearize.rs: crates/perry-transform/src/generator/linearize.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in perry_transform::generator::linearize::linearize_body at line 607. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-transform/src/generator/linearize.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/perry-transform/src/generator/linearize.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87ca35bbea026bfbb752bd32f496accfe0766797d2289ac1c53ef591f01a8d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/nm_install.rs: crates/perry-codegen/src/nm_install.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in perry_codegen::nm_install::runtime_bucket_install_symbol at line 18. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/nm_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/perry-codegen/src/nm_install.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"39dfb7b418d519fea3e213a4bf4f698406837aaaa3ab495ff768614baf519b56"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/decl_units.rs: crates/perry-wpfacts/src/decl_units.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in perry_wpfacts::decl_units::views at line 1392. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/decl_units.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/perry-wpfacts/src/decl_units.rs"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"375c1cf7de028244e61b3c32bab108add469209baf568ed66b45adf668e8ec86"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_call/static_and_instance.rs: crates/perry-hir/src/lower/expr_call/static_and_instance.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in perry_hir::lower::expr_call::static_and_instance::try_static_method_and_instance 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_call/static_and_instance.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/perry-hir/src/lower/expr_call/static_and_instance.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a00365fb907f895237f497fc366a3315db551230d640fb6e80734f8abcf351a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/ptr_shape_numeric.rs: crates/perry-codegen/src/collectors/ptr_shape_numeric.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in perry_codegen::collectors::ptr_shape_numeric::expr_numeric_by_construction_with_region at line 702. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/ptr_shape_numeric.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/perry-codegen/src/collectors/ptr_shape_numeric.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbbf2061ec0dd196692bde33d291fb239ec278ae092d0935d2468267c94c394"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/native_module_dispatch.rs: crates/perry-codegen/src/lower_call/native_module_dispatch.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in perry_codegen::lower_call::native_module_dispatch::lower_native_module_dispatch at line 99. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/native_module_dispatch.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/perry-codegen/src/lower_call/native_module_dispatch.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"51be3ab399a6f1e6d43a78367e93811c2d716b0b969bdba34c9e27ff8d52284b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/property_get/helpers.rs: crates/perry-codegen/src/expr/property_get/helpers.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in perry_codegen::expr::property_get::helpers::lower_raw_f64_class_field_get_for_number_context at line 175. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/property_get/helpers.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/perry-codegen/src/expr/property_get/helpers.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b77ecc168d599399cd580f29afd6f48a8fe8d6bbfc4bb0bb508e3ee24ed5fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/native/mod.rs: crates/perry-codegen/src/lower_call/native/mod.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in perry_codegen::lower_call::native::lower_native_method_call at line 74. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/native/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/perry-codegen/src/lower_call/native/mod.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1c46090653ab927da83a5ee3228c1274f9a6873b2b9255cbe26063fa980a39"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/program_facts.rs: crates/perry/src/commands/compile/program_facts.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in perry::commands::compile::program_facts::elision_for at line 295. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/program_facts.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/perry/src/commands/compile/program_facts.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab9b4c3b50de5bfedaa037e900f42ee75f34cb87c215ab81421aa294dd23e34"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/object_ops/descriptor_helpers.rs: crates/perry-runtime/src/object/object_ops/descriptor_helpers.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry_runtime::object::object_ops::descriptor_helpers::nonconfigurable_redefine_allowed at line 791. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/object_ops/descriptor_helpers.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/perry-runtime/src/object/object_ops/descriptor_helpers.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a201a8ce70b919fb6de910d08f76a6a9c32a6e40e0bfe2fd21da8dbbbe9b63"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/shadow_slot.rs: crates/perry-codegen/src/expr/shadow_slot.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in perry_codegen::expr::shadow_slot::expr_is_known_non_pointer_shadow_value at line 41. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/shadow_slot.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/perry-codegen/src/expr/shadow_slot.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bda3b65b727a8d54ea4f0c6d97fd8e27ff9ad709bd9714609efa33f85d2318b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/gc_map.rs: crates/perry-codegen/src/gc_map.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in perry_codegen::gc_map::decode_v3 at line 534. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/gc_map.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/perry-codegen/src/gc_map.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"f290cc33b8f6b8250e06bf6bf61a616829ba299110de9bce53b9a2476481c2b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/stdlib_features.rs: crates/perry/src/commands/stdlib_features.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in perry::commands::stdlib_features::module_to_features at line 27. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/stdlib_features.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/perry/src/commands/stdlib_features.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b48d570739b115e4230993d6cd0a8909bfb80276e6cf5b1b83414d7a0ed8d9c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/static_shapes.rs: crates/perry-runtime/src/object/static_shapes.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in perry_runtime::object::static_shapes::finalized_constfn_facts 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/static_shapes.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/perry-runtime/src/object/static_shapes.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"72445a13b520a2931b22672ec4e49ccf88211cedc5d8dc6750081fce1145ae67"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/split_regions.rs: crates/perry-codegen/src/codegen/split_regions.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 107 in perry_codegen::codegen::split_regions::try_extract at line 509. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/split_regions.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/perry-codegen/src/codegen/split_regions.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"884ac1fc5996673ef4d24ad204003c52700336f80fb250ca805d5b3e6ee03e31"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/native_module_dispatch/dispatch_a_c.rs: crates/perry-runtime/src/object/native_module_dispatch/dispatch_a_c.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in perry_runtime::object::native_module_dispatch::dispatch_a_c::nm_dispatch_bun at line 249. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/native_module_dispatch/dispatch_a_c.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/perry-runtime/src/object/native_module_dispatch/dispatch_a_c.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba0ca475ae0ddefef6723d6e3c2086b637945578769d4e9c8d3743de6bbbcb5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/key_attrs.rs: crates/perry-runtime/src/object/key_attrs.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in perry_runtime::object::key_attrs::apply_edits at line 1503. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/key_attrs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/key_attrs.rs"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"46af5c87052b127387bdbadccda5de5f009d101cf7a0f8d62c79bcf777b7b528"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-http/src/client_request_surface.rs: crates/perry-ext-http/src/client_request_surface.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in perry_ext_http::client_request_surface::dispatch_method 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-http/src/client_request_surface.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/perry-ext-http/src/client_request_surface.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"6769e47a9c0bd52f06d349d5b384d02acde8f008e5793a5a32d14b29a57d6ff8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/promise/async_step.rs: crates/perry-runtime/src/promise/async_step.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in perry_runtime::promise::async_step::js_async_step_chain at line 465. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/promise/async_step.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/perry-runtime/src/promise/async_step.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabb984ddd6876df70b82573b8bb4d6cf7ccfc3fdb0fd7bc86b6fbef46fd1d13"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/closure/dispatch/value_call.rs: crates/perry-runtime/src/closure/dispatch/value_call.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in perry_runtime::closure::dispatch::value_call::dispatch_explicit_this_call at line 99. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/closure/dispatch/value_call.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/perry-runtime/src/closure/dispatch/value_call.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e533ecf0b3e87f4e17564bf89564ee6acee9fbaa8a3fbed8de7fb6af5084bc9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/iterator_prototypes.rs: crates/perry-runtime/src/object/iterator_prototypes.rs changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in perry_runtime::object::iterator_prototypes::call_overridden_iterator_next at line 566. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/iterator_prototypes.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/perry-runtime/src/object/iterator_prototypes.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e88c449915fbd61b445b41701bdfe8157ad5d4b446c6ec1def1fd9013b6abe3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/arena/reset.rs: crates/perry-runtime/src/arena/reset.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in perry_runtime::arena::reset::arena_reset_empty_blocks at line 394. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/arena/reset.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/perry-runtime/src/arena/reset.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e82d659ea445b3eef02a0cb2a51166365e7899949c7078cd141989ed1d97bd1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/typedarray_props.rs: crates/perry-runtime/src/typedarray_props.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in perry_runtime::typedarray_props::typed_array_define_own_property at line 286. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/typedarray_props.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/perry-runtime/src/typedarray_props.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fddbcd8b3f277c2816b162bea83cbcde96dd544708d64b9049553f286a6dd7d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/native_call_method/object_proto.rs: crates/perry-runtime/src/object/native_call_method/object_proto.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in perry_runtime::object::native_call_method::object_proto::js_object_is_prototype_of_value at line 420. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/native_call_method/object_proto.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/perry-runtime/src/object/native_call_method/object_proto.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"3168ad25c82f829a588deeb777199960840f7d322b6caa02fbfff397a967b851"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/method_site.rs: crates/perry-codegen/src/expr/method_site.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_codegen::expr::method_site::emit_method_site at line 356. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/method_site.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/perry-codegen/src/expr/method_site.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8ef4a645ec5fdc6f1fac3834dc337fbdd9e74db225036f0e535424cbb6e6c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/shared_mutable_capture.rs: crates/perry-hir/src/lower/shared_mutable_capture.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in perry_hir::lower::shared_mutable_capture::desugar_shared_mutable_captures at line 81. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/shared_mutable_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/perry-hir/src/lower/shared_mutable_capture.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a306233784900f6b87ec2bd3b57a7c93d7cf26acc1eb2e68db22ddab80e53f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/math_simple.rs: crates/perry-codegen/src/expr/math_simple.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in perry_codegen::expr::math_simple::lower at line 431. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/math_simple.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/perry-codegen/src/expr/math_simple.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8211be4c21fd3bc4b50c9c38910f7bd6da2e88c238067ee017c3ea8f6a5a823"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/global_this/install_static.rs: crates/perry-runtime/src/object/global_this/install_static.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in perry_runtime::object::global_this::install_static::install_builtin_constructor_statics at line 414. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/global_this/install_static.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/perry-runtime/src/object/global_this/install_static.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba68a713de4701aca3a2def82b3ca8b16ac5c5970e3796a1c0500965f07764d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/lower_expr/arm_ident.rs: crates/perry-hir/src/lower/lower_expr/arm_ident.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in perry_hir::lower::lower_expr::arm_ident::lower_ident_expr at line 31. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/lower_expr/arm_ident.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/perry-hir/src/lower/lower_expr/arm_ident.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"91432fb72a4af116cd5cd7281a920eda9d5ea385eba3c80d80c9bdecdcf5cba0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-transform/src/inline/call_inliner.rs: crates/perry-transform/src/inline/call_inliner.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in perry_transform::inline::call_inliner::inline_calls_in_stmts at line 344. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-transform/src/inline/call_inliner.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/perry-transform/src/inline/call_inliner.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"2447020b461e8b73a80f9e9563fd4350b5aa0e2b4b7c42bd28c0cdda9f8ea8e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/builtins/table.rs: crates/perry-runtime/src/builtins/table.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in perry_runtime::builtins::table::js_console_table_with_properties at line 285. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/builtins/table.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/builtins/table.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0e55bbe34c65765c8aff71151d22d0cc913d297b0dee459f3fa3c793bf7e21"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/streams.rs: crates/perry-stdlib/src/streams.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in perry_stdlib::streams::js_reader_read at line 2358. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/streams.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/perry-stdlib/src/streams.rs"},"region":{"startLine":2358}}}],"partialFingerprints":{"codehealthFindingId/v1":"a125a80acfe519ea6d487cf93101fabddd9c0ca17f523db4b53f49034e8d65da"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/canonical_keys.rs: crates/perry-runtime/src/object/canonical_keys.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in perry_runtime::object::canonical_keys::extend_token at line 1027. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/canonical_keys.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/perry-runtime/src/object/canonical_keys.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c3e7139d451a07727e3a85a987fbec544657f2cdc98e1e5255d75ee0d4c6ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/string/concat.rs: crates/perry-runtime/src/string/concat.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in perry_runtime::string::concat::concat_chain_sized at line 1398. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/string/concat.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/perry-runtime/src/string/concat.rs"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6a2edeccd14469632194070691ed96085d1bded06e4b1905e60cac7f7121db"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower_decl/block.rs: crates/perry-hir/src/lower_decl/block.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in perry_hir::lower_decl::block::lower_fn_body_block_stmt_inner at line 642. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower_decl/block.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/perry-hir/src/lower_decl/block.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5bb1bf57a08d78f6557438a6957c8f013a22b27400aee1990347a28be095953"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/builtins/numbers.rs: crates/perry-runtime/src/builtins/numbers.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in perry_runtime::builtins::numbers::number_coerce_non_plain 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/builtins/numbers.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/perry-runtime/src/builtins/numbers.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"264150b15231c53c5c2c1c20fb9e8b2f5e8062e16e4d6994b67616657d769431"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/gc/heap_snapshot.rs: crates/perry-runtime/src/gc/heap_snapshot.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in perry_runtime::gc::heap_snapshot::gc_build_v8_heap_snapshot_json_with_format at line 241. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/gc/heap_snapshot.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/perry-runtime/src/gc/heap_snapshot.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fc78046b2bc7a9712cfab6ed0a4c9f301b915c4d6799e38b71bc37f026b3d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/thread/clone_write.rs: crates/perry-runtime/src/thread/clone_write.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Writer::pointer at line 460. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/thread/clone_write.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/perry-runtime/src/thread/clone_write.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1f510a890f31c771af6ee6df18bdba7484645f6567708ec2dd6adec0916a9d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/module/linkage.rs: crates/perry-codegen/src/module/linkage.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_codegen::module::linkage::external_decl_for_global at line 305. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/module/linkage.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/perry-codegen/src/module/linkage.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a743c1ba13aeb2d72efdaa7a1ce83dcea5cf2e1d3e973b7294d51a2ebc2fe73"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/type_analysis/predicates.rs: crates/perry-codegen/src/type_analysis/predicates.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in perry_codegen::type_analysis::predicates::static_type_of at line 552. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/type_analysis/predicates.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/perry-codegen/src/type_analysis/predicates.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"47eb92e4f8c6d035a0918c2ed86fa0632e7f1522d706b1740ace736af7e7cfb6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/stmt/stable_packed_loop.rs: crates/perry-codegen/src/stmt/stable_packed_loop.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in perry_codegen::stmt::stable_packed_loop::match_candidate at line 476. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/stmt/stable_packed_loop.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/perry-codegen/src/stmt/stable_packed_loop.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f22041327c2c9ac6cd0a90c33cb9d145bcd5fc64eb8d075fd5469647664b6d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/new_helpers.rs: crates/perry-codegen/src/lower_call/new_helpers.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in perry_codegen::lower_call::new_helpers::native_instance_base at line 104. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/new_helpers.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/perry-codegen/src/lower_call/new_helpers.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d411f58c50749c8cc11e2e130f148f70d3cd92df75d1c0647227f714d9dbb69a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/scalar_method_dispatch.rs: crates/perry-codegen/src/collectors/scalar_method_dispatch.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in perry_codegen::collectors::scalar_method_dispatch::collect_module_dispatch_facts at line 510. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/scalar_method_dispatch.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/perry-codegen/src/collectors/scalar_method_dispatch.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47e6f3145c1a3d4a3ae38cd314963e48d6c2daea4472c71f5cff36d80a0deff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/webcrypto/jwk.rs: crates/perry-stdlib/src/webcrypto/jwk.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 134 in perry_stdlib::webcrypto::jwk::js_webcrypto_import_key at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/webcrypto/jwk.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/perry-stdlib/src/webcrypto/jwk.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5164b29c7d041fd16614b3d18dee61632e71a9452bf01a5fd3e413d919de8053"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/inst.rs: crates/perry-codegen/src/inst.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in LlInst::render_into at line 197. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/inst.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/perry-codegen/src/inst.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"4340a3a6f249b5f180ddeabebd064d55a7e3dff592da8d764fcc5abf9953710b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/array/iter_methods.rs: crates/perry-runtime/src/array/iter_methods.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_runtime::array::iter_methods::js_array_reduce at line 1279. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/array/iter_methods.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/perry-runtime/src/array/iter_methods.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"b315d3f8597a202affb19b10e4aa2c856c053bc3972aef153c8c6f8e0b546d4d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/arena/block.rs: crates/perry-runtime/src/arena/block.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in Arena::drop at line 640. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/arena/block.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/perry-runtime/src/arena/block.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"07caf29c7f209749b7f0b7b0cf8d435397ab3fd33cda218fb4849cdb223b5bc9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/link/platform_cmd.rs: crates/perry/src/commands/compile/link/platform_cmd.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in perry::commands::compile::link::platform_cmd::select_linker_command at line 118. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/link/platform_cmd.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/perry/src/commands/compile/link/platform_cmd.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c046efa9094fce1bb2d95b1d36a70587b7d40c4754d645f3c67d8536c2a61139"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/spec_abi_sites.rs: crates/perry-codegen/src/collectors/spec_abi_sites.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in perry_codegen::collectors::spec_abi_sites::walk_stmt at line 720. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/spec_abi_sites.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/perry-codegen/src/collectors/spec_abi_sites.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a01e7a914e48c83a81442a4effa66fd43e0d1c58a60653b73dd1b40a9a4078a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/property_get/static_dispatch.rs: crates/perry-codegen/src/lower_call/property_get/static_dispatch.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in perry_codegen::lower_call::property_get::static_dispatch::try_lower_static_dispatch at line 22. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/property_get/static_dispatch.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/perry-codegen/src/lower_call/property_get/static_dispatch.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"95dfdb79f026e5c2b63fbb9746bfc36965a827ee99e93f40dabe8cfaa8f75f85"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/typed_abi.rs: crates/perry-codegen/src/codegen/typed_abi.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in TypedCloneRejectionReason::as_str at line 477. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/typed_abi.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/perry-codegen/src/codegen/typed_abi.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2f256e2116ddc9d7a07d40a7cbad7dc81ed659fe2cd040a99511ce981400b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: benchmarks/gc_ratchet/gc_ratchet.py: benchmarks/gc_ratchet/gc_ratchet.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in gc_ratchet.evaluate at line 1691. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- benchmarks/gc_ratchet/gc_ratchet.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/gc_ratchet/gc_ratchet.py"},"region":{"startLine":1691}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f31e6a6de42edd8e064fe44cb3bb3e1a1cef68abbb53c6b9006e48e1eef327"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/reflect_support.rs: crates/perry-runtime/src/object/reflect_support.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry_runtime::object::reflect_support::obj_value_has_own_key at line 44. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/reflect_support.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/perry-runtime/src/object/reflect_support.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78c2544cf4e9e9bf546510c39f0f85f95fcf41096e6a057e4ab922723d5082d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/exotic_expando.rs: crates/perry-runtime/src/object/exotic_expando.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in perry_runtime::object::exotic_expando::exotic_define_own_property at line 306. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/exotic_expando.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/perry-runtime/src/object/exotic_expando.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e93edb6c0673ebf9f93de8c1e7a936832840a88c7ba0c80dee2c317d6e5a171"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/native_module_dispatch/dispatch_m_p.rs: crates/perry-runtime/src/object/native_module_dispatch/dispatch_m_p.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 72 in perry_runtime::object::native_module_dispatch::dispatch_m_p::nm_dispatch_process 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/native_module_dispatch/dispatch_m_p.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/perry-runtime/src/object/native_module_dispatch/dispatch_m_p.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a6682077a59cb005363d7e17934b9178ddc6bddc2afb3d490ee0a149dcdac4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/units/driver.rs: crates/perry-wpfacts/src/units/driver.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 124 in perry_wpfacts::units::driver::run 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/units/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/perry-wpfacts/src/units/driver.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"011b2b8f3fde35d6b3ad9ec88577863c75c55296410c1b10c206cd7e5c5f3faa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/destructuring/pattern_binding.rs: crates/perry-hir/src/destructuring/pattern_binding.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in perry_hir::destructuring::pattern_binding::lower_pattern_binding_into at line 467. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/destructuring/pattern_binding.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/perry-hir/src/destructuring/pattern_binding.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e03c38619ce2d258d3a7ba2eae1fd15d5addc3fc43b04af4e2d8739c620246"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/node_stream/native_hooks.rs: crates/perry-runtime/src/node_stream/native_hooks.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in perry_runtime::node_stream::native_hooks::run_native_steps at line 553. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/node_stream/native_hooks.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/perry-runtime/src/node_stream/native_hooks.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf704520d874d7e6d2f91dc6a4949a25fe674d6bdf0ec9345512738258c4d72"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/main.rs: crates/perry/src/main.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in perry::main_inner at line 389. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/main.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"723f33c6ff02508fcef4241393e31398b387e014c47efaf7274ea910b560a2ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/native_call_method/typed_array.rs: crates/perry-runtime/src/object/native_call_method/typed_array.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in perry_runtime::object::native_call_method::typed_array::dispatch_typed_array_method at line 40. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/native_call_method/typed_array.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/perry-runtime/src/object/native_call_method/typed_array.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a206bd40b3c0a1479b52a1027faf04f28f576b969625970cfcae61ea6619ba2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/rooting/temp_root.rs: crates/perry-codegen/src/rooting/temp_root.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in perry_codegen::rooting::temp_root::expr_is_inert_primitive at line 428. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/rooting/temp_root.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/perry-codegen/src/rooting/temp_root.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e37cb4a41d4f988ad75cb011780a79a3236eb8641b8a00c8cf56f5de96a4f8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/compiler_output_harness/repsel_census.py: scripts/compiler_output_harness/repsel_census.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in repsel_census.census_from_report at line 425. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/compiler_output_harness/repsel_census.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/compiler_output_harness/repsel_census.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b3f4b0fe089b205e5f398d62b482cda710e89e16f2ae20b34a388bee3a3582"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/array/iter_object.rs: crates/perry-runtime/src/array/iter_object.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in perry_runtime::array::iter_object::collection_iter_obj_for_receiver at line 337. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/array/iter_object.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/perry-runtime/src/array/iter_object.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b69b097298209f2c6f9b5371f6d1d313900dad88b69dc1f37b7a31abd4f525"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-http/src/server/server.rs: crates/perry-ext-http/src/server/server.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_ext_http::server::server::process_pending at line 1231. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-http/src/server/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/perry-ext-http/src/server/server.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e458abe384636a5327bbbc20377a86f5e4543b140930fdd55c664586778a6f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/ptr_shape_elements.rs: crates/perry-codegen/src/collectors/ptr_shape_elements.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in perry_codegen::collectors::ptr_shape_elements::collect_element_shape_facts at line 321. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/ptr_shape_elements.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/perry-codegen/src/collectors/ptr_shape_elements.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef77b1d4d7aaf87fafbf61062eb30069cd82ae9aab555c24de58bf79bd8f9be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/node_stream/proto_methods.rs: crates/perry-runtime/src/node_stream/proto_methods.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in Prop::get at line 927. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/node_stream/proto_methods.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/perry-runtime/src/node_stream/proto_methods.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"396cbe80a000da768883a9e927130d7d40b5783f6fb9ee9d99da88238348db3a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/array/subclass_loop_guard.rs: crates/perry-runtime/src/array/subclass_loop_guard.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in perry_runtime::array::subclass_loop_guard::js_packed_arraylike_loop_revalidate_live at line 370. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/array/subclass_loop_guard.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/perry-runtime/src/array/subclass_loop_guard.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ea7ecf542968c5b511cd92cfa7f8b36baa829f7cbad031c45d2574e88f75bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-http/src/agent.rs: crates/perry-ext-http/src/agent.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in perry_ext_http::agent::js_ext_http_agent_dispatch_property at line 857. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-http/src/agent.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/perry-ext-http/src/agent.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0aac15b330214ae4c180befe9d10e3e9f3e51784b71f10dde183d41de56bdc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/lower_expr/arm_bin.rs: crates/perry-hir/src/lower/lower_expr/arm_bin.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in perry_hir::lower::lower_expr::arm_bin::lower_bin_expr at line 8. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/lower_expr/arm_bin.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/perry-hir/src/lower/lower_expr/arm_bin.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"076a1783c93bf92874abc5148a58b8b0cb438bc0171e234f9d0dd3b811f911e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/thread/clone_read.rs: crates/perry-runtime/src/thread/clone_read.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in Reader::value 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/thread/clone_read.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/perry-runtime/src/thread/clone_read.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0839c2bf272fd9bdc8bb178869efae7abc74d3eaf6159f6fbac58dbfb061b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/index.rs: crates/perry-codegen/src/expr/index.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry_codegen::expr::index::lower_index_set_fast at line 76. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/index.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/perry-codegen/src/expr/index.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61563f3c604b612cf77063c8d7209f31f14e8b13a4cbfb58c4bbfbc7fa5a632"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen-wasm/src/emit/compile.rs: crates/perry-codegen-wasm/src/emit/compile.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 154 in WasmModuleEmitter::compile at line 9. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen-wasm/src/emit/compile.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/perry-codegen-wasm/src/emit/compile.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22434656234026e5a519245fb890d12b3f530524e1ab50e875ab6afbd1d7f68"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/shape_store.rs: crates/perry-runtime/src/object/shape_store.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in perry_runtime::object::shape_store::try_array_store at line 583. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/shape_store.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/perry-runtime/src/object/shape_store.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"2beea96f18c252f00e225875603d0276da37a2ea388f277dab55ddf95b50e89c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/string_regex_proc.rs: crates/perry-codegen/src/expr/string_regex_proc.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 92 in perry_codegen::expr::string_regex_proc::lower at line 18. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/string_regex_proc.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/perry-codegen/src/expr/string_regex_proc.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"686b0f48d12cfcda40333d1697d80841f1add36f177030700fed347a16add269"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower_decl/fn_decl.rs: crates/perry-hir/src/lower_decl/fn_decl.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in perry_hir::lower_decl::fn_decl::lower_fn_decl at line 27. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower_decl/fn_decl.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/perry-hir/src/lower_decl/fn_decl.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c85290c99ab38ebf97ea6afb8101e8c58ff5ab6ea477076208d830ffebfeff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/member_update.rs: crates/perry-codegen/src/expr/member_update.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in perry_codegen::expr::member_update::lower 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/member_update.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/perry-codegen/src/expr/member_update.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"552ef98291e01a03ace4b2612c219c2f8cd6f34d3025ae56f87eff8e9fd81c99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-net/src/tls.rs: crates/perry-ext-net/src/tls.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in perry_ext_net::tls::js_tls_connect at line 625. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-net/src/tls.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/perry-ext-net/src/tls.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6ad7c6520d38ed68266da816dacb517fd3f2d0712ae5c2c1d4c7b62c96de53"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/stmt/masked_window_region.rs: crates/perry-codegen/src/stmt/masked_window_region.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in perry_codegen::stmt::masked_window_region::try_match_masked_window_region at line 403. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/stmt/masked_window_region.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/stmt/masked_window_region.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"80db6700a1690cf4ba8f9f9a6622947417fc7c14690257107a71e29739ae4add"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/array/generic.rs: crates/perry-runtime/src/array/generic.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_runtime::array::generic::al_get 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/array/generic.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/perry-runtime/src/array/generic.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"d470a73b8e045b984618951f0f08f3a10acb6d58e2eac12cd024636aff198fc0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/receiver_regions.rs: crates/perry-codegen/src/collectors/receiver_regions.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in perry_codegen::collectors::receiver_regions::enders_in_stmt at line 1164. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/receiver_regions.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/perry-codegen/src/collectors/receiver_regions.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"5178a0e81ecbe17ed6ddf1c49857315d06d895dcab0babf64d975e379dce7f38"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/regex/perex_replace.rs: crates/perry-runtime/src/regex/perex_replace.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in perry_runtime::regex::perex_replace::regexp at line 111. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/regex/perex_replace.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/perry-runtime/src/regex/perex_replace.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d600b3e86e493109372f381ae5be0508d48e0ad664e230ed91a0f61b2724236"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/proven_this.rs: crates/perry-codegen/src/collectors/proven_this.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in perry_codegen::collectors::proven_this::method_proven_this_impl at line 563. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/proven_this.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/perry-codegen/src/collectors/proven_this.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42da58f90908f69722174db32b628b5662fe59bc5a8ad963d5af9ceb057171a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/fn_info.rs: crates/perry-codegen/src/fn_info.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in perry_codegen::fn_info::render_definition at line 329. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/fn_info.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/perry-codegen/src/fn_info.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ee6e112a9988b9ceb82e2c3ab9df4bd567bdcdc75159e8e9d0888ff6fef1e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/gc/tenuring.rs: crates/perry-runtime/src/gc/tenuring.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in perry_runtime::gc::tenuring::retune_nursery_cap_scale at line 985. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/gc/tenuring.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/perry-runtime/src/gc/tenuring.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"de27b4c8394185ebfb78ee0d5b498708768511bf64083806b12d2bf380de9081"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/lower_expr.rs: crates/perry-hir/src/lower/lower_expr.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in perry_hir::lower::lower_expr::lower_expr_impl 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/lower_expr.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/perry-hir/src/lower/lower_expr.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36d8d116b1f1afa776a34b183c0c399ddd721736d93acf2890b1efb275d2fba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/fetch/dispatch.rs: crates/perry-stdlib/src/fetch/dispatch.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in perry_stdlib::fetch::dispatch::dispatch_request_property at line 333. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/fetch/dispatch.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/perry-stdlib/src/fetch/dispatch.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61d08b5e51ad53785c2f752895bee5aea06e58d13642f7d45ae4fd5b5cd9faa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/field_get_set/ic_miss/private_member_access.rs: crates/perry-runtime/src/object/field_get_set/ic_miss/private_member_access.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in perry_runtime::object::field_get_set::ic_miss::private_member_access::js_private_brand_check at line 372. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/field_get_set/ic_miss/private_member_access.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/perry-runtime/src/object/field_get_set/ic_miss/private_member_access.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0fa3ec405b128814a0624579ab011ebe8830674cc3afe541fffc8ecb957523"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/i32_locals.rs: crates/perry-codegen/src/collectors/i32_locals.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 106 in perry_codegen::collectors::i32_locals::collect_localset_ids_in_expr_filtered at line 1233. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/i32_locals.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/perry-codegen/src/collectors/i32_locals.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02af3a6e1a9065d63fdaecbd2beacafe3b6472b79660da9b9e2cb69da0aa480"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/this_as_value.rs: crates/perry-codegen/src/collectors/this_as_value.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in perry_codegen::collectors::this_as_value::expr_uses_this_as_value at line 321. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/this_as_value.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/perry-codegen/src/collectors/this_as_value.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7274653136a51452252f3c428a0f78dd1373cdb25da80be56d6444f04b1fd2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/webcrypto/hmac.rs: crates/perry-stdlib/src/webcrypto/hmac.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in perry_stdlib::webcrypto::hmac::js_webcrypto_verify 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/webcrypto/hmac.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/perry-stdlib/src/webcrypto/hmac.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfcabbd9605b7274a58d39ff8baa8926068c04f9d886ff8a5174dde747b555b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/inprocess/optimize_emit.rs: crates/perry-codegen/src/inprocess/optimize_emit.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in perry_codegen::inprocess::optimize_emit::optimize_and_emit at line 18. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/inprocess/optimize_emit.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/perry-codegen/src/inprocess/optimize_emit.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b887cc4c9584202db70b5bda9d7f3db97f2de09c2d4f2eff16ea3618a538c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/type_analysis/pod.rs: crates/perry-codegen/src/type_analysis/pod.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in perry_codegen::type_analysis::pod::numeric_proof_is_declared_only at line 537. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/type_analysis/pod.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/perry-codegen/src/type_analysis/pod.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d8dee5b666649d63e89657ae5e41a7aee0263132f6d23d122272f171fd47f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-parser/src/lib.rs: crates/perry-parser/src/lib.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in perry_parser::normalize_unicode_identifier_escapes_with_metadata at line 442. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-parser/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/perry-parser/src/lib.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"00df5064ddb4a78c7394192213d468705b1a737dcf984ff033cf25cbbbc21594"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/escape_arrays.rs: crates/perry-codegen/src/collectors/escape_arrays.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in perry_codegen::collectors::escape_arrays::check_array_escapes_in_expr at line 550. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/escape_arrays.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/perry-codegen/src/collectors/escape_arrays.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"210573760ba912ceeb5c4ef0c35175030fe042949cdbb2c9e7aa3c94ffe55b8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/field_get_set/has_property/shape_presence.rs: crates/perry-runtime/src/object/field_get_set/has_property/shape_presence.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in perry_runtime::object::field_get_set::has_property::shape_presence::own_position at line 13. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/field_get_set/has_property/shape_presence.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/perry-runtime/src/object/field_get_set/has_property/shape_presence.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dde027d836cf079c9e7c7aa64bf4df9f19a28f344fbc011bf3f3dc0d8911822"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/gc/census.rs: crates/perry-runtime/src/gc/census.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_runtime::gc::census::take_census at line 717. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/gc/census.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/perry-runtime/src/gc/census.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"43dc0ea6319357c74c02d8e36a82ef9230402a6e2250d84f104fa4baea617d23"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/native_call_method/class_holder.rs: crates/perry-runtime/src/object/native_call_method/class_holder.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in perry_runtime::object::native_call_method::class_holder::chain_method_admitting 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/native_call_method/class_holder.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/perry-runtime/src/object/native_call_method/class_holder.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"598d7262382934a268e0be59627c0c5c30e6cd832c1de1e1d249a74056f39ea0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/promise/combinators.rs: crates/perry-runtime/src/promise/combinators.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_runtime::promise::combinators::js_assimilate_thenable at line 1267. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/promise/combinators.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/perry-runtime/src/promise/combinators.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ea0310f10e307d32f79c5656666351fe12627dc4fbe009ebcb84a4a111fb8b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/param_guard.rs: crates/perry-codegen/src/codegen/param_guard.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in perry_codegen::codegen::param_guard::guarded_falsy_field_default_method_candidate at line 1020. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/param_guard.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/perry-codegen/src/codegen/param_guard.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4912a7e20505b81bf69d77655844b8d75ecbe827bcc18b8da61762a74c526b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/library_search.rs: crates/perry/src/commands/compile/library_search.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in perry::commands::compile::library_search::collect_library_candidates at line 1083. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/library_search.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/perry/src/commands/compile/library_search.rs"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"1badab8175f71c4bf15f9680d651423e0c39e9532096fcd516a05d67b8256cff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/turnloop_net/mod.rs: crates/perry-runtime/src/turnloop_net/mod.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in perry_runtime::turnloop_net::dispatch at line 954. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/turnloop_net/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/perry-runtime/src/turnloop_net/mod.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc077cc80b670ae9148c69c044de863a1ed317a17f6d2df39f43340971ce6831"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/dyn_eval/interp.rs: crates/perry-runtime/src/dyn_eval/interp.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry_runtime::dyn_eval::interp::eval_class_expr at line 1231. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/dyn_eval/interp.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/perry-runtime/src/dyn_eval/interp.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"af53e159277d22e7cb602df84d02877c1fc4924fd00986a6065ea8715b8c63b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-http/src/server/turnloop_serve/conn.rs: crates/perry-ext-http/src/server/turnloop_serve/conn.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry_ext_http::server::turnloop_serve::conn::decode_step at line 492. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-http/src/server/turnloop_serve/conn.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/perry-ext-http/src/server/turnloop_serve/conn.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5f0e213cf051040e63bb5954109f625a524eba5e5c833dae02e9b11e8a405f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/check_actions_topology.py: scripts/check_actions_topology.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in check_actions_topology.main at line 32. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/check_actions_topology.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check_actions_topology.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35b3a795d09cbdb8b6f8280e83ca748e2d457ba5ac55367e91d6e44f897cc23"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/json/parse_api.rs: crates/perry-runtime/src/json/parse_api.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in perry_runtime::json::parse_api::parse_slow at line 527. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/json/parse_api.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/perry-runtime/src/json/parse_api.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ab65524da0cd5b22748b28fc9d116ba0ada78a600e7f77d78b56cc4fe28cbf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/readline/pump.rs: crates/perry-stdlib/src/readline/pump.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in perry_stdlib::readline::pump::js_readline_process_pending at line 358. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/readline/pump.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/perry-stdlib/src/readline/pump.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03c8e0ca9901cbd87e10551411390dd5881c6205c55b7e1d44109460e4c3e73"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/mutation.rs: crates/perry-codegen/src/collectors/mutation.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in perry_codegen::collectors::mutation::expr_has_mutation at line 481. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/mutation.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/perry-codegen/src/collectors/mutation.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"352d6543fc9d82671e05882ad695c62c7e981cb354c91a55c06d4927ab4d9d66"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/gen/glue.rs: crates/perry-wpfacts/src/gen/glue.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in Gen::runtime_glue 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/gen/glue.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/perry-wpfacts/src/gen/glue.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d38efbce2addf587727d6bfd8d6776092a9c3f33a58cf5e9d2f2a9e19a1e58"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/array/from_concat.rs: crates/perry-runtime/src/array/from_concat.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in perry_runtime::array::from_concat::try_append_spread_array_dense at line 1201. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/array/from_concat.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/perry-runtime/src/array/from_concat.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de8e43401c97d88850eb8ff318ff9cc00bfa800859dfb99d2dc7105ca9c7576"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/value/dynamic_arith.rs: crates/perry-runtime/src/value/dynamic_arith.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in perry_runtime::value::dynamic_arith::to_primitive_default_for_add at line 194. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/value/dynamic_arith.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/perry-runtime/src/value/dynamic_arith.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9bc41bbf99a0bf487b0549fbd0ffa172d59506e1d2f69ee5c2721ca1d2d201c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/gc_store_site_inventory.py: scripts/gc_store_site_inventory.py changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in gc_store_site_inventory.classify_rust_store at line 396. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/gc_store_site_inventory.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gc_store_site_inventory.py"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7391903f1efe3b23bad2fde640e4714937fd1cdae7e79a5f05e50cb31c609ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-net/src/payload_socket.rs: crates/perry-ext-net/src/payload_socket.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in perry_ext_net::payload_socket::get at line 1466. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-net/src/payload_socket.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/perry-ext-net/src/payload_socket.rs"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"23474625847b0cfe7efe6a4d7b87959a7e656857e93083b17951852dbb9fc369"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower_types/extract.rs: crates/perry-hir/src/lower_types/extract.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in perry_hir::lower_types::extract::extract_ts_type_with_ctx at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower_types/extract.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_types/extract.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad380625367a450117481e0b9a08f1ec19be69ba694f474820ec9a01d967e0da"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/module_decl/namespace.rs: crates/perry-hir/src/lower/module_decl/namespace.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in perry_hir::lower::module_decl::namespace::lower_namespace_block at line 228. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/module_decl/namespace.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/perry-hir/src/lower/module_decl/namespace.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8e5d4934a130dcbf2b0a28eed21190a1c6f63bbc58d36398345acaca458909"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower_decl/class_members.rs: crates/perry-hir/src/lower_decl/class_members.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in perry_hir::lower_decl::class_members::lower_class_method_in_scope at line 477. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower_decl/class_members.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/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2ad63fa04a7d2121c32f28b2a1e315f0255dff2aa2443f87c4d570917c5de0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/readline/mod.rs: crates/perry-stdlib/src/readline/mod.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_stdlib::readline::js_readline_on at line 1416. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/readline/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/perry-stdlib/src/readline/mod.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a13f0bea7193063daff48e8e61952b5d05721bd0ab7137abf545d6a87fcc9f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/global_sink_isolation.py: scripts/global_sink_isolation.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in global_sink_isolation.self_test at line 484. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/global_sink_isolation.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/global_sink_isolation.py"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"77372b1ed664fdedba99deb6614944fcc9619fa38452fb479478e2cab1686648"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-http/src/server/http2_server/pump.rs: crates/perry-ext-http/src/server/http2_server/pump.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in perry_ext_http::server::http2_server::pump::process_pending_h2_events at line 169. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-http/src/server/http2_server/pump.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/perry-ext-http/src/server/http2_server/pump.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c849ec988b9524486de515f83f1ce906bdaea887c12cb7a982ae3d738146ed0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/builtins/formatting/util_format.rs: crates/perry-runtime/src/builtins/formatting/util_format.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in perry_runtime::builtins::formatting::util_format::js_util_format at line 218. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/builtins/formatting/util_format.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/perry-runtime/src/builtins/formatting/util_format.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"504d9f20da671d5e8282e43602087bae4d3c02ad4d55fe02062cfa51260d4673"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/class_registry/decl_prototype_birth.rs: crates/perry-runtime/src/object/class_registry/decl_prototype_birth.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in perry_runtime::object::class_registry::decl_prototype_birth::decl_prototype_born_final at line 95. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/class_registry/decl_prototype_birth.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/perry-runtime/src/object/class_registry/decl_prototype_birth.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d12a393561fc6fcf01c0e49e0a64f5177ac2b3e53d30ad9a8c6984990e73314"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/url/node_compat.rs: crates/perry-runtime/src/url/node_compat.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in perry_runtime::url::node_compat::legacy_url_resolve_impl at line 883. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/url/node_compat.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/perry-runtime/src/url/node_compat.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08f74219a0f4a76652ee1374826a29f54b85d5b51c86684d3f94175e44b5c31"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/intl/number_format.rs: crates/perry-runtime/src/intl/number_format.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in perry_runtime::intl::number_format::number_parts_core at line 729. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/intl/number_format.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/perry-runtime/src/intl/number_format.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2279254b9eee2d17e306bd902fd648a68aaabb2ca96d591669377f2766a70e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/dynamic_import.rs: crates/perry-hir/src/dynamic_import.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in perry_hir::dynamic_import::resolve_import_path_with_context at line 1281. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/dynamic_import.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/perry-hir/src/dynamic_import.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee108b9e58cc9420613869600485569c383c0fb117bcdce50ba917cd7a6f67b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/number_by_construction.rs: crates/perry-codegen/src/collectors/number_by_construction.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in NumberAtReadFlow::stmt at line 350. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/number_by_construction.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/perry-codegen/src/collectors/number_by_construction.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bef532b22d237e8587c119699e2e26346261b39bc04d6ce69207551ef7caef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/tls/dispatch.rs: crates/perry-stdlib/src/tls/dispatch.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in perry_stdlib::tls::dispatch::dispatch_tls_handle 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/tls/dispatch.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/perry-stdlib/src/tls/dispatch.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ceae83947e8f7b36d3ef360d8313a75a95b96c577707cacacec276ecfa89a86"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/arena/quarantine.rs: crates/perry-runtime/src/arena/quarantine.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_runtime::arena::quarantine::report_stale_address_holders at line 941. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/arena/quarantine.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/perry-runtime/src/arena/quarantine.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"acad3c4f7120934350387da990dcea037272cef23e5cf4556773a9bc63616b1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/solve/lookup.rs: crates/perry-wpfacts/src/solve/lookup.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Model::load_from at line 8. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/solve/lookup.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/perry-wpfacts/src/solve/lookup.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb99b34f691710c3761e7ed7f74ba5a43ea5cd7e383aa7008b99953db42987f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/gen/walk.rs: crates/perry-wpfacts/src/gen/walk.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Gen::stmt_inner at line 532. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/gen/walk.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/perry-wpfacts/src/gen/walk.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"d819776a036dab964de4c920e5567dcea0523110cbd094922c798c37034301fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/cjs_wrap/hoist_classes.rs: crates/perry/src/commands/compile/cjs_wrap/hoist_classes.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in perry::commands::compile::cjs_wrap::hoist_classes::collect_top_level_let_const_var_names at line 724. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/cjs_wrap/hoist_classes.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/perry/src/commands/compile/cjs_wrap/hoist_classes.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a8c26af900af7a9c46bf365238c299a9f26b36fbf4fea52a7f83d4f8c09481"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/class_artifacts.rs: crates/perry-codegen/src/codegen/class_artifacts.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in perry_codegen::codegen::class_artifacts::emit_class_artifacts at line 59. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/class_artifacts.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/perry-codegen/src/codegen/class_artifacts.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c88e738d2132b14f2d24e48b7e71bb039ccea7e30f1cb73cfde3b8aefa5aced"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/regex/perex_split.rs: crates/perry-runtime/src/regex/perex_split.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in perry_runtime::regex::perex_split::regexp at line 286. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/regex/perex_split.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/perry-runtime/src/regex/perex_split.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe95b2920e95f0acee584c849cb05d1372bf670fc91d77c9904393c69c6d742"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/url/parse.rs: crates/perry-runtime/src/url/parse.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in perry_runtime::url::parse::parse_url at line 27. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/url/parse.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/perry-runtime/src/url/parse.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df107372ef2a62ac0925ee099211a02ab12894b349de1c1a24897cabab512b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/regex/perex_replace_direct.rs: crates/perry-runtime/src/regex/perex_replace_direct.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in perry_runtime::regex::perex_replace_direct::replace at line 159. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/regex/perex_replace_direct.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/perry-runtime/src/regex/perex_replace_direct.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef0ba9eb338ec99cc13b62ff6b37a7ad9b5a79e04d3e3a22b83c86080f0ff4b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/proxy/reflect.rs: crates/perry-runtime/src/proxy/reflect.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in perry_runtime::proxy::reflect::proxy_get_own_property_descriptor at line 36. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/proxy/reflect.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/perry-runtime/src/proxy/reflect.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59ff6eef2dccf62fe3e4bba174a273960ab2e0bbcf17a39e1293be874185c39"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/array_literal.rs: crates/perry-codegen/src/expr/array_literal.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in perry_codegen::expr::array_literal::emit_array_from_lowered_values at line 237. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/array_literal.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/perry-codegen/src/expr/array_literal.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1c4bdc2325c114c922953ce31a60eda8d86d9c96495a2a4217f59ef5da1be8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/array_methods.rs: crates/perry-codegen/src/expr/array_methods.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in perry_codegen::expr::array_methods::lower at line 58. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/array_methods.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/perry-codegen/src/expr/array_methods.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d754dad0bdcb3ed198b7a3a274fd7fc5f81ffa62f15d0df9521d2e5d885b289c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/field_get_set/field_ops.rs: crates/perry-runtime/src/object/field_get_set/field_ops.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in perry_runtime::object::field_get_set::field_ops::js_object_set_field at line 101. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/field_get_set/field_ops.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/perry-runtime/src/object/field_get_set/field_ops.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7dea250f51ea19ab76489e22199dfefc4050ac1e35563d10de91d4312176ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/array/concat_reverse.rs: crates/perry-runtime/src/array/concat_reverse.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in perry_runtime::array::concat_reverse::js_array_concat at line 78. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/array/concat_reverse.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/perry-runtime/src/array/concat_reverse.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a84b69f00d1692dafa8bd6923d67588b38291dcaf1a85dcce0675b373b20b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/wpfacts_access.rs: crates/perry-codegen/src/expr/wpfacts_access.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in perry_codegen::expr::wpfacts_access::prove at line 285. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/wpfacts_access.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/perry-codegen/src/expr/wpfacts_access.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76e4b50418e8cd497d6e6cfeb784916e2801e081051bac73aa6f52a3bb6a9dc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/iterator_helpers.rs: crates/perry-runtime/src/iterator_helpers.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in perry_runtime::iterator_helpers::dispatch_iterator_helper_method at line 497. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/iterator_helpers.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/perry-runtime/src/iterator_helpers.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"962a01086a6eb714af808b97d26c63b51cd6c1cb5e596b0ff60cfa634cb5e87e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/url_main.rs: crates/perry-codegen/src/expr/url_main.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in perry_codegen::expr::url_main::lower at line 40. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/url_main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/url_main.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"103120b8598a8729156bc1c67f98a4891633c4b71cd3199e8797b6458850af33"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/field_get_set/entries_shape.rs: crates/perry-runtime/src/object/field_get_set/entries_shape.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in perry_runtime::object::field_get_set::entries_shape::js_object_entries_shape at line 9. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/field_get_set/entries_shape.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/perry-runtime/src/object/field_get_set/entries_shape.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af5ad67578f0ea3cfd8d2fb2923b3f28de49f3deca5aa37a5ffad9a7d10034c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wasm-host/src/lib.rs: crates/perry-wasm-host/src/lib.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry_wasm_host::instantiate_with_import_callbacks at line 374. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wasm-host/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/perry-wasm-host/src/lib.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67ff68f21d35e28311729cf51af93bc3428bba83af9e81fa97896d716d08893"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/escape_objects.rs: crates/perry-codegen/src/collectors/escape_objects.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in perry_codegen::collectors::escape_objects::check_object_literal_escapes_in_expr at line 407. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/escape_objects.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/perry-codegen/src/collectors/escape_objects.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8caece782f6f7fec45ea8c6eb6a996276883923f6e220438482108573afd592"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/collect_modules/static_require_transform.rs: crates/perry/src/commands/compile/collect_modules/static_require_transform.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in perry::commands::compile::collect_modules::static_require_transform::transform_static_literal_requires_with_bunfs at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/collect_modules/static_require_transform.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/perry/src/commands/compile/collect_modules/static_require_transform.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"674cb23c38d720b81f5b30c9d545154846ab3432146905daee27c9050ed9956c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/fs/stream.rs: crates/perry-runtime/src/fs/stream.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in perry_runtime::fs::stream::stream_on_common at line 1563. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/fs/stream.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/perry-runtime/src/fs/stream.rs"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2a9b876d051ebf0afb5521c5b5d019a66bee209555bb97325f4c695f6ae2cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/builtins/console.rs: crates/perry-runtime/src/builtins/console.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_runtime::builtins::console::js_console_log_dynamic at line 50. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/builtins/console.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/perry-runtime/src/builtins/console.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"74396601802c643b209084a88b4c7a129dad7c97e974073f510d7b0e8f5d4576"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/ci_plan.py: scripts/ci_plan.py changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ci_plan.plan at line 312. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/ci_plan.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci_plan.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa60e9de0a958587051989f70c0736541903c3338a22832b2264899f290195e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/type_analysis/strings.rs: crates/perry-codegen/src/type_analysis/strings.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in perry_codegen::type_analysis::strings::is_string_expr at line 683. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/type_analysis/strings.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/perry-codegen/src/type_analysis/strings.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"b702006299a6cd25ce978c475f5396b91c7d112a2f626f12df6174525a3b419e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/gen/class_values.rs: crates/perry-wpfacts/src/gen/class_values.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in Gen::stand_in_class at line 636. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/gen/class_values.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/perry-wpfacts/src/gen/class_values.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a73c4eb3d1890f0239236363da56a8afd7a7712b9b05cab64950351128e8697"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/static_prototype.rs: crates/perry-codegen/src/codegen/static_prototype.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in perry_codegen::codegen::static_prototype::collect at line 5. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/static_prototype.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/perry-codegen/src/codegen/static_prototype.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fc0f508a9e6160cde1a19619f3bf639d75a62d1374da8cdfd95b730e724f66"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-transform/src/inline/cross_module.rs: crates/perry-transform/src/inline/cross_module.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in perry_transform::inline::cross_module::localize_cross_module_functions at line 571. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-transform/src/inline/cross_module.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/perry-transform/src/inline/cross_module.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4081530d4edbc615316d643592073dbcb7714d871bb80a8b694ad6d53da4f40"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/gen/import_values.rs: crates/perry-wpfacts/src/gen/import_values.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in Gen::stand_in_fn_of at line 596. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/gen/import_values.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/perry-wpfacts/src/gen/import_values.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c8676a87355956ab03ced2e471554544c30057af4292bb7ad93806c946407f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/common/dispatch/fastify_net.rs: crates/perry-stdlib/src/common/dispatch/fastify_net.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in perry_stdlib::common::dispatch::fastify_net::dispatch_external_net_socket at line 15. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/common/dispatch/fastify_net.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/perry-stdlib/src/common/dispatch/fastify_net.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7903cc0cd91d8adf5c2edf692a7fb05f59d2c26c1b1f352af92877cedfffb4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/closure/props.rs: crates/perry-runtime/src/closure/props.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in perry_runtime::closure::props::bag_born_with_attrs at line 108. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/closure/props.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/perry-runtime/src/closure/props.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e151fde9f3dda186238e631552d90cb611e9e83a9fa2ab215b0c270a75d4c165"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/streams/subclass.rs: crates/perry-stdlib/src/streams/subclass.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in perry_stdlib::streams::subclass::dispatch_stream_method at line 181. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/streams/subclass.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/perry-stdlib/src/streams/subclass.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2c3733c5e6a016ebb21ae5d22196e55532e5bf71eb5642d5acc2277fd90bcb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/common/net_method_values.rs: crates/perry-stdlib/src/common/net_method_values.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in perry_stdlib::common::net_method_values::net_socket_method_name at line 87. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/common/net_method_values.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/perry-stdlib/src/common/net_method_values.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"3894282a49da6d60f935f48535d31027979a4930fbf78612b29f679e95fc9809"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/node_stream_pipeline.rs: crates/perry-runtime/src/node_stream_pipeline.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_runtime::node_stream_pipeline::run_collected_pipeline at line 729. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/node_stream_pipeline.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/perry-runtime/src/node_stream_pipeline.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"daac2f78e8ab1c7d07d121303f936c525b7b5de4d3bfa60dd509d2b6e528c29f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-http/src/server/mod.rs: crates/perry-ext-http/src/server/mod.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_ext_http::server::scan_http_server_roots at line 128. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-http/src/server/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/perry-ext-http/src/server/mod.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"9469e53786c1a084653f71737ffafe83f759cf18cf9bc9281874cfaabbb7266c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/hot_callees.rs: crates/perry-codegen/src/collectors/hot_callees.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in perry_codegen::collectors::hot_callees::walk_expr at line 444. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/hot_callees.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/perry-codegen/src/collectors/hot_callees.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"2403c95aeddb94b4c121a16d9088dcf1a3deed6475f9bf918a3e957d4e80965b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/function/precise_roots.rs: crates/perry-codegen/src/function/precise_roots.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_codegen::function::precise_roots::lower_roots_for_rs4gc 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/function/precise_roots.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/perry-codegen/src/function/precise_roots.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"79da4e75e572743a7912761e241654c42b8b549d4587337eed14f0669f69f638"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_call/native_module/imported_module_dispatch.rs: crates/perry-hir/src/lower/expr_call/native_module/imported_module_dispatch.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in perry_hir::lower::expr_call::native_module::imported_module_dispatch::try_imported_module_dispatch at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_call/native_module/imported_module_dispatch.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/perry-hir/src/lower/expr_call/native_module/imported_module_dispatch.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f850540932e8ae3678fab52c91f0f996932404bbab523b6ffbf749ecb2d74b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/env_clones.rs: crates/perry-codegen/src/expr/env_clones.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in perry_codegen::expr::env_clones::lower at line 15. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/env_clones.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/perry-codegen/src/expr/env_clones.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1741b1f8e173c26d9dbe1cb0790671bd6e3c7a0e89ff5b8c2dd7d295110363c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-zlib/src/stream/driver.rs: crates/perry-ext-zlib/src/stream/driver.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in Header::read at line 162. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-zlib/src/stream/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/perry-ext-zlib/src/stream/driver.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b95c26ac9dba39c748353eecbd7cac48d123420ee54275c3ed3f4db761da53"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/cjs_wrap/extract_exports.rs: crates/perry/src/commands/compile/cjs_wrap/extract_exports.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in perry::commands::compile::cjs_wrap::extract_exports::extract_exports_from_source at line 406. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/cjs_wrap/extract_exports.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/perry/src/commands/compile/cjs_wrap/extract_exports.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"551d94735917c882f7c817942e871f2fef9df0d173e3cb7f688e3c3eba4fd43f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/buffer_access.rs: crates/perry-codegen/src/expr/buffer_access.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in perry_codegen::expr::buffer_access::lower_typed_array_store at line 768. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/buffer_access.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/perry-codegen/src/expr/buffer_access.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7d49331c56a6c96d40d17da403b31020f97ac091da944c3946124cec014844"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/element_shape_guard.rs: crates/perry-codegen/src/expr/element_shape_guard.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in perry_codegen::expr::element_shape_guard::emit_element_shape_loop_preheader_check at line 200. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/element_shape_guard.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/perry-codegen/src/expr/element_shape_guard.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23dfa47a7ac70e411ffc2e42a5e9043a7e7422215e507169ba698043ba785a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/node_submodules/zlib.rs: crates/perry-runtime/src/node_submodules/zlib.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in perry_runtime::node_submodules::zlib::js_zlib_stream_option at line 746. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/node_submodules/zlib.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/perry-runtime/src/node_submodules/zlib.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36759436dc5ed57e138119ebda11469e20ec33575cf439d2598e6557c075976"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/string/split.rs: crates/perry-runtime/src/string/split.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in perry_runtime::string::split::js_string_split_n at line 320. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/string/split.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/perry-runtime/src/string/split.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bb6ae9bbb04d882a84aec410e5c542ca9bd7263a15d6c284677776eb52fe3c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/child_process/fork.rs: crates/perry-runtime/src/child_process/fork.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry_runtime::child_process::fork::js_child_process_fork at line 27. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/child_process/fork.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/perry-runtime/src/child_process/fork.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa266a3836b2ae240c90cda8c034d34f0d4c766ddbcf6db4be60c5c58b219a1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/method_site/read_holder/keyed.rs: crates/perry-runtime/src/object/method_site/read_holder/keyed.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry_runtime::object::method_site::read_holder::keyed::walk_to_key at line 40. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/method_site/read_holder/keyed.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/perry-runtime/src/object/method_site/read_holder/keyed.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe65c9bf777486ffb32592714de6a30ca85128d3513a846709e8e90542d67a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/global_this/typed_array.rs: crates/perry-runtime/src/object/global_this/typed_array.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_runtime::object::global_this::typed_array::validate_array_buffer_species_constructor at line 236. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/global_this/typed_array.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/perry-runtime/src/object/global_this/typed_array.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"76419cd89cdafcb307fc8ae686a59a6c888d43ffdd16d1eecc91ae7462b6d1fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/event_pump.rs: crates/perry-runtime/src/event_pump.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_runtime::event_pump::js_wait_for_event at line 725. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/event_pump.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/perry-runtime/src/event_pump.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd26172814989bfd4b2cdc99b34322b91e797cbcd90141f1e3fcff237ba7acb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-gc-effects/src/graph.rs: crates/perry-gc-effects/src/graph.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 95 in perry_gc_effects::graph::classify at line 335. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-gc-effects/src/graph.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/perry-gc-effects/src/graph.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad532eea930e3f81facbf2efdc06a7ac0a5f6df55bb1ff4bc1fa2b947f50ae93"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/monomorph/defaults.rs: crates/perry-hir/src/monomorph/defaults.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in perry_hir::monomorph::defaults::fill_defaults_in_expr at line 196. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/monomorph/defaults.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/perry-hir/src/monomorph/defaults.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"2055ec0863bbfeff3fcd355a843dab2a51cab85b19192c0263bc62ac39a30404"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/array/splice_slice.rs: crates/perry-runtime/src/array/splice_slice.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in perry_runtime::array::splice_slice::js_array_splice at line 24. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/array/splice_slice.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/perry-runtime/src/array/splice_slice.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dab2c127882234ad387e588aed490103a21bc9c88c942531887ffc52e711622"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/layout_read.rs: crates/perry-codegen/src/expr/layout_read.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in perry_codegen::expr::layout_read::run_value at line 387. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/layout_read.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/perry-codegen/src/expr/layout_read.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"572196143a49fe56035f79fe12dbf5ae1927b3cc485f75c1f5f33629838342e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/ptr_shape_report.rs: crates/perry-codegen/src/collectors/ptr_shape_report.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in perry_codegen::collectors::ptr_shape_report::scan_stmts at line 726. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/ptr_shape_report.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/perry-codegen/src/collectors/ptr_shape_report.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f0241d49a7e17b3b35984453984b5aa6d4d23691ebd3b2c5bd775e89e5c5ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/gc/oldgen/sweep_objects.rs: crates/perry-runtime/src/gc/oldgen/sweep_objects.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ArenaSweepObjectsState::apply_block_skip at line 134. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/gc/oldgen/sweep_objects.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/perry-runtime/src/gc/oldgen/sweep_objects.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bccf2b0de2908311dd941ee62ef51b4b4524cd1c786b5d00be4b77439c288aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/promise/then_probe.rs: crates/perry-runtime/src/promise/then_probe.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in perry_runtime::promise::then_probe::prove_no_then at line 473. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/promise/then_probe.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/perry-runtime/src/promise/then_probe.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"70496f11f4be1776b7602a6f3cefe4f354cf46346b8cfb671934a30882a9205b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/ui_tables.rs: crates/perry-codegen/src/lower_call/ui_tables.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in perry_codegen::lower_call::ui_tables::lower_perry_ui_table_call at line 376. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/ui_tables.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/ui_tables.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e8cc35b760e358beedca1c62edad5108ade801272d2dc71857a48ca1b5e089"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_call/module_class_static.rs: crates/perry-hir/src/lower/expr_call/module_class_static.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in perry_hir::lower::expr_call::module_class_static::try_module_class_static at line 13. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_call/module_class_static.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/perry-hir/src/lower/expr_call/module_class_static.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"87370bf6e1ff4edab61060b16a63c40c369a770f0a1664c27e067c0951c238b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/scalar_method.rs: crates/perry-codegen/src/lower_call/scalar_method.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in perry_codegen::lower_call::scalar_method::try_lower_scalar_replaced_method_call at line 1005. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/scalar_method.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/perry-codegen/src/lower_call/scalar_method.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"68afc54fae0833f9c8fc3d123789646bbae4ee632f11eef6c4f0c650c2b1e59b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/native_module_dispatch/dispatch_util.rs: crates/perry-runtime/src/object/native_module_dispatch/dispatch_util.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 135 in perry_runtime::object::native_module_dispatch::dispatch_util::nm_dispatch_util at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/native_module_dispatch/dispatch_util.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/perry-runtime/src/object/native_module_dispatch/dispatch_util.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64d8edba13c629477796180995fa24eb6138bc268d6ee0b7226b25b31e01ca0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs: crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in perry_hir::lower_decl::body_stmt::nested_fn_decl::lower_nested_fn_decl at line 18. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.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/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dddaa87ad934aa703ef6446c86e87ced160378a30ec561794bae3cdec7bff42"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/property_get.rs: crates/perry-codegen/src/lower_call/property_get.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in perry_codegen::lower_call::property_get::lower_method_call_chain at line 347. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/property_get.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/perry-codegen/src/lower_call/property_get.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"921dd562a00b70175c693f7084dd591307b4295bbec89e8c51b7d2b0a9d6fae2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen-arkts/src/mutations.rs: crates/perry-codegen-arkts/src/mutations.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 89 in perry_codegen_arkts::mutations::collect_mutations_in_expr at line 204. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen-arkts/src/mutations.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/perry-codegen-arkts/src/mutations.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"96055553c3187844d7bafaa03d5a17cc5a65e033de56d37994bd55f2f30c4575"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/json/stringify_record_output.rs: crates/perry-runtime/src/json/stringify_record_output.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in perry_runtime::json::stringify_record_output::emit_cached_record_memo at line 525. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/json/stringify_record_output.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/perry-runtime/src/json/stringify_record_output.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc959cd47dc97571064a87e512badd716e57ad7f26cd98dc1514bc336ba6c83e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/fetch/request_copy.rs: crates/perry-stdlib/src/fetch/request_copy.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in perry_stdlib::fetch::request_copy::js_request_new_from_input at line 10. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/fetch/request_copy.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/perry-stdlib/src/fetch/request_copy.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4117340d66b34f40c3ed1212f1b80f07032b518467f5e34294f130cc48929b01"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/solve/store.rs: crates/perry-wpfacts/src/solve/store.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 88 in Model::store_into at line 276. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/solve/store.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/perry-wpfacts/src/solve/store.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"04374bfb7625323de891a3829fb931270cefb4ad79d9063ea1ef68e946e8a746"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/bootstrap.rs: crates/perry/src/commands/compile/bootstrap.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry::commands::compile::bootstrap::rerun_collect_with_class_field_types at line 181. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/bootstrap.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/perry/src/commands/compile/bootstrap.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6522447ba07c987e18cdfc27489d48c2ef403785d66bc0bda049aac89d2ca62"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/runtime_abi_check.py: scripts/runtime_abi_check.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in runtime_abi_check.self_test at line 1001. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/runtime_abi_check.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/runtime_abi_check.py"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48c4c69ca279f32a5412a891d3dd49ccfb742e3a843e8df165b01027c41d16e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/collect_modules/finish.rs: crates/perry/src/commands/compile/collect_modules/finish.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in perry::commands::compile::collect_modules::finish::collect_module_finish 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/collect_modules/finish.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/perry/src/commands/compile/collect_modules/finish.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a3fb6c5ca7f3bd125a51dcff5b8fd23bf1458d94902cf5bd7caa16aeaad100"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/native_module/constructor_shapes.rs: crates/perry-runtime/src/object/native_module/constructor_shapes.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_runtime::object::native_module::constructor_shapes::attach at line 169. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/native_module/constructor_shapes.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/perry-runtime/src/object/native_module/constructor_shapes.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e8288cc596bcf7b63c705b0f79345585e6204c24474756552eec7bfaf8d6e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/destructuring/var_decl_sources.rs: crates/perry-hir/src/destructuring/var_decl_sources.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in perry_hir::destructuring::var_decl_sources::register_destructured_stream_ctors at line 161. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/destructuring/var_decl_sources.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/perry-hir/src/destructuring/var_decl_sources.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"d264ac617e3c8e0c6c326cadcccda36f0ef9aab330f9776394e8aef071f4ec4d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/field_get_set/ic_miss/class_field_define_fast.rs: crates/perry-runtime/src/object/field_get_set/ic_miss/class_field_define_fast.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in perry_runtime::object::field_get_set::ic_miss::class_field_define_fast::try_define_new_class_field at line 26. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/field_get_set/ic_miss/class_field_define_fast.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/perry-runtime/src/object/field_get_set/ic_miss/class_field_define_fast.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bacb928c02da490a227997e5ac44398c2b829768732b685297d33f006adce36"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/worker_threads/worker_pump.rs: crates/perry-stdlib/src/worker_threads/worker_pump.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_stdlib::worker_threads::worker_pump::js_worker_threads_process_pending at line 70. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/worker_threads/worker_pump.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/perry-stdlib/src/worker_threads/worker_pump.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c28a81a0c92cb956a4c532d170274b735813667e2e506ef9d5c864cf2674b9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/entry_outline.rs: crates/perry-codegen/src/codegen/entry_outline.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in perry_codegen::codegen::entry_outline::max_func_id at line 748. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/entry_outline.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/perry-codegen/src/codegen/entry_outline.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2083014e476c3ccb456f8535808b76537348f249d30f8c6389882eb148e4712"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ui-windows/src/app.rs: crates/perry-ui-windows/src/app.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in perry_ui_windows::app::app_run at line 618. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ui-windows/src/app.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/perry-ui-windows/src/app.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9f1b5f6ae5b0e7c29ff2daa95c847c90f5f016917dfc3265d93e709d3e5a95"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/optimized_libs/features.rs: crates/perry/src/commands/compile/optimized_libs/features.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in perry::commands::compile::optimized_libs::features::auto_optimized_cross_features at line 127. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/optimized_libs/features.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/perry/src/commands/compile/optimized_libs/features.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6a272601b9eaeafa05cf3ef60b6807c4bec9b72e090f503f80c5c338abb75d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/native_module_dispatch.rs: crates/perry-runtime/src/object/native_module_dispatch.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry_runtime::object::native_module_dispatch::normalize_dispatch_module_name at line 252. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/native_module_dispatch.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/perry-runtime/src/object/native_module_dispatch.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ca156b95d0f937b1c966e42323166429f4e0cd5f0b6a1f42e7665a7dbd0901"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/typedarray/access.rs: crates/perry-runtime/src/typedarray/access.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry_runtime::typedarray::access::classify_set_source at line 417. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/typedarray/access.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/perry-runtime/src/typedarray/access.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef45fca3c97dc3ee086d860ca284535e914b4e38104599be8475a2da6703f28b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/arena/promote.rs: crates/perry-runtime/src/arena/promote.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_runtime::arena::promote::stamp_and_index_block at line 458. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/arena/promote.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/perry-runtime/src/arena/promote.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9f579518260eda5231bbd3bd00ed2bb4f476432fa915b2884133f246f85639"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/builtin_proto.rs: crates/perry-runtime/src/object/builtin_proto.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_runtime::object::builtin_proto::receiver_fact at line 612. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/builtin_proto.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/perry-runtime/src/object/builtin_proto.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4fe8e518870bcb25ae8fa046193a1d09f4379061eaf90195d0f4b95a6830fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/promise/spec_combinators.rs: crates/perry-runtime/src/promise/spec_combinators.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in perry_runtime::promise::spec_combinators::perform 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/promise/spec_combinators.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/perry-runtime/src/promise/spec_combinators.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"886cea3355a8bfa9793f005728837ec820bf7b8bb450496d7d2112960534bf22"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/array/iterator_step.rs: crates/perry-runtime/src/array/iterator_step.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_runtime::array::iterator_step::js_iterator_step at line 9. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/array/iterator_step.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/perry-runtime/src/array/iterator_step.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e31a40b88106c3021efc8c0fd3dad3fbc869a71f6bde7d8a6dc21d7876e5698"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/eh_walker.rs: crates/perry-runtime/src/eh_walker.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_runtime::eh_walker::parse_unwind_info at line 333. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/eh_walker.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/perry-runtime/src/eh_walker.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78213a79bb1ceb83d13a5414ba9f774d7bdd2938929e39ecb66ec58071f992c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/gc/fromspace_scan.rs: crates/perry-runtime/src/gc/fromspace_scan.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in perry_runtime::gc::fromspace_scan::scan_object at line 200. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/gc/fromspace_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/perry-runtime/src/gc/fromspace_scan.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"841356ac8013c7aa07e0cfc05842b79f0ce85db3ea60c12c3c761335b02e27c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_call/url_date_instance.rs: crates/perry-hir/src/lower/expr_call/url_date_instance.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in perry_hir::lower::expr_call::url_date_instance::try_url_date_weakref_instance at line 37. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_call/url_date_instance.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/perry-hir/src/lower/expr_call/url_date_instance.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ffa7dbe76a3c50b664c1b6865db389398cef329ae6affbb51d61a377667e12"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/runtime_state_key.rs: crates/perry-runtime/src/runtime_state_key.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in NamedStateKey::write_existing at line 119. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/runtime_state_key.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/perry-runtime/src/runtime_state_key.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0a9fa016222b61a0e0a51002d421be96ebf74ba499b2fdaca8d1410c88e118"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/ta_element_read.rs: crates/perry-codegen/src/expr/ta_element_read.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in perry_codegen::expr::ta_element_read::receiver_kind at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/ta_element_read.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/perry-codegen/src/expr/ta_element_read.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80ec43ab49eb164ffc5265e728d12e4faff856c9117e063bfa81dca689430e4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/field_get_set/for_in_stable.rs: crates/perry-runtime/src/object/field_get_set/for_in_stable.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in perry_runtime::object::field_get_set::for_in_stable::stable_single_own_for_in_keys at line 126. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/field_get_set/for_in_stable.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/perry-runtime/src/object/field_get_set/for_in_stable.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00005464172bde06a1ff093968300ae4c8c2fa624ade6b99b324b9e8064df2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower_decl/enum_decl.rs: crates/perry-hir/src/lower_decl/enum_decl.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in perry_hir::lower_decl::enum_decl::eval_enum_init at line 249. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower_decl/enum_decl.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/perry-hir/src/lower_decl/enum_decl.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"b027052104e77fbb62fe32cebecb2c8d1b1de307f862c315c078500f5bb09fb7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/gc/trace/mark_slots.rs: crates/perry-runtime/src/gc/trace/mark_slots.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in perry_runtime::gc::trace::mark_slots::trace_heap_rewrite_slots_impl at line 77. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/gc/trace/mark_slots.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/perry-runtime/src/gc/trace/mark_slots.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3623fc18a631ce89ad1b79a00d3a4d67b2a791f211bef7601bc69176beab8d47"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/destructuring/var_decl/type_infer.rs: crates/perry-hir/src/destructuring/var_decl/type_infer.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in perry_hir::destructuring::var_decl::type_infer::infer_decl_type 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/destructuring/var_decl/type_infer.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/perry-hir/src/destructuring/var_decl/type_infer.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"67844cb4b72821bf26bfe7f3a843c2f88cc3228d4f2a918a435f151ae59f79d3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/collection_proto_thunks.rs: crates/perry-runtime/src/object/collection_proto_thunks.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in perry_runtime::object::collection_proto_thunks::render_incompatible_receiver at line 406. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/collection_proto_thunks.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/perry-runtime/src/object/collection_proto_thunks.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"f553d5abb19123db45c6eee7dbeb3b2e2e15e9c6507d9b234461c5a260ed652d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/child_process/validate.rs: crates/perry-runtime/src/child_process/validate.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in perry_runtime::child_process::validate::cp_validate_options at line 248. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/child_process/validate.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/perry-runtime/src/child_process/validate.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"1938dbf2a16c80fd781e4ef6db20327d774f8d07a6e0904597a28b6a7748fb9b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/const_fold_fn.rs: crates/perry-hir/src/lower/const_fold_fn.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_hir::lower::const_fold_fn::try_const_fold_function_construct_kind at line 191. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/const_fold_fn.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/perry-hir/src/lower/const_fold_fn.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f0604552544e56bf84459286cbf19177f8bd6b09971e6875ce41a2b99a414b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/array/subclass_packed_index.rs: crates/perry-runtime/src/array/subclass_packed_index.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_runtime::array::subclass_packed_index::js_packed_arraylike_index_get 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/array/subclass_packed_index.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/perry-runtime/src/array/subclass_packed_index.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"10152de8b72538d84558c10a34006d7a03c3572791f461ca80a8a6d7bf8446a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/worker_threads/channel_pump.rs: crates/perry-stdlib/src/worker_threads/channel_pump.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in perry_stdlib::worker_threads::channel_pump::js_worker_threads_channels_process_pending at line 17. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/worker_threads/channel_pump.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/perry-stdlib/src/worker_threads/channel_pump.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91618ab94bf8fd5b34f1ef7c765467b888bcec509ad3209e8ddf6cdebde277b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/gc_gate_wiring_check.py: scripts/gc_gate_wiring_check.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in gc_gate_wiring_check.main at line 605. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/gc_gate_wiring_check.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gc_gate_wiring_check.py"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"92876732efdb393287106bda767c8c2cad66f581aa1c82e289544ccf94a65a89"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_conditional.rs: crates/perry-codegen/src/lower_conditional.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_codegen::lower_conditional::lower_test at line 177. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_conditional.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/perry-codegen/src/lower_conditional.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"55badea4b6a4b83ebe5bc7527d0e84778afd7ef3fcbc93b818a46e4815c80c33"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/stmt/loops/iterator_record.rs: crates/perry-codegen/src/stmt/loops/iterator_record.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in perry_codegen::stmt::loops::iterator_record::lower at line 7. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/stmt/loops/iterator_record.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/perry-codegen/src/stmt/loops/iterator_record.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fd2f16cc0bc7a4638ccb62d21c0257f28372446c202d315ce880841d8981e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/dns/ffi.rs: crates/perry-runtime/src/dns/ffi.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in perry_runtime::dns::ffi::route_export at line 493. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/dns/ffi.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/perry-runtime/src/dns/ffi.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c9e4e5eb2ff7099eeb1bc8ad132c299406dbe5d63f3ee6ab8b7c6736536d97"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/array/literal_descriptor.rs: crates/perry-runtime/src/array/literal_descriptor.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Reader::value 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/array/literal_descriptor.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/perry-runtime/src/array/literal_descriptor.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad6f635503b50b8daa97513c0d222709c3a33659ed94384d52c33e9de290fc9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/ctor_prologue_stores.rs: crates/perry-codegen/src/lower_call/ctor_prologue_stores.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in perry_codegen::lower_call::ctor_prologue_stores::prologue_store_plan at line 133. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/ctor_prologue_stores.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/perry-codegen/src/lower_call/ctor_prologue_stores.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7691ae4ed786ccd07e3fdacd162baa1a7b839416e40ba7cf57baf9784d38fe1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/timer/handle_object.rs: crates/perry-runtime/src/timer/handle_object.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in perry_runtime::timer::handle_object::try_timer_method_fast_dispatch at line 224. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/timer/handle_object.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/perry-runtime/src/timer/handle_object.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f05b7f211ddd47560f9dd6d357fac84008254605def8c38e72d4a476e00a15c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-http/src/server/response_end.rs: crates/perry-ext-http/src/server/response_end.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in perry_ext_http::server::response_end::standalone_end at line 136. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-http/src/server/response_end.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/perry-ext-http/src/server/response_end.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc7c52928fa28c8c050b0d577be6b47c30f4d1a6082a678161a39ffffc6188b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/date/parse.rs: crates/perry-runtime/src/date/parse.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in perry_runtime::date::parse::parse_slash_date at line 574. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/date/parse.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/perry-runtime/src/date/parse.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc67d188e0e87f28b3cca9c3a4dbcf904d71ff793475535ce8053fb8564128af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/pty/reactor.rs: crates/perry-runtime/src/pty/reactor.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in perry_runtime::pty::reactor::pty_reactor_pump_inner at line 424. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/pty/reactor.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/perry-runtime/src/pty/reactor.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b7c7b4fd49751700e6fffbc678d1a9f6e3f3b8db4e4ab234d923992ee97f67"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/lower_expr/arm_optchain.rs: crates/perry-hir/src/lower/lower_expr/arm_optchain.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in perry_hir::lower::lower_expr::arm_optchain::lower_opt_chain_expr 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/lower_expr/arm_optchain.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/perry-hir/src/lower/lower_expr/arm_optchain.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c487c687472074e778f2c1d2fad5dfacd82e526e2eacba26c9a8cb202a630add"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/builder_fold.rs: crates/perry-hir/src/lower/builder_fold.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in perry_hir::lower::builder_fold::walk_expr at line 1418. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/builder_fold.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/perry-hir/src/lower/builder_fold.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c757838c0e027db058ee2e8a1f482d95d782026344f343de7ed24ec50c642d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/array/indexing_proto_chain.rs: crates/perry-runtime/src/array/indexing_proto_chain.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_runtime::array::indexing_proto_chain::array_index_get_walk at line 338. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/array/indexing_proto_chain.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/perry-runtime/src/array/indexing_proto_chain.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a5807e9238351ceb225f214a12cfe7d57d84f26d2a0d59cd4453f21e47cad4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/dump.rs: crates/perry-wpfacts/src/dump.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_wpfacts::dump::dump_text at line 99. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/dump.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/perry-wpfacts/src/dump.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"3441002d4ade83665d82f7336167e2209ed2b34be959cf043212885a2e151ee1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/json/stringify_flat.rs: crates/perry-runtime/src/json/stringify_flat.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_runtime::json::stringify_flat::try_object at line 234. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/json/stringify_flat.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/perry-runtime/src/json/stringify_flat.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a93425b9496dafe6b7bc1e0b4df721ab18f1a382f5dc0882bec9c3cf62e067e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/crypto/x509.rs: crates/perry-stdlib/src/crypto/x509.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in perry_stdlib::crypto::x509::dispatch_x509_property at line 1008. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/crypto/x509.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/perry-stdlib/src/crypto/x509.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0fbe6f903d59563575b0914c9b4078e32aeac265334b46d74d702378e207bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-http/src/client_events.rs: crates/perry-ext-http/src/client_events.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_ext_http::client_events::handle_response_event at line 253. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-http/src/client_events.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/perry-ext-http/src/client_events.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b7dba5bf25a9ab22a6623bd4cd0848b58ab12a07287962120ca7d173fd8169"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/compiler_output_harness/verification.py: scripts/compiler_output_harness/verification.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in verification.verify_artifacts at line 1253. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/compiler_output_harness/verification.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/compiler_output_harness/verification.py"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fce58f83dcf4d60b8283f0465cd37670a9f4f556b6862641c61c95d97e72243"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/object_ops/accessors.rs: crates/perry-runtime/src/object/object_ops/accessors.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in perry_runtime::object::object_ops::accessors::js_object_get_own_field_or_undef at line 120. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/object_ops/accessors.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/perry-runtime/src/object/object_ops/accessors.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99a8fd7aa6c04a731e91f38079db66fb3c8cd5d0042d0c164a19a728e89471b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/native_module/class_method_bind.rs: crates/perry-runtime/src/object/native_module/class_method_bind.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in perry_runtime::object::native_module::class_method_bind::js_class_method_bind at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/native_module/class_method_bind.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/perry-runtime/src/object/native_module/class_method_bind.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf943a2edb264faeaa1ff0530e13bdd572cf85e59f4b875dc434f5426d317ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/check_thread_locals.py: scripts/check_thread_locals.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in check_thread_locals.self_test at line 526. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/check_thread_locals.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check_thread_locals.py"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"a465ae925219414908be8721329aad7472702192992c7875e18aefcc015514c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/int_valued_ta_locals.rs: crates/perry-codegen/src/collectors/int_valued_ta_locals.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in perry_codegen::collectors::int_valued_ta_locals::observe_stmts at line 1345. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/int_valued_ta_locals.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/perry-codegen/src/collectors/int_valued_ta_locals.rs"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb7bb521f9e720d41aef6ff8c90cad63b5c9c379f9159985a9345cd575676d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/opt_report/render.rs: crates/perry-codegen/src/opt_report/render.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in perry_codegen::opt_report::render::render_text_with_sources at line 160. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/opt_report/render.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/perry-codegen/src/opt_report/render.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f62b47a95c230bbc74b4ebd80217b011cbbdb827bae0e5d21eae4981917e30"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/shape_mint_census.rs: crates/perry-runtime/src/object/shape_mint_census.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in perry_runtime::object::shape_mint_census::dump at line 613. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/shape_mint_census.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/perry-runtime/src/object/shape_mint_census.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"be400065fba377f098841a1f60d0ebd04b635b36e3cc2e153a76b7afb1600086"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/layout_desc/create_families.rs: crates/perry-codegen/src/layout_desc/create_families.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in perry_codegen::layout_desc::create_families::literal_iife at line 1701. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/layout_desc/create_families.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/perry-codegen/src/layout_desc/create_families.rs"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d4d672950222e01b3e5e937610ab9f7d9dc4fffe0a50bc28b5a6c96fc3a449"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/webcrypto/keys.rs: crates/perry-stdlib/src/webcrypto/keys.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 99 in perry_stdlib::webcrypto::keys::js_webcrypto_generate_key at line 18. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/webcrypto/keys.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/perry-stdlib/src/webcrypto/keys.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c6e9be622fc7ed726139c8c8722677103d7bd8bd66479bc1841dd536789908"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/cjs_wrap/extract_requires.rs: crates/perry/src/commands/compile/cjs_wrap/extract_requires.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in perry::commands::compile::cjs_wrap::extract_requires::function_local_specs at line 365. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/cjs_wrap/extract_requires.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/perry/src/commands/compile/cjs_wrap/extract_requires.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"610360ed16cd71510c460d378bb0c76193aca84d8132bb55fac4f85afec0c7ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-transform/src/inline/exact_receivers.rs: crates/perry-transform/src/inline/exact_receivers.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in perry_transform::inline::exact_receivers::collect_module_prototype_facts at line 85. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-transform/src/inline/exact_receivers.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/perry-transform/src/inline/exact_receivers.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcd93ec8619f28bbbb698a7a794ddc108f4e73598446a16cf1898e05135294e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/pre_scan/weakref_locals.rs: crates/perry-hir/src/lower/pre_scan/weakref_locals.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 97 in perry_hir::lower::pre_scan::weakref_locals::pre_scan_weakref_locals 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/pre_scan/weakref_locals.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/perry-hir/src/lower/pre_scan/weakref_locals.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"220b98f0023bd2a283f57c21b551a1d43e4f09f8914ecad07d6baa0aa9c63264"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/tls/module_api.rs: crates/perry-stdlib/src/tls/module_api.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_stdlib::tls::module_api::js_tls_native_dispatch at line 295. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/tls/module_api.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/perry-stdlib/src/tls/module_api.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"0447894cb0c7764da4056ca4fd44359bd056cc6852f35dfa88302c69821f6b33"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/object_literal.rs: crates/perry-codegen/src/expr/object_literal.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_codegen::expr::object_literal::lower_object_literal at line 211. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/object_literal.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/perry-codegen/src/expr/object_literal.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f6edbad7c52e37576cd6b009c33ff3993708daa452143296c8bc28eff15ac5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/raw_handle_debt.py: scripts/raw_handle_debt.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in raw_handle_debt.self_test at line 340. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/raw_handle_debt.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/raw_handle_debt.py"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75c3bd58937cd04d1aa40059b6b0f1a8e1dfdea602ef48328e95511966c6e25"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/intl/duration_format.rs: crates/perry-runtime/src/intl/duration_format.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_runtime::intl::duration_format::get_duration_unit_options at line 117. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/intl/duration_format.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/perry-runtime/src/intl/duration_format.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d455ca7ac3cc11f8ea02f0ce7fa9d3e12041132772310b8954da2a748bb162a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/fs/dirent.rs: crates/perry-runtime/src/fs/dirent.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_runtime::fs::dirent::js_fs_readdir_sync at line 400. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/fs/dirent.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/perry-runtime/src/fs/dirent.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"186084958a6c4f887701c255525c336eff6d2cf052c2a166fcff8d91429fe55e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/link/wasi.rs: crates/perry/src/commands/compile/link/wasi.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in perry::commands::compile::link::wasi::link_wasi at line 188. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/link/wasi.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/perry/src/commands/compile/link/wasi.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"443c3ba2b2784124dd1a41150d4a078813f05db587f8b9b1174aaa20b9fbea0d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/child_process/options.rs: crates/perry-runtime/src/child_process/options.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in perry_runtime::child_process::options::cp_apply_live_stdio at line 267. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/child_process/options.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/perry-runtime/src/child_process/options.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fba5810604d6ea48553605409746aaf45d1191839e4c746beded6ab9bdd381"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/string/slice_ops.rs: crates/perry-runtime/src/string/slice_ops.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in perry_runtime::string::slice_ops::case_convert at line 348. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/string/slice_ops.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/perry-runtime/src/string/slice_ops.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8ebb6f96cfc8870aaad1c1dc50fc735a9c7d96070a06590fdb98a5bbcb231b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/source_need/flow.rs: crates/perry-codegen/src/codegen/source_need/flow.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 92 in Build::expr at line 888. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/source_need/flow.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/perry-codegen/src/codegen/source_need/flow.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d3381899bd58fcbc21c60639149ca0cb98498c1d8e381e58f0ed146818c48b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/check_gate_freshness.py: scripts/check_gate_freshness.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in check_gate_freshness.self_test at line 512. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/check_gate_freshness.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check_gate_freshness.py"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce24f6154440f2ff46903c13f5eaf8e5359b44ed41637d5f6db61da84bd5c14"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/namespace_call.rs: crates/perry-codegen/src/lower_call/namespace_call.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in perry_codegen::lower_call::namespace_call::try_lower_namespace_member_call at line 67. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/namespace_call.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/perry-codegen/src/lower_call/namespace_call.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7fa7bcd25d755e38e467e843bde45cdfb03df8ec444aa7e8589f6707d1d56b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/buffer/dataview.rs: crates/perry-runtime/src/buffer/dataview.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in perry_runtime::buffer::dataview::js_data_view_get at line 282. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/buffer/dataview.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/perry-runtime/src/buffer/dataview.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8effaefda8de2b5bbf078e36559464c62e2420e13eaba85f003192a8ac5bb0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/shaped_symbols.rs: crates/perry-runtime/src/object/shaped_symbols.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_runtime::object::shaped_symbols::define at line 41. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/shaped_symbols.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/perry-runtime/src/object/shaped_symbols.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"00237ba3f2323204ca0a07fed922106fc7d31b702390b572a6a61037022d2ad0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/literal_descriptor.rs: crates/perry-codegen/src/expr/literal_descriptor.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in Descriptor::value at line 125. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/literal_descriptor.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/perry-codegen/src/expr/literal_descriptor.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"90cd92ef646062c14f39e87b6574fc41c996c201b9323a49dd48cd3e026d393b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-net/src/payload_io.rs: crates/perry-ext-net/src/payload_io.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in perry_ext_net::payload_io::sink at line 50. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-net/src/payload_io.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/perry-ext-net/src/payload_io.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24dede363589f211306279f846661834dca6fa31b0588d94a78f2c06a14e52a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-http/src/server/types.rs: crates/perry-ext-http/src/server/types.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_ext_http::server::types::jsvalue_to_body_bytes at line 296. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-http/src/server/types.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-http/src/server/types.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"2638077f9e2bdc4ef34b5329908dfe8625fdbd19a10ec27e5ae18751027a404f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/layout_desc/registration.rs: crates/perry-runtime/src/object/layout_desc/registration.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in perry_runtime::object::layout_desc::registration::register_bound at line 157. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/layout_desc/registration.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/perry-runtime/src/object/layout_desc/registration.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f23b75311645ab1b0590454f08ba3fc0f94357659f53d2a838d7dd0ce2d86a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/run/remote.rs: crates/perry/src/commands/run/remote.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in perry::commands::run::remote::remote_build_and_launch at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/run/remote.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/perry/src/commands/run/remote.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5acc37e228e4d713669093089871984184577033bb0283ad8b42c04c06c545"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-transform/src/generator/per_iteration.rs: crates/perry-transform/src/generator/per_iteration.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in perry_transform::generator::per_iteration::rewrite_cells_in_expr at line 1223. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-transform/src/generator/per_iteration.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/perry-transform/src/generator/per_iteration.rs"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb2b29335dc2a3f87a319efa7883e788762d2076795496c3c3a90722946fa57"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs: crates/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in perry_hir::lower::expr_call::intrinsics::apply_call::try_builtin_prototype_method_apply_call at line 370. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_call/intrinsics/apply_call.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/perry-hir/src/lower/expr_call/intrinsics/apply_call.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"0949a57a02f23856b9a32cd4f2c355933ac8b456203da4cd5e2dc364577ec581"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/gc/verify_diag.rs: crates/perry-runtime/src/gc/verify_diag.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in perry_runtime::gc::verify_diag::rewrite_visitor_name at line 116. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/gc/verify_diag.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/perry-runtime/src/gc/verify_diag.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"454465de375d3c0245a2236c97b2c08b47773e3939775149459d2b1a62c965cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/dyn_eval/expr.rs: crates/perry-runtime/src/dyn_eval/expr.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in perry_runtime::dyn_eval::expr::eval_expr at line 25. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/dyn_eval/expr.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/perry-runtime/src/dyn_eval/expr.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"670ea65c763b6f54144911d38c0282756f900b3577328371769cd1a277322965"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/class_declarations.rs: crates/perry-codegen/src/codegen/class_declarations.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in perry_codegen::codegen::class_declarations::class_declaration_globals 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/class_declarations.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/perry-codegen/src/codegen/class_declarations.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"731d73d450ce0237c2a847745a5f9a388f940e4da66961e618161e2c05c0cd55"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-zlib/src/stream/one_shot_callback.rs: crates/perry-ext-zlib/src/stream/one_shot_callback.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in perry_ext_zlib::stream::one_shot_callback::run 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-zlib/src/stream/one_shot_callback.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/perry-ext-zlib/src/stream/one_shot_callback.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a07771f8ce59ebb43d07456ed425343b959a2bd66c957041e17bf311cd02e4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-transform/src/generator/mod.rs: crates/perry-transform/src/generator/mod.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_transform::generator::transform_generators at line 110. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-transform/src/generator/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/perry-transform/src/generator/mod.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc50225b24c5ce66dcf9da402c082c934fa729d000db168d61b70ba026925462"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/buffer/query.rs: crates/perry-runtime/src/buffer/query.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_runtime::buffer::query::js_buffer_byte_length_value at line 234. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/buffer/query.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/perry-runtime/src/buffer/query.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"7615425f2b520404d3dcfd1fa7c07a14d26f49ffd68cccba6ef2b7656787680a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/check_ext_net_socket_open_invariant.py: scripts/check_ext_net_socket_open_invariant.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in check_ext_net_socket_open_invariant.evaluate at line 128. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/check_ext_net_socket_open_invariant.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check_ext_net_socket_open_invariant.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2628cf50e7fc37f69d86c1be061628a00441ae833235f8e1d2993231683c65c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/wasi_net/mod.rs: crates/perry-runtime/src/wasi_net/mod.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in perry_runtime::wasi_net::pump at line 482. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/wasi_net/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/perry-runtime/src/wasi_net/mod.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8c94a6497d1e3a8e0b6f5f749f0ee18a85a8a6a35ac9e2e39a038946df5499"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/wasi.rs: crates/perry-runtime/src/wasi.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in perry_runtime::wasi::validate_options at line 259. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/wasi.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/perry-runtime/src/wasi.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"f246169bf7e1c49639d2c04d780ab1b522507010d38e4df995833481e72c4500"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/export_value_wrappers.rs: crates/perry-codegen/src/codegen/export_value_wrappers.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in perry_codegen::codegen::export_value_wrappers::emit_export_value_wrappers at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/export_value_wrappers.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/perry-codegen/src/codegen/export_value_wrappers.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d25b7a436d794b8d6f340cb3da094a34667a4bb4dd64eb3418b45474913732f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/collect_modules/walk.rs: crates/perry/src/commands/compile/collect_modules/walk.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in perry::commands::compile::collect_modules::walk::walk_modules at line 105. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/collect_modules/walk.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/perry/src/commands/compile/collect_modules/walk.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6699039cd4d836f9189a5258c9d1ff5851222468668851287d8ac78320d22148"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/closure_collect.rs: crates/perry-codegen/src/codegen/closure_collect.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in perry_codegen::codegen::closure_collect::collect_module_closures at line 621. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/closure_collect.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/perry-codegen/src/codegen/closure_collect.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83782a4f280f7e2992eb8b9399df9dc6649e4b1a0e6408caac03b68db48e5c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-net/src/native_dispatch.rs: crates/perry-ext-net/src/native_dispatch.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in perry_ext_net::native_dispatch::js_ext_net_native_dispatch 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-net/src/native_dispatch.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/perry-ext-net/src/native_dispatch.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a110759b26e4883057845dd5e1927f7e928fd0a2b15b1b9cf50faabae2d9cae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/array_record_stack.rs: crates/perry-codegen/src/array_record_stack.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in perry_codegen::array_record_stack::lower at line 229. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/array_record_stack.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/perry-codegen/src/array_record_stack.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c333c336b80108b65ceb7cef0c20be41d70ee1273ff274daf6f2e5e92d1c418"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/package_bench_attr.py: scripts/package_bench_attr.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in package_bench_attr.run at line 728. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/package_bench_attr.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/package_bench_attr.py"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e6fd1e13e9d3a19006e1bd5eb3a82f0a2a1388372b401e43b2c45686a4bcb5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/class_registry/construct/builtin.rs: crates/perry-runtime/src/object/class_registry/construct/builtin.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in perry_runtime::object::class_registry::construct::builtin::construct at line 5. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/class_registry/construct/builtin.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/perry-runtime/src/object/class_registry/construct/builtin.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34f58ccb5236b3cd5fa69cfdaca0e6d72b8efe2eab55af1c27b87ac83bab2ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/turnloop_client/exchange.rs: crates/perry-stdlib/src/turnloop_client/exchange.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in perry_stdlib::turnloop_client::exchange::feed at line 831. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/turnloop_client/exchange.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/perry-stdlib/src/turnloop_client/exchange.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3863455df39b6aa431a60c9502214dc9827bd1e5721d9e7634722d556c0ec8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/lib/contracts.rs: crates/perry-wpfacts/src/lib/contracts.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in perry_wpfacts::lib::contracts::arg_contract_of at line 1592. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/lib/contracts.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/perry-wpfacts/src/lib/contracts.rs"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be9f77f4dd29a9a22db55dab67b83bfd0d79b1dba7476b4b0238538dc530b71"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/builtins/collections.rs: crates/perry-wpfacts/src/builtins/collections.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in perry_wpfacts::builtins::collections::array_method at line 306. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/builtins/collections.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/perry-wpfacts/src/builtins/collections.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc04b63444e6068def2a4d1a23006fce3907235777360911d3c7028608f50e90"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/regex/perex_results.rs: crates/perry-runtime/src/regex/perex_results.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in perry_runtime::regex::perex_results::materialize at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/regex/perex_results.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/perry-runtime/src/regex/perex_results.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c7c6896645ee51d49f73ee5fc7025afffad78acf00d2c66dee122dab6a9251"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/inprocess/native_homes.rs: crates/perry-codegen/src/inprocess/native_homes.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in perry_codegen::inprocess::native_homes::retain at line 27. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/inprocess/native_homes.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/perry-codegen/src/inprocess/native_homes.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc46e662d099a4b958e615875c56f31172151c7df145e53346ae98882b660b61"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/tiny_program/mod.rs: crates/perry/src/commands/compile/tiny_program/mod.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in perry::commands::compile::tiny_program::try_compile at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/tiny_program/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/perry/src/commands/compile/tiny_program/mod.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b41b3755395aaf441bde2ea7640a9d2b440f4049630fa53f1d9cc65418c6fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-transform/src/inline/substitute.rs: crates/perry-transform/src/inline/substitute.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in perry_transform::inline::substitute::substitute_locals_inner at line 15. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-transform/src/inline/substitute.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/perry-transform/src/inline/substitute.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"02264c7ce486512a82de611b96fc2e8c3736044421699c30c897d57eca4eecdb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_member/native_dispatch.rs: crates/perry-hir/src/lower/expr_member/native_dispatch.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in perry_hir::lower::expr_member::native_dispatch::is_native_dispatch_member at line 35. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_member/native_dispatch.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/perry-hir/src/lower/expr_member/native_dispatch.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd32a98399aa1299e870c0e1b7f1ba1cc6c23812ef8feab16999318833570af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/bindings.rs: crates/perry-wpfacts/src/bindings.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in perry_wpfacts::bindings::collect at line 273. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/bindings.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/perry-wpfacts/src/bindings.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"102ca6deebdba8a0e8cd4ea76f923b6878b3023857c9b41ec3d1820a66e4bf93"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/check_test_registration.py: scripts/check_test_registration.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in check_test_registration._rust_module_is_declared at line 189. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/check_test_registration.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check_test_registration.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"35346b620a4f17e1dac85c1c4de47e4a2644b68c3cafe14e1f81198a6dcc2067"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/init_order.rs: crates/perry/src/commands/compile/init_order.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in perry::commands::compile::init_order::topo_sort_non_entry_modules 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/init_order.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/perry/src/commands/compile/init_order.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"510f58b6db87e1a70b945da318bf1a940d254fd5f59843eb2188c5fccf559464"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/layout_families/late.rs: crates/perry-codegen/src/layout_families/late.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in perry_codegen::layout_families::late::module_groups at line 490. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/layout_families/late.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/perry-codegen/src/layout_families/late.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fbd1f1009945deeaef84caac36dc9292e791a653829283589a6cf4d25fb52f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/artifact_source_text.rs: crates/perry-codegen/src/codegen/artifact_source_text.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in perry_codegen::codegen::artifact_source_text::extend_class_method_source_text at line 18. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/artifact_source_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/perry-codegen/src/codegen/artifact_source_text.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d917ae54750e8c508ae41cff6ea1a82fd53e1d67196dad4fe5b971d9b48107"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/typed_locals.rs: crates/perry-codegen/src/collectors/typed_locals.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in Env::kind at line 321. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/typed_locals.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/perry-codegen/src/collectors/typed_locals.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c1b33988d3ee337b27a003d13100aafc59ffa3a0441593f9c5cfc8832f45a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/streams/tee.rs: crates/perry-stdlib/src/streams/tee.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_stdlib::streams::tee::tee_pull_microtask at line 379. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/streams/tee.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/perry-stdlib/src/streams/tee.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7b5982dbcdc7eae8c6f0548d40d49145dade159a153989b628bab1633339cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower_patterns.rs: crates/perry-hir/src/lower_patterns.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_hir::lower_patterns::lower_assign_target_to_expr 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower_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/perry-hir/src/lower_patterns.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34ed75adef2014fa3ce5fdc48b410b0cf55468042358190c5cf074fbef2db1c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wit/src/guest_c/values.rs: crates/perry-wit/src/guest_c/values.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in Emitter::lower_inner at line 320. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wit/src/guest_c/values.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/perry-wit/src/guest_c/values.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea29879c531b44750b731e1f8c3aaab85f08902b8bd3527a7682f3789b54ef1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/delete_retired_workflow_runs.py: scripts/delete_retired_workflow_runs.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in delete_retired_workflow_runs.main at line 46. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/delete_retired_workflow_runs.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/delete_retired_workflow_runs.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a384cf1f44fa57f3cdfc9115fc30b4f7478014ce4fa24cd5972f168cbfe0ac0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/json/stringify_primitive_object.rs: crates/perry-runtime/src/json/stringify_primitive_object.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry_runtime::json::stringify_primitive_object::emit at line 74. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/json/stringify_primitive_object.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/perry-runtime/src/json/stringify_primitive_object.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6b332da633b624e7d27843f436ece59dbc5b90c44ea3b24b452f43711f242f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/lower_expr/helpers.rs: crates/perry-hir/src/lower/lower_expr/helpers.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry_hir::lower::lower_expr::helpers::native_module_binding_value at line 399. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/lower_expr/helpers.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/perry-hir/src/lower/lower_expr/helpers.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabb7eb600e4614d7284ef9e8dfcf4bc227b22e740c19bcd83b89078a2f4298c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/common/dispatch_http.rs: crates/perry-stdlib/src/common/dispatch_http.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in perry_stdlib::common::dispatch_http::dispatch_client_incoming_property at line 181. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/common/dispatch_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/perry-stdlib/src/common/dispatch_http.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a13321d6ef514b1c9ec61205cf1e3bbc498f17eb25e934dec353e0e856d14c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/segview.rs: crates/perry-codegen/src/collectors/segview.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in perry_codegen::collectors::segview::rewrite_site at line 1008. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/segview.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/perry-codegen/src/collectors/segview.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"5161c09d5cdd1d86b609b817df4eb1290c8c6a3ee39bd81c55597f656edf8417"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/define_own_data.rs: crates/perry-runtime/src/object/define_own_data.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_runtime::object::define_own_data::definition_admitted at line 371. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/define_own_data.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/perry-runtime/src/object/define_own_data.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"47162fed8607374f02ecd18137ef2c20e8040706eea70351e33d6bd743fa3c2e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/monomorph/driver.rs: crates/perry-hir/src/monomorph/driver.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_hir::monomorph::driver::monomorphize_with_context at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/monomorph/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/perry-hir/src/monomorph/driver.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"952fc3d823669fbe6757465c9ea76807c545ac83b4cff04ac212ed96877442f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/node_http_prototypes.rs: crates/perry-runtime/src/object/node_http_prototypes.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_runtime::object::node_http_prototypes::message_init at line 715. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/node_http_prototypes.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/perry-runtime/src/object/node_http_prototypes.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2f8cb2664d53d1deaa9f9bedd37730ac43900eaceaea931302b9422781ddc5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/primitive_proto_thunks.rs: crates/perry-runtime/src/object/primitive_proto_thunks.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_runtime::object::primitive_proto_thunks::primitive_proto_method_value at line 130. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/primitive_proto_thunks.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/perry-runtime/src/object/primitive_proto_thunks.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f911c475412d1a65f47c8619ef54592455c26af0fde8ef2581ccfe51a92bb9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/class_registry/declarations.rs: crates/perry-runtime/src/object/class_registry/declarations.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_runtime::object::class_registry::declarations::name_computed_member_by_key at line 911. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/class_registry/declarations.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/perry-runtime/src/object/class_registry/declarations.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3de9dc0abbaa886c5f43bb2751dce53be6001733bbd1f11c0cb61c549b44de"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_misc.rs: crates/perry-hir/src/lower/expr_misc.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_hir::lower::expr_misc::lower_update at line 143. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_misc.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/perry-hir/src/lower/expr_misc.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"214bff254c10656df1bc74753a90e9f72a01ed2620c6497eb7918f0362a91d4f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/static_fields.rs: crates/perry-codegen/src/codegen/static_fields.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in perry_codegen::codegen::static_fields::init_static_fields_early at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/static_fields.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/perry-codegen/src/codegen/static_fields.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a8b9996377946302e40edb50337f656b62e9650b237f98ff864ac15d20c28b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/native_module/constructor_exports.rs: crates/perry-runtime/src/object/native_module/constructor_exports.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in perry_runtime::object::native_module::constructor_exports::is_native_module_constructor_export at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/native_module/constructor_exports.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/perry-runtime/src/object/native_module/constructor_exports.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"4365ab6567b9f5b865d52d745c57726d8276865bbba1e9b12d288c933fa9b86c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/retained_source_pool.rs: crates/perry-codegen/src/codegen/retained_source_pool.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in perry_codegen::codegen::retained_source_pool::prepare_ranges at line 196. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/retained_source_pool.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/perry-codegen/src/codegen/retained_source_pool.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"3488d4ca08bf2a755d5b4c8b13953df8afc4865a5f5d8a7ce17f92c5d1285566"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/stmt/stable_packed_accumulator.rs: crates/perry-codegen/src/stmt/stable_packed_accumulator.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in perry_codegen::stmt::stable_packed_accumulator::accumulator_rhs_is_numeric at line 36. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/stmt/stable_packed_accumulator.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/perry-codegen/src/stmt/stable_packed_accumulator.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"32601795aab672944878cf4fd97c4a8c1c7750aaa975026595e1b71e08111020"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/object_ops/define_symbol_property.rs: crates/perry-runtime/src/object/object_ops/define_symbol_property.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in perry_runtime::object::object_ops::define_symbol_property::define_symbol_property at line 5. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/object_ops/define_symbol_property.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/perry-runtime/src/object/object_ops/define_symbol_property.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"563aabef3a29211bb8a404de54c4bce10937d6be4f8009007d023e6e94a0476e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/buffer/store.rs: crates/perry-runtime/src/buffer/store.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_runtime::buffer::store::store_alloc at line 316. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/buffer/store.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/perry-runtime/src/buffer/store.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"7acd705aff30f7c9fe4da4e19e150552adccdf607f7e4fe22a702e82734ec122"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/json/stringify_api.rs: crates/perry-runtime/src/json/stringify_api.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_runtime::json::stringify_api::try_stringify_lazy_array 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/json/stringify_api.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/perry-runtime/src/json/stringify_api.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c28a31d540afe8081e1d400c7ed8119b0462400fd16461fa3bad9c8d9af440d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/range_facts.rs: crates/perry-codegen/src/expr/range_facts.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_codegen::expr::range_facts::bounds_for_buffer_access_width at line 701. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/range_facts.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/perry-codegen/src/expr/range_facts.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77a2e0bbfa746c66606189d68c4ff8986c87017c3e7e431292d90731f7689cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-http/src/client_turnloop/native_client.rs: crates/perry-ext-http/src/client_turnloop/native_client.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in perry_ext_http::client_turnloop::native_client::run at line 221. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-http/src/client_turnloop/native_client.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/perry-ext-http/src/client_turnloop/native_client.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"583721b89dccd1fc765ebda72dffef53b059821f4200a98e8edaea4bf0f5ef52"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/array/numeric_range.rs: crates/perry-runtime/src/array/numeric_range.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in perry_runtime::array::numeric_range::array_numeric_range_add_impl at line 23. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/array/numeric_range.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/perry-runtime/src/array/numeric_range.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"104696f12289dfb33b9939f72eeb8f166f25e15b07aa520c0c4b40447c7d7e34"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/property_get/number_string.rs: crates/perry-codegen/src/lower_call/property_get/number_string.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in perry_codegen::lower_call::property_get::number_string::try_lower_number_string_methods at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/property_get/number_string.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/perry-codegen/src/lower_call/property_get/number_string.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e216b27140adbb96b55b15472bd80f1090da6b6cdbb0467c479f178189d7aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/child_process/sync_run.rs: crates/perry-runtime/src/child_process/sync_run.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in perry_runtime::child_process::sync_run::cp_run_to_completion at line 242. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/child_process/sync_run.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/perry-runtime/src/child_process/sync_run.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10033a09061c943b45cf0adcfc8ec24f9e73a3e184c5526b6cb81252ebed198"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-http/src/server/http2_server/dispatch.rs: crates/perry-ext-http/src/server/http2_server/dispatch.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in perry_ext_http::server::http2_server::dispatch::js_ext_http2_session_dispatch_method at line 34. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-http/src/server/http2_server/dispatch.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/perry-ext-http/src/server/http2_server/dispatch.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b38dda3a265ebd9a6918508816bcd78e6fe4d61b28f0480da206d5b2c555ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/dialect/types.rs: crates/perry-codegen/src/dialect/types.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in perry_codegen::dialect::types::constant at line 208. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/dialect/types.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/dialect/types.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"20434b6c7b61555dc7e951bd72fbb13e5b7a6c01ebcfe38cc9e872eb5478b085"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/crypto/util.rs: crates/perry-stdlib/src/crypto/util.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_stdlib::crypto::util::crypto_key_input_to_public_pem at line 775. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/crypto/util.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/perry-stdlib/src/crypto/util.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"94044c6bc54d77037a3585f0549c2a347fd6c331dbf244957e1b218ec16517a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/value/equality.rs: crates/perry-runtime/src/value/equality.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in perry_runtime::value::equality::js_jsvalue_equals at line 52. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/value/equality.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/perry-runtime/src/value/equality.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"385104c4e4ce794b67c6df4cdfe3d37db84dc2e711bdd4039488ae6793f1c0f0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/solve/copy.rs: crates/perry-wpfacts/src/solve/copy.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in Model::edge_impl 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/solve/copy.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/perry-wpfacts/src/solve/copy.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcda53af27f7a40d20dbfb5fdb7896586bdc34f85635cbb76e2b5945a4757dd6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/buffer_intrinsic.rs: crates/perry-codegen/src/lower_call/buffer_intrinsic.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_codegen::lower_call::buffer_intrinsic::emit_numeric_load at line 344. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/buffer_intrinsic.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/perry-codegen/src/lower_call/buffer_intrinsic.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12fb2ae60a0df7e51579b3293546b0ebf0a3f074e4ab534749c392b92623f27"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: test-files/test_gap_9459_property_set_strictness.cts: test-files/test_gap_9459_property_set_strictness.cts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in test_gap_9459_property_set_strictness.sloppyArm at line 148. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- test-files/test_gap_9459_property_set_strictness.cts\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":"test-files/test_gap_9459_property_set_strictness.cts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d69565ff3224e0d2c691d6681d65cc87fd019ebbb43ce248db576462dc7cd8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wit/src/guest_c.rs: crates/perry-wit/src/guest_c.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Generator::generate at line 180. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wit/src/guest_c.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/perry-wit/src/guest_c.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa5ac6758f8828622a39f8503f9004470c5d5b8eb5fd21961f816f2501867e8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/builtin_method.rs: crates/perry-runtime/src/object/builtin_method.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_runtime::object::builtin_method::js_bm_lookup at line 1913. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/builtin_method.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/perry-runtime/src/object/builtin_method.rs"},"region":{"startLine":1913}}}],"partialFingerprints":{"codehealthFindingId/v1":"d924a4ffd22a1202f087f7cb0e6d285027fca51867d4e5e0c325d1788469232b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/layout_desc/methods.rs: crates/perry-runtime/src/object/layout_desc/methods.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry_runtime::object::layout_desc::methods::perry_probe_family_method at line 62. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/layout_desc/methods.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/perry-runtime/src/object/layout_desc/methods.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d00cde680eeafceed72c5c3f4b72ef28949b308083e749437c5c4cf2ff837b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/method_registry.rs: crates/perry-codegen/src/codegen/method_registry.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry_codegen::codegen::method_registry::build_method_names at line 27. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/method_registry.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/perry-codegen/src/codegen/method_registry.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"df64e7f792a2b28063c3f47ea208f485cc5fa0c15494810bdb57c15787f118cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-transform/src/inline/closure_analysis.rs: crates/perry-transform/src/inline/closure_analysis.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in perry_transform::inline::closure_analysis::find_max_local_id at line 649. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-transform/src/inline/closure_analysis.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/perry-transform/src/inline/closure_analysis.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0c28a76a1a585a8084b391df428fd3dc9f365ed8ea09d366361713be04cfed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/measure_linux_rss_ab.py: scripts/measure_linux_rss_ab.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in measure_linux_rss_ab.main at line 160. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/measure_linux_rss_ab.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/measure_linux_rss_ab.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62ca2eb03ee83eee6cd31579dbcdb15bee7474d3cd1ef7cc2587a7c17c73d6a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/calls/crypto_hash.rs: crates/perry-codegen/src/expr/calls/crypto_hash.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in perry_codegen::expr::calls::crypto_hash::arm_crypto_hash_chain at line 13. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/calls/crypto_hash.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/perry-codegen/src/expr/calls/crypto_hash.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"024a8ccc38d25fc9f4be1941ad1b59436b2c4db425c6eb64318ae97d9990e2a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/not_bigint_locals.rs: crates/perry-codegen/src/collectors/not_bigint_locals.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry_codegen::collectors::not_bigint_locals::collect_writes at line 300. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/not_bigint_locals.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/perry-codegen/src/collectors/not_bigint_locals.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f3e760dcd7ab05c7a2e8ee5449fd9bec222d4c755bcb0b87074873225b4104"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/property_get/map_set.rs: crates/perry-codegen/src/lower_call/property_get/map_set.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in perry_codegen::lower_call::property_get::map_set::try_lower_map_set_methods at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/property_get/map_set.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/perry-codegen/src/lower_call/property_get/map_set.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d3df49eb92865f22f3b9dfc35ff4e90c79fd80a4c5f44011dcdb2e8afd8096"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/dynamic_import/worker_paths.rs: crates/perry-hir/src/dynamic_import/worker_paths.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in WorkerPaths::resolve at line 133. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/dynamic_import/worker_paths.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/perry-hir/src/dynamic_import/worker_paths.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2c6c1d74ea97148d6dad63754608f944847e959665c672d7e3194d528d843f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/birth_lanes.rs: crates/perry-codegen/src/lower_call/birth_lanes.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in perry_codegen::lower_call::birth_lanes::chain_birth_f64_fields at line 56. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/birth_lanes.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/perry-codegen/src/lower_call/birth_lanes.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ca4ff1135389cc17116041f80c52523e3496600a35938d49876c96b6b11e8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/unrooted_local_shape.py: scripts/unrooted_local_shape.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in unrooted_local_shape.self_test at line 624. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/unrooted_local_shape.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/unrooted_local_shape.py"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb2484b9e9a98b0ee8f6131ceaf1f66610c9db27b3d537617692d36e83ccf93"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/index_uses.rs: crates/perry-codegen/src/collectors/index_uses.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in perry_codegen::collectors::index_uses::walk_index_uses_in_expr at line 305. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/index_uses.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/perry-codegen/src/collectors/index_uses.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be4460051eda4f8ae58277a5086a0b01033e452e954d16a8e2fae78b871182b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/fetch/gc.rs: crates/perry-stdlib/src/fetch/gc.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in perry_stdlib::fetch::gc::scan_fetch_roots_with at line 154. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/fetch/gc.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/perry-stdlib/src/fetch/gc.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebd8129fe1bbe03c4b1ad83ef0a520a7b2914e5aac9dff98d1a145ea2a56109"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/closure_analysis.rs: crates/perry-hir/src/lower/closure_analysis.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in perry_hir::lower::closure_analysis::collect_closure_assigned_in_body_expr at line 1192. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/closure_analysis.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/perry-hir/src/lower/closure_analysis.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64e80efed22850d3c7bf8b690af3d311a4e5815262c87f3aac030bf595312c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/tls/event_pump.rs: crates/perry-stdlib/src/tls/event_pump.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in perry_stdlib::tls::event_pump::js_tls_process_pending at line 33. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/tls/event_pump.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/perry-stdlib/src/tls/event_pump.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ef00ea0fb4bc094e54953433aadb9a85ba931b0715d34e9e99cf5530304557"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/intl/number_format_options.rs: crates/perry-runtime/src/intl/number_format_options.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in perry_runtime::intl::number_format_options::configure_number_format at line 8. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/intl/number_format_options.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/perry-runtime/src/intl/number_format_options.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"869ef2010812879732e1f76a200aae35fc7d81f0057961a53b4beb79368d3c9b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/node_stream/write_state.rs: crates/perry-runtime/src/node_stream/write_state.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_runtime::node_stream::write_state::clear_buffer at line 253. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/node_stream/write_state.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/perry-runtime/src/node_stream/write_state.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e67ffc55f5225c1e4ecedadad9c13d7ad11edd8546104c05e8ddd0c62db665"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/timer/gc_scan.rs: crates/perry-runtime/src/timer/gc_scan.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in perry_runtime::timer::gc_scan::scan_store_step at line 70. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/timer/gc_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/perry-runtime/src/timer/gc_scan.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4a55d88606f32c0a8a4e5857533417d110627ff23907824a3cb0769e12c028"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/boxed_vars.rs: crates/perry-codegen/src/boxed_vars.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in perry_codegen::boxed_vars::collect_nested_closure_boxed_vars_in_expr at line 510. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/boxed_vars.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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4037557ec2ba8b302000a981c811c210e66d0a45d57f939ab880ae88f846e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/streams/transform.rs: crates/perry-stdlib/src/streams/transform.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_stdlib::streams::transform::perform_transform_close at line 800. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/streams/transform.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/perry-stdlib/src/streams/transform.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"16029555aa0ca11afd9d430e095bd3bcbb7f86fc08e1a33d2d82e55b5419fbfb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/gc/copying/remembered_scan.rs: crates/perry-runtime/src/gc/copying/remembered_scan.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in perry_runtime::gc::copying::remembered_scan::scan_remembered_dirty_slots_copying at line 8. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/gc/copying/remembered_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/perry-runtime/src/gc/copying/remembered_scan.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56a371731093b361bc01101c5e6c322cdf66d4ebf699b05223201f34737f387"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/os_uri_dates.rs: crates/perry-codegen/src/expr/os_uri_dates.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in perry_codegen::expr::os_uri_dates::lower at line 65. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/os_uri_dates.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/perry-codegen/src/expr/os_uri_dates.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"299ac50cd9020fa47e40a79e1a8346ad6457fd7dbce5dccbbf24108c614fc637"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/shapes_own_data.rs: crates/perry-runtime/src/object/shapes_own_data.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in perry_runtime::object::shapes_own_data::plain_receiver_miss_is_final at line 80. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/shapes_own_data.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/perry-runtime/src/object/shapes_own_data.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cfecac1fac2691b084cfaefe5b0c8566a38c048e6d29d24bdf254018c88aaf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ui-macos/src/app.rs: crates/perry-ui-macos/src/app.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in perry_ui_macos::app::register_global_hotkey at line 1060. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ui-macos/src/app.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/perry-ui-macos/src/app.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64615d6619b69f61d48bfca5cd4948c5467590e0c72dc3bbc5594ca8be510b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/stmt/number_local_loop.rs: crates/perry-codegen/src/stmt/number_local_loop.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in perry_codegen::stmt::number_local_loop::lower at line 383. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/stmt/number_local_loop.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/perry-codegen/src/stmt/number_local_loop.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"685d440512459390b2c2bd599b3dfc54fe51fff940bcccd7e163953238c3d0b9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/object_literal_exports.rs: crates/perry-codegen/src/collectors/object_literal_exports.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in perry_codegen::collectors::object_literal_exports::capability_from_init at line 93. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/object_literal_exports.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/perry-codegen/src/collectors/object_literal_exports.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"0abab62dd2d8e6758b7fdb348b652bcc3b0606a247682bb6d6d8772982e9c208"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-http/src/pending_dispatch.rs: crates/perry-ext-http/src/pending_dispatch.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in perry_ext_http::pending_dispatch::js_http_process_pending at line 8. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-http/src/pending_dispatch.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/perry-ext-http/src/pending_dispatch.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6624963b2f603fb0b5b635816b17b103f9f12f88461404bd89295d679fc57ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/ptr_shape_returns.rs: crates/perry-codegen/src/collectors/ptr_shape_returns.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_codegen::collectors::ptr_shape_returns::producer_return_class at line 429. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/ptr_shape_returns.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/perry-codegen/src/collectors/ptr_shape_returns.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f2494abdb5c4672f34d742418361c87f4d4e1c4657a31baf237d76f2ac8fb4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/layout_probe_site_memo.rs: crates/perry-runtime/src/object/layout_probe_site_memo.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_runtime::object::layout_probe_site_memo::prime at line 211. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/layout_probe_site_memo.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/perry-runtime/src/object/layout_probe_site_memo.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec143332f2a180163ad612fb59961a90a90ff2a1807628abf319108759d93b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-http/src/server/native_dispatch.rs: crates/perry-ext-http/src/server/native_dispatch.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_ext_http::server::native_dispatch::js_ext_http_native_dispatch at line 133. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-http/src/server/native_dispatch.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/perry-ext-http/src/server/native_dispatch.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"19831158ed42430e8371e229c63dbe0afcb6d412bc94f091ac76264d59c1d990"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/calls/fs.rs: crates/perry-codegen/src/expr/calls/fs.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in perry_codegen::expr::calls::fs::arm_fs at line 135. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/calls/fs.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/perry-codegen/src/expr/calls/fs.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e10cb0a7e4126255fa7574e00023340adbfe1cc2775c9bc7b0c820622403c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-component-host/src/lib.rs: crates/perry-component-host/src/lib.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Host::new_prepared at line 191. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-component-host/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/perry-component-host/src/lib.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36eda02a35c8c9de0834253d7c0ed9a798eecfea1cfc322f146905bc483cd44"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/array/indexing_keyed.rs: crates/perry-runtime/src/array/indexing_keyed.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in perry_runtime::array::indexing_keyed::js_array_set_string_key at line 27. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/array/indexing_keyed.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/perry-runtime/src/array/indexing_keyed.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7c04e041f5a2948772048de8626c35b88d57eb6d2bb2a93b572cf25e793f39"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/child_process/registry.rs: crates/perry-runtime/src/child_process/registry.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in perry_runtime::child_process::registry::js_child_process_spawn_background at line 67. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/child_process/registry.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/perry-runtime/src/child_process/registry.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d292c3b4b1db4cc928ba3de8e1027e463dfc7abbbf67edf0d34160cef8be6f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/type_widening.rs: crates/perry-hir/src/lower/type_widening.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in perry_hir::lower::type_widening::widen_lets_stmt at line 229. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/type_widening.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/perry-hir/src/lower/type_widening.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30e9c2c6e47330c9a0ab67b81a194f6b5639619f16d0aa20e3f8d166a328923"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/hoisted_callback_calls.rs: crates/perry-codegen/src/collectors/hoisted_callback_calls.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in perry_codegen::collectors::hoisted_callback_calls::collect_loop_called_callee_bindings at line 280. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/hoisted_callback_calls.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/perry-codegen/src/collectors/hoisted_callback_calls.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d76fa213d9cab20b5adc85446c8b09a8a2644edae94fb5eec04f9bf5063767"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/setup/ios.rs: crates/perry/src/commands/setup/ios.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in perry::commands::setup::ios::ios_wizard at line 13. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/setup/ios.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/perry/src/commands/setup/ios.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4547607b1683c7aca01ad65f5d5d4d625c46972fb09638493c121b52c799099"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/cjs_wrap/run_once_syntax.rs: crates/perry/src/commands/compile/cjs_wrap/run_once_syntax.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in Uses::visit_call_expr at line 56. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/cjs_wrap/run_once_syntax.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/perry/src/commands/compile/cjs_wrap/run_once_syntax.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc03d177dfe0d586a7dd3d3417ca7f64ff240344a4c7ac667c028210cfdd71d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/unary.rs: crates/perry-codegen/src/expr/unary.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_codegen::expr::unary::lower 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/unary.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/perry-codegen/src/expr/unary.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbee60a06beb60ea9ac3da5459284e5d131284bf257056752567cff119af13f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/collect_modules/reexport_prune/forwarding.rs: crates/perry/src/commands/compile/collect_modules/reexport_prune/forwarding.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in perry::commands::compile::collect_modules::reexport_prune::forwarding::normalize at line 15. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/collect_modules/reexport_prune/forwarding.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/perry/src/commands/compile/collect_modules/reexport_prune/forwarding.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"820e27ff2b514ee5515f651f3d46a12ba8cdf2394e690c2a6e460b13a7fc3300"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/wasi_run.py: scripts/wasi_run.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in wasi_run.main at line 120. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/wasi_run.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_run.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b853b08ef6c352efaa1b763d57479acff840ca23c74320ab464979a35df5086"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/component/value.rs: crates/perry-runtime/src/component/value.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in perry_runtime::component::value::encode_at at line 41. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/component/value.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/perry-runtime/src/component/value.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19d53539fbf81b189c87b190da42fe4e9a3cfc59b2ee585095d694d2f44a8a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/actions_plan.py: scripts/actions_plan.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in actions_plan.select at line 196. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/actions_plan.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/actions_plan.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6664f2385b729f7d756997ef4ac1723261b3234fe5db006095e2f09ff5375c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ui-gtk4/src/app.rs: crates/perry-ui-gtk4/src/app.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in perry_ui_gtk4::app::app_run at line 144. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ui-gtk4/src/app.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/perry-ui-gtk4/src/app.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad24eabf1572c6d783c6319f86e546ad140bc0b2967cfe8e55d663fcaa341cfa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/test-require-runtime.mjs: scripts/test-require-runtime.mjs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in test-require-runtime.prepareRequireRuntime at line 8. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/test-require-runtime.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/test-require-runtime.mjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae58cae496ede7ea4d4c9b08fd20836bdcb16f4a9cd9cfccf9750d2112881a7e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/node_api_host/mod.rs: crates/perry-runtime/src/node_api_host/mod.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in perry_runtime::node_api_host::scan_node_api_roots_mut at line 525. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/node_api_host/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/perry-runtime/src/node_api_host/mod.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8117cb13dcafc36338c1087e8a388e4859d48ae76241f49ff99002ef679deef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/call_spread_short.rs: crates/perry-codegen/src/expr/call_spread_short.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in perry_codegen::expr::call_spread_short::try_lower at line 181. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/call_spread_short.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/perry-codegen/src/expr/call_spread_short.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c1b6a6f8cada4439dfe3fe664d343f2cf260f0891125b95494357e4e882a74"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-transform/src/aggregate_scalar.rs: crates/perry-transform/src/aggregate_scalar.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in perry_transform::aggregate_scalar::scalarize_stmts at line 225. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-transform/src/aggregate_scalar.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/perry-transform/src/aggregate_scalar.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"42746b3f7f7985b01b578d1f9f6eff63625aabf5edbe89fcc6676850e499181a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/compare_chain.rs: crates/perry-codegen/src/expr/compare_chain.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in perry_codegen::expr::compare_chain::try_lower 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/compare_chain.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/perry-codegen/src/expr/compare_chain.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab65e1528cf589b6bbf3b1a4627aab59ded7ff52bc049326e24bfbd68bf46f46"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/native_value/verify.rs: crates/perry-codegen/src/native_value/verify.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in perry_codegen::native_value::verify::verify_native_rep_records at line 27. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/native_value/verify.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/perry-codegen/src/native_value/verify.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9be53271b0c7b9a0161a398ef0494dab205f2cf40968950b6a6265bc6aa95af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/app_metadata.rs: crates/perry/src/commands/compile/app_metadata.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in perry::commands::compile::app_metadata::rust_target_triple at line 191. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/app_metadata.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/perry/src/commands/compile/app_metadata.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"020d2b5d550205ef6c7174c8834670200d572a85f41a476b015456e8a1bffd60"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_call/native_module/process_module.rs: crates/perry-hir/src/lower/expr_call/native_module/process_module.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in perry_hir::lower::expr_call::native_module::process_module::try_process_module_methods at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_call/native_module/process_module.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/perry-hir/src/lower/expr_call/native_module/process_module.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1093f93198507c4eacbc364c370036a9ed369adb0bcedaef0f5c256aea05b25b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/integer_locals.rs: crates/perry-codegen/src/collectors/integer_locals.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in perry_codegen::collectors::integer_locals::int32_producing_deps at line 731. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/integer_locals.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/perry-codegen/src/collectors/integer_locals.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec7fdb70778356fa2e47fbbe3b10cc2ec5d497cb30bcbc8c16009b59bce4933"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/addr_class_inventory.py: scripts/addr_class_inventory.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in addr_class_inventory.main at line 743. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/addr_class_inventory.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/addr_class_inventory.py"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"609f6781cf4ead96774ba9c91972cb823e37eb5c739e185dac028f3165a1d8e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/loop_purity.rs: crates/perry-codegen/src/loop_purity.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in perry_codegen::loop_purity::expr_alloc_free 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/loop_purity.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/perry-codegen/src/loop_purity.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac8ea5bf82cc8c126eb84a20ea927ebb226725e5d57ec45d3adc115c450a11c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/size_report.rs: crates/perry/src/commands/compile/size_report.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in perry::commands::compile::size_report::build_report at line 227. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/size_report.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/perry/src/commands/compile/size_report.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93fd5ebbf0ac23459941a1f13a8e7ecc509f4710be26cb96c51b4d418b09098"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: benchmarks/benchmark_gate.py: benchmarks/benchmark_gate.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in benchmark_gate.validate_artifact at line 282. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- benchmarks/benchmark_gate.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/benchmark_gate.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"d136ce07198f6962132c7ce74e3385297bbf54d98b3e0fb58f56ba614d15fd25"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/tokio_inventory.py: scripts/tokio_inventory.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in tokio_inventory.self_test at line 361. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/tokio_inventory.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/tokio_inventory.py"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"78864307d4685d8e07f5e343b1adffa0c3193de0c62b166011c826f53fda6e08"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/array/reduce_right.rs: crates/perry-runtime/src/array/reduce_right.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_runtime::array::reduce_right::js_array_reduce_right at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/array/reduce_right.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/perry-runtime/src/array/reduce_right.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92fb386d29007b66b3c594f77bdf4e291075b6bff0e9c48556b36bf10cb8046"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/embed.rs: crates/perry/src/commands/compile/embed.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry::commands::compile::embed::generate_embedded_asset_object at line 365. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/embed.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/perry/src/commands/compile/embed.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"896424343c793cb762f80093c9c1145b7a755c8c21e0d758dc8affe3fbe2bc4a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/fs/dir_glob_watch/glob.rs: crates/perry-runtime/src/fs/dir_glob_watch/glob.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_runtime::fs::dir_glob_watch::glob::run_bun_glob_result at line 834. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/fs/dir_glob_watch/glob.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/perry-runtime/src/fs/dir_glob_watch/glob.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"2092883288405ca92693427cce75801051a051435182364d773b7c47204453e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/shapes_integrity.rs: crates/perry-runtime/src/object/shapes_integrity.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_runtime::object::shapes_integrity::transition_object_integrity at line 42. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/shapes_integrity.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/perry-runtime/src/object/shapes_integrity.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"18fc133769275f4ec007003cc863a414899de878341921aab50c5846045e504d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-transform/src/finally_inline.rs: crates/perry-transform/src/finally_inline.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in perry_transform::finally_inline::process_stmts at line 235. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-transform/src/finally_inline.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-transform/src/finally_inline.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa58821e8af9f4ce8d42d60bee1368524276a07eb862f3f7b1e1f8f9d9841cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/layout_desc/array_families.rs: crates/perry-codegen/src/layout_desc/array_families.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in Flow::expression at line 64. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/layout_desc/array_families.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/perry-codegen/src/layout_desc/array_families.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae46305761a6180f4e8c3758369ab2297435a5f17e9d1147d4138975b8c4555"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/destructuring/var_decl/alias_tracking.rs: crates/perry-hir/src/destructuring/var_decl/alias_tracking.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in perry_hir::destructuring::var_decl::alias_tracking::track_decl_aliases at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/destructuring/var_decl/alias_tracking.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/perry-hir/src/destructuring/var_decl/alias_tracking.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffaebc5ba23a565a8e77db17e74e4b7894e3085de816cbfbb15dfdb9fdd136f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/native_value/pod.rs: crates/perry-codegen/src/native_value/pod.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in perry_codegen::native_value::pod::pod_init_value_roundtrips_exact at line 205. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/native_value/pod.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/perry-codegen/src/native_value/pod.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4fe7c63760744d000d87048decbad11ed2c3fc53fe4ebca732484dafcdb977"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: test-wasi/components/transform/rust-host/src/main.rs: test-wasi/components/transform/rust-host/src/main.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_component_rust_host::main at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- test-wasi/components/transform/rust-host/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-wasi/components/transform/rust-host/src/main.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"2685cececbc0be39f8d78552a7e3f6224e823fc11fc6bccf2988fd1d140dc843"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/wasi_build_runtime.py: scripts/wasi_build_runtime.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in wasi_build_runtime.main at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/wasi_build_runtime.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_build_runtime.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"48db4d7bd3d8f622775ea81b0eaabba0f3d33b4deb0829e0e7923dcff22d9698"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/array_append.rs: crates/perry-codegen/src/expr/array_append.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_codegen::expr::array_append::try_lower at line 13. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/array_append.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/perry-codegen/src/expr/array_append.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b214f892ffe8fcb9f086b279d26c92e0456d9724132a830cf5b698cb562a5a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/inline_birth_invariant.rs: crates/perry-codegen/src/lower_call/inline_birth_invariant.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in perry_codegen::lower_call::inline_birth_invariant::check at line 126. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/inline_birth_invariant.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/perry-codegen/src/lower_call/inline_birth_invariant.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4012a8a96efaf057718828c6ed46deb6fdaffe0baedfa2f1a35d185fc1faa679"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/stmt/if_stmt.rs: crates/perry-codegen/src/stmt/if_stmt.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in perry_codegen::stmt::if_stmt::try_const_fold_condition at line 90. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/stmt/if_stmt.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/perry-codegen/src/stmt/if_stmt.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f25a0966c03b220da2ddf906855def75d8f5f56d84f06dbf843ff26607d2174"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/native_addon_sidecar.rs: crates/perry/src/commands/compile/native_addon_sidecar.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry::commands::compile::native_addon_sidecar::addon_payload_files at line 133. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/native_addon_sidecar.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/perry/src/commands/compile/native_addon_sidecar.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d73b8ed92a3e49227a71c1f43b5e2d62313a31b2a3eacdd7b6448299e9d016"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/update_policy.rs: crates/perry/src/update_policy.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in perry::update_policy::run_teardown_action at line 491. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/update_policy.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/perry/src/update_policy.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da4fbbb521c8aea9d78fb327fb694663bd8c2bb793a403f45679ac9b9201bef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/stmt/region_loop/verify.rs: crates/perry-codegen/src/stmt/region_loop/verify.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry_codegen::stmt::region_loop::verify::verify_exit_effects at line 168. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/stmt/region_loop/verify.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/perry-codegen/src/stmt/region_loop/verify.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a7043c2d688251b29d253b6284afa5a73259d27764906ee6dd4acc5bf45ddd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-transform/src/unroll/mod.rs: crates/perry-transform/src/unroll/mod.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry_transform::unroll::refresh_in_expr at line 934. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-transform/src/unroll/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/perry-transform/src/unroll/mod.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dfcd40fdaf20e7058cae38d0ae5730d24934aec84ca6b99d96534a76903806b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ui-windows/src/state.rs: crates/perry-ui-windows/src/state.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry_ui_windows::state::state_set 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ui-windows/src/state.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/perry-ui-windows/src/state.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"81017ddfc60574780bf966d1e37bd5232f955ffc748579e9234b9ce250832eeb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/type_analysis_class_fields.rs: crates/perry-codegen/src/type_analysis_class_fields.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in perry_codegen::type_analysis_class_fields::class_field_global_index at line 71. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/type_analysis_class_fields.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/perry-codegen/src/type_analysis_class_fields.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bebc8e76f59ea038c16d6d461426fe1f1f69d3f229df2e6cce232db86115f8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen-wasm/src/emit/expr/arrays.rs: crates/perry-codegen-wasm/src/emit/expr/arrays.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in FuncEmitCtx::try_emit_expr_arrays at line 9. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen-wasm/src/emit/expr/arrays.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/perry-codegen-wasm/src/emit/expr/arrays.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"683874a627e1002d77ff9223042b94c0a9b5a3916f91e4e07885c3508806f965"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/global_eval_hoist.rs: crates/perry-hir/src/lower/global_eval_hoist.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in GlobalEvalHoist::rewrite_list_inner at line 740. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/global_eval_hoist.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/perry-hir/src/lower/global_eval_hoist.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a9238ab5ea0881e4f4b5d389016a335694263b4a2dae1b81d03083bb0f1572"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/array/fill_extend.rs: crates/perry-runtime/src/array/fill_extend.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in perry_runtime::array::fill_extend::js_array_fill_f64_const_extend at line 23. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/array/fill_extend.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/perry-runtime/src/array/fill_extend.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5b0c9a32b5ae9fc9d34c9bebdf9dcda1820d4c58764b5a5bcb401d281ade36"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/check_gc_env_knobs.py: scripts/check_gc_env_knobs.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in check_gc_env_knobs.self_test at line 201. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/check_gc_env_knobs.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check_gc_env_knobs.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"8084d31f355175491ded45543c688d44b5e4e48baf170710a59d90f8c7feb70c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/component_host_acceptance.py: scripts/component_host_acceptance.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in component_host_acceptance.main at line 20. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/component_host_acceptance.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/component_host_acceptance.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04b3a47d019c48d101107905b29a8bb692808bd728f797ab00a3ed655c5b381"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/check_buffer_layout.py: scripts/check_buffer_layout.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in check_buffer_layout.inventory at line 36. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/check_buffer_layout.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check_buffer_layout.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb2208d7be6f5ce75b3c34b09d7ccf0bb1e42d9063380f46a59c0799953c7a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/array/search.rs: crates/perry-runtime/src/array/search.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in perry_runtime::array::search::js_array_last_index_of_jsvalue at line 291. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/array/search.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/perry-runtime/src/array/search.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c53192336cb972135f4ff8f1b7a8076389b5e0b5a295c4cced0ae2f46a62354"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/anon_key_adds.rs: crates/perry-codegen/src/collectors/anon_key_adds.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in perry_codegen::collectors::anon_key_adds::anon_receiver_added_keys at line 45. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/anon_key_adds.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/perry-codegen/src/collectors/anon_key_adds.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"956e9d1d7ccf368b3051718a586430ed7f0e64f9a431c5c46dae957e3a9d94cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/loop_bounded_i32.rs: crates/perry-codegen/src/collectors/loop_bounded_i32.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in perry_codegen::collectors::loop_bounded_i32::walk_accumulator_stmts at line 1285. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/loop_bounded_i32.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/perry-codegen/src/collectors/loop_bounded_i32.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"661edc2cc33282100bda25099316cfa6f04e135a913f340e5b414ee2e3e5216e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/native_value/materialize.rs: crates/perry-codegen/src/native_value/materialize.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in perry_codegen::native_value::materialize::materialize_js_value at line 511. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/native_value/materialize.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/perry-codegen/src/native_value/materialize.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"4251760361bc43a73add00effa8113c7eb6996e9f96b208a864145552a00d416"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_call/native_module/object_statics.rs: crates/perry-hir/src/lower/expr_call/native_module/object_statics.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in perry_hir::lower::expr_call::native_module::object_statics::try_object_statics 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_call/native_module/object_statics.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/perry-hir/src/lower/expr_call/native_module/object_statics.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"480fd53ceb736027f8b70f47a17087ec075ea5b9afe4cdb4d93e36fbbb3ae9df"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/fallback_diag.rs: crates/perry-codegen/src/fallback_diag.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in perry_codegen::fallback_diag::record at line 641. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/fallback_diag.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/perry-codegen/src/fallback_diag.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"2138d6f83ef3de0454f8a601bdb79c506725f8e7b1b648fc941224d868c1718b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/typedarray_named.rs: crates/perry-runtime/src/typedarray_named.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_runtime::typedarray_named::get at line 117. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/typedarray_named.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/perry-runtime/src/typedarray_named.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d326f3f88aa2e9c7487ef77cb70452880551c90d23c1be2963425c1005dbfd0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wit/src/resolve.rs: crates/perry-wit/src/resolve.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Converter::definition at line 167. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wit/src/resolve.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/perry-wit/src/resolve.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4300b4b7236c974e71d725584f53444530de002584cdbfe6375f7b5f78433eb1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_call/intrinsics/require.rs: crates/perry-hir/src/lower/expr_call/intrinsics/require.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_hir::lower::expr_call::intrinsics::require::try_import_meta_require at line 176. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_call/intrinsics/require.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/perry-hir/src/lower/expr_call/intrinsics/require.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe237382775fe2dc7d18e1210c08723796b6560323c8695a23dadf57947e629"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/collect_modules/source_prep.rs: crates/perry/src/commands/compile/collect_modules/source_prep.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry::commands::compile::collect_modules::source_prep::prepare_from_raw at line 234. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/collect_modules/source_prep.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/perry/src/commands/compile/collect_modules/source_prep.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"888ded13df330744b01d58d7f6ebd09952d8e1c15c7a759f3df00b0415ddaacb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/child_proc.rs: crates/perry-codegen/src/expr/child_proc.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_codegen::expr::child_proc::lower 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/child_proc.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/perry-codegen/src/expr/child_proc.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7d0387f67dfb041e49621bdae344772cc1872e3c179d39148ec7639c1be464"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen-wasm/src/emit/closures.rs: crates/perry-codegen-wasm/src/emit/closures.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in perry_codegen_wasm::emit::closures::collect_closures_from_expr at line 92. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen-wasm/src/emit/closures.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/perry-codegen-wasm/src/emit/closures.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4df5085363591ab08b881f7ff0ffb01543c0b26400dd186dd2389b410e78761"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-stdlib/src/streams/gc.rs: crates/perry-stdlib/src/streams/gc.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in perry_stdlib::streams::gc::scan_stream_roots_with at line 137. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/streams/gc.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/perry-stdlib/src/streams/gc.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab25dde1f4e261b0da840778c1c59eaf2a97351d93550136caa0889372f3fbda"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/gate_failure_watch.py: scripts/gate_failure_watch.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in gate_failure_watch.subject_verdict at line 107. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/gate_failure_watch.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gate_failure_watch.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"641e776ecf4a7986a5960cfcb0b2cf5ef801c5f5a42e4b520589273106856537"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/array/sort_indices.rs: crates/perry-runtime/src/array/sort_indices.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_runtime::array::sort_indices::sort_indices at line 17. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/array/sort_indices.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/perry-runtime/src/array/sort_indices.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"984399da1f6afd8b9516a66acbb97dc855a933b62ddf58ca461ac948fc82b2cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/native_call_method/compiled_target.rs: crates/perry-runtime/src/object/native_call_method/compiled_target.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_runtime::object::native_call_method::compiled_target::compiled_target_call at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/native_call_method/compiled_target.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/perry-runtime/src/object/native_call_method/compiled_target.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e7bd77356d462becb344847ed5cf3734c03aebe70bf0920000c7e8acc0e4ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/publish/pipeline.mts: scripts/publish/pipeline.mts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in pipeline.main at line 449. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/publish/pipeline.mts\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/publish/pipeline.mts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb82800a48fd9f8e2e957ae3edf26f23e80c1e9b5673e7468cb2089b2195d1d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/node_submodules/test_reporters.rs: crates/perry-runtime/src/node_submodules/test_reporters.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_runtime::node_submodules::test_reporters::format_reporter_event at line 215. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/node_submodules/test_reporters.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/perry-runtime/src/node_submodules/test_reporters.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b6d49569bf5bcbc8111cb1e9a5b519919f4a44a3b204057db461c12c1ff650"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower_decl/private_members.rs: crates/perry-hir/src/lower_decl/private_members.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_hir::lower_decl::private_members::lower_private_method_in_scope at line 82. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower_decl/private_members.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/perry-hir/src/lower_decl/private_members.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7705a2f8bef1834068338f21bef4d0f652a91b5a6f1d95b9eef90889bf6e1e2d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_call/native_module/buffer_statics.rs: crates/perry-hir/src/lower/expr_call/native_module/buffer_statics.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in perry_hir::lower::expr_call::native_module::buffer_statics::try_buffer_uint8array_statics at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_call/native_module/buffer_statics.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/perry-hir/src/lower/expr_call/native_module/buffer_statics.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"89341c8a9944166f5857c5e03f21bedc62574c3ca7c19a9cc9f9e169e065f617"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/fs/deferred.rs: crates/perry-runtime/src/fs/deferred.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_runtime::fs::deferred::perform_deferred_fs_op at line 267. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/fs/deferred.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/perry-runtime/src/fs/deferred.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ab0e6130d0d72ea01f0c81d663c245a0335d0c7d28fcfd16d87e834d342aad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/pod_record.rs: crates/perry-codegen/src/expr/pod_record.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_codegen::expr::pod_record::pod_scalar_guard_rep_id at line 749. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/pod_record.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/perry-codegen/src/expr/pod_record.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64ca6e14c3b873783e7ceab715784adf25c45440b72b4ed6f1f31f2a0d00690"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/read_before_write.rs: crates/perry-codegen/src/collectors/read_before_write.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in Walk::stmt at line 448. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/read_before_write.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/perry-codegen/src/collectors/read_before_write.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76c7d9fe2a58fe55d790a27f5e97247be0eefdeb87769e162fe6484d016c39d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/dynamic_import/binding_origin.rs: crates/perry-hir/src/dynamic_import/binding_origin.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in perry_hir::dynamic_import::binding_origin::resolve_exported_binding at line 116. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/dynamic_import/binding_origin.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/perry-hir/src/dynamic_import/binding_origin.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b0dee21ff8cd92e53b6fc460dcc74623e2b50645676f8599f7ae22e13c4070"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/monomorph/infer.rs: crates/perry-hir/src/monomorph/infer.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in perry_hir::monomorph::infer::infer_expr_type at line 9. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/monomorph/infer.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/perry-hir/src/monomorph/infer.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"30337f55e02e4ced79be18529ac9b86f473c8c6aba92de3e2e5c22e22bc3b2e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/regex/perex_substitution.rs: crates/perry-runtime/src/regex/perex_substitution.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in perry_runtime::regex::perex_substitution::scan at line 56. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/regex/perex_substitution.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/perry-runtime/src/regex/perex_substitution.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1d4469a91d556d99e41f95620fa93270896b6b1c9d3b3970a6ee7e4a01d357"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ui-gtk4/src/state.rs: crates/perry-ui-gtk4/src/state.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in perry_ui_gtk4::state::state_set at line 156. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ui-gtk4/src/state.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/perry-ui-gtk4/src/state.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e631e1f7218567be64005f32773c397575ae2e23d021ebf58fe29527e1915d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/proxy/own_keys.rs: crates/perry-runtime/src/proxy/own_keys.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in perry_runtime::proxy::own_keys::js_proxy_own_keys at line 125. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/proxy/own_keys.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/perry-runtime/src/proxy/own_keys.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc812f7c729956468ca807886d7322a35da8d82fd246d83b93cc39260ee29648"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/shapes_last_key_rollback.rs: crates/perry-runtime/src/object/shapes_last_key_rollback.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in perry_runtime::object::shapes_last_key_rollback::publish_object_shape_last_key_rollback at line 92. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/shapes_last_key_rollback.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/perry-runtime/src/object/shapes_last_key_rollback.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33758b9ded3db75123804946fd804dbc7a473653a66d2768efb18068d6f09f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/codegen/artifact_display_names.rs: crates/perry-codegen/src/codegen/artifact_display_names.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in perry_codegen::codegen::artifact_display_names::extend_body_symbol_display_names 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/artifact_display_names.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/perry-codegen/src/codegen/artifact_display_names.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2a171ed2bb8632a89715e5aed0de7102c1710ec8c095f34b3d5902cfa3c8a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_new/non_ident.rs: crates/perry-hir/src/lower/expr_new/non_ident.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in perry_hir::lower::expr_new::non_ident::lower_new_non_ident at line 117. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_new/non_ident.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/perry-hir/src/lower/expr_new/non_ident.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d647e6ec7134815e677ce9cc6aaff294b96636689fced4aebedc3afc14f99cdd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/gen/for_in.rs: crates/perry-wpfacts/src/gen/for_in.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Gen::note_for_in_define_keys at line 317. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/gen/for_in.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/perry-wpfacts/src/gen/for_in.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"130561dacc9974ec1db6ee3016d6caa1834493425eb5d9946a1e9e50e4b7b346"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_call/intrinsics/eval_strict.rs: crates/perry-hir/src/lower/expr_call/intrinsics/eval_strict.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry_hir::lower::expr_call::intrinsics::eval_strict::check_eval_function_call at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_call/intrinsics/eval_strict.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/perry-hir/src/lower/expr_call/intrinsics/eval_strict.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3016839c112dca4dffd6c6721d3eb7349007df27de5e10a2dd133568cad14ae7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ui-android/src/state.rs: crates/perry-ui-android/src/state.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry_ui_android::state::state_set at line 138. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ui-android/src/state.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/perry-ui-android/src/state.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"222139d4bc57601b658113dab854f635d4f769fc6c95bdd09c7228476baad267"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/intl/icu_dtf.rs: crates/perry-runtime/src/intl/icu_dtf.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in perry_runtime::intl::icu_dtf::format_components at line 208. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/intl/icu_dtf.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/perry-runtime/src/intl/icu_dtf.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f991d8ac1e8c886f1e21d948219ae61e1bba63e54bb8cb314499761442f3bce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/bun_ffi/mod.rs: crates/perry-runtime/src/bun_ffi/mod.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry_runtime::bun_ffi::dispatch at line 131. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/bun_ffi/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/perry-runtime/src/bun_ffi/mod.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2b19e94cfb3fa7a6560184fd26f96784a698536897bea933d9d8f6af17a021"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/proxy/get.rs: crates/perry-runtime/src/proxy/get.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_runtime::proxy::get::proxy_get_with_receiver_impl at line 25. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/proxy/get.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/perry-runtime/src/proxy/get.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f10ae4df84c5b394fbc9b240939dde59da25023cec9111a82181e89f57b8d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ui-gtk4/src/widgets/webview.rs: crates/perry-ui-gtk4/src/widgets/webview.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_ui_gtk4::widgets::webview::install_signal_handlers at line 128. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ui-gtk4/src/widgets/webview.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/perry-ui-gtk4/src/widgets/webview.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"007f9e967892197d53d2e1b9dc6d505969d79e73c849191fd614e52628632b3d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/capture_writeback.rs: crates/perry-codegen/src/lower_call/capture_writeback.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_codegen::lower_call::capture_writeback::emit_class_capture_writeback at line 36. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/capture_writeback.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/perry-codegen/src/lower_call/capture_writeback.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21e423ee4cf7e3e93b5645cad4da816507e0ccdb8c7494b520fc264a81c1e58"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/dynamic_eval.rs: crates/perry-hir/src/lower/dynamic_eval.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in perry_hir::lower::dynamic_eval::lower at line 198. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/dynamic_eval.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/perry-hir/src/lower/dynamic_eval.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e312f62b7a8a106f1f3ef728d18ce4da23fb1e21bf7672c18a16f8786bb1458f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen-js/src/emit/decls.rs: crates/perry-codegen-js/src/emit/decls.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in JsEmitter::emit_class at line 56. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen-js/src/emit/decls.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/perry-codegen-js/src/emit/decls.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b414eaeea869e5c573fe5b07bbb2c2c6d908554fdfdc3824e394793e0e0b4d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/stmt/switch_stmt.rs: crates/perry-codegen/src/stmt/switch_stmt.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in perry_codegen::stmt::switch_stmt::lower_switch at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/stmt/switch_stmt.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/perry-codegen/src/stmt/switch_stmt.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a412377f8f448fe792e3c63bc33546fd9f8026c4f993a73d6ce8d73e59af428"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/bigint_dispatch.rs: crates/perry-runtime/src/object/bigint_dispatch.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in perry_runtime::object::bigint_dispatch::dispatch_bigint_binary_method 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/bigint_dispatch.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/perry-runtime/src/object/bigint_dispatch.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77b6babe266bd19a4c75378501a354d5121aebc653ee58c7e6a55ae4f4a8188"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/object/field_get_set/ic_miss/class_field_chain.rs: crates/perry-runtime/src/object/field_get_set/ic_miss/class_field_chain.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_runtime::object::field_get_set::ic_miss::class_field_chain::try_define at line 39. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/field_get_set/ic_miss/class_field_chain.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/perry-runtime/src/object/field_get_set/ic_miss/class_field_chain.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f40a390bba421d2c31f965026b4d129160d5da0c70ebb0f809243a4a26f84bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/expr/class_env.rs: crates/perry-codegen/src/expr/class_env.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_codegen::expr::class_env::lower at line 234. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/class_env.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/perry-codegen/src/expr/class_env.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee0edbd9278e828a973794ba961538afcbdbe354f679698934554bc9dcb9b9e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_call/imported_array_methods.rs: crates/perry-hir/src/lower/expr_call/imported_array_methods.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in perry_hir::lower::expr_call::imported_array_methods::try_imported_array_methods at line 55. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_call/imported_array_methods.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/perry-hir/src/lower/expr_call/imported_array_methods.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfd244ede50605b02d8a7ea0c5a380c9da7782b1819c8195bef0fd5b31a30c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/compiler_output_harness/capture.py: scripts/compiler_output_harness/capture.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in capture.capture at line 234. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/compiler_output_harness/capture.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/compiler_output_harness/capture.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"79cc9e494b9d9547a164dff730b120c95449ec37cfd796ad045a6eb6d2134486"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_call/inline_array_methods.rs: crates/perry-hir/src/lower/expr_call/inline_array_methods.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in perry_hir::lower::expr_call::inline_array_methods::try_inline_array_methods at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_call/inline_array_methods.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/perry-hir/src/lower/expr_call/inline_array_methods.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2900a6754697f3e243358ddfdd920125c7bad8165160f3dbe8def05d93f4750f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/expr_call/native_module/reflect_statics.rs: crates/perry-hir/src/lower/expr_call/native_module/reflect_statics.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in perry_hir::lower::expr_call::native_module::reflect_statics::try_reflect_statics at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_call/native_module/reflect_statics.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/perry-hir/src/lower/expr_call/native_module/reflect_statics.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d497fb9cbc2a74c234ccdf5869471b248714c7626f439fd21e9ed7c05b3b3d2c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/stmt/let_scalar_new.rs: crates/perry-codegen/src/stmt/let_scalar_new.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in perry_codegen::stmt::let_scalar_new::try_lower_scalar_replaced_new at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/stmt/let_scalar_new.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/perry-codegen/src/stmt/let_scalar_new.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f59cdf3294fb33c33247594afd4c2da795cc7f94c89c81ffed48720274d411"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/wpfacts_check.rs: crates/perry-runtime/src/wpfacts_check.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_runtime::wpfacts_check::perry_wpfacts_check_field 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/wpfacts_check.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/perry-runtime/src/wpfacts_check.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"78106494b9f1d34d71788f39574e9dff166bf215ed360c5c3a4d94dea0893724"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/bootstrap/named_exports.rs: crates/perry/src/commands/compile/bootstrap/named_exports.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry::commands::compile::bootstrap::named_exports::visit_stmt at line 411. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/bootstrap/named_exports.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/perry/src/commands/compile/bootstrap/named_exports.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"9765253384df6536a4238fbbac092747fd4aeaa9ea9fd172f18d903f8c0caf71"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/lower/lower_expr/assignment.rs: crates/perry-hir/src/lower/lower_expr/assignment.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_hir::lower::lower_expr::assignment::lower_expr_assignment at line 8. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/lower_expr/assignment.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/perry-hir/src/lower/lower_expr/assignment.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3814ac968b6db7579a4da66239f0580934e50a77b1c89e98b1bbef89bbb829"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/gc/native_stack_scan.rs: crates/perry-runtime/src/gc/native_stack_scan.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in perry_runtime::gc::native_stack_scan::run_native_stack_scan at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/gc/native_stack_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/perry-runtime/src/gc/native_stack_scan.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"94915fbc1e89e59ff732ac802ebab6a55711f1ef8a05aa5d6f98ec7eabc37a00"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/test262_subset.py: scripts/test262_subset.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in test262_subset.main at line 393. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/test262_subset.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test262_subset.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"12042c5edb14fc479487d4b55c6dd9a991506cf6432b1daea8508d43bbb84568"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-component-io/src/lib.rs: crates/perry-component-io/src/lib.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Driver::new at line 108. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-component-io/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/perry-component-io/src/lib.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d5860ed6d241a9b457a52489295a17cc59fa22aa689219572e41510c18e142"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wasm-host/src/tables.rs: crates/perry-wasm-host/src/tables.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in perry_wasm_host::tables::perry_wasm_host_instance_table_get at line 37. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wasm-host/src/tables.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wasm-host/src/tables.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1600eee6123d682de4e09b4881e0317cd7a9391430e42f4b1224a16f912e525a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/json/stringify_proxy.rs: crates/perry-runtime/src/json/stringify_proxy.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in perry_runtime::json::stringify_proxy::try_stringify at line 25. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/json/stringify_proxy.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/perry-runtime/src/json/stringify_proxy.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a44933f7084037bcc329a4f1c79234334ab07904fac5890fe608c09bcfb61b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ui-android/src/system.rs: crates/perry-ui-android/src/system.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in perry_ui_android::system::preferences_get at line 177. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ui-android/src/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/perry-ui-android/src/system.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c3493642676da525cc693ac9fe3a480ae56578fadbd9c2eb6cfdf6ef561190"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-better-sqlite3/src/dispatch_ext.rs: crates/perry-ext-better-sqlite3/src/dispatch_ext.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in perry_ext_better_sqlite3::dispatch_ext::property_of at line 190. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-better-sqlite3/src/dispatch_ext.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/perry-ext-better-sqlite3/src/dispatch_ext.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb1b2d08ab3b6e6254751bf0b16d05d94131b392aab6e0cbe18fcc8cfddc3b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-http/src/root_scanner.rs: crates/perry-ext-http/src/root_scanner.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_ext_http::root_scanner::scan_http_roots at line 7. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-http/src/root_scanner.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/perry-ext-http/src/root_scanner.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b6cb0299aed232eb614e2e3e164c4259b889cae783c074356a33a1b7ea5cfc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/private_method.rs: crates/perry-codegen/src/lower_call/private_method.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_codegen::lower_call::private_method::try_lower_private_method_call at line 33. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/private_method.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/perry-codegen/src/lower_call/private_method.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d78516153807ac27c52e5aeda8d0446db37dfaca5d57a2c4cb021a5ea90b2c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: benchmarks/json_performance/run_regression_focus.py: benchmarks/json_performance/run_regression_focus.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in run_regression_focus.main at line 37. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- benchmarks/json_performance/run_regression_focus.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/json_performance/run_regression_focus.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd179b22a13499edad139f74002b0e891eb8696a6460623be4b4f3026316ada"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/value/truthy.rs: crates/perry-runtime/src/value/truthy.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in perry_runtime::value::truthy::js_is_truthy 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/value/truthy.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/perry-runtime/src/value/truthy.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"42bf0a3d26eb4b2679ca3a958fbefe31b22dcc69a0e029fc1545028e22b5f37c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/value/to_string_radix.rs: crates/perry-runtime/src/value/to_string_radix.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_runtime::value::to_string_radix::js_jsvalue_to_string_radix at line 227. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/value/to_string_radix.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/perry-runtime/src/value/to_string_radix.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"430e5a06cef41c50c20918d92d431ff5e360d420bbe4d733020aee2403806918"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/exception/marks.rs: crates/perry-runtime/src/exception/marks.rs changed 3 times in last 90 days, max cyclomatic complexity 15 in perry_runtime::exception::marks::unwind_managed_stacks at line 343. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/exception/marks.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/perry-runtime/src/exception/marks.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9f697587e49bfb5b2b5bda4a5e5e66eb841e2a24bdda0c55071bec8710ed5c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/proven_args.rs: crates/perry-codegen/src/collectors/proven_args.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_codegen::collectors::proven_args::method_proven_shape_args at line 60. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/proven_args.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/perry-codegen/src/collectors/proven_args.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"5824f025beaf6d3f8716dd4c465b2b7d8fb692277057e03cd677269fcb9af1bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-http/src/transport_error.rs: crates/perry-ext-http/src/transport_error.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_ext_http::transport_error::fallback_errno at line 24. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-http/src/transport_error.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/perry-ext-http/src/transport_error.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"79540d719d8007595173e7e889326261559a438e468a89014199aef8e375e34e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/local_refs.rs: crates/perry-codegen/src/collectors/local_refs.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry_codegen::collectors::local_refs::expr_contains_local_get at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/local_refs.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/perry-codegen/src/collectors/local_refs.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"33982f6907216d37a6d34dde989bf6adaf132ad502fc03260e5d4cf6622ff1ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/collect_modules/native_addon/discovery.rs: crates/perry/src/commands/compile/collect_modules/native_addon/discovery.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in perry::commands::compile::collect_modules::native_addon::discovery::collect_declared_addons at line 7. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/collect_modules/native_addon/discovery.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/perry/src/commands/compile/collect_modules/native_addon/discovery.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"caba1c22a8f7596556e11f885e6a8a2b7a8dd32d09b9035e829244f8ef6c0629"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/collectors/all_pointer_arrays.rs: crates/perry-codegen/src/collectors/all_pointer_arrays.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in perry_codegen::collectors::all_pointer_arrays::collect_all_pointer_array_locals at line 88. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/collectors/all_pointer_arrays.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/perry-codegen/src/collectors/all_pointer_arrays.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a17481acd8a69dd442a821e28cddeeae09b5665e25cc5dacebccde61d0dfddb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-hir/src/proto_census.rs: crates/perry-hir/src/proto_census.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in CensusScanner::visit_call_expr at line 610. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/proto_census.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/perry-hir/src/proto_census.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f6e50b72a5b53c9c7755c8a562a0bce22ef0d732009374a464c3c6d3cc1406"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/lock_scan.rs: crates/perry/src/commands/compile/lock_scan.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in perry::commands::compile::lock_scan::derive_target_key at line 138. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/lock_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/perry/src/commands/compile/lock_scan.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfd3fa35683cc32d471bdf065978fdfc12152a111aa12bee6c3f76c1a7da8a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/regex/perex_literal_search.rs: crates/perry-runtime/src/regex/perex_literal_search.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in perry_runtime::regex::perex_literal_search::ascii_positions 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/regex/perex_literal_search.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/perry-runtime/src/regex/perex_literal_search.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ff7f7d4d90ec61e54472f6f34e51a5779fcf49dda821cc03880fe009c4cb68"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/run/resign.rs: crates/perry/src/commands/run/resign.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in perry::commands::run::resign::create_dev_profile_via_api at line 326. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/run/resign.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/perry/src/commands/run/resign.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"93af1be0cf7b7cfefe66fd17a49196130f989654a420dd5dddc86066cb80cfd9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/perf_12015_lane.py: scripts/perf_12015_lane.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in perf_12015_lane.compare at line 114. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/perf_12015_lane.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/perf_12015_lane.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22772de6b9568b9e16df123094e541fc198d7fc3a4dcf18acce36d1874be796"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/verify.rs: crates/perry/src/commands/verify.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in perry::commands::verify::run_verify_check 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/verify.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/perry/src/commands/verify.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1842f3c36d032d7fddc55eb622a570f3ffa262614d1e2fc92f636604572c73"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/collect_modules/import_meta_require.rs: crates/perry/src/commands/compile/collect_modules/import_meta_require.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry::commands::compile::collect_modules::import_meta_require::rewrite_import_meta_require_addons at line 278. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/collect_modules/import_meta_require.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/perry/src/commands/compile/collect_modules/import_meta_require.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe0c817b3ce7293ed01d67bec8c317d3121a89d8273aa8cf1260f2199f4f2fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ext-ws/src/dispatch.rs: crates/perry-ext-ws/src/dispatch.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_ext_ws::dispatch::method at line 56. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-ws/src/dispatch.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/perry-ext-ws/src/dispatch.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7fb56e14fa1ea0c228c0d9c9fb48590ab8658c3897e887056c172c98b0ded5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/node_compat_matrix.mjs: scripts/node_compat_matrix.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in node_compat_matrix.runMatrix at line 458. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/node_compat_matrix.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/node_compat_matrix.mjs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36e9dffa780c3273b9dcdd8da319ab7cb29d69b20f9ee190f8f1cab9ff57021"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-codegen/src/lower_call/atomics.rs: crates/perry-codegen/src/lower_call/atomics.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_codegen::lower_call::atomics::try_lower_atomics_static_call at line 17. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/atomics.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/perry-codegen/src/lower_call/atomics.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c52fcb117287539826168fb71f0eba9e6384e878b2ce6e4dfbdfb16e7bcb99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ui-android/src/widgets/image.rs: crates/perry-ui-android/src/widgets/image.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in perry_ui_android::widgets::image::create_file 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ui-android/src/widgets/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/perry-ui-android/src/widgets/image.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"af21948a77c99c5c5b192ade99c42f017d3219372d0def277963548f1523a72c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/publish/scan.mts: scripts/publish/scan.mts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in scan.scanTarball at line 169. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/publish/scan.mts\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/publish/scan.mts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6adb5a3d1ba90ce3df25cd9585cf8f86bdae9153d9759d7fa306c29258c1c93"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry/src/commands/compile/fallback_diag.rs: crates/perry/src/commands/compile/fallback_diag.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry::commands::compile::fallback_diag::facts_for 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry/src/commands/compile/fallback_diag.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/perry/src/commands/compile/fallback_diag.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef037901bfb3628e2fea23b9a8ca92a2189f1544128f51d30ad0e5870bc6da3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-wpfacts/src/solve/shared.rs: crates/perry-wpfacts/src/solve/shared.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in Model::replay_shared at line 52. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-wpfacts/src/solve/shared.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/perry-wpfacts/src/solve/shared.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ec30cb58bb046a7060b2b240485af3974122798dd094023175e7c2ed7d3459"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/soak/external-tools.mts: scripts/soak/external-tools.mts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in external-tools.main at line 634. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/soak/external-tools.mts\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/soak/external-tools.mts"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b23efe0acfee2f210a14624bf6db82533a84e3833f22af91caa908968aeeb79"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-doc-tests/src/main.rs: crates/perry-doc-tests/src/main.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_doc_tests::cross_compile_one 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-doc-tests/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-doc-tests/src/main.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e34d6e908d8d308f5d46b9a52c9c20fdfe0fba3b7cd73f68e8cfe9790b1ef2c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-ui-android/src/widgets/attributed_text.rs: crates/perry-ui-android/src/widgets/attributed_text.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_ui_android::widgets::attributed_text::append at line 72. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ui-android/src/widgets/attributed_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/perry-ui-android/src/widgets/attributed_text.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2e9d87f364e5193e8530b5ffe28695da0e31a3c29f2551eecf8f6c621a1bb3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/perry-runtime/src/native_value_profile.rs: crates/perry-runtime/src/native_value_profile.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in perry_runtime::native_value_profile::checked_number 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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/native_value_profile.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/perry-runtime/src/native_value_profile.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bbe2918d23deb329c7bb6d2f65daa283a7ce42ecce9630261eda8be407044b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-hir/src/lower/context_new.rs: crates/perry-hir/src/lower/context_new.rs changed 24 times in last 90 days and 15 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 LoweringContext::new at line 17), 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(hir): bind forward reads of a repeated class and fill forward cells in async scopes\u201D; \u201Cfix(hir): construct the global when a program class shares a name with a globalThis alias\u201D; \u201Cfix(hir): construct undici agents through a require()d namespace local\u201D; \u201Cfix(compile): take module shape-id slices at job start; share the deferred set\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/context_new.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/perry-hir/src/lower/context_new.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab79946eff9e75a72b1c455ca0dd66a7a49b3a359692309144ba4f791a81c93"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-codegen/src/lower_call/property_get/own_override_guard.rs: crates/perry-codegen/src/lower_call/property_get/own_override_guard.rs changed 17 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 7 (its worst body is perry_codegen::lower_call::property_get::own_override_guard::proven_kind_family at line 263), 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(array): preserve Proxy receivers through builtin dispatch\u201D; \u201Cfix(runtime,codegen): builtin method calls honour patched prototypes via one pristine-prototype proof checked in the callee (#11915)\u201D; \u201Cfix(codegen): own method beats a Date/Array builtin on unproven receivers (#11493)\u201D; \u201Cfix: an own \u0060push\u0060 beats Array.prototype.push on a proven array (#11021)\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/lower_call/property_get/own_override_guard.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/perry-codegen/src/lower_call/property_get/own_override_guard.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e89a3a55b14de1775733e5232be2afe01b3a6e19e87bd14d9f482580086c1c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-runtime/src/fs/validate.rs: crates/perry-runtime/src/fs/validate.rs 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 8 (its worst body is perry_runtime::fs::validate::encoded_path_separator at line 46), 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: clear strict Rust warning gates and portable test helpers\u201D; \u201Cfix: native handles are JS references everywhere \u2014 one is_reference predicate, sign-closed number guards, reference-test audit gate (#12540)\u201D; \u201Cfix(runtime): classify diagnostic prototype chains without extra gets\u201D; \u201Cfix(runtime): respect diagnostic GetV and native prototype authority\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/fs/validate.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/perry-runtime/src/fs/validate.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbfd048f94f51e27080a17956b05cb90cc46972c5d91e7d23ab4f52dc812e44"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-stdlib/src/fetch/headers.rs: crates/perry-stdlib/src/fetch/headers.rs changed 14 times in last 90 days and 8 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 perry_stdlib::fetch::headers::js_headers_method_value at line 60), 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(fetch): reclaim unreachable handles and recycle registry IDs\u201D; \u201Cfix(fetch): keep the Headers method cache in a registry-only record\u201D; \u201Cfix(fetch): tie bound-method caches to handle records\u201D; \u201CFix proxy array materialization and dynamic Request headers\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/fetch/headers.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/perry-stdlib/src/fetch/headers.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7976cfa26d7a7cbfafb1d7070708b10921c316ffba248f4695f0743c52157e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-stdlib/src/fetch/request_ctor.rs: crates/perry-stdlib/src/fetch/request_ctor.rs changed 12 times in last 90 days and 8 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 perry_stdlib::fetch::request_ctor::js_request_new at line 16), 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 fetch options passed through variables and helpers\u201D; \u201Cfix(fetch): new Request(url, { headers: null }) throws a TypeError again\u201D; \u201Cfix(fetch): read Request, Response and fetch bodies from async iterables\u201D; \u201Cfix(fetch): preserve enclosing body conversion metadata\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/fetch/request_ctor.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/perry-stdlib/src/fetch/request_ctor.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88e9b6faf8099c404423894d241a823d45e7b91b4c40a54ce96e755a0fb02a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-ui-macos/src/widgets/padding.rs: crates/perry-ui-macos/src/widgets/padding.rs changed 12 times in last 90 days and 7 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 perry_ui_macos::widgets::padding::set_edge_insets at line 230), 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(ui-macos): keep text fields and Text inside the width they fill (#11739) (#11740)\u201D; \u201Cfix(ui-macos): keep TextField and SecureField to one line, as a web input does (#11661)\u201D; \u201Cfix(ui-macos): pad text fields as CSS padding does (#11661)\u201D; \u201Cfix(ui-macos): build the inset cell through cellClass (#11661)\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ui-macos/src/widgets/padding.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/perry-ui-macos/src/widgets/padding.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95d54fbbc141862f939992290364b0f1eac6f802f3e8d5d5a2f58438a374912"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-runtime/src/url/mod.rs: crates/perry-runtime/src/url/mod.rs changed 11 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 2 (its worst body is perry_runtime::url::js_url_coerce_string at line 74), 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: clear strict Rust warning gates and portable test helpers\u201D; \u201Cfix(url): remove dot segments and fold special-scheme separators\u201D; \u201Cfix file URL Windows drive parsing\u201D; \u201Cfix(runtime,stdlib,codegen,ext): short (SSO) strings at native string entry points (#11519)\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/url/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/perry-runtime/src/url/mod.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"544e520e3c45984335ada13628ae4261af6c2f1687c353d2100cb184bf3fa85a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-runtime/src/object/class_super_chain.rs: crates/perry-runtime/src/object/class_super_chain.rs changed 11 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 8 (its worst body is perry_runtime::object::class_super_chain::super_call_with_lookup at line 52), 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: follow live constructor and home-object heritage\u201D; \u201Cfix: native handles are JS references everywhere \u2014 one is_reference predicate, sign-closed number guards, reference-test audit gate (#12540)\u201D; \u201Cfix(classes): lexical class homes for super, live-home super writes, lone-surrogate method names, WeakMap/WeakSet subclass new.target (#12210 #12211 #12202 #12396)\u201D; \u201Cfix(runtime): preserve evaluated super prototypes and reuse interned keys\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/class_super_chain.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/perry-runtime/src/object/class_super_chain.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58902944840c239686e990889069faac80e282682f7293f607d27970728355e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-ext-http/src/server/http2_settings.rs: crates/perry-ext-http/src/server/http2_settings.rs changed 7 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 13 (its worst body is perry_ext_http::server::http2_settings::js_node_http2_get_unpacked_settings at line 155), 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(http,ws): honor canonical native handle values\u201D; \u201Cfix(http2): pack NaN settings as zero and reject infinite ones like Node\u201D; \u201Cfix(http2): pack in-range fractional settings as truncated uint32\u201D; \u201Cfix(http2): enforce packed initial window size bound\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-http/src/server/http2_settings.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/perry-ext-http/src/server/http2_settings.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"73439de75272e10bde46c0561e32803dd4be5fe1e66a68fc123dab8ff616ed22"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: test-files/test_gap_received_value_diagnostics.ts: test-files/test_gap_received_value_diagnostics.ts 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 3 (its worst body is test_gap_received_value_diagnostics.chainValueGetter at line 356), 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(runtime): classify diagnostic prototype chains without extra gets\u201D; \u201Cfix(runtime): respect diagnostic GetV and native prototype authority\u201D; \u201Cfix(runtime): guard primitive diagnostic constructor operands\u201D; \u201Cfix(runtime): honor inherited intrinsic view diagnostic constructors\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- test-files/test_gap_received_value_diagnostics.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-files/test_gap_received_value_diagnostics.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"678c458d9f927990a2a167342c6cde1e176dc48362303572105e50f7984b5c5a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-ext-ws/src/server.rs: crates/perry-ext-ws/src/server.rs changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is perry_ext_ws::server::js_ws_server_new at line 150), 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(ext-ws): drop an exiting agent\u0027s ws state and root only the current agent\u0027s slots\u201D; \u201Cfix(ext-ws): run the ws pump and keepalive on every agent\u0027s own loop\u201D; \u201Cfix(http,ws): honor canonical native handle values\u201D; \u201CDeclare fixed runtime record layouts\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-ws/src/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/perry-ext-ws/src/server.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"030a6e91d275ef9543c4f4883bcd268545baeeea454d08865b7f35ac3a75d86e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-ext-http/src/server/turnloop_serve/mod.rs: crates/perry-ext-http/src/server/turnloop_serve/mod.rs changed 9 times in last 90 days and 5 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 perry_ext_http::server::turnloop_serve::post_with at line 190), 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(http): keep response lifetime separate from request receipt\u201D; \u201Cfix(http): destroy accepted socket transport across protocols\u201D; \u201Cfix(http2): close server connection socket with transport\u201D; \u201Cfix(http): preserve response framing after writeHead\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-http/src/server/turnloop_serve/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/perry-ext-http/src/server/turnloop_serve/mod.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb86ec291f0fe2696f1cbc31d7ee2b97efc497efca032d6c886e088f451b88ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-stdlib/src/fetch/response_ctor.rs: crates/perry-stdlib/src/fetch/response_ctor.rs changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is perry_stdlib::fetch::response_ctor::js_response_new at line 87), 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(fetch): read Request, Response and fetch bodies from async iterables\u201D; \u201Cfix(fetch): make handle reclamation deadlock-free, root object URLs and young ids\u201D; \u201Cfix(fetch): reclaim unreachable handles and recycle registry IDs\u201D; \u201Cfix(fetch): keep the Headers method cache in a registry-only record\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/fetch/response_ctor.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/perry-stdlib/src/fetch/response_ctor.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e838675a777e998a4802f77951f14af73f35893a6d67b9b2d882d8df840c86e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-runtime/src/object/class_registry/evaluation_heritage.rs: crates/perry-runtime/src/object/class_registry/evaluation_heritage.rs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is perry_runtime::object::class_registry::evaluation_heritage::pin_instance_constructing_class at line 209), 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(layout): a class evaluation\u0027s instance carries its own copy of the family layout\u201D; \u201Cfix: follow live constructor and home-object heritage\u201D; \u201Cfix(runtime): a class used as a value is its function object; statics are its own properties (#11414) (#11609)\u201D; \u201Cfix: preserve tagged error names across class evaluations\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/class_registry/evaluation_heritage.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/perry-runtime/src/object/class_registry/evaluation_heritage.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaecc9d7335b964e53669752898ff260f2eef6e78b9104effe03d320ad828224"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-runtime/src/object/native_module/name_tables.rs: crates/perry-runtime/src/object/native_module/name_tables.rs changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is perry_runtime::object::native_module::name_tables::canonical_native_callable_property at line 6), 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(runtime): route native-module namespaces without a dispatch bucket to their implementations\u201D; \u201Cfix(zlib): preserve constant descriptors and readonly writes\u201D; \u201Cfix(domain): preserve factory alias identity and canonical name\u201D; \u201Cfix(runtime): preserve builtin CommonJS default identities\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/native_module/name_tables.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/native_module/name_tables.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da38aa0c9709cb5261b05d497eb636c4a3825b818df9e718db1f36ddd641338"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-stdlib/src/fetch/body_clone.rs: crates/perry-stdlib/src/fetch/body_clone.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is perry_stdlib::fetch::body_clone::response_body_stream at line 50), 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(runtime): a number is always a Number; Web Streams handles are POINTER_TAG handles\u201D; \u201Cfix(fetch): reclaim unreachable handles and recycle registry IDs\u201D; \u201Cfix(fetch): keep the Headers method cache in a registry-only record\u201D; \u201Cfix(fetch): Response.json shares ctor init validation; Bun platform skips null-body-status check (#10360)\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/fetch/body_clone.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/perry-stdlib/src/fetch/body_clone.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1caa5d18bb97c800a6ab295347862ba6be77ab837a4a37f8796d777839fb53"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-stdlib/src/fetch/turnloop_bridge.rs: crates/perry-stdlib/src/fetch/turnloop_bridge.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is perry_stdlib::fetch::turnloop_bridge::response_done at line 299), 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(runtime): a number is always a Number; Web Streams handles are POINTER_TAG handles\u201D; \u201Cfix(fetch): reject blocked destination ports before connecting\u201D; \u201Cfix(stdlib): match Node\u0027s rejection shape and Response.type for redirects, add gap test\u201D; \u201Cfix(fetch): honor redirect modes and response metadata\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-stdlib/src/fetch/turnloop_bridge.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/perry-stdlib/src/fetch/turnloop_bridge.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"a330d5604e8b41fc5c9380d3cdafdcf4c0b2576ccaeaf71615b622aff67689e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-ext-better-sqlite3/src/lib.rs: crates/perry-ext-better-sqlite3/src/lib.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is perry_ext_better_sqlite3::params_from_array at line 101), 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(better-sqlite3): stmt.run() works on a statement that returns rows\u201D; \u201Cfix(ext): dynamic method calls on better-sqlite3 and Bun.Transpiler handles\u201D; \u201CDeclare fixed runtime record layouts\u201D; \u201Cfix(sqlite): better-sqlite3 close() closes the connection (Refs #11919)\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-better-sqlite3/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/perry-ext-better-sqlite3/src/lib.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"119fd4e425619e44554115297fdf493611edabd9e2a470c09deff292d08fcba3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-codegen/src/expr/worker_new.rs: crates/perry-codegen/src/expr/worker_new.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is perry_codegen::expr::worker_new::lower_candidates at line 11), 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(codegen): make worker ownership a per-compile input\u201D; \u201Cfix(worker): retain static candidates beside opaque returns\u201D; \u201Cfix(codegen): the OTHER worker-entry emitter also needs the guarded wrapper (#10399)\u201D; \u201Cfix(codegen): keep every alloca in the function entry block\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/worker_new.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/perry-codegen/src/expr/worker_new.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad017bd19d1786aa807cba5092484cf59256ebcaf64970c67121ae565120013"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-codegen/src/expr/v8_interop.rs: crates/perry-codegen/src/expr/v8_interop.rs changed 6 times in last 90 days and 4 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 perry_codegen::expr::v8_interop::try_static_class_name at line 285), 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: honor live Map constructor binding\u201D; \u201Cfix(codegen): keep every alloca in the function entry block\u201D; \u201Cfix(codegen): build the intrinsic, not a runtime read, for a shadowed \u0060new globalThis.X()\u0060 (#10359)\u201D; \u201Cfix(hir,codegen): construct the global in \u0060new globalThis.X()\u0060 when a binding shadows X (#10359)\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/v8_interop.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/perry-codegen/src/expr/v8_interop.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"226921fd4a75a4ab5d51984f59976d7abcb10c3b8f5dd996e60c5fe325882819"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-hir/src/lower_decl/class_decl/class_heritage.rs: crates/perry-hir/src/lower_decl/class_decl/class_heritage.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is perry_hir::lower_decl::class_decl::class_heritage::dynamic_function_forwarding_mode at line 34), 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(hir): retain same-named global member parents without self-links\u201D; \u201Cfix(hir): a member heritage named like an Error or fetch built-in is not that built-in\u201D; \u201Cfix: follow live constructor and home-object heritage\u201D; \u201Cfix(hir): a member heritage named like a JS built-in is not that built-in (#11139)\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower_decl/class_decl/class_heritage.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/perry-hir/src/lower_decl/class_decl/class_heritage.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0605abe275cb3a09bef4cc07bb9c3f8845fe8f46349f127368ac793ca54fcb9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-codegen/src/expr/class_field_push.rs: crates/perry-codegen/src/expr/class_field_push.rs 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 3 (its worst body is perry_codegen::expr::class_field_push::lower at line 14), 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(runtime,codegen): builtin method calls honour patched prototypes via one pristine-prototype proof checked in the callee (#11915)\u201D; \u201Cfix(runtime): a number is always a Number; Web Streams handles are POINTER_TAG handles\u201D; \u201Cfix(gc): root call arguments across collecting argument evaluation in all call lowerings\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/class_field_push.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/perry-codegen/src/expr/class_field_push.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9504ac48966f09c45688ecc3e1b46c1885a64785afb08eb2d0b65bc049633031"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-runtime/src/timer/store.rs: crates/perry-runtime/src/timer/store.rs 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 9 (its worst body is AgentTimers::sift_down at line 341), 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(timer): limit freed-range cleanup to primary partition\u201D; \u201Cfix(timer): install the real Timeout/Immediate handle as callback \u0060this\u0060\u201D; \u201Cfix(timer): stop check/poll queue placeholders from stealing a reused slab slot\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/timer/store.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/perry-runtime/src/timer/store.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0fea307bf9c79604aff0c4dc248ed367f97749c8d3fbb433469d9b94c3cb65"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-codegen/src/codegen/ctor_arity.rs: crates/perry-codegen/src/codegen/ctor_arity.rs 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 12 (its worst body is perry_codegen::codegen::ctor_arity::synthesized_ctor_param_count at line 97), 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(hir,codegen,runtime): make \u0060arguments\u0060 in class constructors reflect the call site\u201D; \u201Cfix(compile): share constructor arity across all heritage forms\u201D; \u201Cfix(compile): imported default ctor arity matches the synthesized forwarding ctor (#10258)\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/codegen/ctor_arity.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/perry-codegen/src/codegen/ctor_arity.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc0df5e7cd387eeacd8cd5fdd4a8482c7e8b5d71c6d62e882f5e9fe7da1c8ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-runtime/src/net_validate.rs: crates/perry-runtime/src/net_validate.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 13 (its worst body is perry_runtime::net_validate::js_net_normalize_args at line 336), 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(net): validate SocketAddress fields before coercion\u201D; \u201Cfix(net): validate SocketAddress constructor options\u201D; \u201Cfix(runtime): own statics on built-in constructors match Node\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/net_validate.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/perry-runtime/src/net_validate.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"740dbc17d59570ee511d4e73262802073441ee51027ee4a27fe3a5f1de039df2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-runtime/src/value/addr_class/image.rs: crates/perry-runtime/src/value/addr_class/image.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 8 (its worst body is perry_runtime::value::addr_class::image::header at line 79), 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(runtime): admit program string literals on wasm32 by exact section bounds\u201D; \u201Cfix: Next.js startup: string images with the atom-hash trailer, readdir errors, derived-ctor arrow check\u201D; \u201CFix Mach-O image-string section bounds symbols and keep the section anchor\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/value/addr_class/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/perry-runtime/src/value/addr_class/image.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca11e2c50642c8d9f7547ef10d48c89e00f9ea5835ee0a4f72749e980a88fd89"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-codegen/src/expr/class_first_evaluation.rs: crates/perry-codegen/src/expr/class_first_evaluation.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 perry_codegen::expr::class_first_evaluation::lower at line 54), 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(hir): bind forward reads of a repeated class and fill forward cells in async scopes\u201D; \u201CFix Unicode identifiers in native symbol names\u201D; \u201Cfix(codegen): make worker ownership a per-compile input\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/class_first_evaluation.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/perry-codegen/src/expr/class_first_evaluation.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba7a4b3a456f06e77f2fc7105b28e52f19d85508bca0982fcb2324ffaffa63e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-ext-net/src/payload_prototype.rs: crates/perry-ext-net/src/payload_prototype.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 perry_ext_net::payload_prototype::tls_session at line 301), 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(runtime,ext-net): aliased http.Server instances run net.Server members\u201D; \u201Cfix(net): preserve Socket construction routes and initial metadata\u201D; \u201Cfix(net): finish payload custody audits and enforce a single opened field\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-net/src/payload_prototype.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/perry-ext-net/src/payload_prototype.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e3ba2c27f2c5848d8989533fe4afcb315d1fc83a0f78091b056684c310fb26"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-ext-http/src/response_headers.rs: crates/perry-ext-http/src/response_headers.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 11 (its worst body is perry_ext_http::response_headers::build_response_headers_object at line 117), 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(http): retain original response header values\u201D; \u201Cfix(http): root response_headers.rs array pointers across allocating calls\u201D; \u201Cfix(http): client rawHeaders/httpVersion*/complete, \u0027upgrade\u0027 event, request-level createConnection (#10467, #10468, #10469)\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-http/src/response_headers.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/perry-ext-http/src/response_headers.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f860b08bc2afb8f19422f14a3722e862977626adf69061be358a43479ecc95"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-codegen/src/native_root_coverage/string_method_coercion.rs: crates/perry-codegen/src/native_root_coverage/string_method_coercion.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 1 (its worst body is perry_codegen::native_root_coverage::string_method_coercion::method_module at line 28), 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(gc): split string coercion helpers into coercing entries and number-only twins (#12538)\u201D; \u201Cfix(runtime,codegen): builtin method calls honour patched prototypes via one pristine-prototype proof checked in the callee (#11915)\u201D; \u201Cfix(runtime): locale string paths read options before taking string pointers\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/native_root_coverage/string_method_coercion.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/perry-codegen/src/native_root_coverage/string_method_coercion.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"032abac0b5704010d48d3c480375a2e22668531f5857e330577f226494894602"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-runtime/src/object/class_env.rs: crates/perry-runtime/src/object/class_env.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 8 (its worst body is perry_runtime::object::class_env::js_class_env_stamp at line 272), 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(runtime): an unstamped subclass instance reads the class evaluation its class extends\u201D; \u201Cfix(runtime): class environments keep the defining evaluation across super and inherited statics\u201D; \u201Cfix(hir): a self-construction records its member\u0027s class evaluation\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/object/class_env.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/perry-runtime/src/object/class_env.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c38b578893f9e4522631bc1f122de9f90f7157d1ff6bc6603e6653255ffeed8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-runtime/src/child_process/windows_fork.rs: crates/perry-runtime/src/child_process/windows_fork.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 10 (its worst body is perry_runtime::child_process::windows_fork::spawn at line 61), 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: cancel native pipe flushes and resolve path-qualified executables\u201D; \u201Cfix: make Windows pipe drains cancellable and match executable lookup\u201D; \u201Cfix: Windows pipe shutdown, child launches, and platform compatibility\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/child_process/windows_fork.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/perry-runtime/src/child_process/windows_fork.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ef078ce3b945b62b8e0bfbef8977fdb4b8c008692f6e761ed50c24168510d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: test-files/test_parity_own_override_beats_builtin.ts: test-files/test_parity_own_override_beats_builtin.ts 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 2 (its worst body is test_parity_own_override_beats_builtin.t at line 28), 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: an own \u0060push\u0060 beats Array.prototype.push on a proven array (#11021)\u201D; \u201Cfix(codegen): push leaves the gate; the guard\u0027s common case is a flag test\u201D; \u201Cfix(codegen): scope the guard\u0027s suppression to the node, not the subtree\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- test-files/test_parity_own_override_beats_builtin.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-files/test_parity_own_override_beats_builtin.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0546aa0b151f2ac17ae6c7301e7ba3dbee641bcd68b9c23c6d42da5a4a3853c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-hir/src/lower/expr_new/helpers.rs: crates/perry-hir/src/lower/expr_new/helpers.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 11 (its worst body is perry_hir::lower::expr_new::helpers::lower_text_decoder_new at line 71), 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(worker): retain static candidates beside opaque returns\u201D; \u201Cfix(codegen): build the intrinsic, not a runtime read, for a shadowed \u0060new globalThis.X()\u0060 (#10359)\u201D; \u201Cfix(hir,codegen): construct the global in \u0060new globalThis.X()\u0060 when a binding shadows X (#10359)\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-hir/src/lower/expr_new/helpers.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/perry-hir/src/lower/expr_new/helpers.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"7928484886e98ff0177e068f7d81f0bb156c5190068df29139c5036a8011104b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-runtime/src/os_hook_slots.rs: crates/perry-runtime/src/os_hook_slots.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 2 (its worst body is perry_runtime::os_hook_slots::register_installed_roots at line 258), 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(runtime): call non-Unix signal count without an indirect hook\u201D; \u201Cfix: clear strict Rust warning gates and portable test helpers\u201D; \u201Cfix(runtime): gate the signal-completion hook slot off wasm32\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-runtime/src/os_hook_slots.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/perry-runtime/src/os_hook_slots.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf7e9878f76c302b2efc5f432f8dc4f03ed991a37f0c3b11968112140282edb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-ext-net/src/classes_prototype.rs: crates/perry-ext-net/src/classes_prototype.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 9 (its worst body is perry_ext_net::classes_prototype::add_range at line 39), 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(net): publish and safely import BlockList JSON methods\u201D; \u201Cfix(net): accept SocketAddress inputs in BlockList mutators\u201D; \u201Cfix(net): preserve BlockList check typed input validation\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-ext-net/src/classes_prototype.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/perry-ext-net/src/classes_prototype.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce26d6625b05a41ec62d83e5d2be8620fc319364229fc2b907edd5ebd1d88d9b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/perry-codegen/src/expr/private_field_site.rs: crates/perry-codegen/src/expr/private_field_site.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 14 (its worst body is perry_codegen::expr::private_field_site::private_field_site at line 81), 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(runtime): a number is always a Number; Web Streams handles are POINTER_TAG handles\u201D; \u201Cfix(classes): store static private fields in constructor shapes\u201D; \u201Cfix(codegen): preserve private access before super\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- crates/perry-codegen/src/expr/private_field_site.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/perry-codegen/src/expr/private_field_site.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"493424e0859f1ec6ff458df3590b52c03ecd29c7934d7f4458b5f70b58661687"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: test-files/test_gap_json_lazy_defineproperty_index.ts: test-files/test_gap_json_lazy_defineproperty_index.ts 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 get at line 17), 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(runtime): preserve lazy array Reflect descriptor rejection\u201D; \u201Cfix(runtime): canonicalize lazy array index redefinitions\u201D; \u201Cfix(runtime): honor lazy JSON array index accessors\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- test-files/test_gap_json_lazy_defineproperty_index.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-files/test_gap_json_lazy_defineproperty_index.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"463bf1576829f50ae5740ff45d5feb512a5692ce06f87ab71276105b6f23e4b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: test-files/test_gap_11250_for_let_class_capture_update.ts: test-files/test_gap_11250_for_let_class_capture_update.ts 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 test_gap_11250_for_let_class_capture_update.inFunction at line 7), 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(hir): reset a for-let class owner at the top of each iteration\u201D; \u201Cfix(hir): keep out-of-scope class-capture refreshes, re-reading the expired head\u201D; \u201Cfix(hir): prune class-capture refreshes outside a for-let head\u0027s body (#11250)\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-07-30..2026-10-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-30 12:14:48 \u002B01:00\u0027 --until=\u00272026-10-28 12:14:48 \u002B01:00\u0027 --full-history --no-merges -- test-files/test_gap_11250_for_let_class_capture_update.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-files/test_gap_11250_for_let_class_capture_update.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e2a957e0c7f1594551a146ef4b6d2f506110a8128b07efb13be24f8878d910"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // is a TODO follow-up); we just confirm the shim returns a truthy \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":"test-files/test_zlib_brotli_decompress.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"88fe093c3ac2aefd29e5c8f3078f76d3b0ff3d8103cf6a38c1775d4136b8d232"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // dropped the function body entirely (the \u0060// TODO: properly lower function \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-files/fixtures/issue_uuid_cross_module/producer.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4803b2cd97c3c88ff800ece52d790e759506034e05b4ae903a2fbf9578a546"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # enumerated, verdict not established \u2014 a dated TODO \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":"scripts/gc_runtime_root_holders.py"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb932007029a07a47b935de520b73c1d02fc7932c96706637c0b59d2e76410e8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: configurable? determine from how much space left in file? \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/perry-wasi/src/p2/filesystem.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0b3a49004d55d7099f283f6039ca8a93b459dfecff412d234ca705528ee13f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO delete the path flags from this function \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wasi/src/p2/host/filesystem.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"064cc5b4d2214fe3d45e1daf3b00498f3b60d6a095760c47088976829cb2d3c5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO delete the path flags from this function \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wasi/src/p2/host/filesystem/sync.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c81fff8135e9afc6d759cfda26b84ecad767d50840fe6eefd1131ae484c554"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We could optimize this to not allocate one big zeroed buffer, and instead write \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/perry-wasi/src/io/impls.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ca148362b26bdf0565639fece86c9a64aefee7922320f4e42807147bad6a35"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! TODO: \u0060check_set_times\u0060 etc. \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/perry-wasi/src/filesystem/primitives/set_times.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94a907af3f742b61a11323b4fa966004804ae4e1bb7efecc337e38b46e187db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: How should we handle FILE_FLAG_SESSION_AWARE? \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/perry-wasi/src/filesystem/primitives/windows/fs/create_file_at_w.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce661249a24b6355bedd0567257bb0fa3bde95c533de4556a21314dc5e707ca9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace this with \u0060Path::file_prefix\u0060 once that\u0027s stable. For now, \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/perry-wasi/src/filesystem/primitives/windows/fs/open_impl.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df319fa62bc6894587cf89bcbebe1446fd519fc1e9c16cd083eb581e1447a7c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Check the error message \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/perry-wasi/src/filesystem/primitives/tests/cap_basics.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b4d210be62522aece373dd9e7da8acdf9827ac53cd13c66053e31fb2d0689a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO investigate why this one is failing \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/perry-wasi/src/filesystem/primitives/tests/fs_additional.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0a78802dbf0ec79a021324d242661fad653cfe2791f2a3e0cab4ae73529d13"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO investigate why this one is failing \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/perry-wasi/src/filesystem/primitives/tests/fs_additional.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c813c5f4ff74dd6960d7a3335cdaacf72c094cf1decf76842b2cd29a8f6ba7f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO investigate why this one is failing \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/perry-wasi/src/filesystem/primitives/tests/fs_additional.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"73bd66c07754c2656b2939ae7d8e4894e52d522806740ca023366c26a69e112d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO investigate why this one is failing \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/perry-wasi/src/filesystem/primitives/tests/fs_additional.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"5935dab944a687c28103cdc7f1b9f546cd4ee99612203b2e10b81a03a520b720"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Platform-specific error code. \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/perry-wasi/src/filesystem/primitives/tests/fs_additional.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"668d38cecad849131730d53792cb800d2e7adee001f8643ddda5d4deec62e28e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Platform-specific error code. \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/perry-wasi/src/filesystem/primitives/tests/fs_additional.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fffb6409b7656631c674abf73d3866b42f561a9304f445adbe5edc9cc124d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Platform-specific error code. \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/perry-wasi/src/filesystem/primitives/tests/rename.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0128f1aa231ba79ffe868121b95cec512f4edc50bbd3826672f3a29a20fdf9f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Platform-specific error code. \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/perry-wasi/src/filesystem/primitives/tests/rename.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9901149829ec050101bfcf77b32c0c0460a8b61a794a804ff931434320e7e87"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Platform-specific error code. \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/perry-wasi/src/filesystem/primitives/tests/rename.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ba6039a3cece2db6c6a6f3becf78c7240f3b3ac43025291b03a27f6982e858"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Platform-specific error code. \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/perry-wasi/src/filesystem/primitives/tests/rename.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8b9329bc041406f51baf8cb96203efed3d492d050a92ef7359ab7e232b9afb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Re-enable this assertion once the \u0060io_error_more\u0060 \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/perry-wasi/src/filesystem/primitives/tests/paths_containing_nul.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"400db9f32f74c4f95cd3070fcda9221c7730e910916742d861b68e04140d8dae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Blocked on error message discrepancies \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/perry-wasi/src/filesystem/primitives/tests/rename.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f004878e33b84c9df124c4817bb5d3df743c19184ad054776fb977034e6e95"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use \u0060byte_offfset_from\u0060 when pointer_byte_offsets is stable \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/perry-wasi/src/filesystem/primitives/tests/sys_common/symlink_junction.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"8264945333bb0579c3c92421032a9eb8c7992fd23925799f9ad0fb12bc7aff64"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this conversion is very hacky \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/perry-wasi/src/filesystem/primitives/tests/sys_common/symlink_junction.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"940517f7948ada39fa0f9c8ba2b0fdfc76d17db38a2bebd82b0d636adab63430"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use io::ErrorKind::InvalidFilename when io_error_more is stabilized \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/perry-wasi/src/filesystem/primitives/tests/sys_common/symlink_junction.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8de16aada8d749b13aafc860ec9b15e3ece140797c9613a8ce77f02cf583de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // POSIX returns \u0060ENOENT\u0060 on an empty path. TODO: On Windows, we should \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wasi/src/filesystem/primitives/manually/open.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"826a959365092b0aad9594705ec6d7ad1d28e76f85acf6c0be49f59f7b6e0474"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // POSIX returns \u0060ENOENT\u0060 on an empty path. TODO: On Windows, we should \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wasi/src/filesystem/primitives/manually/open.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3dcd5e95cdc71b40683f8f05b61c6c05fb65b274908c7e45792a1aaab4ee77c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Full implementation with SHGetFileInfo \u002B HICON -\u003E bitmap conversion \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/perry-ui-windows/src/app.rs"},"region":{"startLine":1846}}}],"partialFingerprints":{"codehealthFindingId/v1":"3490ce2814ddbb6592dfac6bc907d6e34a8d4d0be7e1282d3199afd32e00e0a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement iOS textfield focus observer \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/perry-ui-visionos/src/ffi_focus_menu.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb3767a5859c45c5c14610b5421038602c0b1fdd8801cc7b4d1f97e734469d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement iOS textfield focus observer \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/perry-ui-tvos/src/ffi/menus_dialog.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7ac452e36eb764009089adc7eb35b27a41f9ed09c512ce927ba7c1f839d384"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement iOS textfield focus observer \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/perry-ui-ios/src/ffi/widgets_basic.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce12f21bca1349277d4d7b9b3f89f742bd081d672243a876baa075bb63320626"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement iOS blur \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/perry-ui-visionos/src/ffi_focus_menu.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"d500bd26bfe810e82bc669acc08830f3064407fbb1f7f8a2eac573d7c43829ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement iOS blur \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/perry-ui-tvos/src/ffi/menus_dialog.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"637a6f7d9b51ac6a6c218bf0575d4329e9bd47d49eda11d9dd62c0185dedc2bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement iOS blur \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/perry-ui-ios/src/ffi/widgets_basic.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e680ab0403605d86baee3d476c0b426b93923346044419888f45018912e91d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: UIContextMenuInteraction \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/perry-ui-visionos/src/menu.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"9325e7eae4a07db2134bb2e6c0cab0975db62e79cd5c62664bb4156e4bf1a49e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: UIContextMenuInteraction \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/perry-ui-tvos/src/menu.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4122db705dd9dda276c1047759871df1a470dcff551aa2ca33cd7077c74645"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: UIContextMenuInteraction \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/perry-ui-ios/src/menu.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"865d196b4c6f98f7bd45b3676305eeb05b29d07e6b7a2e16078a6c976f26856d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(visionos): replace UILabel stub with a real picker once the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-visionos/src/widgets/picker.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdba2e57015d5b3d901b611ea68e4cd1f57f21a13ec1321c5cb29276b6d41365"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(visionos): wire \u0060style\u0060 through once this migrates off the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-visionos/src/widgets/picker.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8500b0ebae8fa48a90ccbfa5b7ffbe26da2ab7e26c44b28a9d5ed3993391a71"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(visionos): replace UILabel stub with UISwitch once sim-side \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/perry-ui-visionos/src/widgets/toggle.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc28678038ab204985874fa8dd10d5da1de853e632b813a5803d609176fac688"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //    widget destroy (TODO: hook widget-destroy in mod.rs to call \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/perry-ui-macos/src/widgets/webview.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d523cfbb7cf6402b0176a8709eeebd239bcc581d0db0a598aa4444c395d13f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // navigation. (TODO: refactor create() to defer initial load until after \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/perry-ui-macos/src/widgets/webview.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a8ce50da0f7c3d544b9c59c006a03a83e732e0808c6dadbdf2285f68b308d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: hide soft keyboard via InputMethodManager \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/perry-ui-android/src/ffi/embed_misc.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7aea884867139dee53a88ffb5d665c4dfd6cf41a6568bc5924e91f988c66fb8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: wire OnFocusChangeListener \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/perry-ui-android/src/ffi/embed_misc.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12b3901741db538516ea31de1b58e2961d7847f0585a98070342b7c630706c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add child as overlay in FrameLayout \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/perry-ui-android/src/ffi/embed_misc.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5d4875299007c5c30cf39b4d5a77307eef90fb7dcc9136bf6410259694bf10"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: set FrameLayout.LayoutParams with margins \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/perry-ui-android/src/ffi/embed_misc.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f8f8034ff9468b030b01d7f65228f86dadfdaf485c377ba0fe5fbc91ec2dd2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement closure conversion \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/perry-transform/src/closure.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24906554300d8b88e97e630d76c5a1a2f88163a3b55056db09fbd84e88efb5d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Implement properly when dynamic object properties are supported \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/perry-runtime/src/os.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7cff55a4f22837c6f50acb6933191ade13f3792513f68c602aadb4a426d4a3c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: when useEffect cleanup-on-dep-change wiring lands, \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/perry-runtime/src/tui/hooks.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc162ee7fd66f94ccfa9d1b2e1aefb737618b1516f9cc5eaf131409788cee6f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle generic extends \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/perry-hir/src/monomorph/specialize.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aea77b08b580697cb0c6016dc8edd145eafd6be4d654a48036bcabb98f52f58"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: detect optional params \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/perry-hir/src/lower_types/extract.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"30af61e590108e85b042883f17f30d0c4040230f53e0760d736e44887900a023"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check accessibility \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/perry-hir/src/lower_decl/class_members.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"632a1a0448eded35568eb5749beceb897510854dc1309b96a6ece4dccf3de107"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // syntax. TODO: extend to async/generator methods once the modifier \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/perry-hir/src/lower/expr_object.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9e5500cc90d279e7803156e07c96dc0a17ef4d2982dee937dab85ee52fae61"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// RSA-OAEP are TODO follow-ups tracked alongside #561."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/ir/expr.rs"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f69eefd3c0f19ce088ef907434293d2c6ca647b9bd7e79450a3b191f3bbcc1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// for); asymmetric and other algorithms are TODO follow-ups \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/perry-hir/src/ir/expr.rs"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"611cc7161e8a16e2c160990a35700bb3eed0039943d9d1020f12e438ad31f0f7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// asymmetric (RSA-OAEP) wrap is a TODO follow-up tracked \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/perry-hir/src/ir/expr.rs"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d2e4689bfefc96af4ce98aa6d5bc6de22bc58aed2726865fd18a4b5a213a82"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(#867): create a \u0060GADBannerView\u0060, attach it to the root"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-ads/src/lib.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd9636453a7d2cfb1a42787b6e19e7f25a7c73edbf9e9beb337193c17be2f16"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// \u0060// Could be parsed from security_opt\u0060 TODO and silently \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/perry-container-compose/src/backend.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c408541e092ead24b1b3e973f498eedccec4334d9765e421da2f997ee1faf2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO, silently dropping the user\u0027s \u0060security_opt: [\u0022seccomp=...\u0022]\u0060 \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/perry-container-compose/src/compose.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"452153afda33b68ec518a1c0343bb82731fe642bea99e1fe67133e5abba9b97e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: insert items if present \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/perry-codegen-wasm/src/emit/expr/arrays.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a1a3e4d7c7830f38544d9c4ab42929945aef70819f7b7be9d4b0654733500b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: radix support \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/perry-codegen-wasm/src/emit/expr/regex_globals.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82702ef42cf8f9f58e935bc8f71d19b040034999baa1002be85724b634b35a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: emit Glance text style modifiers \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/perry-codegen-glance/src/emit.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49a3f59314ab8505cb2e9c51e7b766794136ddb4ef3bd94415547800f28f3ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // the user knows the call is recognized. TODO: hook into \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/perry-codegen-arkts/src/mutations.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ff17da736e9d441c588b1759ba8bff54cbd4eeb472f79dc68e98f3db367f77"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///   (we don\u0027t box them yet \u2014 TODO if needed). \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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"344746835328c511b81d531f5700e6593d066eec7db4fe8b843f027d3925d7b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// (boxed_vars.rs\u0027s standing \u0022params \u2026 we don\u0027t box them yet\u0022 TODO). \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/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"660e01f876bd945dbe93ec2a89764e3697263c9392b4a16781a7eca7f4df1336"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! \u0060perry.disallowScripts\u0060 (TODO Phase 9.1) or simply \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/perry/src/commands/install/allowlist.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"722ba3ce93438b2cd2a2a3315e310e258ceac52c242f890a1b31ce03efdcefe3"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 9 of 95 project(s) overshoot their size bounds, lowering Project Cohesion to 8.1/10. The most over is \u0060crates/perry-runtime\u0060 (717862 LoC, 1629 module-visible types across 144 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3fc5bbe474917455284f8ca1fce42496d445f6aa0533e91b2b95aad9f0b94ff6"},"properties":{"commitSha":"b19e4fc68cfacfec958ef1602d84d357f70386ac"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2d0734c788963868935448e52ee3dcb79d31802e5d9af918b0fd4c889d986f17"},"properties":{"commitSha":"5aff4215fe575ee4d6139b63494d77fa8bc14948"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"59e9469134fa51b1862f5955945852cfd8482d640b9a3bcd09045ee3b7b021e0"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"800afb9acf4a3a1716bf1f114996525509d9355bd09f0b37dfa0ec62e4f7f59a"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"95df8846b4ba0bf2d382686163cbf0a44a024b676872ebff0c6b219e7974b212"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3eb3e57a30c817e03126b0432a356fa8cb826a6154130901f2c9f32924f95505"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dca9ff0266482f68aa3c7596e9e5bd9a48c8826cd6d3a681a398de95947ecdd9"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"effa21ac57b046d9a2f7881f9fe180417dbdf3ff0a2e4bf9b5f242ed9f033e3f"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e040a0081afc8954d9d0970bf691393e30ecb9b7a8cf7b9fe9ec77fbfc62dbdf"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f304bc37122ca18da382d51ffeb3953e8dc520f72de98b8fbcd81be421aa71f4"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"80424b6a6089c40bd30a9a058bf0c3d4d6a4cc68f9e76cbecc354a2bef2238d4"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c7410be6f9f9bfacdfe129396b52cfba2bbec5fd88b156f07c6b5a55e4f85d39"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"075125506d56ba87c0f3700c50438157591fb8b14d8366f983d41010a33de18b"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"560c28ae89b54814ada905401c9103b26ed97126888ab6bd47696de365965639"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"795962011e5ebebccf108d72d081033f2809de0a98082a2afc7a41c5a79d8aff"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d8395ef0dd0b3877c3314bda48ae8964bd1ae2e5cc797f48ca8af23a1cee9bc0"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0420c3e453c2c695101a3efef42cf3180b567b43e47cf09e9711633ffde988f9"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f4e0a0deaa2156aeb64b28d4d26a824c389308da1ef29d041d4c20a4db946ed5"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7995d122a6f22982c57650c50b7a8cc77c0ea113650e0611ee871a712e69892e"},"properties":{"commitSha":"0766018d430d49a8f5c8e2012d412b0fcddd8df1"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"37a450c569d00101d42615599f79b7740e9e3dde675f97b2769642d02def0da6"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d0918487c07b5bd2f54da180ba2519792b7d1e491cf7dde166bb0713f7c7ed0"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"93fcdc52bcd5fb8178b59de7acb600e57f66c80f8547a8ac7a63ef29f8bf1cd4"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c09574dda2fcf01febe05148b26eb2dc4a21b7e6c147e237c30f65b2c0c6f7f2"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"afdb1c03b6352b40e57f3d9469122bff802fb6b5a30e0c8e0f2bd28b4bf9de93"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"81333f5d240fdc1154ec4e882ce02c789b38770731033b017d722307e5a26fdd"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"66286914057ee618405fd137a9ffe4076308318f965248c0b97a455220dae3e1"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"45e81f2c7bacb5287c4e501c06010c4c9ea05dc6eebf81406455e721c5914b92"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"db9be4f8dfcc71b8a957ba76bb2c24afd78e5d7c7277ec70b728c01cde517b25"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eacb7e7673a54f3734fbae20229c50c84011c7033a7708637fe583b8c4af8ee5"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6ab72bdc42193fddea682d31015a469714898d21aaeee4b44f40f07702c8d910"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"54adcc27bc037f4ac0e5f0e3346fc457e8f0f673e2b70b1b7ddcd10ec59e0fc1"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ee1aba7c0729569b062a2c37a3df590b860bc2df796b2fe322fcc1498e37b870"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0db7598f31be09bc5b397faca3a25de63d5e55b3db72267eb1c11f6d6ddd5408"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8af1292ca05e4a8c0da372084525a30201d1c8f33952d86ae148c36893c33bda"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dca71712550db37eac5621df696c5f04ad1834c87ab5197ed2021c8b81a97dc5"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"51e687f534e62fd09252c6476cb6c677960f5377cdc0b9530a968a2a41ee9963"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9bf421b6254b7af3540ea9d9b2aa10feeae2174efc2604937c98bfec6648aa3a"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5187dc89cd86e07dcbaa6d3c3377e61b661da6f930fcc7a9b677ef42ff026029"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"14696a3b956698377e314c2cc36e8805b829079418954221a0012e739e8f7de6"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6efd584981430989c621453a40cc31f246dd6988176f9bd453f5e45c52e10daa"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e356b752318dbbcbe3325716ec206152594f3f8c0dffa1fc93a6c09269f123b0"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d9aadbb58963bb9f1ca7e05c87c31cb8ff7048119deffb8c3d198e77cedc3785"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"50e2a3964e2d7c3b10ca617249dd60a2137cb3e8e052a8627d73dcf99a41822c"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5599c8205e8dd42f678ebb1e9d2e3f72cdc9467457b3fce5d87688ea802857f8"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"25075757d5c37fe85a3f95b72e2c8b89fa6fc701a58373c7a88fe851967b2066"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"57e9a1b7e04766582eb6da06f33d51c5b0a99798d0d9fc365cfb18329c299303"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1bc198713b2b5fc408d23bd47c108cdce7fededaad5a385291232f658cba9e22"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5ae724fdf3f03b09180777e4708250ded3cca692489ade95e25a9df4c729c113"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2705ac5293f25e1eb458f2f9c23033e9a80176fdf2913b8a676f93de98fda35c"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f6c64dab36c3373a7d163c3cf6b5e77730470b3ecf5ac3683c7dc0930ff07ee1"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"640c6fac6a081489c644de6f88076ed8c1b478b88a11d00eebc4ba8cbb9c9761"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a03cd6b328c5af797e1408914baaabea8b3532d2dfc6297416c0c2599dd7d063"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eebe596f549afd524f8ada938f754c923d1f29cbc1621e9cf64faae8ef42f797"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4e097d5c347fe0ed16a58881ac96cfef5377c70cdaa596151e7c87d9a674486c"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0189aa07201daf4d114b8c1394f3375f7207afe7d845514b3012fe7c15cd2d05"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ccb9ef0ab87d7fdc11dc0e4f93fd95b3c008023fe1292467139c25cce08acebd"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"db10159dc3c40591430c6c66b55572e5a2b556fb8fda5c8cd11f773169d53edb"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"453e9e7df9d10b29791d5d0aefa1781f178453d3199e8ed7f49e76b4f08991a7"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e26ca03933f413056ade3d42f398f87c31082846e50fe02094e3050756f0a84"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5dd6f8404c3bc12c2e54f5703128cf11c005fbd5ffe10bab7ac104d70951ed6d"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3476567e2a3b3a08ba771a3994cc28c098a1e55a355555e086d16029e7456700"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b452731559a595705ce2f6f968eb2a25f21f0cdda72aacd314422052f4da6997"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"171ac118c8a72565f4223b6d9c0bd2fcba5ce1d9b66333b9ccc879708c889964"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8015aa76c42c31ee606dfcce24623bd29600f387b74246ee468f135883cd299c"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fcc2a0a7e5facc35528ca53c99eaef78c9641ccd67e71afb720753e40bebbc2e"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8c569c8467ad134be5eb47460db1b4d5069ef261e833a8a4fb0de589cbf9bdd9"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"39c301962f15e41c62666b1c79d00524045692993b96303816c0f3cabd37d290"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7aeb9f991c3c2a25f4e73fbcc4975b6a52e0e184696289c4fa0dd177cf41b056"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"26ee9ec9fec1bdc84fc709d47453439722d171b379b82225c7696f522f27df0f"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8bcae3fc4a2387283198cacba625fb4975930ca289664fb3bd0dbf3d882c8caa"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"12749fee2921f9469532f464886ca6116436c7fb7815f032ee45488ed4a92052"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cbf86d07d0b67a891d5ca5efefb6d94864bcafb45e6949412dcffe9b325a0d54"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6a77d618a38574b75fb01acc65fcd0fdb2f61f142d3544f6761282f855474f7a"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b7d677890377956fa1e3543ea1dbb52dedc27d99f54c7aec80dfd7dd571ed62"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f05c230b7e56fcca480aef3735afa21de381a92d0a53884a9850cae96b035363"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2aa3c84422d9b1e52ee3626697703208efc85289c52f22d5ef3857aec830d2f0"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4fc37b351f910c76dda7c0cd4fe62da9327007e3375a0dcfaadec2f3c5fd799a"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bd6aba99d79e78926fa25b973b3cc105ef2b7d1ae54bde373a3bd84d9ccb4bf4"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"380990d511dcd4808dda1c2cb71a9bdc8f565951afc94d9c0df6bc895c42b78a"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b3935b6ef9f9af45b3352a7dc6dd20c585c83c984b04a2e39151c06f062481c0"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"471b409e2bf9345e4f69e3e865ab831655a1eaa2d846754dab4df40c1eb2a50b"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e773526f3ae0aeb320152b4ab7f9ff0a9857f4c84bdc8a2ed9d1dc0ec86abd9c"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ead35be816d039084d1a0f57d614fc2664320fbe6b4e97c6024f81a96604b5fa"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"08cc99f407ae197e93d1d7d3eb4d8021ff63e0ebcdd30a03579937db5367a606"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"318577bff5c44304bce8e077a863895957db9c0a271a8a1a2407bfd7066d6002"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"014855e626fb465a6804859cd41c18591a9eb5c80e905d6b892afa6f6ff1b5b9"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dcbaefff6ec0c158729e668bfe701df18f87f203915678d6b739e674240586a1"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"94f35f1484db400d512bfce565f4705d77c6894d45af0f7532113ebf946a0502"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ded36c0efcbae11a3cf3bed38bfa9f53b53488446f72c86c0877c7fdaf846159"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9975895adfdfdf2b3a99710359e626a5f3af484f717bc068b498f545994a94b"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5df3cf5552f3ce4b61dc0ba7a424d39cddf686854517cf8c5b004d7c72584098"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"499f19bbbac74ffc34ee349bd5db53097208ed3e356ce92d50a1fd033bf4c985"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"df84bae028f2806e422209958d6809525f1e1299e157a24a9098646639f16d87"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ea970c9aa90c06f006241e4c2b25382953fd35247f0e5c63da5c7df3c510d7fe"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e52fda5f546ba3546c8c4771dc1eae8dfeef6af4df3aa52bc49a0419f2dea54"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fb18e54d9e51532b81cd56fd6449c00adc34c0fcf5dadc3438a4f0dd19223583"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c0de6104d4b21c4b64af45586203ec08333313a5fe31dbb7e491eef6466ad6f4"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"009e66d81586d804e06026fe15183620e215356353786aabf221d62f342b7368"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"915591708933c9ef3dfec851f3a04e1c034421d6f1e163fd4184cc178d0fd88b"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3ec1ffa3da5aa7bbacb62b44a6e3a7081807794568029a6d9b3f8ddc2572b5e4"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f05ad43d53e43a3de5037b5011af14b7277acee54497b2c2df7358eb1342210d"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"88078056af7f3e2b87473b491d112a52f613c369a98c83c58316f9e64136fab0"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ca78209908ec0e323011f3cde242ac7055b3cdb1ff96d0569f188a94683bc17a"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7bafc781ef9c3aa9145e3e375ae868c734e5a3c59d6af881efc8ecf2886401b9"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7b567975b038356124c479b486bf1b7e007661b72acce9c8f8a4d9241db722f7"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b89a293004c7053af7388c73f4ab1bc0f273770342ef8807bc12a6c6ccb6730"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"97fdbf9a82cdb56f8f9c5a0ee0d3a72089dd7d5ba3065306b946e59fb63be25d"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"403ccd3358cfda147d7b19944c006f3a858ba7c852cc7b278490ed40b4d6e0cb"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8cd4f4fd1275918669e3b541b3d52b3be2a17560f51dc85288439ab83bce4b5a"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8774971de9235629ab96f1115328e5403097e7a8ebed90b3176c54c183a7b2f6"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"923982fbb14338be897e5da3eec26be77eabf6af0226c4e9b34c64fd63e580da"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f2393c49a22e336275733eeb842a0c50d593e1c4e6b3c42154dbb09f82d4efaa"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f458ddfc5c53cb48775a2a58873525aff3f7a66c42f46dc0fa27ed4435b9f4c"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aa421ba3ba3a923265f89d215d72ba19fc15089f24991479340f8b5033756740"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"517514bc6309a188bef67d9576395e0b8b2ac84762894c7c2452b0de7db0c7bd"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d0ea4cc2fe58560e09365f90c215dba2f6153819bc5dd3ddf7998eae84330ae"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"baf0f906e34abd9e9bca40153903d6c8f26122ef1a983e09f5818e98e8581b51"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"605a53e1b928247b478439d4dca0a3b6a82e17aa8537e9805c260b95007d0c77"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4b4c0bf665f50f1b9c4e42482eb56784efaa81dcd05a9de407066e0851084f54"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb0460ef7289601e3dc945fea60661fe64a18f8190b3d3266f01a44148581d67"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd06b3c219b898bdbc14e0663d90480cd07c49fc19ef15eec359bf582b4c3e2f"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cff46ec9b529403f8160e5882417191bb608535c912789c4a59a7ba62b0ba914"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"393cc9597b210ad229767d6c58b9a7e2556f3ec9e8a2f06dded42545e2548a80"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"94583e439edae5b76b654a5c26b079d2197cfa689d48470a726e4c6f9d26e29f"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"12f5660f930efd8ece923f86dbc9c428db225f77d4721dfb6fe7da02b29de567"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd286c4ef50a0287319c998788ee0c9855d32d8ebc18607bbe919d8a4d160997"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"77e2b19f7c232eb4451c6a0ffaf4ae264412e8bf9fd73ec3389c7fae1d464495"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4299c9cb5d8a4bd7b33de6da227f74eb664758bd118653e48929099e8d54276c"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ecf7833ccf71bbe2be3b26594712d4306bc899985b9e61c865556fda9ac814dc"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"83196282ba04bec6f5f240b3ab19bd2fa4a1ee29346d2a41ace93dd437f1fd17"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6add75bb942bfce3aac22d82e24a4de5fb4184b2d2dfaa8aef399a8c76aee7f2"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ca247acac3f847f384122dc17e141d25b47956b346408d0010faaede6574eced"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"244c450a4fb9415d13d24d9d79ddce1067117969816a9d38ea107990caa4b20f"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"921d43efa377f27be5510fb1776807da02bf183c40ea596edd2ee7c0c6284e04"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4a3252456db22ba9d64689951640e4b9c8092bc68a2686559a99a69119a9326b"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d3ec74018fee9e83df4b3e56737cddec2b329af832d2bc284b9051f4a6cb7ca3"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a06a849bd354db56ff6e389d0d5d8c7d1d751e41dff16b62a4cd27b9acfe6dab"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b57606b8be4893a2ebade035d7d15f6642d9b303700b4df762041b6e6a0a878"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5db688fdc6c8bd854a4b64341f6610f1611f8680969680185c1388e0e5259217"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f2d9ad4d0f1fe69bd8511c9de8e2aa38481e8abd0975bf16617e178918b2eea1"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ea733b707babd8f14fc586c3cbd3a1cb18582ac6bbbc33dddde24d0417fa58d3"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"54db5b979f8dec625b8478dd4ea5dd47a3e9b3f0272ae6de21fe114145309888"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0874cbaad925ebfb2e531cd4e559925e99df4611ebd76e56a227238abe301e51"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7bc278bc64e4e91646f47286d5611f43f8469a7ed7713019ed50c02face94405"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e5ed8d6713b60d9cd6cd00d9ec6048964a577dbed22267c1fff96f03cd0a9ebb"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e15228e3941efb0e919454967701aa6939b4b34927e39b4ef8454a77212f86de"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ce604940c974244efbfeec7f5782e9232039978d17b8daffbeed80aad7bc58aa"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"21cb79f966cc4aa86349e18e4f7f56b5bee09e8df155e222057b4268da38682c"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"18215f9a4d946f90665259a88aad3191d200c1ab896fa0c1dc48cd7e0d8cf1a4"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"673c90b93c0460f9f83e38b32908ea23f9cfafedf867144f130ef6e0627afaa8"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"57e884358df20308cead47d704c0275e93f9ab921843de1bf020269d5a0f7bba"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0c1afa63d6bad1c9974d6e9f031b57552765283e3c05e408e73f7d52489f9bdd"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bbc97b96a29f6f9b70f7c67653cd934fbf8fefb96880fb2e24da0ee4cbde7a57"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ee876987074c0769f7919efa7cf55762fa66a1acca4e42c837201e751694d07d"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"71baec7e5ced84c664ad0d786e98308ed24ba1189d9d5a80c4ecc8d5e52cac9b"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ce9374b480e5b1ab86315544d542a3262906e41a51331e4cdc7504333660c40e"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"27404d503732ab88a010b0f3c4a3c0cd59a329b0b40e41c6c1d34becf1552b2b"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4b5380b904dc206202f90943816abed2c7af08e6595c754007c05468f4bf0d75"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9dd74e58342cdd4d560b7f4b4a633fc5930168e18183405338472e2039397ed8"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd466ccc1515b2dd0f8f150dd6d5e65c2f894ee3adb36f4d11265e5bb314d374"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"737d32fe09bc6c7a589e7dbbb97744957fb5ff8846aa2e7473ed12ef19276484"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"292a4fafc774ac313289f0c55444652bfae21d2f5eea4b969d76e4d737291d60"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"359b42c0341d38c8d1883fa821148efea23bbea8a667d6c4e46463158da9846e"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"85247f62b9901f30f8d40115cf8215597b625afb833bc923a3aeb0fb425b6dc6"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fea002173dc1fd8b794e486ec14f936def29f9882584451de22c2ed5db75216e"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed49eb20c9623bc558400d3d9716440bfc707eb8499a41b0072486fa937604a4"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d2929e792073b2d0ae945032b828511890a0198b00f2d9c8c849b50d3c10422f"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"151dd4048f2cfa81157b8662ee9139ebaf6d95b7506ef0fb981baed9fc203c5a"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e7a023210417e890002d2757c8b209b48bbbc25fdd58d7d8dadd61a6d1d31068"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"82cadd61532cdef7b36887d44c5d372e18490795d53b7990a2f905dbeea8fdfb"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0929c5dffbffcd658c62b3832619c36da637e9d5e9ce61ffcf5dc127309a440f"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"93e647b833d96795e62db29977c8cc7917f3f887c7c37883ba05a57edd299132"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2a4f05a67116de952bb18ebc2214b56c4654a52a2db3d3c0b455151601196454"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe4ffccaecb0fb393afad5af771e55fec7f4cf6c7b9f2562f171f82ca8fd1772"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"581971377a409664e5a350e6508bbcb2e0b23d8e551e78b980d710f8c0478c0c"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4896159e79a11a45081b09d9ea4af1ca0062c33063cd4260b9b7090c3478f28"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b2741d750ee0dc25394b92fb0d99d2315291879f0b96b21df72c70f23a1823fc"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6cfeb618db180e31e45cee535af51b73a4c7bba7ddf5d6ba13aeffbb4bbfd7c0"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c0c274ee8fc7bda75d3eac142c1e1cf58bf773dd4b85df50ab08bde7966f6881"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2a5139d77c949bddf34d6959c949316a71f3071db797d986416571a648c20d93"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8684eb155f2a261c8fe85fc4736c1158e58c90f9c6daf4033fe8be7b5822594b"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f0c59ee416a28578766cf0c174827b27d4bbe5741a1e8629b823a8e5d3b4c709"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63e7e32c6738e6099be3ba4fcf7fe5d4d15a50e412a5a22532a7d343af2c1543"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e83d09b112047a9323a7306bdda2e76c95488623681020e71e576d948d717da"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e6a8d5e6145367155d2700d873e51fad3457987368dc77524fafd29becbe6e3e"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c739730e408c634286d7dca82890867cc3306461d8d3e65e3d890eda0a2b5e4c"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4a8c192ce4755a6faad358dfe6fcc4937d4e73f00b0ae39b0b3c668812db06c3"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"95ed7e4e593cdff8bbd5de8350b7ad78bad5aa1f81857672f8960b4eeb17ab5a"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"472a04851c093f4feb5ea8f69653079f634e4a017da7c7d98ded19096414d53a"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"045c1b24a97eef7f02cd0d69528c7cd2ba998bdeb1c52ded205626ff4c3d6a95"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0b5624e82c90a5e3b7f9dd4e8b09286863166e23b1065b69bce350a97c968b88"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5b6aa4865e337cde4743b06516dcb9ef895526521a1daeabc44e26f3fb98623d"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8dd2b73144aacf981dae1dfc407dbb52ef3145f5d0953b9b92d6733a54ac7ef3"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"449189c584ffe72ecbfe20c9a19b0f7dbe56788ed5c3d26cac2b262f5f18b72a"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a403fb48ff2a63b9d34ff607df196e07d2a75ad03a236d20711185656ddfb681"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"99197eaae141fc54473f615e6e2794dc42f9f236b5a2685f65ffda58328c3be7"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b09664fa2b9f72ea99b7886586abb1d4ec0c226ff1ca0ad2cc1e2b90549d7bb5"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ea360e34551bdbb51ff337a923c835f80aeb46d44707ec9d9ec540752ed0a587"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4bbde1437f2cc16e06936b853796291b29631517f7edd90eaed93fb35f0a26c6"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"611a37d2fc5bf90e8d9312d09391c56a385d4aba6c19ae1a54a77b99e81ea647"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2e4cb6675820c63b178b50ccf9dc662e9617be9a4c4c445a812c93fc4955c98e"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"19132e5e34e1e7af3bc0bbda8b66389e7fe24c6cf86d677160149963295ca4d5"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d2b9ecc8a4aff9edb19bc6af559be9cbdbfa49257f93911714960086d634ee21"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3bc22fec0fa055514aa9e4b65a988074288105457e8bc7e9344c60ea99e4de88"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0f21ff74fd1e5e443f06a0f4139318729a937fc2fe34de741058786b16704fef"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e16e861cef41aaaea23dbfde227c1644494a1ad9affa2db41785e2032043594"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"049e1cc7df0b0338fc60cf3c94663ef8d21b49c8b73aadc92865aabb0187bbb2"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"857eabb9dfb0160e0e44730a18c8af9b73e9b26cd8a539d035823c609f4ac07f"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"da18101295e90b5a646787d5567b255790d2dbcd01135b9e193e11f28ed8f7cc"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"58eed8cc38d9ea660a23368524cdc67247ab75a4fbc4e4dd28d2e6406a906e27"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fa4a527cba0e1ba97509d01efcee8a47993abbbf769de6d27c7c81a718599bb6"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd8a4c6f495aa990f90d143b4c6cf72a2313f3721eab691df29f8b3f3c103d53"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1ae5c4cb119ff35c3bac8633c714ffefda524d763c4f39fed51f21c0ad716841"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae147a7f14213b66b82b66e4981068e09e53e1b0fee2b4057882b6c50e5ff684"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"88ec13e1deeeb87494faed707af7942f6d878b4bd109c247e917c569919d08de"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"53e1b0dcad040aca28f5e1946e793eeede72d465d02851a9978ed63ed505c9f8"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bb3ee2f8cc3c45e8895112773b90a7f63fb234ed2604d9069cad121df11fa066"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"37e3f4b70711cd96c624c9cfeb52af4ea540093cfe3015add3d4e421b7fb2435"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c4509d3a88871102d99e2440f12b3ad67748bdf1b2be7310805497162339f0e9"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bd731895df402c24730cf1f090b910f210961e8d50aa9b1a83e6d1b2dfe213ac"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b0da72de4b61ba27d154bc51c176246da759d46f88306851aa91bcff7b2e1699"},"properties":{"commitSha":"c089e20f99c0006530f085e4c990c8c60cf1270f"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9752516fbf220cd3335673bfbd7ae22dd6856cb4dd22a40cab88ad11ffc3f780"},"properties":{"commitSha":"c089e20f99c0006530f085e4c990c8c60cf1270f"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c00a65af967661da9b767c4df0ab8f85147f8cc00c9bee8b98a61e3cc1407632"},"properties":{"commitSha":"c089e20f99c0006530f085e4c990c8c60cf1270f"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c083654b7ac6c3f7adfe1994326b5283d43b26be6470373396ccaff001688bfc"},"properties":{"commitSha":"74aeb102ed34d8c751d4cc92cb19a4c76d1bbc05"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4493bac27de6dcff73659412cc3fdf259e935ad6a8d84ded9d1429dcdc6fafe4"},"properties":{"commitSha":"74aeb102ed34d8c751d4cc92cb19a4c76d1bbc05"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fbc5cdab4a9707920e35eb101d58b704307f5ca485bdcc0e61e21bcc169a7016"},"properties":{"commitSha":"74aeb102ed34d8c751d4cc92cb19a4c76d1bbc05"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fa57b65c18eea3c3d52aa3028a01938d34a2dda4626c08874ee3bbdc82971e0f"},"properties":{"commitSha":"74aeb102ed34d8c751d4cc92cb19a4c76d1bbc05"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb576797f3d523aa70f0ca017dde3070e8c66d1b3d14bf87d0cc6d88f104c0b1"},"properties":{"commitSha":"74aeb102ed34d8c751d4cc92cb19a4c76d1bbc05"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"807c5c9edde2b5a079505c59d5fbf4b068b80a3eb0ae619ed7b9dbca6c5cb7f6"},"properties":{"commitSha":"74aeb102ed34d8c751d4cc92cb19a4c76d1bbc05"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6315c9e3bd60099c30f83ad0b80b19985b5b58cac68a25cd0845c62047653322"},"properties":{"commitSha":"74aeb102ed34d8c751d4cc92cb19a4c76d1bbc05"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0f481eaec4a0b3c3948f1e4a2960fa72ba86dfd01ddb2c01009eda1e522f4487"},"properties":{"commitSha":"536f8f29b33b7db6d3b13c55992f2a63ac008a8a"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d137e532cc4767ca12389edbbbcc5a6871f27596bb6bd74a5b628f8c61801d5"},"properties":{"commitSha":"536f8f29b33b7db6d3b13c55992f2a63ac008a8a"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"97306575c438557fbc51b6b00a44cd0235b6a875d1e1bac5328b78a3fc3e67b5"},"properties":{"commitSha":"536f8f29b33b7db6d3b13c55992f2a63ac008a8a"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ee0ab5ea3271a60525110bc7e8b003db67ff457250c62174c3ea958d8305d5d"},"properties":{"commitSha":"536f8f29b33b7db6d3b13c55992f2a63ac008a8a"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"81ad99ddd42755eb6df653b6a34f27c4003a1553c95f5d84dc028752128d702a"},"properties":{"commitSha":"536f8f29b33b7db6d3b13c55992f2a63ac008a8a"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"28862fef65a9bf284c376c5d7ae858e78c098b9575358fd4b7565db33f7780cf"},"properties":{"commitSha":"536f8f29b33b7db6d3b13c55992f2a63ac008a8a"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef4d18791075ee4ba7eb06a16f22c834ca63e80981355b8f067d288ec68fe3b3"},"properties":{"commitSha":"536f8f29b33b7db6d3b13c55992f2a63ac008a8a"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4bd6448e66defce682341d3cfc8197ce671ab28260f3eb679419cc7aaad427e4"},"properties":{"commitSha":"5c1bb183629749e2d8da82f46f27082f0c764589"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9879642a356ac4d684bb0e9fe3f41bcc461899a6e2a49d00699ce0d636db4059"},"properties":{"commitSha":"5c1bb183629749e2d8da82f46f27082f0c764589"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d06f7c66ea1faa64b71a1378564bf93fa96daf3459fd90e7f5f4ca38a1f056f0"},"properties":{"commitSha":"5c1bb183629749e2d8da82f46f27082f0c764589"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f2812afe93fd9f86a03c67e3940ea9d296a33347c4063cef1acaf4958e71008a"},"properties":{"commitSha":"5c1bb183629749e2d8da82f46f27082f0c764589"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"89246d24f7015959da57dc010c9892cb9133067d03077632728cb816fda86794"},"properties":{"commitSha":"5c1bb183629749e2d8da82f46f27082f0c764589"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1385d8aa30121e9428f89d36f7f528692d2f6f1a7d37eaa7dad42c7c37441f7a"},"properties":{"commitSha":"5c1bb183629749e2d8da82f46f27082f0c764589"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"22c3d95c799dc465bec3c30e43ee711860f3e5be97b62e7a5030dbcdb1840b8f"},"properties":{"commitSha":"5c1bb183629749e2d8da82f46f27082f0c764589"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fae4d6f06e80da1974ce4155d94c5f4841c8ce2b19590fb02688d450941a1ba8"},"properties":{"commitSha":"53df2c671fff33b1f8f624432372c2401db8b1d0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"187eecccd833e93a88f99989a15b7ee4b73ae9740f03e36c8c813e8a67fceac5"},"properties":{"commitSha":"53df2c671fff33b1f8f624432372c2401db8b1d0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bd21fa15fd011ea8f0eb7a6dfbbea4274743501edb6ff7918bd86ad642e40492"},"properties":{"commitSha":"53df2c671fff33b1f8f624432372c2401db8b1d0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7314ef3a11238265b5fb5767742d75e0b900844f50935892f929cc5cf5b9bfe5"},"properties":{"commitSha":"53df2c671fff33b1f8f624432372c2401db8b1d0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"784e8093a577ffa217f37b9fcc2c3b3ca99b606cd10fbf23b77662701eceed72"},"properties":{"commitSha":"53df2c671fff33b1f8f624432372c2401db8b1d0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8db4a92d0117590530c46868e2b40671aa1380e57c05bc6319ad245595bd8197"},"properties":{"commitSha":"53df2c671fff33b1f8f624432372c2401db8b1d0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9b502f36eaf0672be7fdd43de4ad174e125d871a2359343af15d723cfd147c7"},"properties":{"commitSha":"53df2c671fff33b1f8f624432372c2401db8b1d0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"778170eef25818a50b84ab8ce5e96616abbf96f42560e237d04e972d117eaf14"},"properties":{"commitSha":"53df2c671fff33b1f8f624432372c2401db8b1d0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"659bffd7c99b3b81e72da2569675a470d78b3810e03be4db7aee54bffcd88464"},"properties":{"commitSha":"53df2c671fff33b1f8f624432372c2401db8b1d0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6a9436702e0fd19a98ed65195d1f5f56d1d8faaf7a1c819011e95373278bb4c7"},"properties":{"commitSha":"0766018d430d49a8f5c8e2012d412b0fcddd8df1"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"083b29b822236b208b8927352709db3b713c5eeb69cc192d7ef268045073f1cc"},"properties":{"commitSha":"c3f77fc17b661e3e2fc7a6d5af84d0fad0cc6d99"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c05a36c7986fe588260b988923d35b0009cc5b2d299678f54a6869087e598704"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cab35fb30f8ddf25de1973d52e8a1959f0f82e0fc3f6751338da5a01a2523509"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7a594d73fc31a935214088623ed04757abb3d2f2ea1c40c079722942b52a113c"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b5aff45670f2d058d8729a529fdb2b4c7e44ca69ac5009c0214efbae1cafff3"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"74f520baeb8e53faad5d61350525290e0a73179983812109385d60c4e515e066"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d37475bb1cf2567bfc0ddfaa68c7965d6ed6ec33ed07e86fb1d210ec51cc4407"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a21255d56714d289b13e41de96c2c2df644d2aa21957f90d865631c55a9275cc"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ccbb46a585a993c4841fa2b2600961aad5c61889ca507842e94686db3abf7682"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b49f71a5ed1c5f0c347c9036286a8bcc230a9e8e0f7bdff316b8ad920e938a82"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"697d7d133cf1a0920b03afdce6e1045222a4d4d43b2d4b2699ca86d367436f76"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"07067906b27898719215e16a7deb5937e7395b5fb16a9d573bf05d6a317188a2"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9c51aac05c7d57f2ebe7dd0c681abc810532f2ee7cd84cecb7623f44cfd8cc0f"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7a88c32b560bdab4321f78f2199fbbd1b817e20c2e7b2c70337666dd8f840fc4"},"properties":{"commitSha":"a0132f66853968a899040e8392974eb698dd2229"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"19e0ad05973b55ae181b0ce6309bedca9c230d93e37475c482556014fc375dc5"},"properties":{"commitSha":"68a6c1600944c4c21cd5269643634c3119949538"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bcf0d2ceab83e2abdef2aabc0bcc2cbe610a08019092942625a334c966f8dd76"},"properties":{"commitSha":"68a6c1600944c4c21cd5269643634c3119949538"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b046789c0caf250daa07e9094a96bc3d814917273606896b3adea781ab605558"},"properties":{"commitSha":"340119b01c46b95d7f2c34a2ca17b919eb417c85"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"21e853ea8ba50824ea99965c7a22071fcc2f3cb39b0efddd840f6639a6794c19"},"properties":{"commitSha":"340119b01c46b95d7f2c34a2ca17b919eb417c85"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a51d04d1c21d6b5e727425693656ee756faaa5fbcd53410b172e18174b8af59b"},"properties":{"commitSha":"ad4e0077e45f0edf2583c2b5a4e64481110aacd0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d0f5204804aab0b93bbf12ed2023cdf583d1e00e0b7dd3681581b0a565a04224"},"properties":{"commitSha":"ad4e0077e45f0edf2583c2b5a4e64481110aacd0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"873336f147e46f66d59877f50981c7635423aa701efc51e9009c63a1a90c447b"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ada729a8367eebececb328855031d7474a823ffedbbf23317fa203830c33ee97"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"352924fd338a96824db70ca131cd456114efc535128a1adfac81d94f4fa337e5"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"39c11d5fff839a6e3fc34097776c039a684aab38ec55542a1641c751c3ba4eda"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c7516be3b05a36b4f0e114ffe0d72452856809cb799d5830665fe884824da475"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e87e6f07d9c4b58bd5dc60f1c5e8a1cf9cfa86b6e7d3f058327290edf26f9d8b"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c4e6e613520c95b8b1d962452f584d1bb97c1d6f991437124235446092182545"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"43760561d143fe4ba023ba73181830d0b5ca43a53043c0020f24acac1b91f33e"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2e21e8c287454f6b90d948678d531cf82bc112cf7eb9a60e068c79bd0a2b8a46"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4c95a35b2652ff747a96d6e00de1526c691f3e22da177f2ae561ad41a17a70ef"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9395ec8068dc2ad7f40c07324aa162e9425188b7c1b774a390db5fcfdfc6aef8"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fdb94a57130262f83e96d6a50e252faef507816e2134e87e0d24e317d83e1f28"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"127ed1ae73c404a29f411a350dfa53366d9dffb92662f9f1bb76c37cb15d2a50"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"df62559ca53b1df9a585c510839f44c43e8d1c27b373bb57633c0f1c830e0565"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"53cb313882d27b9c1d8e1242ef2ad8bbd959b8e9d1e708217630b4635d9b23d2"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6177127910241a4ea7367decfab6d72baa0e1c523fcf7b2f87f79628f2519c71"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6761f0dc0cd6b8226a56745943eae8e988f9c7b8a74dd2f2265edca5c22d4b76"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a52df1078b1c0ffd92d6bb305cab049b0710005a9708265455f95e4f39474624"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4d14425322b3943f93bedf017501063b50af634092ce2d97496a21480e42de9f"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"00b92d084bab0332a6908dbfcc159d99e4714f3d1cf3ecbb663f9ae4e2dc9d61"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f27335a5d9f9eb5d1bc3e626c885c62bcc6b796651ae824296a598a99f6c0449"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"27a34ac88573bdf80eaadf84b24e30d2cbe7a600e7ba3350d8f873440b068e18"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b95bbed2dd72260930acb975d69dc3de239370f249f77541c70fbba398f94f95"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9acba646f1567ccf45d4334d1e755ac9e404e77decda6e18983ba6fe3abd29f2"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd10c49c86c29586a1bbd7eb76106a4fd138ffebdb58903c7dc1a871413fa71a"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3a02f8f893830f10131c7b01fa13ac8ac550a406c313d76dae226f15014249f4"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f029ff915718d2ebd82540e0c09b6d25517d412f4e2e26ba6a289f01e8f6ab65"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3ec816a934662d5095834fbcfae915ec77f7b7dc01401d9fe001c1963a346a38"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3ca73334eabdc2d21d1352027c83c9ae5f36c76189afe9b9fbcde3840393c65c"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4205cc950a60fbea0a16a7a0bb5c147dd80c9d888b34ebca87adf92cc220a8c9"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e84b71c9470d3a8baed35e579d95f29caa4ea8a5d0cea6c8495f1b862010dcd"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"51b55eba4f1117c330aeacc1184bb01e676eeb1296264c8d6ab50253434d905f"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"671dc5a04fe90f02018a0ad1559524310343e118e4e4940ca87818bfb733ef8c"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"327e9a4e3184e22f4cedb49ede985529fab41241f59490351822264ac3ef357d"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4e353178a318d6b619b9c81c6b1c379c66177538fc0dc776c4d1316f6d155bae"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f68c5da6513aa7c99bc268244f7bf84586033fc487d0e3b4127302bfe6b016f"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"252229dea900534abc3e214a227540f2ed3475c8e7abd129400e9087514fd253"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6046578b74303b3d4b3e048b72c4270d1a92b6eda73a829569d6a0929c878eff"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d303d8d8abf8b8dd253b75abbf84254ed909e3dbcb7f0e7825e02515e4714aee"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5e221e82afd12bca42de90ae0a08f9072e816a805e63c7d3f41c865c613c30c"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"508dd16b29f693c4bacf10f7cd2377a93fe4be4ab9947e6c9eae4c78519cf7c9"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"994279e5c6d3596e84463c5258744e9fc514056051e32967ba43c23ac7334f97"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f45fca9caf61f03b800103b08bc040e195532b2c3d5ce5254c5d726dcf4969b9"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b21ad86dc6817dedcb993b9b62dc735254c7f0096960fbbf57017140ecc3ca9"},"properties":{"commitSha":"6982a317e25828ba3372326775c31d8528d21f8c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cae8168ce9edbe468cc9c50681c8873eab6ea528f241261578d4d7b332f2ac9b"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e2845345476c68463342d789364c71ef0aa70410e680eeaa10321dc4067ad70"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"95188c20693d7e35899e6b4b115c5a72b97a82010a9f417d2fe1c141c901f3ce"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ee65bc0d94a4e25f6daa097f23830cfff78292e91c0c1cd8e205bd62897b62e3"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3b728e72d32eee3e14b0d8036efb5036b5bdc16cca0124898605ccaae098a2c4"},"properties":{"commitSha":"53df2c671fff33b1f8f624432372c2401db8b1d0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0589c93985ec5363d27922406a7aa0f1a5ce32936fff8dff20bba591478b6b5d"},"properties":{"commitSha":"53df2c671fff33b1f8f624432372c2401db8b1d0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"57ebd08aec8dc4adf15d0ab860c39f8aa66e11165d06320dff361b8bb9422cc5"},"properties":{"commitSha":"0766018d430d49a8f5c8e2012d412b0fcddd8df1"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d4253c374dc5413f910ed0764ecadf5a10ca9d3a521d8e2ceb729ae5dd712164"},"properties":{"commitSha":"15b5a8a2ed43e59e07c04f0eee36cf9ab2654496"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4af5b93138dcc1c2d3ff38fd06adfc3dde1d493764d2ed4950bf3c3556288aa3"},"properties":{"commitSha":"05cb9cccab5e9733cbc053972e2af8780a44faea"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ad02189c9451eae2251ae952aa5669cc8446d990e9bd00ab131218d16b7b8f1a"},"properties":{"commitSha":"24e268557dc53a930c267b5f1579bf92c77b6d46"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"03dace98e3a572a6b3d31aa8b0c008a28e6321e9b35846602a6628516254f0e0"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"443529c9d06d312d05ce6a79db012b584c05789855a16f48cce12f11fa7a1bd5"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"70bf78df1f720f5d5e9960dacbec80aecd6eb529e48189648ab8f6fdbe5894dc"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6bc39491f575df245552756d77a0eddd97e8db1f367817ff3515302c6ecbba22"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"86a84d89eec7b7c977669a9e7a5c1a2ee59c7eb6a1c7bd3fa485011c6db7d4ca"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"47ff23847d5931c2e629685f9bda2dc29da4702578640e24583ec6fb413976d3"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"262d23ea0024dac748442120372edf8cf9194eb6d5020ba72c76ce302066864f"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d360e0c467edf82935933b767c58a4facd3460c7afbbb2124287743a04c95810"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cd6352e3056233c73bacbba71d2b5bad96c8c3a2efb38be0920a901d17219da9"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"906d07bbe69b604a92a1dd0c57d85b28b3b976baeec87229ec05236d6615bab9"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5628662e91de7c2fe316f1b5c5a641297873859b8e00f82454db7a23169419e8"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"94aa5239733909bc43f6ce237cd81911247f6d1090157ba19b4c2e430fb39155"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3fb8df0e321bf3da5a073800efa4d45d31abfda5ad115c71b583d690ca7e9a5b"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a685bc684d6c2e2df30f6dc6763d9f006e9dbcd3e4dd53fb64f0d37441b078e1"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b52cc84e61592e5c9a6920c72f9d27c0018ed1bfbc5e15442ee21ee95fefd47c"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"244e98e8f1e3df16ae300d70d81b89e0e4202a07386e7f9115e06e7a8a00e289"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ce8dbca6db803ef0713e47302e708f994c17fa9aa0e2b86998d039ae19f2546"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ee4eeaec003a1d84ac30a5188cb23ee5ef7127aaba9e5413cec365477c6e1d9a"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ececf0f857cc80c90ce46c1972c9ee3e8a4fde2deca0ec823602d9b5904f82df"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"843455eb67a3f1b9d6fca8e491ecd13c005ff4b6813d3336652e0702911b0063"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e735442e4918dc5a9c31d72984a0655f5e2bb550002f3da06f93f3768b5d221"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"635e156a2ec84b0c03a8027ca32020bdbc295405536cf121af68bf30d5d0e588"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"65d8ef3a8e4306e76707e17b60ce8924b63760a4c1d764e895a745f80b3c7afc"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2d70bb082da390b6c5a68543e2a240e223548cc00e808611d9d5fc4f88de083c"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d0ba090f7c53a70f2f3047232e4e3237e7167f61206626a24f03a6fcfd34b18f"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"82c58c35a49359cbc1db10637c4848900570f7e81e021428205405b9962c1e4d"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90d0c4c1a60eebe1e92d6d345d214398679cff8a7faf6e9429584f0f5db545fc"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90d841ebedd2afa55e380ae512e6951c827686ce32a6983aa11136915eb19560"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"94a5a452aa05580124234e6ecc15901a75d86fb6aba51197795613914c0c0c68"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f5e994dbdffc7058514024fc4c4cdf3deb917468e4a618176ce45db806db6657"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f8a290cb07a1b33f662eb81869334d515135c343766f9046ccc11e7906a84fe"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c70c81267eed4e58be636d10bd4722c7173dbdf3543d3345a1751bbbb18fe939"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"25d35d727c28851e41bd7073a70539c15db89b2c36f673de1c2f13c1917742e2"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3741c57a5fb806c174485e480ad708108c7c449a1ac252bdaef977f9c97b392f"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e6800d40a9aa5acfbd40c44e45d5e82938dde953527d277ed438787047e35ee5"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1939545b2c6a5c5ef72797586a6283c41bb604b49280be388c5849cb8c3aba6b"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"00de11292dcbc47a434a4b01962b1a2de5faefe1019cfa66586c1d7a9ecb416e"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8b4226cc1482246a96970e081212cad8d79c84a6c64af2cccf63af73c48d27cb"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"188ca2ea773bc6a8ee8428bcfcd2bc12d48821a088546f3bc08d9a5b78cda541"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e2f68e98e0916c240e542f85d6b3456b00720953786cf077e66d2b1b886e1312"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a8388dbabbe44200c824f2052c05528996b51c3352da2e36bb4ded9994f2e10"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"408b483e9a53b308661eeba1df634215aa9a6bead427d6340608b7e419822018"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c7f8bdb3e2531f89f9596c5c04474cd15467ba8c6110430a1898de6b15423250"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"525b4ad14bb694e1cda1f23b247d16facde4671ecf69b7b592077f625c308170"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"98f5ca86f4d8ad69b91d056908629d772d650f423f3336ebeff7e5bc71dd23e5"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6f7a4af3887ec8aad346dd5f46cbb2c7b211e6908245d076de449087bba1ac47"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"03394d0c86d32b04b4eed2cdc8799d757a1ea5b378e016328629650344d8c5dd"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1825f9ca9054f30ce142ca68383df5dee81e2dcc697cad12bd7c92746a8db3ce"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0acb2a762ba1e1a93f59a787606b8a02dc9b04938142b3b48b75ae0694bf5123"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c90cebd911bc5f352e17c01227ed41d581422f12f0cb98194b24d316b9f28190"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d1a009f3cf88fd97e83fc57eeec43c20816cb1aa2fa59ae39ff7927a04d26406"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"faa6558051efb4cea432639ea86ecae8a5accfde6917be4a7516ff00177174ec"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c7cb462beffd6d8dba948ce1abc6afcdffe14d778903c85090610187463545ee"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c953f18ae8d6cbe8c1896ad783a17a47fdc3254e773303562d16284c290c083e"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4792edefb80e9c6f15801a7ce382c5b0358e54b552e0b15627377692c1b59c81"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0b2f903a8db10c3ea0d3bfe5cac1c51610e5d76ad074edcd39fa3fe1011c83cb"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"25fec1714b392b8f784d7728a09703c0e238c8d31bf7cc1d288c5e89d2814300"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3678f7621e2464b7a5085928a216f2f285bd67f6df95b01174ac76233e355c3c"},"properties":{"commitSha":"f5c76643d66d17d46bc15b384c770c6a5c74e0b3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"24ec021ac67f47a3312bc156a40ed6b4f2c15e5ce7c0535c2af1918fde0de7ca"},"properties":{"commitSha":"24e268557dc53a930c267b5f1579bf92c77b6d46"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"09e458a6bfbfe71b7f8dad43c61518f85d6f97103e4468b698ebd0ed71a2eb81"},"properties":{"commitSha":"24e268557dc53a930c267b5f1579bf92c77b6d46"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0d3ce12c8a2d9dca8a811e2bcd56b582dab9eb6b07cce501d386ce1106947070"},"properties":{"commitSha":"24e268557dc53a930c267b5f1579bf92c77b6d46"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f9083123b9ae23d675f1990f25379e12ed63c8e14321201bc2db7b1efb7953e"},"properties":{"commitSha":"74aeb102ed34d8c751d4cc92cb19a4c76d1bbc05"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c7c2dda1c712b83416c68019358d4fa51205a9ad2dc9fc7553f29cdf11cae04d"},"properties":{"commitSha":"74aeb102ed34d8c751d4cc92cb19a4c76d1bbc05"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d168a23f8a3e666fe5a9b50015adc779103cd39089219e34d3ede622391ea611"},"properties":{"commitSha":"74aeb102ed34d8c751d4cc92cb19a4c76d1bbc05"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ea0ced42d078ad6a0b14a3f57101d30ba94c04ea4ff79abc6186c46cc35a1ed1"},"properties":{"commitSha":"74aeb102ed34d8c751d4cc92cb19a4c76d1bbc05"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64a7ce182e8671248c6057246968f5aab8c6ed5365bb103ae356c725c57b9943"},"properties":{"commitSha":"536f8f29b33b7db6d3b13c55992f2a63ac008a8a"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a17f4bc49ff702f1c64761c425a35419b338726fd4363b7863c8effd97cd2dd1"},"properties":{"commitSha":"536f8f29b33b7db6d3b13c55992f2a63ac008a8a"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"60d76d986c538ed5de7b04fb608cd9c628fcd0294f636325cb25099d5fa0a907"},"properties":{"commitSha":"536f8f29b33b7db6d3b13c55992f2a63ac008a8a"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b991f24a1e6ca90defc477cb12fa367010758541404c19a47e57958a84042bd0"},"properties":{"commitSha":"536f8f29b33b7db6d3b13c55992f2a63ac008a8a"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"157d68738952df6ff5428a349df221af8e5692726b43a04f989180dfb3707cf2"},"properties":{"commitSha":"5c1bb183629749e2d8da82f46f27082f0c764589"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1773ebc7a06863a0e3f320d1121eb0f1dc9259d2b516a28542e7363b89cf5036"},"properties":{"commitSha":"5c1bb183629749e2d8da82f46f27082f0c764589"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d6c9570441bc3026e41380f228c7c24459e8643bf3c3b47635dce308fd1ed1f"},"properties":{"commitSha":"5c1bb183629749e2d8da82f46f27082f0c764589"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2164b82afe3a4638aa0592a11dd64a936c7809bccb649430f3f0f3e9d8f56fa1"},"properties":{"commitSha":"5c1bb183629749e2d8da82f46f27082f0c764589"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f2e76b6cd8439162d0f4d5380aa1713e70b3d77de0464289299369657a0763be"},"properties":{"commitSha":"53df2c671fff33b1f8f624432372c2401db8b1d0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab353daa47d383d3adfdd67c9079bfa0d7bc944f671f4f66b04ae7de2823b7af"},"properties":{"commitSha":"53df2c671fff33b1f8f624432372c2401db8b1d0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4a5f2549140299750418349aec6bf0ef5bda646cca1f7518cecda9999440d807"},"properties":{"commitSha":"53df2c671fff33b1f8f624432372c2401db8b1d0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"726710cb8b793fa927943a5bc519f6ea6238f19656d27901818270e0780d05c2"},"properties":{"commitSha":"53df2c671fff33b1f8f624432372c2401db8b1d0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a9741f46c8d0cc3fbc79b392acef68161e2bbe9b159eb4d88ab2b66c4c19c66b"},"properties":{"commitSha":"0766018d430d49a8f5c8e2012d412b0fcddd8df1"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0d5ca84e2680a686baca15dc39f7f55b2e953740b144ed113c2458cb4ed7f402"},"properties":{"commitSha":"a0132f66853968a899040e8392974eb698dd2229"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"09bb8d9072ae8ac69f1e5cdb1641816688ac1dccc377a98cad0312bb370df881"},"properties":{"commitSha":"a0132f66853968a899040e8392974eb698dd2229"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7edb031934863e5dca2ea3de5db612c2001ec6de0ba9b9e5e4cce52030a7f755"},"properties":{"commitSha":"a0132f66853968a899040e8392974eb698dd2229"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8a6683456bab63f0c362a0ae91ff8735eed685fb583c389cf787363cd6193845"},"properties":{"commitSha":"a0132f66853968a899040e8392974eb698dd2229"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dcedf5aa68c47a4af696340071111d6f5ac370ca7c9ecffcd89cc0995dc909a7"},"properties":{"commitSha":"2db544871e29ac38d1aa8085962b5e02e5973ac5"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"acbf7d1a15752327dec264f06c283f7581194b8cde0ac5a96e6d56f198967721"},"properties":{"commitSha":"68a6c1600944c4c21cd5269643634c3119949538"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5789019c5139e827c3f732df18d1520b737b92af181fd2e46825c360095a4579"},"properties":{"commitSha":"fc0a0da7cdb03f0b7abf3f298ea667e2a1dee778"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"22c649fa8ba21978f298f19bc143be88c4c0c18aec1f43c91d83e3d366f10fe6"},"properties":{"commitSha":"c3f77fc17b661e3e2fc7a6d5af84d0fad0cc6d99"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cf5cdc9fc3c80690e7f73e32935117b5d60403835fc3cdf18c4be7c123f0a385"},"properties":{"commitSha":"d11a3f65830d4fa11a168e16e2879e96bb944a5b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a3137f2706d27fe3d893f1e489326ab7739aa759a077f6a920bdb00699acd97a"},"properties":{"commitSha":"d11a3f65830d4fa11a168e16e2879e96bb944a5b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ca2b8cc14408e0dc52eb0e381be57535972d8b274215496ec009a798f80d0a5e"},"properties":{"commitSha":"59dd50cdd927e8a13931cb6c9f642e61830bb597"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9025351c66efb8827a0ced00e012230d345c7f59a1dd36738a7f6e2c30fbf84b"},"properties":{"commitSha":"59dd50cdd927e8a13931cb6c9f642e61830bb597"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4891e8c03d352fcdc2e5fd333def358cea20a1979f4958bd909f94b92befbad8"},"properties":{"commitSha":"59dd50cdd927e8a13931cb6c9f642e61830bb597"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b4ed3e76cc9ba5f84e60f628123a3e0c2013711c71bb2338636b1d0cd97f207b"},"properties":{"commitSha":"59dd50cdd927e8a13931cb6c9f642e61830bb597"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a32d0775c70571238857f14ad877d734ea5d230c29edaf556f704bee82ff1b50"},"properties":{"commitSha":"46938664998d9b2646915d8924edb2f0c2bd6a9d"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f1678e7cf045dcdcb87129a17d3f6478784332b09a9f17c3eee9b49f6aea756f"},"properties":{"commitSha":"46938664998d9b2646915d8924edb2f0c2bd6a9d"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc00731ba8e63cec39f426dd0c21bef21ea8b87d83ed1228af8452f42569b60c"},"properties":{"commitSha":"46938664998d9b2646915d8924edb2f0c2bd6a9d"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1db9cad65932e8c7c3b477d071a628b8d81aad1c2adb4c6301ae61510e1c6b31"},"properties":{"commitSha":"c3f77fc17b661e3e2fc7a6d5af84d0fad0cc6d99"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a386d0557eca915bf36462b17778bc96dda91239ba7a6c080772bd6559966e28"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"870c2d9466ab39e553336ea1261ab0644da0be2c42b1bfff1c92330aec3a3cd6"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b669d63686100cbe445b82640e585f2ae12de83862336af6f8903be0999c2553"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b4a04562bd4f053586366cce41fe857863d1bd05e9e903737c9c7c6d61487ac7"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"75e6d00c807024fc32c247c2e126b30750a49f7aafb30172eeb6bde27904d9fd"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2fbb730a56a077c640254ea29b712f9647e14f206c0276d29b5b9e0213e73eb7"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fad116e449275cdae99589812de937c114baaecde9f131531f48f7c581139a40"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0b4fbdd6c4ccf484be9d23a069a7e348b6b199cb3eef2d7360c95fd41306e9f3"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"967eb02d898221b4d2939c4c51c2c578c085d186001d6ef37f9fcd357e72ac3b"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c0b49450f63072f1db9b73410494eb0e702e6ab38f89faabdb3e01be81343d19"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"230207ce6db50c36374b6f8d27428cf301cbc9ed48fa1a4d6f41bcd3025c6caf"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d280efc40fff6a2eabd719ac31f644e04576e87cf6ea8d8b2917d47e1b6e0481"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6818d6b6716d858b6472a257d3386b38b4a00dcf2581167375efa05ff3f4146c"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4cad89e52d269fe6181bfc5f385df379452743289d87c7b9294f33f4f988e8a2"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"25a537a0af4ca101c6d6e156300b061ed2efcf989d165dd10dbf6e3059fb4cbd"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b9d6189a2e16aa4fcf0488411da521012b3bd35e0891fc845d14c25dd1048a39"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab196de993b99b803972bb11c4354f68321121c2c84ebbeb1831a1a4bea1f892"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"71f304314300a16a21c3cbb4a8293b6274458b1590dd0b16e219f9c765586596"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"257b561e2ceb75b288d3d9cd9f188aaa7382fd2da1ef9accacfebca31133fb45"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6cdb24e0d3d2a4f58bea74110cb71b7719d96d2e0fa12e3eff3e9ae7d2d271fc"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d712f32ca7c5e921175b3e277a49ff4e8f096a6846bac0c07fa81c13ed672945"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0603f293974e6dedb2a1accf7fe20fcce60ddabddfddd7fd341062822b311e77"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bbd8717fb2c93cfbf2803e6a120b082f2638c7edea069c038bd2daf561827324"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f1f05247c9fad0f4589ed3eb005d84f2b6ebc482682c1e9443a4ffd5b85548d8"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"18d09b3302ecb97c30f27e44ce723d92a07e9d717a8eef13399f0c2556754005"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0df16a5439e9395c8404b8ab1e4bb96c28b839bd1ab84b4771d728c5ac3386d5"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"31899184203764fc712ee39cd774ca854ecce141c2cb4726ca1c6f4c8fbac463"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a2dacc6a31980af0fe1b6ed6518a560c44794a3ea1d04ca6ce9367ef1bd19ca3"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"36f80008cf275b1e440421641a09135b6e2d3bdfbbbcb1b74dc9197618bd1cf9"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb959dce1824c10aaeb2d2990b878bff386375ef7d26513755c0af5938e92439"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c0b33c8e48d7cec7ad3ec8f85ea15c23bcccda109c9b72cce9ccad809479274b"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ec40f52e329ee6ffbb18f144714c525eb742e43156542b0d09d23992bf5eb7c"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a803c67cf6130c11281e59b7e4a4ca27b12bf11beca7bfacb63ddec91013f8ce"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6894995ce5895c2c0dd33a7b6122a718be2fbf02922c49b9c980b58357aefda8"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d7f7c9427503459788415ad5ddfde9982bef55b6742e90d3b2def3728c004c5"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6064c4419ba68bbbadfa289a0a8c432fa5b1e11b8b14cd915ef16ff35738039e"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6c1c9b7a544c6b3d4f80db987bd3f65187fec62b070a741ea4a211b61bff08a3"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"07cffee98ff4bfdc56d809a5e24661132f4e6135dde98f1deda19bc567151f16"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1076321a6367ed506ea248b142161c71bd76c0b418ef79a9cc57c89c6af11197"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"00c22e4b40ffc421bee5994a1acce584e056a20cc81d6d7e825bf4aefda14236"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eaeed74c434c83f5c883c18f4fe2fb9a704f7286eb1989a2eb092fa47b2c36fe"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8ed4d2f5301f01aaf8eca72cd25516571b27afcef337b594bc4682568a6c1f09"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fa28f37065aa49d8d2f31903a8102fb87095a5cb3d3137cf614cfb1e4118548c"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6fe6d6ebc1fdf3b451463379245d4be690b19a4e156c79b35c30382563dd7a84"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"437afadac596b01c3d315d4d03f942544f34f24e5d41e414066bdefaa3f272bc"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f95456e091d01ed2a3488c7133108018c40ae2cd8695e182eadc7c011a70b86"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bcbfea7a9d2a3a445754408317c6b93c12d201db0f7546e584fe66b471ae88d1"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bb8337cc2518a441a6f1f91139e5d52e5e429cc2d13d8b9f5126cbe6e0bd1d26"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"13e6b92a46686fb07462b871d4718f83e947269f46fb27c9aad0e96c0b652451"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bcd1036e5f40796a988bca9a37594ca661e7750b0f7d042a929cdb73eeecc644"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"86b540e9942699bedbd0b058caec5c1de3c5eb9baf24aaf05208c25784c1c64b"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b03b5c1d03d78218cb78780f56fff99f4e1149ea3115a399352215acb0523e47"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3dd822f36787a300db1676e85c993b80b53b262898601763e1e9903500e6a2a9"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b4e995b9cabe823ae9cefe583762c7bd89179ee3177e9edd135023afe0e7c5e6"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ec262f1c54666f8747c6d29a3fc66f6b0b726d3a17e8cf80dc7fbac272a46e1b"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eca3f746fb4bda6314ef31aa949369f8bc984c0530fe9540abfd170281e828e2"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"786a34d2f844623fb687675f80ce9d2e07f3fb142d0c896231a88f903cbddcb2"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"04ae31fb45112654667ef52dec85f281edb9e836360364d65d050980aa67ac0f"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fc48fddfea2b3e8be1637c58570221012c3349500076d00e0f44117b0d32aef0"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a6a5356a5ef0916688788a092787c358ff4fe93c39138aa6a9f8329d30803a9b"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d304e4542575f0ff5afb92e32ea3278cbcaeb77eabb99f2fec44e7a482595e6e"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c15fff9b41f01f8a2b7903e808fd0c5885b3aa1b7627834b0768c9b241b1ab39"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"622f74100fd5215e8e483c250896eb13f0e59b5e17e35843fe5578a20125d9c0"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f389fdd6359e5014dd2b6c0e214a04939bd296f783bc46d491346716eaae2fd"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5abe4b8d7a22f9396dee47bf31455b2bf8d508e748172b5d3c40605653d09049"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"155f4c6fff5680ac06fd68784c749d3e26aaa5b81eda789866d38d0df8d65f40"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b28ffdc5d48faa786e6945dc3abf35f0484274b56e9ee5fab8b3f665631b9d2c"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e46ee3d37e055a93d0b1001b6dfeebfb5805754350182b62be61691917129c08"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b336e0886795e1306058dd54c644af386eb7fc546e9e80d62c3468bae5d7eec9"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5cd15d931fdb4f0da342de01c63205000678e1d6f137c732336b9f6010cda774"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a018462f6ae0f3b63fe110273c5405711945aae63a4df09510dd028aec7a9135"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"32606327760fec2e5bc46b97c80b2a175739fd88a21baa13125c50f9e04aa30a"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3efacb53a6f2a9e8d42d7bd340fef634c4f1d9cd211f145d81f04e9580dc2ce2"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c105679c3665f0885c6f8f27fd3b3680e974a32836b13c4cb6703c11a21d255b"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"59a20d1c724026758c61fe8d491cd789baffc7de5b2b981585db22cae57de2a4"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d0989ce6e2c875aa22c652f8d6d45ec66667c9448e072d6eb10d2ba684b708a4"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c9545040937c0ba7da517b0430e04c8e85d91826c707da7df64f3b03d19a3eb0"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3f553858a4d3eb5933d7f93df82993620df3185c597b6ee87181f8852ee103e7"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cab616239e06381f6a7326cf3b459ae3a0fc5308091d5968422d52df79c64189"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bd9266ade650f3c602efd5192a9429707e5c60ce2f53352045e803422467dd0a"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9a655ac25184ce69fc1339eb8eaad63e9e40c1b21ef6b8d4bbbe0c8d0fb665eb"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"243efe9d320d90266673207ecf027e159964f4ebacc927a59a7427f2d692887a"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7368999bda61d9140fb01c5b4d7aec6b22f59398ea69cb2f5cae81d599bd381c"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"28ba9eb5f9df42f4849ec386083aa94c5787afcd0e9feb8d981a2cfa7946088a"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8bef1fcfdf0bb38a343a567bbe09bc165ede9623ac2688e232ff5312b4683b91"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8a2a18d1eb070b92ef8e8aaac485e07f7f5b47a2d58a566e6cee60e1fb4b10fe"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"91dd1954495878b1313b0e471fdce688d55c00b8264fef5c423782a82e4d47b2"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e7b1b9b801c063823dc2b3e25893afa775a8e285f0b2e4af40503696ef29ff1d"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b0a866990f431aa61fa9267d65387ed8c61f910a4f96ece95cc6c96997f333cb"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2991ad0c4f3161f328589476027db8b355d34499e9429bbce263739cdf1f096f"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5f006d773d8a5440a35680e97f91e912607869f41530a3d711109bd6074150fb"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6fe10f5d3ff1f910ee4e3faf8105a4442b29c3700dd77748f6d80b7f787d4825"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9852c76e64f528d1270a182eeaea182cfa0cec9e4cd27c7b1add26d87c0271c6"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d0b4f4c83d715c748db526cc89188f1649d3445afc44b1ff77729915d5d151be"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"13b9476e07f729cbaef00a576bb187023fb0ea9f1ad57bd4d443fa11ab93b91c"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f16f6c79ecb6dd578789ef2d7d1fc46398a9c1cfefbaa9b484123f8d617895a9"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d596d8e46fc9e542320e9d56836acb4522e4642a158d9a6301eab00c96804769"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"25ff3fe1c00c79311a9dc3cda413b3c3fa4422fc193e1ab5d9ca8dec47a9577b"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3da65462b4138de2baf40c62165710db1b3223bb1359fbfb0a1c0da84537d66a"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ce02df13de84b23e3d9c95b6f560800da5cab42d39d6a352d3e692eab01b9126"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e014756f54c42ca8554dafded87ddfbaaa84d933249295fe4a85c36b749723eb"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"73379967b019f9200709c2ead66167b5ab5e8745825b9114bada1f2ebf49dc55"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d4dfea2c49d6da926035a362e482680aa39f74b05353c25279e9a948ffc9c123"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f78f88ce018c5aa75833fd0ec80c34a79cd50bf5d33181b622f28f9e105504d"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0965c123d3537be03e75de7914795c64d10534f79a1b06eeec88192d0509a209"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b80c72d50f2a74ca5be289679db47ca0863d05a53bf363354c93bbf32cff76c6"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ca923026f4afc0f4fa1f1bf9afcd541ac3eeb1d55447e60e0d8d9654c0ded0bf"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7d93941ebaa8404afa973c79c3ae265ac78d363cb3b681dedff72a699191749c"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"13bf32087251ea8416046cc07d338e0d503e433970c4422fa98a373b184364e3"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"77f22cbca163da190253a0edc0088870624acdbd5266a6d70df941309fb7545c"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"76064778b22f84a123549d9697564380e19b5b6a55b54039490203f50211940a"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"beedb42ce0aa23e342861c9ca34c5d2fb6d145c97572d18fdc93b48cc4162a50"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c6453ba4c12ef7eb9d25fef2d8e385d9fd723faa3bbe6f3f684a8285cb6a634d"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e11a6365064509f5ccc45d76de096cd81ef73d50b84b07e0d0b359ca08db9fbc"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"df693b20a2278188b8d6a719d4cb9da7fa136ff96e6594b5ccd30d0bafae9317"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4020d588e605937a7c338c1c9285a7fe9aef0d3fff961b0554b79e403ca1b3b7"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"81a5b7e4c86fff3bc358142a5503b588b490f9d745b5a2fb8ab932a6dbc09133"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e3bb023eb5a17f9a5190e82d64e99d04d7d5105a5c0108d2ff5417ccd08454d6"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2421e348e8d7b7f910f0a10891b3305a25002caada513d50f45a3184f63a8a6a"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"94396199e42dd5104694ad11174f3d0ef534a060ff684f87e132f9022e1ac82e"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"789cff3e7c44bd8eb3543ed3e12ff5d97dc3dc47b6cafe9c4cacfacaff332aff"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ede062530e84d64b440956175c20c2fbb916442e33e1b24b1ef59261687f9e5c"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"28e784eafd381a993c7299c56b70a14a34bdb5059dff38c2e92aad0b65bda0fd"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"56d5951c9672d762ae52f3639eb292f043e6f4f8379d0b0354afd95c887b6d65"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"06895ed080bd8818cc200afba0e18b83478a516ed3bae5132fb25f48a1c339a6"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d77787c5e26749d0148a099a6f3533c21a68f2d1c017f1e6741dd9eca1b5ec0"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7b397039f98eb38871a13551d53b7f03de60d8fc0cff554c17bd56ac46f208d"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e934cccbf287a684b58fe9349b16a0b969e6a85a498599d471d807b484020ab2"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4e9f1e0929cbaea4036ca06e9e51bc5fef6e731db94195852e1f4e5b7b1c21fb"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f2f63c21a97bc12344398f57b154f090634d62eb1963722d5c9f68d6533a3499"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ce3ea29833983036a2e9649bcbeefff9d4a0a623f6aad684639060340ee87a0b"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e8dd16f8ec23f4c672e2536c9e1d66652c8a4e83c55f20a4c0888cd6203f1b47"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ebf92e7bc0dbdaed29f4a05f16463b0e53dd01e6ad7b3614273cdcf4ebf6f07b"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5f609bcacb20a5f60e9c6f401ddfbae51255c052625d98daa06301e2d0d9bebb"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"475ace57f59c93e0b60d8a4c1511cb30daf5752cbed5490a6abe896347790542"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"957837a0da15dd36f72f8063bbe91542c363fce74abd2a0a4cbcf4bea02f3184"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c675d3c66dd6b8957a05ad8b9eb5a1ea27f8d54a161b93aeb8cf1a839441eb0b"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4bd1f8e1643fa0811fe49849e8bd1803e550e35f6914eaafe00e4a3459a9f192"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"44f6f974680e3a5d8a22aebb06b4fda4f6f014e109b97f5fbedbe12e2602a585"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c3aed556ca330b9cef9f595258928eff8f9e56f09d2e50cad26b2f8ed5cf6ecd"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d16957e50d92645f5a90995021cb190cf3009f6752dcb290ffb3c554f70bbce"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"72425fd204d46254f511edd339ba150cce6140bba1a280ae651d779ad2f84650"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"de46bbc8d280e718117c4173d1fceff95fff50cd6b0cc007b0bd6e3407285e71"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2e9ae1aaf145873005824ace26d0abaf425db1bae01fa0e7eef2a471a77b1da6"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cbfbf92ead29757db91f1821729784e00c35125117661db552d1787c211f7c2c"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a0b43ab3fc32e80d3a4ee8cb06edc150dcfa4115f5913ef32a59fe86f9f90229"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"12fe66511e512e6d4adcabffe755e2b704fb593d4f82f1d8eb5029d1a5905991"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"02366d0635eca74e0be276cdb6d9fcbf5b3e495eff230b1dace93ebc660cae4c"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aa7c1b5c25e71a452453332dae51ab3c3e91892bdabdfb130efa4b2bb7ffe98a"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"642d0ec3a1e41ebc43c00618acaad34e3fae1431a473d27175943ba29482068d"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8283686dbd0aff19e4b601341cad0705ef023d83a21dc14197452f6b15e7faaa"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b9b1a636004800660011376d6b8a73a147b4315307cd33002033bf48eccaf49f"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0dd0b719019b85b623c22deecbaa1bcabf521ce64a25d5ed9ab9b4df8c50c6bd"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1990149d15e251872ef53d85934bf1388cbdaff6a9d1c16483b2157b7985ece2"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"59f303c09696b1eeb1e866c39af5e5cd5c573dad623d94d252e2c0ab4c11732c"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d43b55b3e966c75f78c07f536c86c2c224a76c8fa5c58b4614b19d790094feb4"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e578ce7a495534aed549605bd08f8e98dd9ada78de9eb7abc976c966e2c312d6"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"91afb268b81acc0d8aaeb10f547992b87688837a3009e87305056d00dc604930"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"17c0187085c65d2624563f40b63e8cd0eea9cf4586fe0e9b210e8602c0076c4f"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"da88200bd76d8f40be068db7d0ba29153c03cdb218e41cdb628cce1ff017cd3d"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d7dbe3d5d85e14a98a741fa0943eb5c794fc8e6cebcdfa46c738a6d061f8230"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"838d35b400835e8ebeb2a45136da1a4ad878fec2701ef77f6d25bd2e682d4528"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"40fc7f547e0a122a595e183445bac38ee8c9e212658ae0ec1e80557ebd5b8e08"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"48063ef30e36ac2fb25deec944614c252f53851008dcbca74ef7cf18e4ff7d38"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d6d274ceb1e1060a302f6ee1ada627ee445d19fcebc799998afa5bd91a96e038"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e1f4d52fe55eef2b03bf899021bdb7b46713d88bccfff4db1cd945527ffbcc94"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1850b82e60c7c2ecdb154e6f4e7a0e37a6d0ee3574deed9f90b7b01ddc5a8ae7"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"81efd4a180035ad19e66d75c1d3393308622a56aa2e4f665703480c6ff357150"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d863fd36a284db9e33776b20bfb1edfccec372e8f6a1e3f78e490fc9b957e640"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"640f340899a0c493bc45b9d341f5966ae56b32358a9fc43267bfbbbc4e203392"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4f0ecaec648723cd1710d9a134c9f4956e9921787d43789bd6089ac50bd3f51"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"50c3220e6b420716951f0fd857759e55a4daf73dce14f5a6ed24f4d937490795"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e98aee412140911ce2f7d97335f7dd3eb38d01785449d9886b7fc9b34cce4a0"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"40e196c568b069f8bb28730b5a05022d5fd346726f225eb9b8fe387e8be3a5e0"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"755dbd1ed38cdc997679f803f37d4ef740e3e63828ae9d6743552791a761a877"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"47a53973830ce53bb9d4ec16944a1c1f29f0090c4b9ef76703939cc545da4544"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b42f7f282905abda403e021a0c28d9594b7ef7967f6b04f4d21323dcf98dabf2"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fa85586aa0d9b842dc0ebd64abb3e9bbfb28e396a977b078f2435330318b73a1"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2751d85ede63c947f7617af8ec414064c1871901dab5a9517ee2aee5ba713fa9"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"33b4727f22d8c6bd8c9a78ae8a4dcf2d685789d56a9a5702b432a47d59f5c2c0"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d105bd767699656854ce8e11fa89c2ca8dc4e73e4fc9b8dae2acc3a7fae54c0"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8354acd1eb66d85be2948decb2cdfe0ef582cc8eb4282276c0f5bd3cd6fefabc"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4d0643ac7e1f3c82510a964d1504dc95ff0c276ecf2b9c570a2577f8c7b85878"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63c34838b0e70ba10cd782180b2d51c020ceff8ae36ac9b18906a56213d7232a"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b29eec09bcb88daf11778badb41bb98683951bcd108b21a68545bd596a64db76"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"319116113004a43ba2cb58ec49e4f54121a27fe4559c6eb47449b18939ecc525"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2c9ad7705e38572e496ba0f912912830b53bc359a66547f143992a329c622211"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc4dc11620be5f85b7564c7ea2bc5c2b53791a58d1c313c09007324bae62e148"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a6f4cb73e05c9ca5efd5c5b2134be4c7cdd4179c5f0e98d4136304388947060b"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8b2f1ef947dd1eb553b06671156a73cfb45d60640806de9400477ffd562b4d8f"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5f005c3036fe88d68797e361e19e3c42dc93f2b845ebd609f46ab417feaa1d32"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"79a2bd4754af6642aca0622ecf851972378e4c70c0e772b978dc7b2303a3adba"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"de9e2adeae9ae36991fbb61171e308248cdd0fe2cfac5276553ad2a23eef8773"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0cee21f238a1ad4ef581d9e1502f6af72c48e5a10f806c1fa148bc2c6fc72d69"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"83410f79b01ef9f63491ebbd328b73c65581c28dae8968396951e4a51fb9d796"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"79a1ccf227a5c9f493563dcbb35ebd46d88fbee467f5ef2823dcce778700d134"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b901e1f59399a311f21e2ee86b5118964e121c35f6a1c798c9f06ab464dc89fb"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0309d2ea4cca788468d1b81e2faf5b619d537483b116503e077903c17377ce0e"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf450d60f65c54ff1ddbc5d81883261f6a297123d2956671ad8b8caa40d550ef"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2f090e8d7fb5613343ecedd6749c7b3d7c351a29f4b926992edf7cdae1ad7eca"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5a66124369cc1257095f856695c162f5c79ac2b5a4108105afb191bf8ba3a7cc"},"properties":{"commitSha":"3ec4de80e6dd7de9b4cd18ef8407f293d378beb4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5bcad077e7cbabbb67190934a81edcc82e520a38c500a117f6586887183b06d0"},"properties":{"commitSha":"24e268557dc53a930c267b5f1579bf92c77b6d46"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"926eafa0810a42eaf0a3b8cef940baecddd97553a1c0f7d262bf6e35766787c7"},"properties":{"commitSha":"24e268557dc53a930c267b5f1579bf92c77b6d46"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b0122555509564739458efb0a8950a802d4f4f51609ab46e35b41e8d5f1fae5a"},"properties":{"commitSha":"24e268557dc53a930c267b5f1579bf92c77b6d46"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b6aa6074c9a47e7462b1e731d399c8b11c6700f6f305a395009ca46b3f27656c"},"properties":{"commitSha":"24e268557dc53a930c267b5f1579bf92c77b6d46"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f2e63ebd2796df27d872ff0f6c86af2e3a9bfd6fd66b416e263731eb9434cc68"},"properties":{"commitSha":"24e268557dc53a930c267b5f1579bf92c77b6d46"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c9d46c64cc1901696eb1b858941481373bf54530a50d0dc8fe03aa04c774fd28"},"properties":{"commitSha":"24e268557dc53a930c267b5f1579bf92c77b6d46"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4344cc214b0ec470d612c97ac9f969bd48b8dc8485b0615cfa514bdb689dc31d"},"properties":{"commitSha":"6982a317e25828ba3372326775c31d8528d21f8c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9ae543dfaca7860049109b1557f89ad3877abbafb14a8e617ebbffb331b4b57b"},"properties":{"commitSha":"6982a317e25828ba3372326775c31d8528d21f8c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a3e29fa21c73f12e247e47877d744aac453a92be9e8949d295566058d4f4c850"},"properties":{"commitSha":"6982a317e25828ba3372326775c31d8528d21f8c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"192f9eb09f7ee388d60edf2da179560e5d21f13967f91c604747a79bd2fc231e"},"properties":{"commitSha":"a0132f66853968a899040e8392974eb698dd2229"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"55c62bd2a210c483b18598fe26edc41b5440c226ae672dd146233d621fe4c64c"},"properties":{"commitSha":"a0132f66853968a899040e8392974eb698dd2229"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f6ac6a9504c2ebf2c85ead31fc8bdc7e1ded837aab9838e9ef45be26c970bb54"},"properties":{"commitSha":"a0238f154511ca38626a9c7d8296dafbb8886050"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"79eab663bafffb9f7f4e09587b23557f9237c109763f9f697ecd4739b32a5b2f"},"properties":{"commitSha":"a0238f154511ca38626a9c7d8296dafbb8886050"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dab3493b90d5c2918597f6e00285ec85f55123b1df0bc3449c03291318ff7790"},"properties":{"commitSha":"a0238f154511ca38626a9c7d8296dafbb8886050"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5eab41082a1c93417d09bff4c574389f7303ae6b4927ce4ca5a96e80aa5fc48d"},"properties":{"commitSha":"3e1156845e0821c56b339d0bca6dfb0f8f886bc9"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ee0e19422fe75d6e6dbe81be17baa3e2e3b50b134b20db6c38064a142b25b572"},"properties":{"commitSha":"3e1156845e0821c56b339d0bca6dfb0f8f886bc9"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"19e674b1913669416d78839004637f785244698f8f7ef76cda19cf893c447776"},"properties":{"commitSha":"3e1156845e0821c56b339d0bca6dfb0f8f886bc9"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"11d35eb45d79b54293e51a0b500b8413edc3e0989ae9db1d97acfeb8c368cc7e"},"properties":{"commitSha":"3e1156845e0821c56b339d0bca6dfb0f8f886bc9"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"32936ecc3274a198cc19741812083c716fba037a0d8cb5bb513eda0cd95670ac"},"properties":{"commitSha":"3e1156845e0821c56b339d0bca6dfb0f8f886bc9"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb7870c0ab6cc3ac88f34e95acc2c8ab071700e23b3e943b5f1ffaa4dac8cd62"},"properties":{"commitSha":"3e1156845e0821c56b339d0bca6dfb0f8f886bc9"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6feb4f32704a7cea2378c95805c9c5221ceb85da1807ee2d50454003fd66e9f3"},"properties":{"commitSha":"3e1156845e0821c56b339d0bca6dfb0f8f886bc9"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a87cb0c0798cd6ebb613fb1a615683ec1d51cec71933720b287a0021bbfa5ee3"},"properties":{"commitSha":"c089e20f99c0006530f085e4c990c8c60cf1270f"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"58b2074cac8250cf3b78e28c3df5387c5f515750950e18c711d8dd44ed91c647"},"properties":{"commitSha":"c089e20f99c0006530f085e4c990c8c60cf1270f"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"152cb47f632599c0e950f95b184f5860c6e3b4c2953a8a8405b9a5b45789a57f"},"properties":{"commitSha":"c089e20f99c0006530f085e4c990c8c60cf1270f"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"10126903c3d90bbdec4e9075f08de610def67b726a2378ddd3ef78ca0c72f52c"},"properties":{"commitSha":"c089e20f99c0006530f085e4c990c8c60cf1270f"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"70e1cbe8f48e67ec3c13c90066a42bb5cfb12d2a250314173ae1c6a913ec4964"},"properties":{"commitSha":"c089e20f99c0006530f085e4c990c8c60cf1270f"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1852184ab8bded468d089a77709b05a8d607e3756fd717731795588d6a9a382a"},"properties":{"commitSha":"c089e20f99c0006530f085e4c990c8c60cf1270f"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5490f9d0aaa0a73907a13e78748dbbe54a7bc8d45b08577c0c9793c41952c0a2"},"properties":{"commitSha":"c089e20f99c0006530f085e4c990c8c60cf1270f"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"483c7baf248cf6685a485548143869497aa687cb9ae95e7e614493ad5132bb20"},"properties":{"commitSha":"c089e20f99c0006530f085e4c990c8c60cf1270f"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4fc86bc16416577e1d54057ccbb88c06f7cf8534e06abd0c688d760a9265fb66"},"properties":{"commitSha":"c089e20f99c0006530f085e4c990c8c60cf1270f"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f894918e23c8e65e14bbf21d1d0aa6d63b976546458c95cd0338766f54072b50"},"properties":{"commitSha":"c089e20f99c0006530f085e4c990c8c60cf1270f"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f30e7fe53cf722bf2d57648272fdd8a5298a43ba02383bee1a9ad7f2418c644"},"properties":{"commitSha":"c089e20f99c0006530f085e4c990c8c60cf1270f"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5b6ebec2378cea6029f1719881774fa5cf246d64e19994276be743b4f74f221f"},"properties":{"commitSha":"c089e20f99c0006530f085e4c990c8c60cf1270f"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"14a1fafb888f12d1d6a1d7d331fbcd42ec0e99c5aece129bfbe522d187990185"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb92efabc67488bb713abfbfaa8344450da8c5d3c25e72789b92da2e387ebf8c"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d02ad24129b6b3166eab13c144724fced71b220f19c1ff7526daa83ef43773ed"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e06613700f2b173d056f1296220a5484518665df7610888b78daf0f30cd73b8c"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"03f580d3543b8a815bd31568eec5fe3082f63a0c03ad953568b91affafc951e4"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"10a2542b4b89d4c9971b017e383b2914f0674b19d2e630607ea2cdc0d3927052"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4d3666d4e76e0b4422e88411fd17662dc98bf76bfebdc4120be2540fc6b95dfd"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2b456b2195927cde3f9555f4ecfa80c9143f47aacff7b0411761145ff77401e4"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d3469c862c60907b550d556e9d4262508f7e96c7b473cc56455a2b16cb8728aa"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5cbd2acb561a464abc78ccf5a67c0cb088b7ce4f2860c7358911d7e565e5fac0"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3c100c110a4d304354d19c6ac99f8f73bd64d833eea2b825decf1abb75f0caa0"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ad4506cce5d067d93f5b62c9accc15ebc9c55e0af1fd1b5293e913070f96620e"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ac87d0c9003c89dcec87f5ccc2c2849054226d029cf9fa1d57253b30b1636c9"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b3f2c332d803d942cee2e7f10e5f5d5648911132d203bd24e3e717c77236a6a1"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9510d23a53a3b5b2d31a25de837667e41dcce31ba55870fad9da795eb8221249"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5fe0fc460e4a8b2b0e427b8179f353ae0fb0c755bf9abeb465c57aa935c83683"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bfcb864957435e85c8d35d76387d8190fc4cc5a37d9bc5fd101a64c22d780287"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d2c26345f8cbe3be7657019fb976a1db3806a6ba7d191d8ee1d446b7537b40c4"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1d3b7c1da228aaef8dbbe5a328c3474313954935da5b99457aa9638e006d104a"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"738d62805e66751a8c15c911ad0b0fd38f9ffce49a80adfb437c961b19d79928"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e220af9b50e8acfc65973a8fb25653d11d2711a70b5d38622b35881374661004"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b88b9bef5b530cf9a399385c777245396738670cef28fb26ddbd0e06ee660e9b"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"98068be26c54462d695c88b169dfbd18ccd1d8e4f82abce51758b50f65b068b8"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"73cd6addb6bf742348e4bca87a12441a9424235fd4b00edef84e211efe61b3f5"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"318ac3cbafc773b967ab3dee4da939472643780eb2085b36904d4aff2c916fa6"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7e11a7c98e808316a8aa83782afbf7152f4152e88e08b03e35868cd8f8241a3"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ea07ee9ee35ac1dffe1b02d670ec56e8c709d9fb4d23886b51ad193098f72667"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f1c26882c45819c2978c4d71ebb60b2455db0ebb060e6b45227d7e994d46d00"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"769f7bf40c6afe675a0ee8ad93d1a9c1e32530bd681c69fea5de2f528beb9469"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7c45817217fe8a825684f90515c31a75d63f457026cd3c36efa7c6bba35c4439"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"07b92a60543dafc8bea052fe883af48c9194059fc060c225e631107cab3f0ef8"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"76f7bc9221527198f03d853ba6582b0d2639fa979bc5105ff9add74f7c67e8ed"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9979327eed7c80652e8f05891b11ce80d75237877a07af060bed727f7aceaf46"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cd77e975beb729b8345fabe1113eb58bc07d87ad1903c55b9b26fc5a022640e6"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f79bb340a829b7078b16747cf6cc2279a2d795051bc3829d06df55521f83b793"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1e6b73c757505ad96620712189f369d7f3f3ce83149df4793287daed37b24a8d"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a7018c464d982411e2fce335483c95afc5af19648ab5caa6738a5212776e962d"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"808a737125a8ec0049e0d30ee8009a41c609e492ef86702884fffb74d1a3d049"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e73a937ba36abd4fe7f1043d05fae8f1f6de570bf25a5d17a8b8f53c5bb529ab"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8658426c2731dc3532fc2f927716735df83f22ac4543943f70451b502463ab7b"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4b08161f6ae048a574bb427b819a372a59d38308f306a84085557eaf20d41d37"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"da78da0ed379c16cd798852b7c8b2214852be621eb4f30ec2dcd7384e3f3a18e"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a7821b35efd2245e333cd02bb74a41c4497720bf3ac3dfe974bf363e1947abb6"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f9db56bc70dc1d3243beb95ba18c606ae94d95332558f831b2d8fbce4edee7c3"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"36830d645bb76e4e729fd8e1bd7c120f74b8d38943f0cb00fd20ad75af9317d6"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5f66877ac416f2d582bbbfe52bb7374a27b30ace9fc18dae0cfae8975faa966c"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d818093a0c68bf18920fef0f813c25696ceac9e9e5691aff034484ccb96e2c92"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2232cbd07723e1e50cfe64a0064866d3cd77784c6606478af66c1a19ad480ebe"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1cd813c841e909e567b0b38a897d0246b4bd6b3fa8be8dbbf1b1e08315b98114"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fb98950c151251a2deb536c4834ba6633dba1ad0243deb973a6638e782d0bf99"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e6f1b9fef4a65a10900ca3352824c38963cb0e2d03a2e65bdaf417a5e7187a08"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9bd5a4b05ad3381a55eaff53a2d0a70961a6498c6093873f3edcf1149aeb2743"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2344ae916cca49087a41cd76932e2ddbb795eb632d8193f4894a6b884183c218"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3f9bcb845dada42088c0d842ee50546660f26d158a2872e0ace72ad4735a370a"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"86ca05e5688df017cdca8127b2731a18c48ea02c992cecec149c4505632092d8"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c03d304ae0b396a69c458d512ac33c618ba969a1e2f7af6fd88f3a85eb39f3a3"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"306458d141ca02311d0d744b84be696a22ff4f7bbb46bf27322700f2e3626659"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d617ad55f9b5d264f3373622a6e24b303dde1e638954eabf50a99dfcf6d5f955"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"56fd494dc49edc5315df6e083c72a3954cd3c62e00d0d3cba06a145eea7b87da"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3700f5843c9d9ea83707b2704f582bc275f5f0f6ac5679df532812fa7dd71aa8"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0efbbf5785ea33ee0b40f0d972699ee346c25978ed960511bf3ded590e388855"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"88b9d463017a6d2d2bff492fdad19214cf6d045aad111c32898301cbefde00ed"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a336f295951bec55c44a4e8a425ec1fcfb45b3f5ffee92dbbc2767fef0a815ad"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6cc0ab59ad195b1403d1fa1c1e7fea29b406a5a3e3219419f297d98d34813359"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1070bbfbb12ce829913cab096f54176424babd1862d6515a624611a40391a7f7"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d066726cb191bb36f8c7d8c2435dd84159052340f2af9c0600b0507e59ba6e2"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a8be431be2119d7b6fccf996f34e96c35f2cacac7b9943039eb77d511324ca4f"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dda67b3a1818df7532e27d5dcf0aa5599a1d4cb4dcd4c18bbc771dec0b50c31f"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1e8b3c1c91c6ce0019ec55f57e9753bdb7887cfe1c5f8b2931fdf9bbf0889201"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"503db6a81bab4cf251c7efeca67e1adce3fa16304db6417ae1d447050034c26d"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a25256828c91693385fff2f21c8042ac7e01815c3c00b54e0cb6b062e1d3bae4"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"44064ae568dbf8f1457e9115e86ced55f1ac969d7e8f44111a14c2e68ded686a"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fc18c1a2caedd48ace1781a4ba2f7d9dff43b46d3a482a0d26f1fae4494e2644"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"856341a3f22691394928be85649aff9cd3c014bb2de74b9335929dc1100da02a"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cadbb8da9d3b146141f879069449e2d4b3360e8bb6c55bde85c7398fb0a52ca5"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fdd3701e8e6550bb8d4dac5444135a0ef74decd729d67ce57843adcc0e776a1c"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"843004f127668eea7ae7c094aa3102671ab76647251e24ddf2c2e84c22bab2e2"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af648cf5121ba41a79949ba01b484c7dcf37525c879d03497321994eb4fa9759"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d62f1f9db00b7fe5371e10a21acfdd34e32435cda9e57a4b6c531c6a1466c20"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2b85f0f40d91690c84058a68483dfa77b3fe19e87bc93646f527801fb8379165"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e7e3bfc9e58f3fb25ed0157d5054697f6f9306a97b1c130cb587ab7d28765bb"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac52a815b63c61aee60103ab04fc2a7ecab802e04e0bb86e8886b02d2ad1a95f"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"715eb82e84d348a301f05ad844212be3d0c0fe60dcf180276c8f09ae8292cd93"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a4100532d516f071806aac8218c8cf9c1731272b8f4dfe060d87f645368ecfb"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"96646d37faa5afd3bd81cfa7c73c96c1fd62ee1a607901d86f38a6f9106e2a74"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4d045ee8f9c4db83f529969c0838df8ce8e8b3031c80d1928ca5cb2e16dd1c17"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"feb494d6ed8e2b472bb03283ab46aea3e8a703bba6e81d8f8b61cfa811407e62"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b63a788a76909053ec66f5a45e95cca2ce0dc325ec7b33db251d4edbb93190ff"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"896b02357d59c900d09817d19a9638af5761e06b2647a997f1afd4f4a36cf121"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"00d928b814efd2fd5ce69bf69d4a62f57cc8bfaacec6bafd1d57af9d684f223f"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4eed090585ac1802d88e9ef8ee2ecccaf4e6529d9cb193db2491267708a788d5"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f7ac28e981958d90216ed7c2a592fd400de4bb6dbc9a65b1627c482bf6498f65"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1ef12745aeb274c86c1e8aa13240f04f17920165be35abe7f377d17711b4a73d"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"965c556926ed79e13f347478adbc46e0832bd30bbb97c5f95521927f22aea26d"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"be8d829984822d59a4a6f6298fac089337de85d3d2c5e2911352d134c76500a5"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"604e5c330eef3ea1b1dded62a271da0aef7761b3eb05a76bdb19b174a75ab6eb"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9f5ac661824565f3d96e8783cd35b1426c4692c19191786d544f7f059f9ff84f"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b2bf0fb5bc14b50bf100037411c49f659e381648356a537e6d15809cc02f580c"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5225aca8e02d1f6b2b30aff343d5a0817acd97eb2a537974e19db3f8c39628fd"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8bb7779de40a003cf5b90f698ce35ca4f08eeaefe29aeb66c17574673498f417"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8b3a581302dd108130f108784d5407dd686f396af8f9a5a60b4a9f6bad8823c7"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4c3c22939afd1b08ad09eaef5bdd3c3fa8d42439450a13bd6b1d860a77dbde29"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"02b20834a4a1d08a41a83b5ed259de03a4136e07576104c795e1ccab75eb1bef"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7a6cd362bf34565fdad92db0e6822cb88c012c79cb0699535d611d224db0f322"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1bf86fc0e586b7acc8bdae5b18ef707586b190aa3c4671a84a956a703a702de8"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"78334e124b8a2df8ffc98e24c5432c22d24bd5a26bf1a4fb065200d0d20ef8f1"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"139f88cc3c351b69a7ef7baf7d86d84efde041dd7d5686231042bd20c743725a"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"31462b39919a990cd2c1a3910bc33e7f1c9440e1e86664ec620bba77800fb753"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b35eea7741597e92b73b523fb094b267ef27961f3c9ff2c200b5c0b682b6dd8c"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe91c467a69d6672755204d598bc11900d4e996d53bd598a8370becc59c1c17b"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"341d7495a1fbd6c27660fd38b3da2e1eeebee2330f3a9c4a975b917051a32ba5"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4805cbd1d67813699334c5293498ec87a40a759e7ced54ca292a176f77ae1f09"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"741b901b59c0fa09efd5e9f755daddc7baa89530c1fe72a22dacc69f3f11096f"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"11c3d46b359ae0743acfe41d6c533360bf7e88b9cbaac25b48e0c55d60161198"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"621e51eb1069a9be23999581882754c3d1b839d3245af57c8a9b860ddf718da9"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3ccf6de7cc4438a29c554e92429680105a58ab076875b7a59fe8ece6d0ef9f55"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"91db67978c590f01004ae5055a8c5fb585a0f2f2eb706864690721c713ae8706"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7555ee60d0a73f8f8cf509d97749b14a33535bf189f286f6aad58a8162ecba47"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"31582e4b3247ddcfa5c7414026ac53371e0368a8c52bcf08f48cd5a06dcec25e"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"634110129ebea4ba773230711f1cfdde9d3561488199d8dd12145a7e8b1a6e89"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b2b9ea7927e6a85a6848a3c9dff7d4ca055831bef9424b10899846c3e6049b78"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5f82e885e9308478f33570e8f94f043709598398a12c603f40eb588843a9a9d1"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"912b6131ce07af8599b6f1b0f5dc93fefedf38b076ac258ffb8ecb88cb1cad2c"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"96c2986ee74fab14ee738691941e9da51e8b395f911f200511db9b630f4c4444"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"84184c5c779df93a177287eaff3251f04ff46db7602ac093c0ec92b6e7427c83"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ad751270935849c09a668d712b1507a72ea4841546a94bca2d9a5e0ae2b84383"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ba7350322ad2b8266d75c0017dd81bd701b945a82f6d4b21f250c22924394bc3"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af7549d6741644535cb9851aa86437d00dd92d5b94d209c56307b9866f830efa"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d74965b5320e175977206bcc30116fd6ae102513db014f6b985c49ff0b3fc5ec"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8eae46939ef40dd9dba7f6da119c91d81295e1630c9f70d4e2addef4cd603085"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a468d66278a9bbfc04375ae0bdac25e87c61209e15b3350b5424f82f30d2bedf"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5ba99b1c4eeaee20b6229e124bf5f72d80090317a0b9a5af95bc8eeb590c8825"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fa416dc8a1c01f81a090df739f1e7c6bdba413217de048aef94e7b643580a0b9"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d4091e7fbc75e4632a6d10f37f17080773896addf83e415b5c872145e73ce556"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2405cbd640a80cfca8ee1dd88559d32b49ba115cfe6294b9bec91a22915bcc25"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d23a68a76bdeac76534e5b3210c07238e7cf72c2af2b7259f471c328dbb61cfc"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1786102d073bac3798ed3b7eadf93d911f0659e4caa6c135595e4eec59e9e655"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"59608b04615c423d07f307825c37077fc0f21ebdd3a3a7aea64cd4ada09d4bc7"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bb341922b3ef63423f6ab0c20cffbe4253a6423c87fccc387342035f0ee13269"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"30101864acec3518ef266b5fa881ab70c198dfada00a4bfe05d71b2e12d2bdf4"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3a7632b0fd15f533040d1e8503e5a65b5a66dfac506891d5bbc677b30b77ff0f"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3b415f4d19c8ae3c06305cf0da562068b44b2889266aaa8fff664fc7e4f1d4b5"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1c301d8705d52bf547dd593687512d1ff2645dbd85924724c1dbe482b98d8be3"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2e78b134bfb64f91d4aebf0714966d8b6d39ef01d7107cda2fe20d78794a998e"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"939297c21cb31fd5795b7ff8cb2a690a464c2408d4e6fff441dbe871f267973e"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"be89289260eac4daec1caedf281b1d1deecf7b289fbe44027afd9f1f283f1fe3"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3127604a344ddb5cf0e48b3e8d9cac697b79707e81d0f4c19154872cb12f97db"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46c361f85331ef00ed5e09ebdc3b0774086403915fb303abf163a9d304381b6a"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cdb76efd6b78d3f9fb975863e6f6d0527f5c7c54a0fb688a8869eb2ca3345b8f"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b2b0d59b37f25ed4397f33e0ad844351cf4d2c7b7cf2acf8dd96a8519d1fe84d"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"05989ca44fbdf91309693c1f9ad4fcca1de9c666ff1a9f88d86d685d9c6f3958"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"767fb20ddc9b01f79806a4a12e3b9e36dd2a28a093ca1f28ebf9b106ec602417"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"217d6ff352029135e6fff178e943584fa151ff8b888951f59f434730ca3ac231"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e6d287fde0f0dca153f0293197632ef323ca6fac654d3ab938735408ae4943e8"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4caf974ac8a11abb12266f783212ad5aa660a86568557ef531495105eb019126"},"properties":{"commitSha":"24e268557dc53a930c267b5f1579bf92c77b6d46"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5c3ad389afdac94ace32689f50febc5d0c4043e711711e9f4e6bf4bcd8daf37e"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"27d90f9308fca6e97a6e5450884a7153e43f35717baff2d026448c4a8571f54c"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1bfb0d1ba095a9020ab2789b68f392c20e740824c086168611bd959f62731496"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4ce3edfe09ca34e6300cf84aa6f9832735b683b9353942b900ea481d3f29f85f"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7d0fe0ad0d0f42f9bddff4eec23c4f42428969419341d4f2d0a092a7e5ad5724"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f2d42fa0db3bc2d1fa7629f613f26314e0866e98be05d1e85352701804ffdedb"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"965fdb6d89886830d5eed681242fbe781d939e014adb541839c2ab0f4b10c0e1"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c8b1d2baf7aa32bb61839d923a36aad47ac73cc63f2061a6f7c2870040248503"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4fef12aadc0302f39dd319286744bfb1b0721d96d1e2f3360fa97b58add80c4e"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aa0cf0044e8f4a2e359627e0fdd4d92c5c3045fdd70f529f559df8d09517647b"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a0d79b377e6f2f27e63422a0e0c94fee07c5186ff4c0752af8ccf992fd8a45cb"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"371382d5e6e1d922df98a106eace584aeb0cbe38c62615a35feb9fe1bc7c7802"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3a8c1ae13750ded4ce945f7b1fc168654a29890649f7b881e53b6a3708164897"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"579a3f264f5594fb768cc2723c60af59458dabd2eeb934f146865173ce9d1765"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a08f47ab74acb523df9c4967fb7b29857c76107ee577abe02a46701760473a91"},"properties":{"commitSha":"3e1156845e0821c56b339d0bca6dfb0f8f886bc9"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"23b26c3d2231361bdced44bce7b089f77d48fa6afb0ad948d1e176c95d60cf04"},"properties":{"commitSha":"3e1156845e0821c56b339d0bca6dfb0f8f886bc9"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a63b0967160a038ba514cf8645181c1d2941a28ccbea3d4fa57b2ebea6d11f0f"},"properties":{"commitSha":"3e1156845e0821c56b339d0bca6dfb0f8f886bc9"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f4cda1f8e873fc0918cdf5acf6c577854091909059f42d7d50657eb27007456f"},"properties":{"commitSha":"3e1156845e0821c56b339d0bca6dfb0f8f886bc9"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5118e91a8d03024f3073774def9d884dc4521621297be8c9187e00a8c57bca7a"},"properties":{"commitSha":"c089e20f99c0006530f085e4c990c8c60cf1270f"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b21d128998c4647fd6b3b3aaf87edf19f72eedbb37640dd819137d5247126b42"},"properties":{"commitSha":"c089e20f99c0006530f085e4c990c8c60cf1270f"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d18c42d64f51a3771fb3f7fd805db7bc2312619e724facb294b9fba8cc85151e"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"44a1279bb8a6ea775fec903b1f4cc3183b0393082157aba6205aa2230a1d91eb"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8ef67cb8cb5305474c14a8e06c1962d914c6573036775dc7f583702b66b71b5a"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e72a1c45af79b8dbbbbaa5a9dbcffe235db9274b1a16c8193d071b605886bdb0"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ca0e8b5a93ffd2d89be7fb6e28a6a04362e3bfbaedc511109ff74033a4704c4a"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f5d8b70a3a4b59f735a623ef5573ff02770240ba29d60154b5151f3bc1c31eb7"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"95f432ec4b681dac25a4d9675006baba517a61b0ea0fcb9664fa733d9763ed21"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9c6f29744f4e4be5434a7290d42064bae83966d4b1b90ec21fcd77657ba24a7e"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"69b6ae44162fe63a2019a08feb44f768d28bf0dedfc796deb4a3640935ed3bd6"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"50794212d995d0b92e0cabe1da9c3edd07111ab96541b6997631224776b862db"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0775aa41a81506a0dcea4998ecc89995c966b6ffe815774948f0023d631ffdab"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"47e1fc307542eb309bb2ca6078d5c5a338fdd0925b45f386945e4aa8170219f7"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"98eca6aaaa0c02b3aa89e6f753264f344669176f22d8073b8fa7cf255169c08c"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc82e267d522360e6147e6845afc9d6867143830e970e005c13f4f3f490ac4eb"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"173b0a90eab319cb13ec7b3864cb69c68e218e314bbf4b6d6b42f8e260a05e78"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"706a963e41a8593d4c5254021b495516ac51bc1e9b6470f3a63067e8b92a9426"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f9650b93ef955c8e14b907421cdb25c6010768b11c06416ba1318e1e7068f21a"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"379c21561f41b15e0ca1ce0bd940d21da3ee43225af48ed247f8fd62a544f416"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"274d0b8f9706ef93f1bb0b854e73603272dfc529d4161b125c079c549413921e"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e202d779652bad3abec2512e9852a19532ac30686888c930896e25b82290b8d"},"properties":{"commitSha":"cc9fc4b7668b52b076da234fd97910561472c557"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7d4cb0e9a0ae4e2c70c1e565bb4e3b1bf93eeed692a7d3c2a666bf83ac09a5e0"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"754e1ee13e9e07133d9733f6a9b65cf41183ad67a3cc7c8878c9f047bf84733b"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1472c4e4632471fee6888b4d85c4f48085f6e67a200e2f5b93aa9cb582c9372a"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7924c71c2a0cb74fb6b424e958daa1a66cb0547aab27394636c10314a01160f"},"properties":{"commitSha":"dc39693e69b05fd9624e3cf51638344923a0d449"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e219a4f621f6fc96b68fabae14ac8d29a044c3aab671adc27c506e2d29f4770"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a23b2cdfe867446fc2d6ca8e93412b0318ce6f6145d481af48720743821cfe00"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4bc257bc760333504add1d37be9f7b5829f37b5621dfa50cd1669e6131221bbc"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1171e1481d6037828b088417e78c85b892aa398ed15005387e0ff2e16a15a2b1"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"38190bed5a9c80bf3e42c1940ec4173c0d3e04c13db48724b8364ff730412d02"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2340bff1c383b81154ebe3dc4defbfffc3266af2d49be072554ebb95ea254ac8"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"72cdc61db1bece93eda5cbfd94231b9a2d269bcaba4740ed5a31d042eb229827"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4b888e3d6207619a47490f195e3004687a7a0fc279760ba665c3f4f64f3193d6"},"properties":{"commitSha":"0169e05d48f7aff9fce57e9f70d0acc593d98e7b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90b68c18caf124d14bd40b2f4847e4ab0868668910acd5594401ad656f2c5af7"},"properties":{"commitSha":"b1347cac47fa9fa525cfb756f20aca3734c10225"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"669916ce03847cad32c92d1e704f68cb7c24db4a4028062b65ca2dc736364465"},"properties":{"commitSha":"b1347cac47fa9fa525cfb756f20aca3734c10225"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1e2c59049c453115737e3a59324285d410270384fd412b9b32bd23120b670342"},"properties":{"commitSha":"b1347cac47fa9fa525cfb756f20aca3734c10225"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d377999b99e9fb9751ff492a508bf03dca24acaaf46198153775faf6de525d7c"},"properties":{"commitSha":"2d6ad02f6caad2adb3fd908aca87e06846e7162c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"40eaf31c207c50493367840bfc41f1f5383b38bc4d945b1af87a3a2dc7e5f43e"},"properties":{"commitSha":"2d6ad02f6caad2adb3fd908aca87e06846e7162c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d09e84101bf362ba43ac685370932a97f2abe45957799ccafb697b23eb5b681b"},"properties":{"commitSha":"d9a75cd8212e1bce0b21c391ce7526444d5fcb6a"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0d4ab20d7deb13f557dd9a0bac0f96673d1af8dbbc9e360fb63214aa47e21146"},"properties":{"commitSha":"d9a75cd8212e1bce0b21c391ce7526444d5fcb6a"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"50ceff259d9e4f6a465a656b513e48e460792e52bc096ac2b58f2cc7c08f8d7c"},"properties":{"commitSha":"d9a75cd8212e1bce0b21c391ce7526444d5fcb6a"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"02fa8f5bc3f9fbf43c276cd9dc9849df5f978049547e505ad83b513fe62bbf3a"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5a5ce860a9ee4732c7defc519d2e929ce006b547de6682fa64739c1f2cd1bc92"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6f51ae828d33c92956a6d9d178d1c216ce6a8f87f568fc31e1ce366ab364b1ea"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"de0305b6df489aa7ed3b12b2cc4a0ff74d6f0ea027b313cd75ce8d7f998a09cc"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"84bfa749bd7d6995f7532a94dda0c56776c7f42e84ea7e6924583556a80c4fdc"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"857948d810d369837b44672f7bbbfd85f13093d0893427015930eec6f1d41c4d"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7b55228eb10b4eea6e54922fdf939680f888744e21578b51c60edd26f637a340"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"60b024a43caae756f4608501ba566dcadd0f469567090a6d83f2d036ae3bdd92"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"10ab52202a832e0d435d65eab01a85f1ffd36dc8e7a5e5c3f21a84be9be82115"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6a19fcd199126d628d91a293b8b506f6fed4e344cf0b5a62a5566d4faa6697f1"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d238441458c55328cceb84364e108e6fde6f59176fd14e9f9c6ccfd18effd769"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"588189dd4719ea8aa4c6c10778f2a755964462d903f501eecbe198ac860cd7aa"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8efc2055417ccf7887371fdaafa2bea19c6e7551de3c5e2cc2102d6624fdc2cc"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c26beec0d3f0098259f9dc32e8d07a8a8aaaf2b526bda84659cfea005c6a75a4"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8a39e676ad1d77a9207a990321c176fd43d5fef9a019f3c35f38a12dda954816"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e6fd03982313b983bb4a32b4e978f51e7e1662da041450c13dccd9738d7ba11"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5a54b164cd1b84d88aec3fb8197131bb3a53d64c5ec90b4f4b687f543adc72b"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"974c771f1926b5b5c72d9e7d1a49deaaa37ca93ae3ed986aa4286f4614b99eac"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"653616c50551d643ae972024bfcdf1d99c9ea42db490b8d3b2b8a6c7152e270a"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"290f8315042879716f21f9937a5989df15f6136b3dde051dbe490f664c28ce04"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4c67cb5316be0c4b891fa63a5b586a493f20f9af1100d5acb56b9df95a4b7f9d"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e43ed623a1b2391675303895f280ad6fa5e56bc07f4e749a8eaaad573b3a29f9"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"54f5b7e854d547d4dcbc4e76655c49bce57b8dbb23f3a276600bed11a83786df"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b2921796af7bd793d044f73f4dd8deb043824b601fb0bb1cc703cda87cdb8b84"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b6640a95ddcbb5e72f7fff25cea053a87fc8fec7e474d95df7dfc2ab4c19959a"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aca58834b3d9966d2204646fd7eb32c50c7cb63a6157740e07d14cfadb2590ba"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"244d7cfc1d69680193fcf18160c60a8f5dc622680586931f2112aab5e33f2f4c"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"157472e442cd8af80679b8e464d1fa4a27d05fcf47a067b411d07edcfd080263"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8ed9801d36a4c685ad9af4e78471c1ec50956af767497bed720dc67f3aaf73c1"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"92f97a672ed2811904934930eeb7b6d1a39031a9e4a7cfc0c496e2c818aaf64b"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cec82a204eda5e7e07726dd24e873f7390130931b0fc3c6ae085dc1cf1a1f9f9"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"70c9a8596ef94eee5f285f4fe75e97e8300454bba664b176afbaab9dcf91fe30"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0bd59f840e165b0bd09ca62cc75bc4da65e6dca229d282e2d05df8d30050ca6b"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dbb80a876d6461c9a4b06a64079f012edbcf2417faa8d197d5c12da366218130"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3c9ae0781c981bdced40e8a90b33f37232c5c16017163689a5317a001e2e54df"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"86bcbc973d5be7545aa040662bab1b1d1e2bfa2728486d73834cfbe5565382ed"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e490327900b1cf444efd3636f560354a82d44963bdbab2c78f12bcb1070378a7"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"18c44234136956b53d5e1c61900506706f6f19ec50f458fa55a64c4d94dcfabc"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"45c0ba581b36b77d31e27ec5ce7ead754386c780e13d9e06c05ceb6efcf7e786"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"449677473e993d2c638cec3a211f2fc3642c03f79ce7d4f0ee729070be3b9e82"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e914e1719966691bb8291687204c7027087353a1839c3f4415b65d885223dec8"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d2f522d464cc98e4e76d613fa164959bbb01289dcc1fb2e81b2c4775a67c6504"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f88da0f8e56f9f75ddb5ee5dbb6101d4c6ceef20a0a6d14f029361c514d39962"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7b59b2c480227d85edf46a34abca587867c043889d62713fae2bb843f6c47be2"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6309e2c0eea742c08080322b1e021566ab9ffa5fb62af15513d08a2038ca3429"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"883ab2fc8bb7edf91e2d362aa9c889aee13133b8dd54bf288773fcbae82905fa"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"26f35ecd29175268d0a7e49f766f0cec0a08c8414c3dc65205eee9c0ade351b4"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"081bb3ac39596146acbc118127571ff72624f466eafa64e4471582d3e821fd0f"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c9bb3aea4ee19559f6bd32513bf7fffb73d263a5585304f41fd01dc70df45bcc"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2491ccbc5426e8b3794798f4378eaa7b3554e0b4001c035f7e5c5ff4824b913c"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9beac3e2f6b9c310e4dfef000af1f039ddea7fceb62cd6372701b6b37da3ff30"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aa18968739069ccbd89408fe5e968885db5e80bb189d93097226505d774d9dd8"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a24bbd3e3542786c72f3dbad9e1b7fa98e0b30c024cde67a25b7aa3db0735635"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5cc541e7fbaeb74e7819c05c9e3615d953babe903c74fa7f90e1379a6fc17dc6"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"87458c6eaa98dd666737468b13b23dc9e71ab7f7e6695d8346cf09ef0312093d"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"922538149fba3913e57756e0285646ffdb8112dbb12cec95ceaec428ee794ad5"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6bf5e668a4491cb0e739fdfbe21196cf725f28c33b823bcf34526430f6005716"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9a7fb649a913a60fc5c8dfd99a0a08e19a294c228c6c75c89a5557f3eec87a30"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"82d8325f8b468062269f49eb2675e3fadec03e046512d4aaec6cb87ff7644e6d"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d8fec4ecff7fcc1d713c1cb01a8b4a906ecb47228346ae4274e883dd952b22d"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d924154094f4b8cf8ced334d62ffc3708ef5d3ca66a5dc0791609dbc572c5549"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d72de40711cfc829f265b9f66e495965f7f0f38192cda8869babb19b5d549e7f"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"faeaae7d64d8217094bd7d92fc393d943e9fb39acb4bd7b1a12aa3526d46f8a8"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0fdfdf1f19c247a7883d43e70199d9c28e570e2310e9d84e3571306b61d16dd2"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64896f84b508f52136241fb3ae05aeb6d4aed5d3641868b826393a727b6e96d3"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c31b469884bf02177fb053aadce81e2c3e0038970aac2af9e33b7a87102e7910"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"41549d0207952e6fe78ea31fa34aaa5f2ae7e75148b7c20d4e8a2da8e2b1b687"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d891f345714652e9c04e78a30038b8507d39b786a5ce34c6b32456e8a26777f2"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"50314dd2d186f5670d05f94db917f7a4444f3c2bb3d0bf98628cef3e3d81a63f"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7a7a228fc48bc7a24f414e5137538292584ec2b6d674634799d8f191bbdbca70"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"66e761d4cd6659bd03e8b963ee942905e5df1462d2f2dc4d5915f8a4c4dae4eb"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"436099dce2a42f4592b758fff8842673d1a44b7bd8f42f792cbbe7ab2445b8fa"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eeda1d8d1190e44f34f367e1ffa0c41142c925cac0fdff99114b7febc2f83ee4"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"601acacb2a244346a70912f4462642dcff77b53d795750364c97af9e4a821262"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"59657f578f1880961fb304d7f6f3a18881151ef9a4b43558579eebb89327539a"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c68a56bacc19099f3d5964491f88200621b11a1dd512bac51be3655f71fc217c"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"685b8815e8c2817f63695774ca2a8000ba2132124887bf6ca2b4334d966c57ef"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"878a3a5c83cca4cdee012e107880d5ecb225c56a4cdbf357da95d9249d4cecf1"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"335e352a5eaeb6c0573509a2faf964176f76f86baf41e4f9990f8db78477450b"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c0474c4dd12193cca677cb759ea5e588fd4afd54f0a874ee84f58d44afd8c04b"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e4e88aff778db375a62efcd3a61ca7b6623f686046ae80d24246ee1e89741f3a"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5718ac9c5ad3d40b0b239539ad53c76326c1d23d25b9d6917e28da05a0608882"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2bbb3222942320eda83be9bdcc80ba09303cd562d4316750ce13993572941b28"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"19c9fae860429da2ca06558bc757824a654429f1f1c925cfc51d6ce31acfb789"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"86884c43b16afb2ef751b5ca1dd8122b4c1e4d228c0eca5f96b6edb9e834ba72"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"32e1326034471f9b9433c7481d89bb4a2f767b36fc1243250acf5187333187a7"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0c026a43fed0bc4badaa925180581566138e24ab53d6aa37953fbeb41ea4bf45"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cedb799b4523a4f46ff0e5602fbcc07f6ac10854035bc9f59c1b1883a6f9da99"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"278b2050ac3c2313f626c4d8e66f0e4ed27e756b99f53e93027b9e3e768193fa"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b2e3ddff9204d1129b314bfa4a6600741ccfddffc9e82b812c0f4bb3c55c5dc7"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed21edcfb0230431d62e1aeeb57bfc69c7bc14347a8984eb64d8bb409937b8eb"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7c9713e79178d151c2ec6cf536434285cfd6d8bc6e21b94a0b5fc1c42be2b9f7"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2cd46eec52ea0a6ecebdbf864ad9df08059a63ff824ff89ac8f9d5bb1425c316"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8b7e48f8384b272b446d881e6ef1ef0529ac10752c17b19c45d39fc6267291db"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3a134ee51b07ce81a1139d67f35d11fba8dbd32b1c1ce898aec8061087cc6863"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f31b540b44b5172bfdf75b2d78d3a028d4e5a210e403c577bcd6bd93aa6a5f00"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a481159e96e34a876b157bcd19452853b795f7f4effb85f7aa13f901f35c032f"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af75843052f775df0df461c79f7c9fe2f28ec7b1fb49ffd1b5b6f6155d0860ae"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a95c77d2c4d41ba4720fe5e125dac9d01c6683bd4f0c82fa3e958bb68fd464b1"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f7225e1f250922cdeb1836e8f6af5ec43ff2026692d97af414bf3b0bec597ef"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e982bdbfe63ed1b349ef22a34627a2788e7c7195623d3a7d4fea14859e5e8a20"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c39742485ab39de04684b06ed01917e9bfce6290a0d2aa64a055d173c0b375fb"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"654b8554fad3a95e09dadd0bd0fea5c9ab6a6954d61b84b3d968ab9908f6bad7"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aa4399f64a702cddbe407e7fb2a617c16426f0f4968f3e1fb60d2475ef303d9f"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"899499337e072e755f350a81881ed379518c20c17e5b866889e9c03c95949040"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f3390b9c4364ac13ad14c8c66cb3562696354276e258e69cd004469a3c397e7a"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d94c17356e2368253a45718de9f81265949b31cf17ae97de2f90c49e71c8f22c"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8df5d9a2a7a10fe6b389cbcf3352c44f83170b4c4087ebbc8ae4350c542d0332"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"299152d23adcdf827d7ee87ccdf876214a479768836119867ae96de4fca0336a"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"44575fc5a4aace0b660fff531badf70ff6ab6c5c92237c7839219609f1a0955a"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"631449e70e65a2b3439f7f7c277f7ba3c3564afb055228db3653cc7bad8d8386"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a15b58009744d1e39b122edb481d8d360c9f9badeb757807c4a1f81ddb17b2f4"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1ef390518f175a4ffff95b058e6906ed9ae7a9c9233c6e8f69ad70aa0835d6e1"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7696ef70f701bdbb2aec0a4b55cfbcb531b0caef6ce7f2b0df451947cd0e1fa0"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3d13e0a3bf43f3e46f57985691b3bd6e4fbf058e66f6309767e28012e264ad04"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bbafe0c2d2a38da5d7c9711df4eff02a0925c758b9a71365bbf471fa1a0d8c61"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f76dfbedd7121cdfc612184a0e5e51f273350b9dd44db9873e262661e2b928a5"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8413855ce0f577498e7514bc73db16885950103e67e5508fb148f94b73d12b04"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"34c2926a6207524d5ce7d3af9ef9fa4a98fd9f8d2463dd18a3cd10801a82d6cb"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8f83f77dc01451a6214d6ec4bbd811b32a8d5f7a46fdb21f66632553fe540e06"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a751855321996680d8c9927b8042bb40dbe551a64b00521d44d86da5c5239c91"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"928035be675c958588e3622151025c6ba0d76a8cb3e0769189f996af006b2b71"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"66346a94db2deb7a65914ebf8af00703fe2f3749f08c2074cf73681a978c63fc"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ee807b4e0f707aa1091deaa1f55bd5f8ab71e1d1ca9e3d4e51e0ec336ff39a1"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5daac1c78d2788d2c076f63f920dc15e799acdc7d12d5bed094d6f47bebe69e6"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d9f127fb2cb9d719e0dfe333baa12c03f3f18efd8f9c7c34f0b334a68be6db38"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b5cf90a536d187229bd7ab8fb870b19b231767987ac951d107feefd42acf773"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f37e774438b014071a9f4ca1a985f8460251dde7be741e9b9b236685d5cc495"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b0b62d9dd29f215f1bf2ee6ce45e15412b283e31a93918d1520a5785bca1f687"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8af50c60f78131fa1af975c13889d0a31186f691a9799793c073171d63dfe8f7"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dbe140ee922a1471720027fbcde455533846eba20ee398773b95377ef7606d50"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b04696ffeb97088723f8fcaaf2edfd315846529dcbfd2d0c86b25a27d17db6b8"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"17630d64d03d930218bae54d2808ad5a25fb9230438ab47c29398635b8c40aed"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"76d61f4b4390fe7c60487eefbc5e2bdc74bd1f67b11500ae1fddd20494e3e5e7"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d01c8f6a9cd8d91f1536cfb15fec1bcc1990d25698fbcecd67292b4b94c1f249"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"19cab71dad84f86558a4be0defc88b8d4fd69ef100399e2d6f27f391dcb1c41e"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2e77a5b5de230f24c122b7db043251bdac09ef1b89529d62409ce421c0c5c061"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"78d8b49858a2ce3d2c3a5321c0809cf7361b9046849019c87d0e5270461e09d5"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"55174593de88335b9d07be73488413ea951343a10059530820aac9b8f6c48035"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e484c4faca0f53b5fe8bd19d28b6d5d64982a0288e07f5ffaf644593abdc567"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"79b334ed9a71cd9b9bafb329aa6e16f96814343d99175f37785098a558f33715"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf5ab9bcbbdc3d57ec065ab3688a78f4f5ee281741a0c011a54b359c8b187aca"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"771d142a076476c2964541107b74dad6cbea05f7d0781a373fcd41d08ae4fe3c"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d04496a1aaf621b7dc97da33a0ebd118923b857fba1e2e12b13891fdadbc6675"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64b99f5b6ddb5d76018ddc96e44e0a6d052fde9c76d9121315f60d094e783b56"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"44ef2cf2a3475581a5e774724527068d82eb7a8eeb055412331bf7a50adf00da"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e75eb22d7508b2dcadf4ce913d332059f2e3ecb40088a9d4a0c607f35630437d"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ee00cc3d531c535e4d0555af68d18f111c7c3dce8061b6e07cacb67991d6a6fa"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d2917a192eca119767d7c9731ea6538d41a25c82ce13cec797383168e7b6898"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0b838319e5ff8bfbec62143361710532545ec325bed6c1976fa3b7c994ef950e"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e83c7a0a06d5cf982d84d338a16401d523865e5618595bdaef0d655218553142"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2e023104d60578be70aa4c977b5e5c5fdffe9dfaae2977dd4b5d696968be6325"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9f74dada7143a5d14cb0c5983c1f8a0da5ab3b460710e8c7298f6cfb4fa4ab24"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3724f89487e126eec396a7aee4f42d51ea7f6017b55652dac8385f74c57b9053"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f8f632bf168469155fcdf385057c099da4ee8ef4d36c7c7a34d073499419d12d"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bfdbc898b17b853f9c1b283f5ba52767bb08754290e326bde00baab859645f8b"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"097999d2247bdcc9d13a2374465a590993ea7eaf7c9a7502911a792478adef72"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a0c698f1b6b7ab988b0a4edd2bcbd5d73abd040076dc8da895e1b0727632ab60"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d685a0db7224503599b4d838986fe318936b21ea9ad1341ba8ecfb834f32ad07"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bd05fd85469ec3f350d0bd10c882dd4e09e5a1f86172b4993b47381a34160d5b"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"97d2bd579c427efd57b421cb83474c7e7aed438a8850f6add03db3a0e5eea869"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2c3aed676365e6a6079c5a603e56deb154cc57f86876b3db32fbdd7366c39960"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9f25eafe5b112ac9dd01f7c41d7cf1d00113e31a9b2041a26136c5ddb36f9f4c"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f251f3855cd65fd10678bb3db4818950ef86b6076e809e5ebb221fde872a4913"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8a43b2ec109513112747e79942c235ec152b5738b7281f1dc89608362d1d059b"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6fa6840680ff4b8c7027cf1a3e54efb3cc1e915c6067f6851620276cb92e1aef"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"536ed59333d6f6c76ce07b9c56ff9dafef6237115bc8d8ee0612dfca6b1bdfa8"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"adedbec56c4e56a306264adf579fd4c80aad12ee33c1f19b8aa44af4c66a2be2"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d2745588b28f60a13f40b00a127430c8176b358c89c107384f1bda157877a41"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1e0f3ec4f3367ae3ee4141a1782c2d311d2c202b5569579a2154fe32cf1be125"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64a235a1a0dc05e60996006b579558ab474efe5be9efbb0c8fcc2e81bb76039f"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b86ea5b1658f412fb49b17703b457e00a399aa0854a2fc3a930924021a64978f"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"136175c6a6aa45c5e1697c31e264a73af02ed64a5c2241591da3fa5865e2e740"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"01a16740a5d0bd98c312ff1f3a5806fb7b62388046404c24a88ffbb0c4475182"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"751b09e19c0d74ed46edd70ee5e2fedc69df494f97f275e715fdbc06e56cc289"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e6c6b170174fc2a050509e544ccac3b3bda995156e564bdaf6d102b59a5efac"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1bfbfad90f96e77f8ea4d8638a7c5a226a5887eaf74f740ec2688d152ce41f38"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"40cc3fd619e57f8b710ffe42702c904ac0f87d39f0deadc9585a2bff836b0465"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ca2e0c247b6bf116547c77844240e170e33aebf55b5529547f79a48623899ca8"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4c10f41afe16866e824d799a18546a0c7e1d28cfa0ca0d706ec0735259b6320"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f53f12e65f204f044b8ee32b75516bf5ab5ec7d2357ae7c6dd521eb1211247a8"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac4d90646037eab7c76208171ed0fa9864a9785c879379f5478a4b8450cc60a7"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ad743e935a639275184fb62be64ea2d3b8d9e9df984cb0713fe45388f9c41b58"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"238e538317eed38fd8ae4a3958a350cea8ce98c14bf4299a77f97159e0326294"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9894a2a6d6da797313a918715b1d18e1e6f2c560b5157f17d2c7cbf0e571cc88"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d024ae09ac7b17953d24f75008b1ef164784683abcda0b28b763ffd1d9387d51"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"26ab6cbfbac1ad6811eacdf34f23f30865874ecc5bc152d71d7303f4c7734ee2"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0676ecdf8b40f4f83aa01c61ef227a8041b23b534feb6ec6cd451a385d74dea6"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"acd8cbc6a599f433a44f69c50121e08e343aa57e678bb962b44a71f322ad1f69"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"754dd9ae7db316472113b33bd8f3c787721990b1e1a6eed7ce75d41d15dec39e"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"406c10cd988b33b33ce6d01ab0c6b659d06dd0124e9eabd87e62f114c1309c8b"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b6f48647cb1edda530e633da126655dd63df33b31533954552257d40f710371e"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6cfab1b7189610aaefda09873694c3c15d98a2dbd2347c5dff76b81b4d684ae8"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"09bf374e1acb880830a6abe9356e58552e5849b5eadb1a14cd0b7289e3e78132"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e5c5d12c6ca20ac2dc26782d12509f0c05530d80849cd6ed5cdab0d620544f77"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8874bb6668c8082dec7818a6bbc2e305ceba0672337cfd40978b5a65dcb4b000"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"98859e3a8bf052ba4b487872f2ecb1eeeb6f436d820a5a9e8963ff7915e5e20c"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"442577bd0b1f959edffa5b2211d9d8eeddacbdfb8cd219d5edee917ecaf0825f"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aac779ba17cb16596561e967c16017834aaf106a0090319953b8965d2c83babf"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9dc90fe09bef1c12d762116178f08ebaf9c1845380a98f02d87c7fbcb6a8427a"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"911c449f1c77740d390e3aac8719513465dfd645587acd68e655881bbe4c8877"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a7928acacbfa842e7a8e12b7395e01e69f267af64604fe6886fcf568331fbcb3"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb9c40505a91973306ddd06325791070c9bd3fed3b0513c9b959b42ec9aeacf2"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0c24153de28074d278adc02286437464c797cc1eff6686dd69ddbfb8ccb97166"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b36ca59df3bc6ba8fdb50bf1a430d91441ce5c907962cc5e96ee41444eb55220"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0014bb61c11bd6e4acff36a3358fadf55c69f84b85c935f693260f7fe194d3d9"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9dab835326ba4c3dd1840a640bed9fe1552764969089f6452d45a309380403e3"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b102f979686de2312618682732738f75a870c2d3d795ec81cb1502d02a6d2d8"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e6aa16579cc5d2a60fbbb67695802d4f86998c6a19dc9b0edf05c43c388f5da9"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"800c04c0c4561f45450f61dd0d6c09d4471125fcf502806ec129bd84fd96cc1e"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"49ff57b3e43835a81d3a1356aa08e92e8bc9fbc40e0652f1873d1d7bb5ae1b86"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2d72f42b807949f52d088fb6b4f1d4a0c810561134779a9485ac0151c26cd20b"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9865b8f9067265a5f5277e34e0a7a44599baf642fe59704000ee678c0ad8505b"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6013d65ba2d47f07218bf88689f898617a7b8597f6590f9ccb3118a330f5f5cf"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e734f48a4cda4be08f69eca0886659a765496791495e3d567db359320e718463"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1e165e713ed1a9b747976b23c93c43aad969d6e5df2f18fc421a63a0a1f35174"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8e04e607be1cba73834a39e6a71393362bf664dd79c50112ef4f21e28f43942e"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"19efde622d40d7dc6401e48f21942387213576495ba0fd499e7cb68cd5d585f7"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cf14188664f5e8f8d94550f020f4809aacd937b97ebfcbecf86b39c76cbc1286"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"341e91d585f8843b0884520d2c69c7a02cc07cb81d2894ea251731369e33f944"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b8661201c270af0a0efaf8f54dbe3b207ba1334e596f642d748d12b6d94738e6"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"31c3c9b167223b747983173e9798b2ae2910ac05f36a270c263d1a7de6fec082"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8bd44557018e4d870fd9de5160761fe190961f4b9135d7625b786f94c3586cee"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"41e33239837debdf10f07c787a301664656456320975dc36b59c43bd6e2cefe6"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"13749039f5ed61660dccd9f0850e05b6d8ef8324fb5e7367ad32ca89c4904185"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"83cf94ff893c43b35aef3c336f6d6caca345b5344416d3522d24f30d83110ce1"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d497564c6a9af21dc324a441970f3f0e6205a94a3959684b443fff8c3220e4f"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e86a6f9d6b8ddeaee0a42ea7bef65cf8633d8ddffde38b0b02287e12cbbe1d45"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a25674cb933892848b2a30402d8e6271ac3e44be681dc3eb765e5b234b395d37"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6effa97fec5acb1c1dfe35763dc46593135b0aad892c711f0819c02f7b637edc"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c8f9c367b78c63d97affc3d4bb96bfbce426c459ba5484fca771de3017439487"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"db7c6d90fa46082da7c649019b0b805c60ea4b5763a5850ce91c45c48c118722"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"725b70f41ca5f0ddb8c13699027bcdb744639341114f4c0bcb2fd6ed2eeb07ce"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"565c713c1493f6cdcdf52eec8b695c82384b3d16a80ece4f48c140f4d3532313"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"24cf008c8267165fa9688b95ce406c019eb1814aa51cd30d400a9aca4ad50786"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dbd92a52dd1cff9defd88dffa48c40f5805c79dc568100339aa5e993b1b9631e"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab2be23027d78652a799cfdbb087d9f0520bd10048f5e7589d853abf608f9352"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f535b014d57e550b44054261bb66add994122f9f839dd9bb8e0cbf968fce573"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f8e0ae698903f259b61d7e672248dac8ef191d5b27359f260c4cbe24ecb1a364"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46b2d408861a643a5383484daaf6f85c09e1d8423f2c12332637afb7fefffa47"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f99d2cb717b10cc7f0e2bb5dd78625fdffa188abc7a9f788a983c7c7de092a44"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"21366c72ecff95034433e82c30153f545e2317dc783be42950e421f49147ea86"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9840b99c789f87e2e679b046f6e6ff9da3916154709423e22a9cdf757916cd23"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0d2f6f5e981413b3b9a0fa1889bc5539f76ef8df6461dcaea0ca22cd8d25acd9"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bad10da4dbb3c8cf77d8bd2fc569cc87bf6a2375972bf639da72fe245f85df94"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"39265153b4f436ccde29293ba02211d872def1b2813672e82af5109b86080c5a"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ee9b0c7c76e175ab9c857f27c2acffc41859ab35e6bb4de570d8023f031117c5"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b5ddcdcafd1139e70994a062e3ea81c0408e6fce9957a02a2bf87ea6d674e183"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"95cda9427701c4137196e3dfe4e2d7133dfcb91aa5a377c6e810b5e7b49730c5"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb621332a0c49129c82f6e4377ef1c39f237b9d7cb83cdb1c820502445cf9898"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2243102389f541c175c3792aa0465c99d8e45a643ff1a1df23e36d266be9d305"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0fa580368281a8f954e9625a278c0670e7a8827705a18e79808132e61411edb3"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"937833858bdac68a37ebd7aa2ebf2e08e531edca602a68a7ee13d3b814de83f8"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8c6bf947679b0a0808604303392e2fa4dc9a41cc4519f2f0b562498eb4edb9c2"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"be220a922f2fa6db90cce6ad8b2379872b0af60352950364a20e9ebaa4b69881"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"81d48dac23238cff3575f1a1d4360ca7463db453180c2cc1878b05796eaad337"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"153a084e9a1f66f4849ebd79ae63f8ad0feca62698b07e8597f009ea044b9073"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1782493b40ff119a451b3be0bd4600c0153333b928b2fa95d44565d1a8603130"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb4899d0cfafedd6218c785f35ab0a4d0397e37f6d7c5607b356fe3a7a3ff078"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8f5f8303ed5c4330253191f86df6e80732ac15e25a484eb419fce3f5dafdd967"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e91ef459252fc918242a29bc62ef30963b435855b2ebb178e25f1e351856a19b"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5b8b46c0871c8e5f405c62dab465f0f62b307484586b5186f36f81657701b581"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4d7170abeba6c79fa48030d32a09b62fc1b979a80c20125edb3d71895e4818f1"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd367ca5b3dba13a0bca70c1f9b1f07cfeccae1ec9d79a5ab682b2264f41e45b"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6fbac4f2495d2125388345edf90738da036ed5d562c3445eb41e5847f776dd96"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b34a4660da80b886223f09e9ee9e4934885a63ac9b3891a44f85d0d2f58e9bb7"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a92d226d9891950c3c86756bf65b4770e978a2e60caf472cd335ae215cbcb838"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2386535922231f1d9bd866146f5397baa5fc947a928df7089d238c4fd8735fab"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b4acca9ab02997c5b42a65b1a33495344a191458ffa6dc4422d9152c4359b666"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ad3143fdae75c8ecd5888a57f7c89fbb402fae156e5229a4ad5d48c4b2cd58e"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d8a0dcbc4c167d71a962609fdfcfc394550960b684af32e4529cad693a2d076"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e189970ef9141fcc649eab04eeb96d91d7ed78c3d485aee08ce4c43f58d72f2"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5646d2c50a2f82c5b375ba07236da2786ea29eabb94d391070276a26c144eb4f"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f9b1aec3cabefb89d96c6eaaf71895b599fb8177f15500da503f93a83bea3740"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bb0c76272a8b1ad9c285a89b9af2e0dd9ac819388693e10486280bb448f40bb7"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"295162dd9fa89e7056619bde8866dea4fa77d4c3c7beba9b8e7cfc264fc84ce6"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef45cdd7fe4d423e37632251e04f5789e0f0423e5184077528c69495c4c72e11"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8c06bfd43846d4721a3db9393667b2bdfa4751888a217591967e11b1eae768fc"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d24a241e1135676b229d70601efa26b453ef30cf0421684530d6b68146e68233"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c66969e6b3a68a77814c4e003ed591f5b12834b2c04526a6a950d7fa3455b41c"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cf65764199d918ee09007ac7c197bc080a2311ad7b95e58ad52e6cc56950f027"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8940efa347b1309acec47fc38a03e727c678d10c14aac6230618daaa77e54f42"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e5bb72ae2e984ae58e91c2bf88ae98d9c89110624f6faab7edebadfab9a52acf"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"03dcc406c471b0d77ceed3b689951af5d9556c2986e55bde665e2f2671ab23ee"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd63989c322c1c8708b557ad52cc4f20a1d998de7cca5a91176c6f6560870835"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3458df6b767ac69693e92b0768874e4e8fb4725b089734d6eb32a8c59958dc35"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f42698003577697d0b883705faffac6d9d7357a9cce2b8844c27c67fe038d61c"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"833930da3819ccec40812778ffb13fb104ccabe030494291a94b3d112423208f"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f6782f6608779eaa1def48fd7b22f74b9393f428ebd38080320bb464791b2d73"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"700604e417b83dbc78fb1a15ccea388466e9a2f720e41294e788c2f32b7c45e3"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b3837e29d4a092ab0eff49e901f8523bc999bf824d8386a6c4ae207a92e506b1"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b511c1da4dd7efb546239f6a57f3307b2b6e65343e00f40a71bab174b6ec94b1"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c57082f1944e28490af3829fd533c4febef7fbaa95f76ed95e578e0debb30948"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f273fd246c1f2f6d6bc65c93a106bc1a935d8dbd82a73414090368b5ca0be007"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b8698e2575ad2a4cb2ce7008d6ccbd539116ad3ba891474ed688554b3b3a7d83"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5b5dd887a13d32edf4551d555606cf217cef8c5c6d948b5dd598ec8ac65b797e"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b1d20f2d306f583dd6b5b5720e9c5cce3feab351e5890e75ba9c455d8f0aaafe"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ae73199d7508e4416a669f83554121df3f2c9cf5f19b1c90a9555df6ed2dc48"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64d9ad2ddda0a5c626b86f9bdef5998cf3d7c99dad6ddb3b6ec57b1145aec63e"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a128318dfac758c708ddf8632a63bd40a0fdc7ce3cbc7b27ec36bfad9101e558"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b1087227d9260e018c3dc038fc0f055ddaf9184b796c794c781fd18ff3a0d344"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e00ac75f02077e902eeb8e351054793b693238cfafa7eb5932a33e92a5a732be"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"249166135a0d292099b3a3fea175d968cc5c675d683958e5bc13772bd9cd800e"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bc469f642511b303545701d3cf4d9c7ab6e8cb8086cbe17986f76ff14771baed"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"04f44019c1d942037636d787faa1548d5d6e873c834ac5f4b8c6d8b0bf773fa4"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a29d530c5f7b3d19df3031d0637bbc830e6cb23599582076a191dc92949f119e"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6f4081dd6deb5c21885ef7d370726fb72510d71eaddae842eb752ace8e8f8bbb"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c10e1e4e45041448490bcdb70eb9309a9bb9dfc7867d50fc16b89e992299f5eb"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7cc330cbeecaa87c25bdce95e04a57130d2d88f468c8d6e93f587d4cb4fa01ea"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"81bf82620f9501556e4fa52f6984e14af07197082e5363bef7f07598dc752b16"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0b43f27860864a21cd90c3f8b320f18a6d6ea02a9bf47f2a86a7ab251d046e29"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cf9b38d542f252e8fb695a3465dd627a8c423ef99c25c467f2fb47ef220de891"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a7fa4e8ce5c22ec8561b775473c1ad414fceba9dd080381314dd2f006a86a268"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d533dd45bac41a5aba2b1b86d4a0c91bcf8db7cc75b6900974d59a5240b7f31b"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"271e1db2412974e9f48b17f16a610d14c91c9db0126518ba551f2fd64f8d9ed0"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e054578df93240f893e127677dfd5fd5043b748d56e980ffff32aaca6b49ed77"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ecf1e0e0cbc40aee1b1cb0ba3a2601fd890dcd0d3404e4342a5d4801b93ba18"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c554cd664c89a4fc67e576e0d60bdf95d2a6512bd8584423af9a39705369374d"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"824db2c9ee08799a0609f7c02da9d2d660d0e8ddb5eec9072b4593a6e9dc381c"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af0e8fb89ed2a40c7b62b0c2c0eee90cb1d3bb98c3d063445d06fc51e75f2367"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b25cb05d726d3b7b595fb631ed195d5caab8ba3d74ed7a87e596f09b33e6901f"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8b8f52fb7940aecd7972398613a3c4c6874a089bada3c2e81a7dced5ce49844d"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3f5bda3e544a5bb0f72349c1f6dc2f6f81794ed235ed0ed34d61a0d2e93402ac"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"be63f0970c70bfb75bac74c8bb1a5c0b80d12fd2e805ba9ec042949010108fdc"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3ec361222a577e54b17e1c66daa2047c4dcb006107eba38e376c249b681ed45f"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ecd9bc81e098e9b8bfe2bed1f49ad5f317881927210e1670ba594249b66598e4"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8bd1e7013e50cd6465a25ee5dc1c02c7d629cebcff2f60cdf42bd2c0d98d1a57"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4e131a2e624fbb59134a3bda5b415596b614518361d1428875697d032a84a3f9"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0beae4b67639707aa46fc81ed89cccaecddae5477f0276cd37c674532a25e3ee"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"48c31bd3993fa09e7585978758a0e52f87dcc909c23645b3bebf079fbd37307c"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5f93141d2a11e47c08ca9173474ea056b6cc94ca755d0cf1c2f508609e54660"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2dbdac1a36296e011ffd138293c952f1f23b925a1bf90ebcf7a63bbc59529911"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"62575a8be1fb87f8870b5d15cf89a67161d19bc297db2dba6f3fe447a0d129d3"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b8e624e646cdbee6b6d992b26af2e5b66231bdcaeb90d0b09b6bf8338a5c87e9"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"df25cc94134cd31ecaefdc3a7deb2e468ffb53f8a1761d33de7e813c15fb2a94"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb79c904d2f603c6ea2a9b2f1d30ad8c21b9286bd9dbad0aa0fdda607ceee3df"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ad0109eb3aa05fc6aad1906cdc0be896fc8b1279f9225f7c34664ecbe20c88a7"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fa3a09eade999cae44928c313c2d43bc8bda1226cb18714cf65541e5ffdd31bc"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ce4362548b54e099a77f80923224c0a23e45c749e2765528598e6def430c6182"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"655cc651a6f594283081cb74c8310bac0a23d55f8e0b6e355c9509c0086f14e3"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"87bf48d165b4f088965533af034882b8caaccf4f6187a67fad6ec423f1ea93ec"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7226b6b49398e188ab2f385150d02182a930e32fed916b0a6eee7eebc92a4b8c"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e42264946ba9b660e977830debb1b97885712e5fb5ee43715859d9a6d0827c0f"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"693506cdfeabd3349cdcdb46926eab169cc9fff25134949c58d6231afb3bd452"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"97351cc164a2cec94791a745dc0874336cb34e96e7c4b7e175f607a542486ade"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f4e1d8b767f6969f9a1e5008de8b1a01a24408e73587d500a2c09e12377e2a05"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e09f180fa9ddeb309fdcd1a2dd4cc95daf585249e5f6c4fee1a940bcd89dabb8"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e7b76a523602a34e0f325aeb7a86feb20f1707f36e675caec6001b0ebc7440ac"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"55e1b159570e5a02cd7cd8f5c2aba11f732312e075c83e57ee95a12d93888307"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bb85baf5380c0040b068d566545fcf66c1155338f53edde74c171c3430533020"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"76e168a8a64a01cb9014b694103921183c66077fd4836cba5a3f0a6d8a78da94"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"504a68a856cd076ec3149f81e5b9a9944755ac017888f633674abcd932d2b753"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c67824a0db082d986448137daf53a612a29134377e46f6fc4c488952da4aac49"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b435d0cc3535c4c0e7e4de3ec1b0582c1fe577461ee2e3cdaaeca79a7638ee28"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"755c033f917ff9048d0d0fce0dd8201ee7a042379cf4dc7bea100d8612ed5d72"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e7ebda73ebf33d4788098b0c1f256c8eb3bb8e9a29d7d84aca7179dccb6084a"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7a776b3bf667f8cc23ce9a5e87325763d0fc893dc67b159eb50118d216319307"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"43614da7fccb90a1b020b6bc58d0ca3d0a9cd9d173265a61d21124d8febda377"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b68ac331415847d15ed725174873f78444822615c5fb06d27b5e9028dc9b2d89"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f4ca7c606b74c0d21cb2414fb7be8849331a3261f490c88e42087b6b999bd7f0"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb29dae597867f17dfeb3d59588f249564509794db7477e32b4000bcade3712e"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a3342c75ce7e38829e4a6216658bbf90c876273ddedd9ef5a4210a2497744f99"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"96689936f31a820e23ca659b831dbd94aed3500247a5ec75311e32ebbb53e7d0"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f468d5889cf069b0bc02e1ae07c10f5aa6fce56e19305e15248010099111039a"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a8861d7ce014c95f00eb133cf55af6c376628d1165d9236e5e78048237521d22"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2599f6a824ac229623168f33a5c2a54bf6fa3f3fa30f820d86d5eadbc7595558"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"df1d108f57608c542b62366aebdee55438d99b74ec3a22b36a58758ee6dba573"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ea0d814abf44964eeb01f16c4d08d9fe7719cb6f261526ab4f6d1157ac0cf6d5"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1c1ae0b43d571a1fdccccc997a858064e2944f9db4d082de20e7d825c310b6fa"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"388624100f8e09e2aec2ab388b8b0eae108c3dc825ea19fd924ae009d6f1a502"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"32d7e76c5dd4e134298527476a63095995b56e5de186f7678b3107705c3ff9cc"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb04c1ac2ff7b734d381fadecb6fc49b3f7a402714786a24b8045afed0dd9109"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"316f69b4e11c891231f5633572ed27eed10cbf868e604ba0db869eab59b960dd"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1d14649332d98a71b903cf3911d9dc229f3d4c364c86f229666e1fc31a7116d8"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f75e70599163c133ec3c8a1d9d58cdbf9deacadc858def4666573318a5df45da"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f1d52da03579f851d02430763eeca72f720d07f187278f10f1f7079a942c4bb9"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bb3213047966cd7d4de00229938ad895b319b350b0e4d162c9723656088a1249"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0c675abe85cb2857fa2bfd987c6f9c304d1db713410ce2e0cbca4c29bfcb1baf"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"99df2c6288934f9c4cacbf03958945235db2668f68c43ef5c78035338da16440"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9f5b1680805500ff35cf94bc938f7cb39a71819250b996a934800914ec05e6e2"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a842d040269449110901f18e5d71db112e5add1abe7148a51c8d5514aa39b2fa"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c6048e06b103abc8c86d4724a71de5a5c43c22f8773b6cef5fba10635137baf4"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd864965982d82f61cc1e19cc6a1e17aa48fda4ec4180b90a84e807ca71b1e3e"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"235f568cd14224fb8f63daf123599087054dc7a7c92b5eda5e713505de9ef653"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"35e1ebd08cb296602b8445d85d6a669cd8f636c28bd958b2b8a6c59968e28113"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f33405436e5f6d8dee88971a937158546cd89387feddab1c4f5c24be461bd52a"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6a97d3161248ba2e9fe8f71697467d165e89247ee5de0d932935d5f83f93f924"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7afa0b775ce68d6677806457025371d662c9d20a87c8a1f3dd9f081198515faf"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"33829b75d39e67d187afbb36a5075074548492302a9ff27f151dedb2025cc958"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ad52814738a315f45a6052874e10f3f9f24ccc5498af022e0c6fb354bc9a7330"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2c1a78a298afa391487310c8df1638c29396c0509b3a90dee4a2755bffc6564b"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc4aa4cddc5a9ef956aca612ff24e921f5af76607b406e3f7045df79124eb7df"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b290be060c6a377d05d906f386ead77d2010b3414d0ea64b0509a8ebbe0501d4"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b25656571cbda3c7ac870974afbcaabd8b898b7fa7c22df592915774e36c93e5"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f251b085648b22a59963da2ec4d5b7a6418b397a54dbb91b4d6266bffc614dde"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6eee582804a2608ad02f643e396d09137714227160d96e12345f796466959cf6"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e715321fcc64214033b1e083dfadcb1b9dcd9d2cd690c885e0f1d1981bfcafc"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"82cbe3c60b17c2910992bc1a9ae1e0fbdd4c116225187beda6e0a9a733d3d8bd"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46fd6d70897926645676047a12e582d7f0a6fe70fd8de3cb5c02f44ca2fdfe14"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0095f8c481ebeb9569a0e5ad891c9d585afded927c6a24b2ed15038167eb6249"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e88bba454a40358a6a676d23835ecc5ed4999f2a57e636d2cda834f3b0e7426b"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"471c782a3e98dd7c1bbbf5666c2c42f3f5f3de6f8cb6fef049d6ef3166eff33b"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"55113df281d34aa42fed86f1a6c6e9fd3b757c61d38291eb9b59da4177abed8e"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7512a20e6d579b103a0a27b3cc642a98005790202023bd36862c185d827dd918"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c6596fd31e35ec3c78f6390e30394a5802f72960e08fcc0e841c1498c2a1b59e"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae92d09ebdbbd7ed34a5c001c4e0b0ce71e0c9b1d9d969606c4f6b2a29ef87a8"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fae0f56ce6127b1f584d938c371e709da018d76ab45904162f782284f6e240d4"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6a25663826d066743a8da39bae345eb91b428a1b02617799351fbebae85c7677"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e8460e987a507ab900c465117adae612f0b77eb9bda0b86f4b4039f86ac9725"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ec86f0e9cd5069d920faa43c27e434c3b51473ecae018841cd0ed23402f353d7"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e787c6d39e47215e1b710bcae0aeda172c5107a30856939def138861d977f3fd"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"da74e3a17bde96c2522987a3eacfe135a9e16b458b90e6a23937c610e1ad5290"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"568e0f27fb73f5cbad5125b05b709a37bf65fb8496f890dede8665a5d5a4391a"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6a93cb9fb1addced64acd5b48c9029bbb29b12d621654a0e013074a46c640318"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1a5800fb16e000365be402be4c6acb590ed8d02c0e409977f78821f054e1b98a"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c48184cb2a84a863d8ef3461298e9c087ad2bcac517b4a5f60bd2b8d2d690331"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"25259c88ef53342ae3cb803b6b4d0d577699881c8025be42cc752cc6b17d902b"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"491c68c3a841a7f39897598d8221a849bc22621355e700484086ba939a10da2a"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a8e4314edb9fbdab70db9e6ec36131bc99a832ada048bfa9e93cfae1ef5fba42"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"00dd15f5c1ecc58d460a6bfcb009b760a366e217edf97e93ec7781f8a9ff3bf0"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cec41b2a26292c89e5a9074d5b0a57e702b7d630a108dc234d342e3b5df712d1"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4123c546de8dc007db6ec8af6e858f8d374608095f03ee9aefa8940f8821b5ba"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f28a1d04dd7033ecea3cf9397251df51aa67bd94b79a97f579ff0d0ec4cd620a"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0310fa0a7e0fa72716ae47ee23a44b5165ac95dcffcdb6167bd21140c60b396b"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"501ab209cee93c54df99eb144e830f9bf9724eecd496d082d4ea51686f12dc7a"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c345119334abe921269a7fe1580789246e3e5f0350efdc0ec9d3aa7e4e8b6823"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"188eb24b3258a97ba75b329ef72105e926ad4fc55bbb33d07d869137a10b37e8"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"025c77f88bbcdd08fe69156e346350279b154619bb8ff185c3db8a14c944a895"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"342da8d2cb947d5e25aada8587de8e1a62375ef7aa1e1085d7bdbbb5f9716385"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7a315162fa8002c9be6b3240b63bf158cc7d5c440ca37c393a315ad56b912ddb"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"37772db6cb06ba89939042d9c0b4b5a8854bee5cf171f074317f0f38d1e6b1d3"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"746d7ccbddb9f447ae4ddca58adf17835a711094f18855b2ff937ac21cafbe4f"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"37a808e7aa4039e4dfe89f0667689485a4ef951783c1c24b281d587b14ff9f8a"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"459d7a2ad8f49d375e3720998bd1b22c2f9df0db2dc243cf4eaae915d399b2e8"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ec65036295e1d2f85f8cf27826eb88b37d2529959a51b9ccbb3f71dabba8164c"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"98fe07237887bdaaf97433919067f9be34bebe48d2a166a8e32fc6f2b6a23225"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"194415659d44441bc80fc6f2792ba74487d81cbaa0b50c64d5cd5a7507612069"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7972f30de1d42540c08936d145011f796c5ac3cc94d5cf9d07cc4a6d53fc8302"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"40c0f7a599aa528aa1933fe22900da581beac530839a11227052efab02d29fac"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e77fd3434f50f91242386532db80c2120ac9bd2c15f3e19b5bde941d8b05139"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"df9f7d8145d3d3d8649e2f7e7765a0277b52cbd3ae92972bfbab6f638652dbb1"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd27de5e6bb9edddb8a077d25c742b9c40071a785a3c3d4ee54694839e055845"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6fe00d95a021cf1b267c357ec7fc92d97861659698964323bd77a3e87bee74af"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f7b8e6e5a89c4ab0fd321b27f8ae03cfa83216d8f379bc8d150cf43404a46f47"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"34f93a5dac7c6534d39e75a6c2092b06688b808d356042e130866da247819284"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a85b1a02ac3684482eafda6fe96ac0daae668e81b894a9010e685a168a150c9d"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8a05c1fe218cc0c9f7d5cec546ac0a8a29a0bab7684dec9eb988e9cc1f654ff7"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0bca19784f988e05db34eabf8f4aaec2cf5fadd2e97760bacf109413af937d5d"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f34f527ae99901f8d4f00fd91a0a73aa262fe9707f39ca4c5c6f2453ee8e75c6"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf9f8431a2dc77ca3ca08cc217c53fc5512477c8bdf2c565c29038dba8b31453"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7cd2013740082d0335acbddd08ddf61ee90ec1247223a1a54f0b347b9e768ce9"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"47d0d7a13175efdeafac7a8e570a24c73f01723151d51bdfcc54f7fa1bda3029"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e61a975460f15ef57e7a3346d0c9b42a4c4c8dc5c45bbc2e81a07f97278d11e"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"660cac02244520ffb9f6dce8d0831173ca9891bca296440da25103ec29607011"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"01b9c8bd383ad8509abbc6dff25f03f701250816ef4eb7c0008edd2e99997e48"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"45d10651f65244775b126a3638b9c4f1a5bc82a0c0209777f44d1709224da7ef"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7b7498abdadd101fe16f57e724f420ddadf2158194401f16c4bc2bc399bfdf47"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2a4ebe7f002e446e0456706099976cd98fbb1d4860daee53122184c515001975"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d3af4d4551d00fed05e192f198b7617cd5af3cfc1e3aebaaf6b656bb8a6e4ba4"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cebba78dbe2a5a88d628b6e78f7ce365008110374680ddf7ade62ebe35f2fab7"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e190396c929edf995c8aebae6c99a7c27f3fd4e203a58c61aeb308f7286f2dfb"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1a9aeae08799fe4502c65e1d3327c1a270cdeba6932f1c199189df77636f3df3"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f0adce926e22b29c5a1f035325f2daec58a5a7e565147822368049edb0b71e2a"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4de61fea09aad476b1b32eae7327e07f28e838a3403c1455dc4a1bd8e95fcca5"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"69b92d231f784c4331cc6352cc7cbb303269dc7eac4461198211ed6416e13148"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"405e62879bfa6a344a2e0bfb2e2834895e929b3130b98a899f35d16f45fb32a1"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"00c5ffed6d53aaac39553fa23f295d616f3c8849f68a8bc90c5cde2aae6312e1"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0756310c860a0784fc6ac6782eee383ff5f51326fd30b8784bd168cbde64fb88"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"abcda4339740768577d10f13a49ea901be337aec2815301d6ca2ced20ce68351"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"459a16b780a21b160e20b4b9c587ea3812e9ee302176e10e350985ea84f1c3d6"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"84f4a594f5c1d1445a8b3601cb418d1c404ae04ba153fbeac97f5640547fe1b0"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a8c912857e07e3632d936278618984e50e7a38b46fa4dfe01b4a1224d7101422"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4a6b69ba17494f12afdeafe97de5342c0acf0b3625880766cd3ae806360c9120"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1d27668d901982bad529e56cc9bfb377ec8077884695276fb841147969687aac"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"10cfb0771e2b9ec079fb50e09acca577bf1a27ff0b3231259ff1dab4c1b60ceb"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e43978c312ec7b33fa71bdbc1be17d0b224908fba1220150fbf21adddf9f9c13"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf8e4dbe7752e507df9a1a4814c68a5aa2f11c9bb2fa3b825a476f66c1909709"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f826f14205720d996a7c0abbe2775abf19784c1cfb652a50126fa9e80a24ef7"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9eff0141f1f0fa2ca948f3d4303810d3a398ec22aedd1433d495b84641e7ca9b"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e0e3170ec52532d9afbdb59724f7232fc9e5ad06718da7ab979b296e90366f39"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f369caf3d3dd3df23e1b77dd12d6f97887d948774c3ee53fec4cf5508b63cab4"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8e3f7bd963a5974e2e3abe89416b662a96f2bcfaf09c997023781e1320e0645b"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4d1d22de08f2c4c12ddf18261de9d834876478ca824b52d479df4b98287b2d3"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ba0bf5df6a75fa5088788f765fbdd4a1b59217f9d229a8c5355e849deb183ba"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a175481b1ba5a07289b85b62b496d00cc3a2ad76732e3baa0788f7cec02f7ed1"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b8927d412769f0b5e3a324f05c483a734d80c71cc8e75a867a6091b9e048e988"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d34aab5f9b781f5d3c0404e3438010fc8161af9187f37a71b45341f85f32b66"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"db50053593273c1a067cd81015f9fea8e1dd07f102d76ac2ac75cb8b2e079eb8"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"561a60acabb7227ddb9bbd4110454a9f55e4825b844f83dbd5f5e06dd0ddf383"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46251b07a019d3a86d7dc562374a042565cc35a942cbbb407c2be3c24c6a4507"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab7ef6f4b8afe29f164e388f66fa4d0558ef6568827adce57913e08ca11434fe"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a3c5c3ecdbe48877163ce2c08a98bcdfdfd12985a8cc99919395325ce768465f"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd114807c9a29eae2fa336a753d57a18695ec8ffd2447f63c948793214f2b37c"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b09d039992a5b1d0149dea9f01b693f8c5501df3e0b2b8d681ac985fd7802123"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"41c7847bdee191a50592a7ac1e1366d23e1371536374f8d7bd5b2b0264110924"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b1cdfbdbb0f5c3b1eaa205dcf02ca6012bf629af6c554f9e03cc7545a14960b6"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"898ab5435deb9a41218f016c8ef5181ad67d0a4fd796c4fa670040ebca7a4808"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e410f0f7d93125a26c18116dc30509d469225cd355b8a0780d044f1ff5ce8b7b"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ad4cac32859be0c3b8f0de5aa6c8dd3b985c1d21ea6d61847ca9c786029aa7a"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a765b674d92ab4182e583cb65c89cd59e36619fef6e32fdf42dd84c0b9c3efe6"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b4c6d3215fb34019a3f3e1c41d1f78216d044ebac29c1fbb9cef593d305744b1"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ad2f470cec0dce1c6521630b82b9b08c2f47972f43bb4f3a6bd738b5a16d334e"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cec97d94eb8679e78fec2ecacc51819ec2d659d935dbe79d04a698f031439a07"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb58681959958da570370dc29f829ea1735a3ffca8a1b7b8ca4592d4876397e4"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0c8209929ac882f33994eecae6565b3a1fee99d59bcbe0481434ad5156580c3c"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"08b3c8a99ea01c3173e113941d4f2395e7cb790ff84ca85e1a0c62de8fe97cfb"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"daba364ecb679971a919839d2112cafabcbc4bf5ee7fa41d9410dd989479b33a"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a87ed0287e14be9e5bb46613fd4cd7b472134163a8e2442e3ec41ac48820a2c7"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e96ade41c66b47f9fc16b72867aec4299d57d9b401b8d42ea5e80646a10da07a"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4ccfe471e2bdede71720ea5bd60db70cb64c28d3eba348e9792250ca3e62cdbe"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6ac2711bcf93741e36f27e4a337e7b1f3960371fbc8d3617e2b1f79f6ad721dd"},"properties":{"commitSha":"182df24a24006790477fca47942b048f95718ea0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e00f32e31aa78ca181181d3ecde0bf949abfbebf3dd2d889470d3253aa2af3c8"},"properties":{"commitSha":"b77aba63433b100b9482d47181b5ccc5e724ff81"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"115b4a732a138376412035650491f1dc55cd38a25e94b383b7e7bc211dff11ad"},"properties":{"commitSha":"803a5ba8761d9f27cacca83dd5da1bbaefdbf293"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"78cf9e3c2df408be9ad079c687cc5b8efd2bc2f60207960d9e89a6feeed1d38b"},"properties":{"commitSha":"e41021334d4c29cdcc62be0f7c0123a3a567edcb"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cea56c9a6ec094d67833b0fa4bb0463e8a54f4fb87ad58d85544a07fe2e80d2c"},"properties":{"commitSha":"e41021334d4c29cdcc62be0f7c0123a3a567edcb"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae2164669a05505247ceac91e0232536a071890121a280fe9044cc1cea06913f"},"properties":{"commitSha":"e41021334d4c29cdcc62be0f7c0123a3a567edcb"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"58ced3c23e71cf43d90c507db83d13c7f627e36a8cb4f7abb6b8276a72edb85a"},"properties":{"commitSha":"e41021334d4c29cdcc62be0f7c0123a3a567edcb"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6f9754cd595cc2ad6a24171c83a4756fc5fd9f8cce7a6fd2797eff6e375bef58"},"properties":{"commitSha":"e41021334d4c29cdcc62be0f7c0123a3a567edcb"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2d97aa55b90760d9e1f3189686c3d5eaad50ea9cd0e0e39e3cb474d2a93e161c"},"properties":{"commitSha":"e41021334d4c29cdcc62be0f7c0123a3a567edcb"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"15787200e508d86312b1111b133eff74ec068a2467d1002a5770ac0e0a82611d"},"properties":{"commitSha":"e41021334d4c29cdcc62be0f7c0123a3a567edcb"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3efd184aa3b3512890fb623bab1dc3c851ba4295afd1f194b6d8e2edd009afd6"},"properties":{"commitSha":"e41021334d4c29cdcc62be0f7c0123a3a567edcb"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"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":"bddcca21e54fe4a86af1866bd63791744e4217d529a0624a9a9feee86f115914"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"a36f9245e73875c89c0ea31f7befb89624a3b440e8cc49496690dc810b24cb5e"},"taxa":[{"id":"CWE-494","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":"ef04fbf4456ccc6f22123c43fc54500c74817df7b72975d52dbe07d01ae2377f"},"taxa":[{"id":"CWE-494","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":"af57ba7500e8155da55ce3e6ff4e588bae36a1690d9519722ccfbdf2aa2b0b4c"},"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":"68606d8ca49ca3420da399d69d032802c618e869b7da5a702bbb7647ddf04c61"},"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":"598f600125101feba3266eb3ac6e4c1ebd8502c29e1dc9b9e48f5cae266cc4e5"},"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":"3d54971727cdc16d52d03618020a480aa18c2c8ee639a65e6907607a8faa7e44"},"taxa":[{"id":"CWE-494","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":"18ba8f312111bcea619c11d8b584bd4c0a1d58b4860c19c08bd28b25f966fd41"},"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":"de8c868d31daff8fcfb2ed2f1499f3f90e7337864630ce6e2a205ed92af30871"},"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":"ddc3e94c7dc8ace3348c277c6a8d7598c39ea322700b840806ad431f69c20d86"},"taxa":[{"id":"CWE-494","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":"70d628a33e9c0c0bfa5021487f1f9f90f6fdc598c0bc0e2a0d54b761199ee0b5"},"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":"4bfd7558f3b1fc01f669ce005bbdd448163e181e2d50754d47529e35f9a7deba"},"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":"29dae2a683b1afca3e15aed4a479783d930fec2d44909edefdfd406878c1c53c"},"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":"438f98d6dc0916a8c6b24c1cddd156a0fe1f9299d4e0ac638beff5b8b5a187f6"},"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":"3c322f2c500faca91b911d78e122e4585315fc44519c608710ff1506fb9318a5"},"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":"99d80dd984f3df7694ca6379414b5b329397b6dc4113d8606ca5672d441aad10"},"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":"b1af6d3d172b2a6b274bb5cc3f28a66e4ea10f71df9f706c58ccb9b429cb62a9"},"taxa":[{"id":"CWE-494","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":"45e893c9683fdc2a498d93d65165681dfe89512773618eb2dd7736bf73012e08"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"58271846fae4a7bdd2d3ba6cee5b8237874aba2ae937f28675844988a3b3067a"},"taxa":[{"id":"CWE-94","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":"380d35cbb989affa5c4a16c60278f1b28a39a4dab2ef7ef21ebe6c27deffc6ed"},"taxa":[{"id":"CWE-94","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":"ace1e4a3f60edb350de0b9a45d7394cc9f635e207b74fdfafba228fd2f4a4045"},"taxa":[{"id":"CWE-94","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":"3daf4f54502540ab05290016b780dd8a92ae8666167cfb999322cbc1cedb53ce"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"54a0af91bb406be2df1e78a36a69388cbb67de783ad67bd8b7b18d2452684078"},"taxa":[{"id":"CWE-94","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":"5e697c55c2f759c2981ee49fe40c0e1a0313fa40cbaf255c831e61e20c6941f5"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"f302d01866110611a9b271dda6a4ad9c4906aa58215604d3fbd64b6b79d06911"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"20aa662f8430d11ee26aac021f16de0820efa7b77148246ff40245c4ed374e10"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"dd41e016c8ce6881e332e948a541b0c3a964b8aaa9740dd1069bf9910f68a90e"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"c8f079dc0f06a082a43487dfa5410c68345c6c72c92a98c711722be9df1e0329"},"taxa":[{"id":"CWE-94","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":"cac8d7101c8372d920c23ddbabde32a6b6fde94953ce3f2c2b9c11b373335e39"},"taxa":[{"id":"CWE-94","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":"e8726280f52eaf63d61109e731d34bb6514998e503600fafee9a07d086e498c0"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"7821d929fb13928b60980d2ba781036953ede7ee180393b0885729907ea4de91"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"f2246af5fd0ecc93ae4dbfe2cce548a6afc4ac2a7a49baebc498267ef2890052"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"f3e2fdf35e7c591087370c926d3e0e5a5408b40bf54ec3fe5a61e240fd3a2f51"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"88b978c63707e165c71a2acb8d2a8f0c8991966503540c6bc19d1144a704c6f9"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"39034bd720b9a43757d8f0a19aef45c283132ccdbc4195d7d6351f6c138822d4"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"105f75cbaf6432381bc5261647a521234f05742171dc59a7d834cf9edd63bbae"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"8547afa4093f54bc8d506970e6fc3436931fbbc907db1be988fc28c1f29324d5"},"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":"151dfd143e00a21d3b19df727d4a4aa8f793fa69243fd262fe547dc46c641207"},"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":"fd141473d6875da877d33728fef15023f91aed7c39faf581309d99db444e0334"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"64518b9bec91fbc0c18082847aa9f6a6e45a17401039dfa84b7761b1135a33e4"},"taxa":[{"id":"CWE-494","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":"232e9e817ed96767245f2a7ba46cac375f218248156d3f13de8e189c0038881c"},"taxa":[{"id":"CWE-494","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":"684eab8212590daafa95e88593795bda7d578140fb21a2ae991924c1d079221f"},"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":"e82af9b6016ff1117138cae24a898254c48f5a4658dfa62d4919c6b871f7978a"},"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":"f7bd68986757edab0a9f42e6d3f7e7cd6e915c62cfdd49aec359fd4e9dcb5981"},"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":"4f134491c81d2e023c879bf0e55239afd78f19e1b99fa456caed4d5b78016190"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"8c69b72e44c0533e5d9b8a6330056de5a3c6db31ed091c29c506fc4e1e61029e"},"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":"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":"f688bb2e215bc0e103c80d019982e0a334b96048a7910aa809486438c14cf633"},"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":"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":"26ad29d67eefc2c44c3757c86f3b8a01d0dcc20d8560e06b7d5835c4f3561458"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"c48d3755f4e1471401a9010edeae141770de38a873429b780b83106311466846"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"24f20f127a2fd71b707210f0ae7395181c1184e128e8b5965a125a497d8f0ce9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"82ecf1516692ac0ede6c53218f0aa145dc5e664bccf1eb06c82a113accb049d2"},"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":"931f5409a0579b48247b4235c76cb32237ef551d174ebfa05e07cd3808b2f9b3"},"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":"16a9654225fbbfa98b17c8bca5528e2b8ea1d01c9605bcb2479ecb7d80b7b106"},"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":"b3baf6efbe22cf2369bd566a02800ec70c35592dce1abd9e36e825a8d2ce5432"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"eac0a9dee6cb42a1b3744a973fc313a225f24316eb2847c003732147c0db73ec"},"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":"676580dfc11c2d575551ac65f4f6e959286affcea43bc94e53d8b71b703435dd"},"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":"69aa7d8313393ccae9b0764391b203a8df17ed40ebf3563c4fb763c6031c7213"},"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":"d6e1dc607f8efd5f7f99ca1cf128680215932ee4b5ead4988b1f82948dfb1a30"},"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":"14812e114dd9ebb8c3ef037105f39258acea472cd11151e1aac90f01f6e20c0f"},"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":"3790c747484a56fb9ac7f3f0b0eb32bed4d4326734d80fe10a01a4e6cfef984a"},"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":"47363dbe5817799925ab9b2172f7c5655cf54178e66eb2642bef0a293166c59b"},"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":"6eb20cec9303385de9265c1d99d995d0dd4e45c342471dbe4d4996518c8d01cf"},"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":"78ab1fab110bf9eae06cd0ce21166d855f8f7081cbde75a956d874753a2915ed"},"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":"18c7b2aa02664e6e76741f217f8aed7ace17ac3ee3fe13354bedd722fc8c529a"},"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":"59ae1492493121f384dcb9cc2f71f00e6d834337f2146b38cd2b30dde3685ce9"},"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":"406e2902fd6d5451ba9750e516da1a01d767848f6d748b81b99db76e4222746f"},"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":"80c1ec69b3bf86abc7e8945093e5b69181112d11ec0ce236a5dabedb2b844f2d"},"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":"b4273fa6e2da9428a9de32c4fdd5971739df253587f9461a88600bf4735082fb"},"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":"5f7344b18878bd513b225a6dcf99ae63f1455b3a2222d9ce716ed894ce8248b6"},"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":"0fb796099487237e5f4ebd71d22ebb409b29c6393b89a77145768719835d1f5c"},"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":"90614efbb25164e2b65b529ae3dbc3aa99e8048a0ac7ebae9a995672237c96a4"},"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":"9555fbbe6804047924971a1d16b3a9d48595620106b160bb803275fb55e70d6c"},"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":"992811a8480115c3ad0655aac40315840e193e61eda14efc1ab2ef825af6f482"},"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":"f12c909e0ec06da48145f0682b08c1917e6ce3c32c0c7417cb3dfddc7bc4ecfb"},"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":"507fe758778eccbe48a7fed4d115605b74f3aff4358c473af304407c2c8163e0"},"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":"963fb03ce910a915e374b38ecd3bcafa1c01fe2d33b28f561708e9e20dfeab92"},"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":"d5d913aa5a498e61f0a08ab4b482e5ae4885bf6d30a95f966e4afd397cdcbaa5"},"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":"13b95cb0d863e1f389ae8c671455147cadd7c00e8801580210e8808187cd1ba0"},"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":"d34c0c562bc90ec8bfea13dd09a5b5cf0069db18a189ad9ef7b873d3412ae4b4"},"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":"07c86a29536717c96e55ae1ae0c3c24590b3209e5e0f3e4b93029e7cc70edade"},"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":"ee8535b1b6e1b981895a0250af7c37d24da86315a516066f05019ed8bbc7640e"},"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":"7809c8169d5c4030571ed8d03068a789791f93df5ebab15c7d0ad136d2a68b84"},"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":"5210591d83a34a08f00ee66f2818ddba60f41f07dd155c9990a3a1b380f9e93f"},"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":"feab872495aaedef3bf0fcb1db5840ae0f88006db5859e7e0eaa070bc332f802"},"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":"f164f40923e9d7c7c15d98411c9bbf8084959ea07bdf09ff68dc5a594a1ab25b"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"99fbd638158b78cd22d4bc4f199e5c51eedc2d01af9080288ac835b9271e5cc1"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"3d040de2e6200615af9493ace363f82a76e877836fd5621237d0f81d5cfbf322"},"taxa":[{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07: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":"72588fa702b1489aee24be55e37b23cf3de77552a6ab7e5d66c8ceb81bbfb4a5"},"taxa":[{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07: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":"a47f8191ced78896cc7a63c1824ba239935667898f91ec36d5718ae091e71dcf"},"taxa":[{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07: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":"71adf45089e114e6d8af83ca40076d9e6b229d19b374816f2343105924e52181"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"ad4a10e1ae9534471274564a205fb4dccdf1a0cc5eadd80a9b65b201163b25be"},"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":"6249b73398e3db5836173c91c1cf1fdd96ef1ee1b00e60aba4e0b04450382b08"},"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":"9c704925cb1f0cbdbe86f271f0690f451c73cfee54d19b44849efe10aaf38b0a"},"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":"94bc05ace643cff2d7874d5e0abfd876b53ac6dcac8275e548204b097f27f4e9"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"915361b36cc521d1f9f0d6d7a7586e09c6cb5c884aa98758e4fd66e16c8d47c7"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"c0179a007000776a3c00d88c92f68487b84e985e778a5327fa9d86826a8a2d21"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"8bd0a4df96c0ff0990bc65bd7fde26c5c98faca5b9477ca47caaf0d9cc869e6c"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"c822a7975bc0163ea1029153decd499b787eb96501b1f52aa960d367579ba1cf"},"taxa":[{"id":"CWE-79","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":"3d7ce385874f7cabe0738651e858e49403cc273454babbd0f8820b16ab984706"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"ccb13c23ba5317379b1be4b2fbc207daf3b347e3044a667b64f978916116301a"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"0cd77fa203e7c3b1deb74dd71e4a947893d202bd7786dabdcdb2150d647a3dbd"},"taxa":[{"id":"CWE-310","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"01b9781dda162ca746afb6166edd10509f8eb1c178a0fe062b495315db4f893d"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"a941b513bbee26705d740a575eb77404f9f9e8559f713e58f69d571037fdf2bb"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"87822f0b65004b49d761086f036432015c17ef98b4eb784c5cb3c4a28af1807b"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"fa3a57f6e36b215baa7d85a093423d8b3569d715bd851cefc350f4b2e80326da"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"c408d8d5fd09c347a02b9372df42fbcdc150337d4888062d4e545daa9ca323dc"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"5a6796d445854be5afa26867a18869a6069218477a820f13dd2f6045dfacae2d"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"3c9f48b69c05335595d6af7aace5ff92fb3f40bbe4f91d8ffc8598f9dc1b5923"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"c5332e3aee2de2fc1f5feb76d9fd07fb661f3cf9b56d4a0adb3475f9d5eca23c"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"9777142da1375aa31f880bcff5d05168225ca4607ea2c69b439c455e9e854831"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"7826f6efb68faeb0dd4e92c227dfc7cee25c3381960678e2ace68f1866620040"},"taxa":[{"id":"CWE-1164","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"706d105e568897dfe19071f4108a0f4e92d7eb459d0d84a7a2c8323d24fd15ae"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"e8703c489412051ec1780cef7705c55804c7722dda76f8a70469f34e9c9a0b47"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"5b906a1ae86569cb180a343d0c4bc97fcb8bef7cf9b1b0438ac3813265b6a691"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"403b998e40e331c0a4de69e440f4f4834f3c6cad5fb29ad7ca6aa9c048abb26b"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"bd2983c2ac9353569a97b71223c9db469f598d21e4f344f3a321097e9c8f9328"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"0fdd748fc84c5daf1961f86224e555f905162ea6fcc311a60d9bba79349df630"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"5f8d20f962c2d950b73b6b3e9207de12ba7acbba24b06da129ddd4980818902a"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"b86e99e4d01080893921ddee9133e7fec1e7e0b0aec6b41afd974cf62a8e9e7d"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"72dc6875e58a20e4676301f50c70f57cdc5d7d345f75f0e1b7d1171b7f48f00a"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"1d700257b56be747f2db16c5e065aaa9447b4bd7630cd3785b3d9ca6c9bc1790"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"851ccae42572f134d32880516cf2a97b320171b96884fb654bc3858417e64e03"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-755","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"d06109cf000c124760b64c2503f4f78d5ed9dced06ab01bf8fc661c566b525fe"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-755","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"390203eb678107f117091e1c810a420bc13ae12dcdda3088de6275f313a79213"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"71c81f5466f2baf33c169bcc7ad450ad6a694eef416503c6d27fe7c90f719718"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"5969894a92101e00c4a24b5b90e898730ebe5be769a958b10e1ef211af818789"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"ec4a4864e667b6ae2e03024bb7a6739905712d540b85321e290801106f590dc8"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"381533edbf518f1addadad1efbae04bd6d26443b36998dcebd31168cf97af7ea"},"taxa":[{"id":"CWE-310","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"12778021b03e5d5e6276ce5a9574f5adfb45eb094ae285d2a1a1390828e636fa"},"taxa":[{"id":"CWE-310","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"2d6161cc583a8ffa3505322685167a64bda1fcc023ac9062b9baaadbb457fbc3"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"686d7375e683aa7f61dbdf3f09b435cccdcec35e3f76dfcb8afd34e58a230fce"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"7bdf3e363ce87455578f4cfabf27cfda04aa26530e3acba93c3c5b9b2976117b"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"409c822b50564aa3288f50794988a7204334f14113de2b9a1e73f95a43d6aac6"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"defafc94738ee7c85db9c79d2ef24df3a705e0a4e8c2fe37eb5842f4b501bd09"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"71ce2666ef878780b9879f4c25e1c862b2a3ff13d4e8cfdaf139fe60e6fba349"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"d9191b1a51f75d7adf61d41fa9447df51c5ceff968e29d3fcf7069a637ecf128"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"1ff08d86ea827acf3a30c6ccb672b53f269ac9a2c72f5264578d428d320653d2"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"cbc182931be426dbe3e0b75de012a003dc5110a6228e78389e1e73a14bcda250"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"b22d9d0d15bec96c85c55eb1770a72ff68fcc6ff788d4a83422520a4c6777830"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"1208a66053d7999341437f2a4a7d0eacb6712b53db0014a37630d25bf412f193"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"f8a9a114b982fc8dc806824eb5c3199aaefaa4d7b12eb216c975fb482df3ae0c"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"820faaa92d76a93573411bc51e8f5d5fe3ba66e02ebcb8ac3b38677abcaba34f"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"99088deb86fadbd209eb4011401e59a9089cde4730a11b67450213ae7de35cf2"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"820f3ec0b4aa9d1e1126579976b0a2c245402f29723bc5306cbdd01cf0b47a7f"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"9565c53cda5b68b64aeabcf0617b1e3e5600880aa47507069cc623805182ce8b"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"6ed705e98fb209dd2ec2beb017ae680b3fa27e7c26e63d00850283fd133e84b2"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"05197850347687de1db1d70f49404a5a2921bbff063186e8632b4afc48ffdd59"},"taxa":[{"id":"CWE-310","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"854c461b8a361b12e8d71ba2c1492b81bfaad583493cd916c988e4603825f4e7"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"e6502800671aabda1d62143b4d015e44f16afe5cfb92ee32a962b36326fe7981"},"taxa":[{"id":"CWE-1164","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"6802e161e46586499eaea7cd819b5dd59ee26478d566d99adb21e65e9a5a0e64"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"7f7add9f5d401cbabb8abe6512712736de9583b098e4aa3cc9332bd00c81bc9d"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"067805f8f4af0ae4404f39d1a187f4ee424a96ca12dc0007c8abc4c16a69304d"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"974d8646b45f1796e9190844dea9e8b0018c7b9adc79cb0dcb3149035a2656c2"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"94a716f05f8905ca25f9b926910696be48540b4a1f5ee8961d2f0db8f313d29a"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"abc2d2ef8f1dd42d6fda600440ee7ebb7bd769083b1166c6f9abe2cb5a8a22c3"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"146ff9f6e72d1715b506f4bcb3224855085f95bbed68866078d38a874f2759f3"},"taxa":[{"id":"CWE-310","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"270dd7918549fe23dcb7a9a66f667b7139799c582697f7c20f77c23d6ebaa2c8"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"665e715c491a11aec1171ae38580cb0de0268437ffb0d8489d3eaba301754eba"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"eda803261804897e8bce941aa5811a83ef32af31626b11f2715d3d9f73853f86"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"3bcaf01d650904ec4a0760335aa9dbc6b133f6630d55836f73026051add39f0d"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"bd92a75633bef14eff1bc0061c7ccc2e956ab21f9d101a405c0d9e4c24a584de"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"ddc76308aa40d665b3925ab6f1b5aa4a5273a277dece1ab89ae2963a2a7012b0"},"taxa":[{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07: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":"830fde06aaf5429747450a29465dd0078f7ae36e139bca792bb65a66d2fbd5a2"},"taxa":[{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07: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":"dfeda8ad120eb174ae732d3a8c73feab6b9a95a4715dabe04eb0bbf8f7f5d06a"},"taxa":[{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07: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":"791ba2196d4347a89437919ae3961e9b9493d66f5d7b56a68d555c5f963bd767"},"taxa":[{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07: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":"d17b99836d80776bac6189f8e24189cd7a88862c41664243572e5afd029eeb1d"},"taxa":[{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07: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":"b1cb6ec76d9ade6933461a2b98da05db4b59a1f5cc562146fd81b0d0d17b7c50"},"taxa":[{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07: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":"a20dcf14db3f55025500ace0034a8b335e5cf13213dbb9dc17b797bef8148c00"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"337dee59ed88d5fb703c4d24ea3b759b3b7fac82f08817bf27d79aa5344ddce3"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"7af8a1b9ad84f23ba94a51ee95e4985127d68b4a56f36affef9c769c4c4d6375"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"c15b25a5f0cf09809bc791f2e25d03f26e1c6638705cca0825b3f2614f5728f6"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"ceb5cd61ab1a9c7ab32d61304c776dcebdc259b6cf7336619f50daa9a49abfc1"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"c047f4ae5c7a5aac711595adced8d9fbe7ed7fee3b998e80924fd71929a692b6"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"71b77eb53c5a52d70828f8179da8fb2f5e47b18d2763f96b92532266ca911b0c"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"0c0edda38328da7e47a18a35162c980b1d53d45bc6e9513466a73f9da99cc834"},"taxa":[{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07: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":"6ede2878cb39511c8409cf756fd25945cf58103c0d7d8c0b72ca9d9819563bda"},"taxa":[{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07: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":"bb2b05b1997eedc09738c9ec671dcaec8b627ba741365e73fd4f2930cbf657dd"},"taxa":[{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07: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":"f96f7d459736cc645d9fd5f6f691545f20d9df9fc681d4437db47284e7579263"},"taxa":[{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07: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":"91b58e4233c466f3a3fc4d1f49bf6afae20a12d072b001ae6c7d126fd599214a"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"c0157868370abaadcd52706ac661494569ad18cf11ec038d415bf2728f00484b"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"ff11dbefab5ea0470d1ebb3b93a817fe2b8c601861a4d928e124bbb9062b00d0"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"24f8d949286dcf01d66f5f8ac8643ca74032da8d639ad8b9d760fad86410d28f"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"3927a9220ce0b29f4e3a05b510d7513bca5249b43a5f0b0eb9fcd0b52a4c572d"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"fd365500b1669fb32868d801a2d438d2cbd928702c98605fda15b9c8551e46d8"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"4b05bb1d7582511450e5df76ab1034117b80567db2d70f83f481a8d406619cef"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"470eaf60e1490b524d25d51de136a03f2c2c5e1cc4f4e44b2af33eecef6b4b7a"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"6ecfe2290c66c46eede72586c56d49bc83d7b63a6b7bd0a38f013272b2a802a2"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"f328d7f78ec15e4955b2e898034d6d31c07b03d13824829e606256fbdd551657"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"e4d5346df9225f84600974070977a1db4e3aba182ce5a85727ef4c1952543e5a"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"662a3b2b2d068707022d5b42187bd5680a1edb55a7457616eeadaf7e29e0cb92"},"taxa":[{"id":"CWE-310","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"f7cde77860ed73e84795d1211aa0d3169e8a172ac842bccdd508b21a4d068804"},"taxa":[{"id":"CWE-310","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"6ea44ca3f58fc056b223eac762eeadec48178030f532d4df3dd716913afbe5cf"},"taxa":[{"id":"CWE-310","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"9b926d769f6a0540e40edc978f38c2ae277bded556c1d9a817996ff3975e06b7"},"taxa":[{"id":"CWE-310","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"ad20ae107651deb8e4d1ff90b8dc9a3f0f5dc0652b187a861ffee316cb417985"},"taxa":[{"id":"CWE-310","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"9f64d6f0708fc67d10a08153d9d1726e1abf088c958f44045ff674b90c58049b"},"taxa":[{"id":"CWE-310","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"97bf9781eeb7d09f4adb5e33b9dad482f6b945a9a7cf7037e0a6e3987b745c7b"},"taxa":[{"id":"CWE-310","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"9386742d8804ee247b8989dfacd587766a463241a88c7d1a4d2236040ccd362c"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"f4314ca1979ab496ad6d47aa8c7129b29a1c1d59c84959a06a9ad430c5d38196"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"df321b886008f700a709e91fcacbe8f28c7daf49b45abe1ebf6c17f97f87a7c6"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"972ea32a79374a3cea412b4e45f6697af20ea4207320a5c77a939fe81d36a681"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"7529e4eef73c629fe702e74ecf8753755008bff35a3247b9dfecc870d149c44c"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"9abf9857f8323ea87c907804b57f04ecc03c78563e10372fba1dfb2f49dd0b5e"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"53df3990d6b7e7b30b6376d57bd266e74b9c65b9dd06bc6f0996958f172ea73d"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"526a2b4956909ffb6f010824cbba0e6ff62984f10b32e96d286f45892522e3f1"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"44be6e1525e40bddcff86425c6c3e4f245777554a4bf89772c6f9a0d7ac9b672"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"a5b05a8512750a0228eea7b68e830fcf55a714ab10c17fece887cc401d986d56"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"18e3562196b7962fd22429dc00293c2c28b614607148c179ac1688f6e31f26de"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"ffd809c9dea8fac06eff5a68a427a38d24a237cfc4ad88acbe7898a86b11cb80"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"be981d2e54a3e3ff4d87416450ffefe8b22aa303cff7d0f7d601c719989b60e2"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"9cadd0d86d353bea7e41bf3abe73a627122b18d1cb918775ed160d3d90370c0e"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"dca07509c0f6295749a44566d05a88c7f10f4becb7f1f5683809e3ae74f4f756"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"ca408c62adfa0283c919596bb7eb5696bb9d9d8cb8993179ae3cb8989798087e"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"2da170fd84ccbdb73d290f24c7c9eb8fdaf6884c112983a20f85390117be5b55"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"a0a239c83b77a6a1b3aa2728b9e285c96e2ad1aa87f3de854fad095605763ef2"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"ac4bc02306714021f65d78f4a8ae07c5e9640bc043ab6e9fad4d7d01cb671a7f"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"01f730ccea290ea74df7c912f3e76eff9d214db74b8f159ade7738e34afd28a4"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"cd4d3ffb6c311826df0087777539ff0f2894258c75e277479cddc5f88d46a943"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"9acc5133c9647a21f02604b7f64354cf0e7d93ddd42ce36ec98ca16ac10cc94f"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"bc7e5d4e89c27304a28b4a16a6f8a52cc78fb1541374bd21676009730303acc4"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"3ead464868b0105b4106afaa9c5f380f648febaa6075c2ee0e3a3dc66a2a76b8"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"d057e5501d7de15ad1c7de9a3110642d13bfaa472bd05145f7cf29e913fb56c8"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"7723cbd06e6a4be08222b58a46546f4b56885f606f5b8f13c2cf7e40ab9d5d24"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"29e304b41094fbcbe239bb4a0f48b5aea87a37143447eb43517e6259f2218812"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"cf3ff0103ab4e4fbceb3d06f6733786b4e817575163c629f234e5deb94301083"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"7dd54f6a2efee90c4f2cc8d7637afe8828fc9e9c7e57acd3f59d228bdd087fe4"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"353e80e78030cfcd9866b11501dfa6e05c51ff714bac3cc6c81e3094d24ff3ca"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"fb034ec4836b107ea2166ce671cf2963de4deef194452520b370981f635de08a"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"e2c7b637a57f60ca2097159bb5b402f2f9708ff11258db77b17f513c0add1531"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"1a73a9671937bd4d2793cbb65a370318b1787c93a128435e2c23541e5e14dbbe"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"26c11ae868dbfa2b7c327a3d66091b6bd2fba82c8b5cd1fca47288d0b0d614f8"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"c0e23ecba98e35e64427857453d8aaad37ad2ea863e2e16de706a41d1ee1a1f7"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"47246150c2adef029d9ce5d7fdbd7818212efe66c441393c9a6c1959b92cba64"},"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":"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":"c13b10e84a3ad194fc2a2c7bd263ef43ab24c88c044374b4732137bbd1dc51f5"},"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":"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":"3a03c9c458c74dcee3ebdfdc92e02a716855d9f1062c8c1dd6d79f75f20d662e"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"c3e76a73dbafd6d3fbdce8ab870d7c5c6fdc6052130d0b5a8ab0d8648897c2f5"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"35c983ea7bf680955e85215434aee99f96376d7822fe3e7c256ce434724713b9"},"properties":{"dependency":{"package":"seroval","version":"1.5.6","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":"f3b077b5ce6314209be3200a48e2e7cfcbbbbd858c719063003ac2f1a989a138"},"properties":{"dependency":{"package":"lopdf","version":"0.39.0","advisory":"[GHSA redacted]","aliases":["RUSTSEC-2026-0187"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9eabe50e921d2c2a306c1659895f52c11083f6a9b5afd9baccfb22db496e06e7"},"properties":{"dependency":{"package":"body-parser","version":"2.3.0","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":"c2159ca17de5f9a110eb71137b7ef5620235ef5dd3fbd582026bfbbadae322a7"},"properties":{"dependency":{"package":"zod","version":"3.25.76","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"test-or-tooling","file":"tests/release/packages/zod-4-6/entry.ts","line":3}}}},{"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":"5465e97a8cf7f95f53fc9eb680323fd3163c42c48d9fbe4cdd44def8f5d384e4"},"properties":{"dependency":{"package":"zod","version":"4.3.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"test-or-tooling","file":"tests/release/packages/zod-4-6/entry.ts","line":3}}}},{"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":"ac07f6d7edfd49261e66a0ecf670dc83aeb27f637d0eaec58b89ac41744f7835"},"properties":{"dependency":{"package":"rsa","version":"0.9.10","advisory":"RUSTSEC-2023-0071","aliases":["[CVE 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":"95686d8e64236c3c2c566e482859faf67a5bbd9dbeebb6f4df8aab56c3496281"},"properties":{"dependency":{"package":"proc-macro-error","version":"1.0.4","advisory":"RUSTSEC-2024-0370","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2b5cc6a78fe02a95b2f6755616011982ae866dcba8c2aeaae7b037f36ce19be5"},"properties":{"dependency":{"package":"unsafe-libyaml","version":"0.2.11","advisory":"RUSTSEC-2024-0449","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":"b5524f25221308ec94b7206b58afaa59996104c20abaa242285d451f5344e44b"},"properties":{"dependency":{"package":"rustls-pemfile","version":"2.2.0","advisory":"RUSTSEC-2025-0134","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c356dafc2d2f879539349393edf47ceccc3e0771bf15e4dae816abd8594fd25c"},"properties":{"dependency":{"package":"ttf-parser","version":"0.25.1","advisory":"RUSTSEC-2026-0192","reachability":{"kind":"unknown"}}}},{"ruleId":"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":"77d4d5d4357ce0a5ade8f6f76c84914f1a2c80f9fe7358d9854254b760de650a"},"properties":{"dependency":{"package":"zvariant","version":"5.15.1","advisory":"RUSTSEC-2026-0370","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":"7f6329e2b29fe1ee1dd724766af980b151618490b720201bbdc1839704210c3e"},"properties":{"dependency":{"package":"zbus_names","version":"4.3.5","advisory":"RUSTSEC-2026-0371","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":"f67f0700e108bacf2f3dfd2008273e31f01b0ea1f2d5f9ef71c4f46ace73bbe9"},"properties":{"dependency":{"package":"zvariant_derive","version":"5.15.1","advisory":"RUSTSEC-2026-0372","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":"ca383df8f93c1fcb449201c7c47b9fc487e55acf31a9bb60212d29fe36dde189"},"properties":{"dependency":{"package":"block-buffer","version":"0.10.4","advisory":"[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":"e2a7f5a82dc325f63834d60145cc9bfc86a66cf58142fbec48fda958aef81e29"},"properties":{"dependency":{"package":"fast-uri","version":"3.1.8","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":"00490bd03b02cbeee67131dcc04d4f6cb43b5d73ee4764bac91a187a9aa1a307"},"properties":{"dependency":{"package":"fast-uri","version":"4.2.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":"7701bd8fb62790aa18234472e7cdefa45ff38a01c75b17c68e3aea9c285faad3"},"properties":{"dependency":{"package":"fastify","version":"5.12.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"packages/hono-perry-server/src/index.ts","line":27}}}},{"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":"03949ce0ad73a2a9d06d7a1b74b2e80440abe82fae87355ee698d3a8be0a827b"},"properties":{"dependency":{"package":"qs","version":"6.16.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe2d688610b51e0a5a02c7c5dd1724a4986e40f2689fb84510e2ec0164c27d6a"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dc938cdafaf245962ba50db80592552efdb71dd5711f66a3013de13e6eab6ff1"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3813e33cd3d1bdc8a3b9f7c6356bef67d2f974acdec8014da44d63cff0a5dfa5"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"048bea009478db7e238606a4ae4decd40ff473603f4149d6774b050197f7e6ee"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"420dc9c3c3ecb7b2d85467b872b3c453b74292a6e384d0719ba6dda8d8660c48"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9e0e8296a17f1bc4fab4f9bef88aebc31d0e32fa210a4ac84c007ae68cd272ee"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7a6b094e02e7a81e6d5327bab25a311c1a8471a5f142534f6939876389139328"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1e01370e7d7560a4af52ee718142e5291e708f18388746585caa477828289a74"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2abb8b69276a412fe98a0bde3147cb6daa48068291bc15c9a64d558d604ef932"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4916a77c05b72fc4b3dc93f9c2a549e073936e0bde96bd4e6a676d38893b46c9"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8b96745ef67193d0a6a8c3841e70f121d14b645c27e414a8b29aecf946062072"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3de61bd1a81030a97e6eeb34e0950f115c994f7c015cc78b03e26a6a0694ad3d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"67065ef6d0ca04aa971d80090712cf4b4f2535d54ca813e8b44c49bc02af0808"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6133551ceb225c474d00706b7471f8aab1340ead2366bdc2a21aa374cf613536"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f5c52fc8fa0d910e1fe9ab97354c4179591244f87053d6a3339f6595421d1048"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"926693c94c5dfc4af2ee89189df006894cc5ab3edc02bce79645867b6eacf3a4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0eb0a3b1ee91e5f909e0714c7bfb0c7d825788fc2414437ae0b98e3c6e91282c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c4d2e71610dce26398251471fc144abf785f679c2a0d6bc6a1c79a19be485cfe"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/perf_frontier_report.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39042238ff6afb982a5dc1231eaa73e886b420fec8b67c79cda3c2ac819d773"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-container-compose/src/capabilities.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a621c6a207c4b0f06294cd7b7362a7790fcc16b512c7c0d1c89e495a9bd2b94a"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"example-code/forgejo-deployment/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7e61065fc06c38cd6dcaef3b3b8d27e11f9349328a676c06fc571d82dbb59e"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-compat/npm-sweep/run.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"587951e4f55c50b44941b94f6a6982203f1f90983c7c452f90b76bf0864dffa8"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 3 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: crates/perry-container-compose/src/yaml.rs, crates/perry-runtime/src/url/url_pattern.rs, scripts/gen_feature_matrix.py (7 orphaned of 3000 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 3000 of the 14690 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-container-compose/src/yaml.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09bffececba192bb7cf08f026db19e9422f8a4989b2d9e095d7d7845f0f49a79"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/url/url_pattern.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8374e80b12c77cccdf29bf72be1c7a22a0867faeb2c679bd1df3d04ddf5f9d33"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen_feature_matrix.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3907f71d0162e53808cfe3745ff7dba85a162820e4b6fb5ee50cb8194d3b9ec"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: expr.rs \u2192 exprs_more.rs, escape_check.rs, escape_news.rs, refs.rs, expr_mut.rs, expr_ref.rs: \u0060crates/perry-hir/src/stable_hash/expr.rs\u0060 changes together with 6 other files \u2014 \u0060crates/perry-codegen-js/src/emit/exprs_more.rs\u0060, \u0060crates/perry-codegen/src/collectors/escape_check.rs\u0060, \u0060crates/perry-codegen/src/collectors/escape_news.rs\u0060, \u0060crates/perry-codegen/src/collectors/refs.rs\u0060, \u0060crates/perry-hir/src/walker/expr_mut.rs\u0060, \u0060crates/perry-hir/src/walker/expr_ref.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 6 separate couplings, not 6 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 6."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/stable_hash/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcfbf02142913aba644849df437cd6f8f5796fb8e306316f9f9f7f4a13abae18"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: expr_mut.rs \u2192 exprs_more.rs, escape_check.rs, escape_news.rs, refs.rs, expr_ref.rs: \u0060crates/perry-hir/src/walker/expr_mut.rs\u0060 changes together with 5 other files \u2014 \u0060crates/perry-codegen-js/src/emit/exprs_more.rs\u0060, \u0060crates/perry-codegen/src/collectors/escape_check.rs\u0060, \u0060crates/perry-codegen/src/collectors/escape_news.rs\u0060, \u0060crates/perry-codegen/src/collectors/refs.rs\u0060, \u0060crates/perry-hir/src/walker/expr_ref.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 5 separate couplings, not 5 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 5."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/walker/expr_mut.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f374ced9e9fa9b3ef916cd9be1fcc04523f3b78595560fa9c96a4872dd52f9"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: exprs_more.rs \u2192 escape_check.rs, escape_news.rs, expr_ref.rs: \u0060crates/perry-codegen-js/src/emit/exprs_more.rs\u0060 changes together with 3 other files \u2014 \u0060crates/perry-codegen/src/collectors/escape_check.rs\u0060, \u0060crates/perry-codegen/src/collectors/escape_news.rs\u0060, \u0060crates/perry-hir/src/walker/expr_ref.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/emit/exprs_more.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2c9d756cfe0a41947d703bded71aeee519148221ce3991e78babbe9460a5de"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: substitute_expr.rs \u2192 escape_check.rs, escape_news.rs, refs.rs, analysis.rs, expr.rs, expr_mut.rs, expr_ref.rs: \u0060crates/perry-hir/src/monomorph/substitute_expr.rs\u0060 changes together with 7 other files \u2014 \u0060crates/perry-codegen/src/collectors/escape_check.rs\u0060, \u0060crates/perry-codegen/src/collectors/escape_news.rs\u0060, \u0060crates/perry-codegen/src/collectors/refs.rs\u0060, \u0060crates/perry-hir/src/analysis.rs\u0060, \u0060crates/perry-hir/src/stable_hash/expr.rs\u0060, \u0060crates/perry-hir/src/walker/expr_mut.rs\u0060, \u0060crates/perry-hir/src/walker/expr_ref.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 7 separate couplings, not 7 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 7."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/monomorph/substitute_expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"121ddd8e8b5eaebabdaeca0405d6c1f468787df13eb7a51ecf7b7fdb284382e7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: masked_window.rs \u2194 loops.rs: \u0060crates/perry-codegen/src/expr/masked_window.rs\u0060 and \u0060crates/perry-codegen/src/stmt/loops.rs\u0060 change together 80% of the time (8 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060ff0b9919\u0060 perf: array read-modify-write in multi-statement loops takes the dens\u2026; \u00600f70a367\u0060 refactor(codegen): route packed receiver hoists through region descri\u2026; \u00600a164730\u0060 perf(codegen): packed-clone endgame \u2014 receiver caching, poll striding\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/masked_window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f84248d9506147c9fc452934e634c1d08d54ca651f3893fc7e7f1adccffca66"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: native_runtime_branch.rs \u2194 iterator_record.rs: \u0060crates/perry-codegen/src/lower_call/native/native_runtime_branch.rs\u0060 and \u0060crates/perry-hir/src/iterator_record.rs\u0060 change together 80% of the time (8 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u00607f74d17c\u0060 Release the transferred record payload once and preserve completion t\u2026; \u00600fd36b9f\u0060 Use one private payload for array and protocol records; \u00608a25bf23\u0060 Admit the packed-f64 loop beside the record entry proof \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/native/native_runtime_branch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab02f5d946f3fa4818350ab2c9803f547274f781bbdab6abf4b877a1f44b1ee5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: refs.rs \u2192 escape_check.rs, escape_news.rs, analysis.rs: \u0060crates/perry-codegen/src/collectors/refs.rs\u0060 changes together with 3 other files \u2014 \u0060crates/perry-codegen/src/collectors/escape_check.rs\u0060, \u0060crates/perry-codegen/src/collectors/escape_news.rs\u0060, \u0060crates/perry-hir/src/analysis.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/refs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c7e79836dec6d71ab16a98b0e4bfdc70b9abda398f25a6e0da920fc4a93042"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: callable_export_check.rs \u2194 module_keys.rs: \u0060crates/perry-runtime/src/object/native_module/callable_export_check.rs\u0060 and \u0060crates/perry-runtime/src/object/native_module/module_keys.rs\u0060 change together 79% of the time (11 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u0060f9138a57\u0060 feat(bun): Bun.sleep and Bun.sleepSync; \u006091059fe2\u0060 feat: expose Perry heap statistics through bun:jsc; \u006086878744\u0060 feat(bun): add TCP socket facades \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/native_module/callable_export_check.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7da1e968eeaf1f90c109424f05d094edf7c9028d891a71e8ea7ed868b095f8"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: node_core.rs \u2194 native_module_dispatch.rs: \u0060crates/perry-codegen/src/lower_call/native_table/node_core.rs\u0060 and \u0060crates/perry-runtime/src/object/native_module_dispatch.rs\u0060 change together 76% of the time (28 of the 37 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 28 shared commits counted here, the most recent 3 are \u00602c4fe681\u0060 [codex] Add node:module CommonJS internals (#4203); \u0060e624f929\u0060 [codex] expose node:sea outside SEA (#4184); \u00601e830a1c\u0060 [codex] console: expose context and createTask helpers (#4145) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/native_table/node_core.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f079329a9c5e6d62c33c9e31f83eb4f974eb258f162d8ac8b47bffb5bee0e40"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 typedarray_view.rs: \u0060crates/perry-runtime/src/typedarray/mod.rs\u0060 and \u0060crates/perry-runtime/src/typedarray_view.rs\u0060 change together 75% of the time (9 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u00602c238044\u0060 Root typed-array byte copies and retire symbol payload screens; \u00602724261c\u0060 Speed up numeric typed-array element reads; \u0060748cefbb\u0060 perf(typedarray): the header says where elements live, not a global v\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/typedarray/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c2279f28ec0a5f786d13b001ea48216fd8682477dbd08a7e7fff4603f1c244"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling clique: helpers.rs, builtins.rs, global_this.rs: 3 files \u2014 \u0060crates/perry-codegen/src/expr/helpers.rs\u0060, \u0060crates/perry-hir/src/analysis/builtins.rs\u0060, \u0060crates/perry-runtime/src/object/global_this.rs\u0060 \u2014 all change together with no explicit dependency: a fully-connected co-change clique, not 3 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique\u0027s coupling clears at once \u2014 you do not need to break each pair individually."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5fba9a500755ebc953c78b3bec0dd467b474fd466a986528b15ccc81661cc5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: entries.rs \u2192 mod.rs, native_module.rs, native_module_dispatch.rs, stdlib_features.rs: \u0060crates/perry-api-manifest/src/entries.rs\u0060 changes together with 4 other files \u2014 \u0060crates/perry-codegen/src/lower_call/native_table/mod.rs\u0060, \u0060crates/perry-runtime/src/object/native_module.rs\u0060, \u0060crates/perry-runtime/src/object/native_module_dispatch.rs\u0060, \u0060crates/perry/src/commands/stdlib_features.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 4."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-api-manifest/src/entries.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3a622e4a9c53f2b97e76cc57dce130d2fdeea69136a8648ea62eadbe70a195"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: concat_reverse.rs \u2194 immutable.rs: \u0060crates/perry-runtime/src/array/concat_reverse.rs\u0060 and \u0060crates/perry-runtime/src/array/immutable.rs\u0060 change together 73% of the time (8 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060f8d0166e\u0060 fix(runtime): make a pre-sized array\u0027s range addressable before fill \u2026; \u00605dbb7b39\u0060 feat(runtime): maintain the dense prefix of the element-kind word; \u00600d7fe21b\u0060 fix(array): ask the typed-array question before clean_arr_ptr rejects\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/array/concat_reverse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b852706289ffd65c96595d88c59f8c124026b7d5b7bd80117975c29ccf0df724"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: node_core.rs \u2194 native_module.rs: \u0060crates/perry-codegen/src/lower_call/native_table/node_core.rs\u0060 and \u0060crates/perry-runtime/src/object/native_module.rs\u0060 change together 70% of the time (26 of the 37 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 26 shared commits counted here, the most recent 3 are \u00602c4fe681\u0060 [codex] Add node:module CommonJS internals (#4203); \u0060e624f929\u0060 [codex] expose node:sea outside SEA (#4184); \u00601e830a1c\u0060 [codex] console: expose context and createTask helpers (#4145) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/native_table/node_core.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9baed62b054cf06391800db1757819e40409ff6addf6591e50c1af8e5c0e2854"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: math_simple.rs \u2194 strings.rs: \u0060crates/perry-codegen/src/expr/math_simple.rs\u0060 and \u0060crates/perry-codegen/src/runtime_decls/strings.rs\u0060 change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00606925754a\u0060 fix(codegen): run field initializers at native-base super() and guard\u2026; \u0060cafc6d1c\u0060 fix(runtime): test262 built-ins value/throw bugs \u2014 primitive brand, v\u2026; \u0060d68453dd\u0060 [codex] fix existing Math API parity (#5170) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/math_simple.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6756ce3348bb6d3fed0e5ded733d52dbdcb36dafad34c733fa4efff979749b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: http_server.rs \u2192 ext_registry.rs, stdlib_ffi.rs, lib.rs, handle_dispatch.rs, dispatch.rs: \u0060crates/perry-codegen/src/lower_call/native_table/http_server.rs\u0060 changes together with 5 other files \u2014 \u0060crates/perry-codegen/src/ext_registry.rs\u0060, \u0060crates/perry-codegen/src/runtime_decls/stdlib_ffi.rs\u0060, \u0060crates/perry-ext-http/src/lib.rs\u0060, \u0060crates/perry-ext-http/src/server/handle_dispatch.rs\u0060, \u0060crates/perry-stdlib/src/common/dispatch.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 5 separate couplings, not 5 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 5."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/native_table/http_server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14e052901ebf9404b671d299c2a04fa770b88764515fed25a239a3205eabce0"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: dispatch_a_c.rs \u2192 part_4.rs, module_static.rs, callable_export_check.rs, module_keys.rs: \u0060crates/perry-runtime/src/object/native_module_dispatch/dispatch_a_c.rs\u0060 changes together with 4 other files \u2014 \u0060crates/perry-api-manifest/src/entries/part_4.rs\u0060, \u0060crates/perry-hir/src/lower/expr_call/module_static.rs\u0060, \u0060crates/perry-runtime/src/object/native_module/callable_export_check.rs\u0060, \u0060crates/perry-runtime/src/object/native_module/module_keys.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 4."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/native_module_dispatch/dispatch_a_c.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1a2ea8bc3af6645f68f7553e75f593f8bd1ba616f861e04d162f2fcb655728"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: nm_install.rs \u2194 objects.rs: \u0060crates/perry-codegen/src/nm_install.rs\u0060 and \u0060crates/perry-codegen/src/runtime_decls/objects.rs\u0060 change together 62% of the time (10 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u0060addf463c\u0060 One routed-module decision for linking and codegen; \u0060db711f0f\u0060 Install zlib provider metadata before constructors and preserve gener\u2026; \u0060ec3c29be\u0060 fix(runtime): link built-in constructor prototypes and inherit their \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/nm_install.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df899df43937b25ce1d48feae18b46badf54776f07a136decfdec16e1cc5eb83"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: lib.rs \u2194 stdlib_features.rs: \u0060crates/perry-stdlib/src/lib.rs\u0060 and \u0060crates/perry/src/commands/stdlib_features.rs\u0060 change together 60% of the time (9 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u006002212d46\u0060 Remove unused perry-ext-streams crate; \u0060e97c3f67\u0060 stdlib: split the promise bridge from the tokio runtime (turnloop P8 \u2026; \u00607b47239d\u0060 refactor(stdlib): remove nanoid native binding \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa61bad7f958cb5f1014fddc83ba459ac35ab9cf29b6e6f518c81aa79ee6e474"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: field_get_set.rs \u2194 has_own_helpers.rs: \u0060crates/perry-runtime/src/object/field_get_set.rs\u0060 and \u0060crates/perry-runtime/src/object/has_own_helpers.rs\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00600eccf792\u0060 fix(buffer): ask the receiver-kind question above the byte and toLoca\u2026; \u0060731a2f4f\u0060 fix(runtime): honor JSON reviver prototype lookups (#4665); \u0060e08e3d47\u0060 fix(runtime): array boundary-index, sparse length, and non-integer ke\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/field_get_set.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa84715a963f87567060dcecda3ac16dac5410721c21aecc8fe5a4448fa777bb"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 block_skip.rs: \u0060crates/perry-runtime/src/arena/mod.rs\u0060 and \u0060crates/perry-runtime/src/gc/trace/block_skip.rs\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060f80ec62f\u0060 perf(gc): remember old-to-young edges during full marking; \u00608b55a2ae\u0060 perf(runtime): move Map indexes and storage into owned MapStore; \u0060321d1673\u0060 gc: expand a described promoted page only where a full\u0027s sweep reshap\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/arena/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21afadfaa24f0a31135c0087e627369b71a660d4a96af924c46bda740081032e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: dispatch.rs \u2194 x509.rs: \u0060crates/perry-stdlib/src/common/dispatch.rs\u0060 and \u0060crates/perry-stdlib/src/crypto/x509.rs\u0060 change together 59% of the time (10 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u00602dab26cb\u0060 fix(crypto): expose x509 issuerCertificate surface (#4309); \u0060b79e2771\u0060 fix(crypto): check x509 issuers (#4306); \u0060dfc1cdf9\u0060 fix(crypto): check x509 private keys (#4303) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-stdlib/src/common/dispatch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c38a56b20393895fa27dc7dd9da29495812841a057286c69460318b9ef995d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: media.rs \u2194 stdlib_ffi.rs: \u0060crates/perry-codegen/src/lower_call/native_table/media.rs\u0060 and \u0060crates/perry-codegen/src/runtime_decls/stdlib_ffi.rs\u0060 change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060b3ff10c4\u0060 feat(sharp): AVIF encode (.avif) \u002B quality-aware JPEG/AVIF encoding (\u2026; \u00604a73b0e6\u0060 feat(sharp): EXIF auto-orient, .extend(), .trim(), .composite() (#5455); \u006024389a78\u0060 feat(sharp): metadata/toFile objects, Buffer-input factory, .extract(\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/native_table/media.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e5de872c1c86ed70dc08ec31e42e673ac0ace71fbe1de4602a519aebfd0508"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: callbacks.rs \u2194 fs_promises.rs: \u0060crates/perry-runtime/src/fs/callbacks.rs\u0060 and \u0060crates/perry-runtime/src/node_submodules/fs_promises.rs\u0060 change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00603c7696c6\u0060 fix(fs): preserve async write-unlink ordering (#9574); \u0060b13a2009\u0060 fix: the event loop looks before it sleeps (#9441); async fs writes a\u2026; \u00609a567aa1\u0060 fix(fs): appendFile must report failure, not resolve; writeFileSync m\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/fs/callbacks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d35e2e67657780b97cb172a336f8f1eae58114e2ee61cc8d3f470688abdf7f9"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: escape_news.rs \u2194 i32_locals.rs: \u0060crates/perry-codegen/src/collectors/escape_news.rs\u0060 and \u0060crates/perry-codegen/src/collectors/i32_locals.rs\u0060 change together 53% of the time (9 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u006077ea1791\u0060 fix(hir,codegen): instanceof RHS (ty_expr) was invisible to analysis \u2026; \u0060d68453dd\u0060 [codex] fix existing Math API parity (#5170); \u0060ab4794e3\u0060 feat(runtime): async-from-sync iterator adapter (#4590) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/escape_news.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99777dbc6b01ebb14e8b45b9034241b037e3c1ef9c2752e847dded834095212"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: escape_check.rs \u2194 i32_locals.rs: \u0060crates/perry-codegen/src/collectors/escape_check.rs\u0060 and \u0060crates/perry-codegen/src/collectors/i32_locals.rs\u0060 change together 53% of the time (9 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u006077ea1791\u0060 fix(hir,codegen): instanceof RHS (ty_expr) was invisible to analysis \u2026; \u0060d68453dd\u0060 [codex] fix existing Math API parity (#5170); \u0060ab4794e3\u0060 feat(runtime): async-from-sync iterator adapter (#4590) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/escape_check.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23105199fe7aea2901e1f2a0938c0c7eecb6129ef82d080162ed7672688a5622"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: arrays.rs \u2194 mod.rs: \u0060crates/perry-codegen/src/runtime_decls/arrays.rs\u0060 and \u0060crates/perry-runtime/src/array/mod.rs\u0060 change together 50% of the time (31 of the 62 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 31 shared commits counted here, the most recent 3 are \u00602f065374\u0060 perf(generators): for-of and yield* steps allocate no IteratorResult; \u0060c3c66b8a\u0060 fix(array): a generic Array.prototype.flatMap for non-array receivers\u2026; \u0060be726422\u0060 perf(generators): direct protocol entry, one-step iterator results, s\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/runtime_decls/arrays.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c961f947dee9e33b550e068aca17b4585ee3941a12724b8ea7c95f0b8eb1927"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: builtin.rs \u2194 strings_part2.rs: \u0060crates/perry-codegen/src/lower_call/builtin.rs\u0060 and \u0060crates/perry-codegen/src/runtime_decls/strings_part2.rs\u0060 change together 50% of the time (16 of the 32 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 16 shared commits counted here, the most recent 3 are \u0060493f5d97\u0060 fix(fetch): preserve Request inputs and apply init overrides (#10380); \u0060ecf5439f\u0060 fix(runtime): implement resizable ArrayBuffer (#10873); \u0060fd082e59\u0060 fix(hir,fetch): preserve Hono response state (#8982) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/lower_call/builtin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"124521bc77d083c9d939d096ff77251b20b042a55f7210278962d09e3cf73946"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: descriptors.rs \u2194 has_own.rs: \u0060crates/perry-runtime/src/object/descriptors.rs\u0060 and \u0060crates/perry-runtime/src/object/object_ops/has_own.rs\u0060 change together 50% of the time (10 of the 20 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u0060d911e3c6\u0060 Functions answer through their layout; builtin prototypes stay on the\u2026; \u006082cd702f\u0060 runtime: a fresh class object owns its length, name and static methods; \u0060880e9a43\u0060 feat(runtime): class static accessors are accessor properties of the \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/descriptors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cc97bd60824db2d0ca9db0fd57332fad88b89dce2a8559b7b93147f074c84a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: part_4.rs \u2194 callable_export_check.rs: \u0060crates/perry-api-manifest/src/entries/part_4.rs\u0060 and \u0060crates/perry-runtime/src/object/native_module/callable_export_check.rs\u0060 change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060f9138a57\u0060 feat(bun): Bun.sleep and Bun.sleepSync; \u006091059fe2\u0060 feat: expose Perry heap statistics through bun:jsc; \u006086878744\u0060 feat(bun): add TCP socket facades \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-api-manifest/src/entries/part_4.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82339bafb664d56e89f50413cec602fc125553adbb074f7647286e1919a7df0e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: nested_fn_decl.rs \u2194 fn_decl.rs: \u0060crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs\u0060 and \u0060crates/perry-hir/src/lower_decl/fn_decl.rs\u0060 change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060ec5270e8\u0060 perf(hir): an unrebound parameter is the compound-assignment receiver; \u00605b3593e8\u0060 fix(runtime): honor sloppy function poison-pill stores (#9525); \u006056a7a564\u0060 fix(hir): scope class-expression capture refreshes per evaluation (#6\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/lower_decl/body_stmt/nested_fn_decl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c821247795c409e08f0efc0a7b61534cd33b8cff29896be6e070be0b3a96c7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: driver.rs \u2194 zlib.rs: \u0060crates/perry-ext-zlib/src/stream/driver.rs\u0060 and \u0060crates/perry-runtime/src/node_submodules/zlib.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u006014919597\u0060 fix(zlib): honor decoder completion and trailing-input options (#13202); \u00607da477ee\u0060 fix(zlib): apply Zstd dictionaries through codec resets; \u00606fb246e7\u0060 fix(zlib): apply DEFLATE dictionaries in sync and stream codecs \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-zlib/src/stream/driver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3ec385dc6e5132ec857ba8b9d3f098d7a3d72c27582bb091186b496cd38b68"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: prototype_override.rs \u2194 native_call_method.rs: \u0060crates/perry-runtime/src/object/field_get_set/prototype_override.rs\u0060 and \u0060crates/perry-runtime/src/object/native_call_method.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u006023fad159\u0060 fix(runtime): a new F() instance reads its recorded [[Prototype]] aft\u2026; \u006081652e4e\u0060 fix: preserve per-evaluation class heritage in factories; \u0060f001b030\u0060 fix(runtime): separate user prototype override signal (#9333) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/object/field_get_set/prototype_override.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9993d7549f65f6b3f45b35ba505b04e10c9773005424b252629b659fd782426"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: boxed_vars.rs \u2194 type_analysis.rs: \u0060crates/perry-codegen/src/boxed_vars.rs\u0060 and \u0060crates/perry-codegen/src/type_analysis.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060b4373788\u0060 Add shared HIR value type inference spine (#5314); \u00602db07e60\u0060 Fix Discord BigInt and root import reducers (#4946); \u00605b182137\u0060 fix(hir): iteration-statement protocol test262 parity (#4750) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/boxed_vars.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d69c5343324982e86d04bd15e4103e3bd60e5ff089a5272ddceafa86913fb1"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: misc_methods.rs \u2194 strings.rs: \u0060crates/perry-codegen/src/expr/misc_methods.rs\u0060 and \u0060crates/perry-codegen/src/runtime_decls/strings.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060bce10455\u0060 fix(path): path.* arms read an SSO string\u0027s inline bytes as a StringH\u2026; \u0060a0f29555\u0060 fix(array): indexOf/lastIndexOf i64 return, frozen/non-writable push/\u2026; \u0060a7a9e157\u0060 fix(math): apply ToNumber to Math operands (#4421) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/misc_methods.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdd9df994b25005cec3dd6cf9e346d45ad21386a9079bb7d3cd0e84e57f060e"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc682cd7167c2c692b624e54d299d32b2ea2b5b3eb72f5516f0dfab9c0ce991d"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b1273c81a1ca9b5eb097489b2567416912a145951451afeec807249ffa5e5b8"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d9cc7684bfd310f5ec367aa0cca8188669012be08f4482ce89ba6ed6e72ebc2e"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5928b81075799790cb18fed2980a6b6e8aa5072772041c9951633efe8eb3542"},"taxa":[{"id":"CICD-SEC-1","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"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":"5e4607103018ccbf4772504c4475df05c43062f243e17471503584c98dc62fdc"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC7","level":"warning","message":{"text":"Accessibility enforcement below the top rung: No accessibility enforcement found \u2014 no a11y linter (eslint-plugin-jsx-a11y) and no axe/pa11y/Lighthouse in tests or CI. Start with the linter to catch issues at author time. What was searched, so you can tell an absence from a miss: the 3 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository\u0027s test and CI files \u2014 matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d46019b86eff5ddad9db289e6802ac158899e980df54c34f67722442787ead62"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: IGitCommandManager (38 required operations): \u0060IGitCommandManager\u0060 declares 38 required operations: \u0060branchDelete\u0060, \u0060branchExists\u0060, \u0060branchList\u0060, \u0060disableSparseCheckout\u0060, \u0060sparseCheckout\u0060, \u0060sparseCheckoutNonConeMode\u0060, \u0060checkout\u0060, \u0060checkoutDetach\u0060, \u0060config\u0060, \u0060configExists\u0060, \u0060fetch\u0060, \u0060getDefaultBranch\u0060, \u0060getSubmoduleConfigPaths\u0060, \u0060getWorkingDirectory\u0060, \u0060init\u0060, \u0060isDetached\u0060, \u0060lfsFetch\u0060, \u0060lfsInstall\u0060, \u0060log1\u0060, \u0060remoteAdd\u0060, \u0060removeEnvironmentVariable\u0060, \u0060revParse\u0060, \u0060setEnvironmentVariable\u0060, \u0060shaExists\u0060, \u0060submoduleForeach\u0060, \u0060submoduleSync\u0060, \u0060submoduleUpdate\u0060, \u0060submoduleStatus\u0060, \u0060tagExists\u0060, \u0060tryClean\u0060, \u0060tryConfigUnset\u0060, \u0060tryConfigUnsetValue\u0060, \u0060tryDisableAutomaticGarbageCollection\u0060, \u0060tryGetFetchUrl\u0060, \u0060tryGetConfigValues\u0060, \u0060tryGetConfigKeys\u0060, \u0060tryReset\u0060, \u0060version\u0060. Counted over its REQUIRED operations \u2014 a method signature or a function-typed property with no \u0060?\u0060, once per signature; optional members and data properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/actions/checkout/src/git-command-manager.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c7c31ad1b9a474cb37d654786d3099da836bcaf7e534a1ad6a86e0bd7cbb87"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/turnloop/p12-report.md names MongoDB 8, but the manifest declares \u0060mongodb\u0060 7.5.0. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/turnloop/p12-report.md"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"1349b908ef4340cb756a2aefb71760bf26305a2229f7bb5e56b12b18403b4ee3"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/src/internals/weakmap-owned-index-validation.md names Zod 3, but the manifest declares \u0060zod\u0060 ^4.3.5. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/src/internals/weakmap-owned-index-validation.md"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7194193f9c8ff6da519fac09b66dcf7a2e3de48ab1f1d1668f8d1afac8a1b491"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 7/22 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060.\u0060, \u0060.\u0060, \u0060crates/perry-component-host\u0060, \u0060crates/perry-component-io\u0060 and 10 more."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060upstream/actions/actions/cache/src/saveImpl.ts\u0060 reports through \u0060console.*\u0060 at line 94 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/actions/cache/src/saveImpl.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"430b2811c61cad118d411c47bd457c7e268802c4bca2b37ba01cff8eb93b1d01"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060upstream/actions/actions/cache/src/saveImpl.ts\u0060 reports through \u0060console.*\u0060 at line 114 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/actions/cache/src/saveImpl.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8042d717d1b082ba76a53b64cadcd94b12ba22f7a37f0d3e7ad0c4f83e1567bd"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060upstream/actions/Swatinem/rust-cache/src/workspace.ts\u0060 reports through \u0060console.*\u0060 at line 35 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/Swatinem/rust-cache/src/workspace.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"0195ca2a805e917fabf53f9935e156bbb05847351fc2dd8bd4e1dbbc2a9de6cd"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060experiments/llvm-inprocess-spike/spike.ts\u0060 reports through \u0060console.*\u0060 at line 9 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/llvm-inprocess-spike/spike.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4fd745c853bd049a5edf166e69e813d91e117665a8490812a03cf45f1774269"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060experiments/llvm-inprocess-spike/spike.ts\u0060 reports through \u0060console.*\u0060 at line 10 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/llvm-inprocess-spike/spike.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e54f7d895389e967999722f37a3fd4260fe9f6d2279574f6c17ea7e29f5335f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060experiments/llvm-inprocess-spike/spike.ts\u0060 reports through \u0060console.*\u0060 at line 15 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/llvm-inprocess-spike/spike.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"475ed39d44a6f0f3139a7fdaedaeb0c77925209560d633a40d92df8971ed5839"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060experiments/llvm-inprocess-spike/spike.ts\u0060 reports through \u0060console.*\u0060 at line 28 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/llvm-inprocess-spike/spike.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b08beed33213a3e288f59e8160db32f26c979192fbcc31535450ec5ec41a1e1"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060experiments/llvm-inprocess-spike/spike.ts\u0060 reports through \u0060console.*\u0060 at line 31 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/llvm-inprocess-spike/spike.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb11f1c31a053393732b1706f31eae4fb5bd33e99f0553af5a8827eaddd7ca9d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060experiments/llvm-inprocess-spike/spike.ts\u0060 reports through \u0060console.*\u0060 at line 35 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/llvm-inprocess-spike/spike.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33ef645ca8977b6771fcef05d1d0809ff5126d3ca290a9f499bdcc51081be30"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-hir/src/realm_fixtures/non_top.ts\u0060 reports through \u0060console.*\u0060 at line 12 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-hir/src/realm_fixtures/non_top.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff85b7b4be984cace1c307f6261d4774ff6351cf8fe4037dc1e6e96f5dbbd4d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-wasm/src/wasm_runtime.js\u0060 reports through \u0060console.*\u0060 at line 146 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53a82906fc6da598d97ede474961d57443e7fd5e346a63f7990ce7c3c5fee32"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-wasm/src/wasm_runtime.js\u0060 reports through \u0060console.*\u0060 at line 147 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2839e9bd96dd8c9fc9de6b51aee5fb00188204548196e8b9ab7104ad99ddc8"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-wasm/src/wasm_runtime.js\u0060 reports through \u0060console.*\u0060 at line 148 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"5701be32dbe788f8443697d9f8821d632ea0171701789be0513b4168c1aa5c72"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-wasm/src/wasm_runtime.js\u0060 reports through \u0060console.*\u0060 at line 977 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29aba6c1ff4cb7699c95111237c96f4b304c97839f63755926d06ae1286ecb6"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-wasm/src/wasm_runtime.js\u0060 reports through \u0060console.*\u0060 at line 1617 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3362cf146da67e878516744a996012cd52ea331e180f7781e200db497aa9d9e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-wasm/src/wasm_runtime.js\u0060 reports through \u0060console.*\u0060 at line 1618 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"811a61513c48ff69f5c6cdae54f4c931dfc896efb6bf4b7a8546094621a2c063"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-wasm/src/wasm_runtime.js\u0060 reports through \u0060console.*\u0060 at line 1619 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":1619}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea12245d8f99eb2bfdf3a5d9a00e0546dbf9a707676c0cd6c3957354959983b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-wasm/src/wasm_runtime.js\u0060 reports through \u0060console.*\u0060 at line 1620 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":1620}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1df332e28354cd365a8235a3ed8197de04067a0dec4c381c78c467854f7b2b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-wasm/src/wasm_runtime.js\u0060 reports through \u0060console.*\u0060 at line 2678 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":2678}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd89c16948564492cd6ba10d2d6ddacce85c04983bb3992520479cdac0e40de5"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-wasm/src/wasm_runtime.js\u0060 reports through \u0060console.*\u0060 at line 3924 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":3924}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c119966e7d11ce329ac984cb2ebafc0e144259578d6150fb6cfc0fc28d636ba"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-wasm/src/wasm_runtime.js\u0060 reports through \u0060console.*\u0060 at line 3934 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":3934}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4343c0113bb68b53877af9394c3e25e3471d338a3028af0d82f8388fe226a3f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-wasm/src/wasm_runtime.js\u0060 reports through \u0060console.*\u0060 at line 4144 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4144}}}],"partialFingerprints":{"codehealthFindingId/v1":"9529883af8b56e1eb7c15831d66254b4bf64716e49ec62c2ac31468746a2f77a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-wasm/src/wasm_runtime.js\u0060 reports through \u0060console.*\u0060 at line 4186 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4186}}}],"partialFingerprints":{"codehealthFindingId/v1":"8daa115e3cc1f56fcc5f0e0decbf2a472ab674edfde1718c442e0143fb454d5c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-wasm/src/wasm_runtime.js\u0060 reports through \u0060console.*\u0060 at line 4205 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4205}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f1bf10bc306ed12cd74f61e7416cc79aa249d1d88f9bef31c2c7e7112d2530"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-wasm/src/wasm_runtime.js\u0060 reports through \u0060console.*\u0060 at line 4306 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4306}}}],"partialFingerprints":{"codehealthFindingId/v1":"494a3221dbe817257e6e17bd51fcff4ad4cde6283d2cdadd430898a70bb56d9f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-wasm/src/wasm_runtime.js\u0060 reports through \u0060console.*\u0060 at line 4311 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4311}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd216e0a81418a53188e8b3fa73809d0d5c3f877b5b0816373e262f7df4395a6"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-wasm/src/wasm_runtime.js\u0060 reports through \u0060console.*\u0060 at line 4366 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4366}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b4119b51eb28fba7703efb146022085448ecd244a8230df37dfa125460e824"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-wasm/src/wasm_runtime.js\u0060 reports through \u0060console.*\u0060 at line 4370 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4370}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51ec22e9ccdaf90669beab88845e3f1382f6aae228f2ddb8d2297b1ab44f023"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-wasm/src/wasm_runtime.js\u0060 reports through \u0060console.*\u0060 at line 4404 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4404}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fed9282bf33a4353aabe2d836e0bba4c4655ebd5881d5e3286d91605ad454e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-wasm/src/wasm_runtime.js\u0060 reports through \u0060console.*\u0060 at line 4559 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4559}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76f0cb96b50b70b3ea3194c473cf3d14f4dac2fd391c2bdd4bc1d9c8f5e816f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-wasm/src/wasm_runtime.js\u0060 reports through \u0060console.*\u0060 at line 4658 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4658}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a8c596d6fbb42eedd2cfb3d60b55c0778e5f1ce696aa236e2a49da9e252217"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-wasm/src/wasm_runtime.js\u0060 reports through \u0060console.*\u0060 at line 4716 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4716}}}],"partialFingerprints":{"codehealthFindingId/v1":"769647ba3295b49bacbec644eee48d51772092610a973a8808ebf28c13ea06b9"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-js/src/web_runtime.js\u0060 reports through \u0060console.*\u0060 at line 114 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"617174258f0361a1d304ebfa25822cb4085de10751d2ae63fc4dcb40596ae942"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-js/src/web_runtime.js\u0060 reports through \u0060console.*\u0060 at line 856 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb5b86240ec09428c242a0150634a7699aad3e8694132d381e70d0c85c7277f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-js/src/web_runtime.js\u0060 reports through \u0060console.*\u0060 at line 2017 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":2017}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f92c0de9d7adbaaef06c3cbc776e47d17a2b73fc6996a22d6d4d465de3130b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-js/src/web_runtime.js\u0060 reports through \u0060console.*\u0060 at line 2024 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":2024}}}],"partialFingerprints":{"codehealthFindingId/v1":"647ccead8d26bf5521ea3e664fd3206471e9b1f6c0bc7ffafbec80953eac5e9a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-js/src/web_runtime.js\u0060 reports through \u0060console.*\u0060 at line 3181 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":3181}}}],"partialFingerprints":{"codehealthFindingId/v1":"3defd77ef6d0958f31292d6b54b64ef71436fed390c9d39eee7f65df260feed5"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-js/src/web_runtime.js\u0060 reports through \u0060console.*\u0060 at line 3201 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":3201}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a52ca77ffc8de95884dd9624ff34a18a7b03c20b3f76f6757342dce6e0d76a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-js/src/web_runtime.js\u0060 reports through \u0060console.*\u0060 at line 3385 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":3385}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b5263ea20ef06c058dbb7e60786c9d2a6f67e1fe43473dc713764cce3e6776"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-js/src/web_runtime.js\u0060 reports through \u0060console.*\u0060 at line 3415 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":3415}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3a92e9d896d7d614a9328e78f575333a2206da51003738c703728628433484"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-js/src/web_runtime.js\u0060 reports through \u0060console.*\u0060 at line 3423 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":3423}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef033d23d68b1e5292a974dfa4e4302689534dcf7fa21557f37c99ed301433e2"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-js/src/web_runtime.js\u0060 reports through \u0060console.*\u0060 at line 3631 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":3631}}}],"partialFingerprints":{"codehealthFindingId/v1":"904fc5f05874936b059ea106fd971ba7802f5d4cec3fd9ed1bfce3d49a2cd440"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/perry-codegen-js/src/web_runtime.js\u0060 reports through \u0060console.*\u0060 at line 4045 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":4045}}}],"partialFingerprints":{"codehealthFindingId/v1":"389aa603acdf51552a1a7ed8abf611408b3a45e40da5fd02868a48a84213f695"}},{"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":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":3269}}}],"partialFingerprints":{"codehealthFindingId/v1":"6576e27a61de1c9b77ebc28738d5f675124664645f810e7f1369f1fa674ed827"}},{"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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b4acdbe8aaaef80877875d15840a7564b2fb18805f1215db0835342f23eb5f"}},{"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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f18ce9a0d45429853022b1210ff9592b2d89fd78ce005f90fbcfb71011b83a"}},{"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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":2237}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe863de9cde4964a8d88134ffd84fe05f97a86df8494611910a52217e87facce"}},{"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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bfe15bc4dfd9ef87fb9cbf5c3a22902e889ec3477f0d9fbf5ec64e4dda3787"}},{"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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4346}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13f6762d122bb0fe61df596c7651589b22e6b55ca3c944f2e8949a629decc4e"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060http.request(\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":"docs/turnloop/clients-proxy-probe.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"467cda74da2c1e844f224b58ff876eccb6c93d9ed9e7f6a5bf4c9008d4c5c1df"}},{"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":"docs/turnloop/clients-proxy-probe.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"1870c5adb8c073943493f391ac2946aba24b984dd78794b7ff15eed66ccb9fe7"}},{"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":"docs/turnloop/clients-proxy-probe.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc864dad30f5c954f0378c6e1aa9cb4f925362104db817f1f5f05716d638e242"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060requests.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":"scripts/check_gate_freshness.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f79c3f2324acfcee2e1eb07bd0d5c36457d426fcdf2aba5cfa3bbdac8c7be7"}},{"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":"scripts/turnloop/apps/_helpers/p9_rss_worker.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6862ed9383bafa66073c0de7f760bf238d07ad2edfb38c6719d674d7433d272a"}},{"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":"scripts/turnloop/apps/_helpers/p9_worker_acceptance_worker.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1530d700dd3037747a7c75ea746655aed602c541937ae471f5ede6c02ef8ff"}},{"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":"scripts/turnloop/apps/_helpers/p9_worker_gc_stress_worker.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb65e493f23e617056d0567a863959315c0d059f11629453f085a5b2a86e109c"}},{"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":"scripts/turnloop/apps/_helpers/tokio_worker_agent_census_worker.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"247511862c730f871688390f67350646e4676c303bbd17a1809dd64a62d62a5c"}},{"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":"scripts/turnloop/apps/p6_abort_midbody.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"5540bc3f667c9be955279d75560c6cd9c141cb567614235182dbe61fa6f8578c"}},{"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":"scripts/turnloop/apps/p6_abort_midbody.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49651574f1534140ce769aff3283f5bdf5866e0f2a8af3230923d0e592f40f4"}},{"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":"scripts/turnloop/apps/p6_tls_remote.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01651d842aff4e2b3ae85be5ab258d2838d483148f49503b737f07435a54d06"}},{"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":"scripts/turnloop/apps/p6_tls_remote.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f42ca48cce3baa3b3b90a49b9060c8dd4d5ee82701092d68db6ab99178f36a7"}},{"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":"scripts/turnloop/apps/p6_tls_remote.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfa11f9aca82d9c23fc764d174730d1ac755cd1d2a6d2deb3af6858a360eda5"}},{"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":"scripts/turnloop/apps/p6_tls_remote.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c1b9e2149ffe015511eec04ace350cf7792caf7e6bdf048aa88167e27e2edb"}},{"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":"scripts/turnloop/apps/p9_thread_agent.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d801d800152d7cd3d9024ef6dd2b79cb599c7ee47f61009ef3ec6de06f5d8096"}},{"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":"scripts/turnloop/apps/p9_thread_agent_async_refused.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c9d96cf53c5f88573ee2d51e32d46df95efc20b1a8f5d9c6c6d6ac73fc74bd"}},{"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":"scripts/turnloop/apps/p9_worker_agent_acceptance.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1fee2e1beda4c777ea512d8c4f8f0f96ac05e56286a2766cbd94d5f748bea2"}},{"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":"scripts/turnloop/apps/p9_worker_gc_stress.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"745a83b0a29e2181d94f8821ca6dd502ccc2d828f6f1ec19a30d0016319be27e"}},{"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":"scripts/turnloop/apps/tokio_worker_agent_census.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"408940515aedfa07421b5c2b3ff4b812c68786b923953533926ac63b55560765"}},{"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":"upstream/actions/actions/checkout/src/git-command-manager.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6524cfc3b4392ae931f7dc013be1a698a2c73fde693fd12222ab60658504823"}},{"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":"upstream/actions/astral-sh/setup-uv/src/download/manifest.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1fa71f56cbbc6683d762386c544fb7e587aa32022931c0b434d25aeea822cf"}},{"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":"upstream/actions/jdx/mr-boxington-action/src/index.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2adc53180b29a882ee8e102a66a8f4d94be1f858562b2ee8b966537370e13d68"}},{"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":"upstream/actions/oven-sh/setup-bun/src/utils.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c60e443be8337740db0f12979d3e6e24ca0b2b02ed49a099702f7882a4fc862"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060downloadAndVerify\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":"packages/perry-updater/src/index.ts"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7addf86c37f7b2049817b58865174944e6dec98d802583aa8bcddbd642fcd8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060downloadAndVerify\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":"packages/perry-updater/src/index.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d506347fd7e6b1e6d83e0de9aebc6cf82cb8ccb72516a7f387bdccbc4f0a3f6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060runChecks\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/check/run.mts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0532facae005b36df3b6b706098a4f188c8d840d76b0a1589d5e839d13fb699"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060packTarball\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/publish/npm/proof.mts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ca991a07ff2098a3f4f1ac23cf2dfcc175b26b5c049e49074340451556954d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060resolvePackageTarball\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/publish/npm/proof.mts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c71009e4c1161a3326c2e8509ad4f9df7f95cbd5163b9da8808f3aa4a175f9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readdirSync\u0060 in \u0060resolvePackageTarball\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/publish/npm/proof.mts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"de37318527a0259ae8972fba8328df2bbda056d09e258ee79e0255784503d935"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060ensureTagAndRelease\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/publish/release.mts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5bb0f6ce0d2f2c4c8210a4f638c4bf8be421c384abe93d965fe471d9777d83"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060ensureTagAndRelease\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/publish/release.mts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c78f6df2a92710884aff707ef7a852b3145f473fa9d66edef43fb90ab2e89d2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060ensureTagAndRelease\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/publish/release.mts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"9128f6a98a0430d390b47796b750ff83b2fbf8f36e80a0bfd873ca466b9e1885"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060ensureTagAndRelease\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/publish/release.mts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ce7bab5b68be2df09370f69d48302f4215dbdf1c228bc15e109ad833febf16"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060ensureTagAndRelease\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/publish/release.mts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"250842d53860b0104484ad5b4e1a8dcaaa8f1f74f7ef14219bfdd7f68ad0282a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060ensureTagAndRelease\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/publish/release.mts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8356d4529c3a77124aaecd73efb0484d58559f6d78d48e99437193733de0269"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\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/publish/scan-ci-packages.mts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda57bbf6c5556c9b0c31d76dde07a753abdfbf5350329b7bd07b5195791b310"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\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/publish/scan-ci-packages.mts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ddbb20fe25b413a53d4361f88bf3d7f69b1b0361083fd9ee82e4f57f655282"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060scanTarball\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/publish/scan.mts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d840cb000cb010fafd3366c4c9fb99fc0854da357766e1c1c6158f6991f3f741"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060installAssetTool\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/soak/external-tools.mts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"7905e63500511c3a4e6887fb036e54fa32a6c2c3614fe4b83fcb07b018576229"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060installAssetTool\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/soak/external-tools.mts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"991b378f7493b017ccca799dfd1d7003edd59079427b485c19ece9f9169c5d36"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060installAssetTool\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/soak/external-tools.mts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8db20ee532f5c4843e1d9959772955e2b4e53f3e93ba4eee59050926c14a799"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060installAssetTool\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/soak/external-tools.mts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ece500d66d79852b39dc1cd66ebbb4ded72688f105680c4176724af95d5f5e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060installAssetTool\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/soak/external-tools.mts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0438c5e6d0391b02e5af5ac1cd2640fe77649466ea722c9953d71bf7f841d2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060installAssetTool\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/soak/external-tools.mts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d64059b45b95838791fbf954c243338d0fb91aaf7cd4ab2cb8330bd91821ab"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060installAssetTool\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/soak/external-tools.mts"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa580e3e990b12cfc732a192daddd79afc8bb5ac4de70f91491c5353583981e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060chmodSync\u0060 in \u0060installAssetTool\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/soak/external-tools.mts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd84c4b2c537378cba8be61d10107e5afa6fbd094bc3442a42bedf28042a506"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060installNpmTarball\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/soak/external-tools.mts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"0488333deb390f6a98bc756a6016772376712573428d9cf9665de30e3c4371dd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060installNpmTarball\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/soak/external-tools.mts"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf757bed15f96fc45b59311ac8c5a2f24211b8d9412e4a32ada23b184f28f02"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060installNpmTarball\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/soak/external-tools.mts"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a765b3ae18bba3c260d8b09818c736e5f55f1ba77f0942be8fc74be86d6138"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060installNpmTarball\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/soak/external-tools.mts"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"b410c35a1fffbf9207d80ccd624f2a55f9f29a157991677b47b5eeef7c05b590"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060installNpmTarball\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/soak/external-tools.mts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d012cbaa265af96b8742060384a9c9eebaf0de7f747b2433f91087d88d6afe0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060installNpmTarball\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/soak/external-tools.mts"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a54223d649dc589f9fe9189d510c0bae2b4ea0ba9b3d6054cf7703e5da03899"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060installNpmTarball\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/soak/external-tools.mts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41262d21c0602bacd7e6f6095829655aedd22e75fbc4b1a385b4677137e3d13"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060chmodSync\u0060 in \u0060installNpmTarball\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/soak/external-tools.mts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e8590213898251cda0c2bc95e394618ca553d547c62b3536a06614b83a0467"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\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/soak/external-tools.mts"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"493957c43238bb20383c1b15377a51b0ba330e7e55687c807aabb2d6ba82ef4f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\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/soak/external-tools.mts"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"639add910b84baa8c7591ddefa07cefc973b525cc689bd793df4113435013cd7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060fixture\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":"test-files/fetch_stream_fixture.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c474d2eabae40a21e16ba5a531bae0f56f595d36e3a35f3906672aa2f0a4650d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060fixture\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":"test-files/fetch_stream_fixture.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a3d1972173425fff1edc4137e78e15c7474d3cb2235bae8bc537a589c1aed0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060fixture\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":"test-files/fetch_stream_fixture.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c618c548663433a246ec5697bcb18a5cef4eccfc8420fbf7537c0c81baae8c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060close\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":"test-files/fetch_stream_fixture.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8fac06f3b784aa50b2b8bb6514032ee72b04ba2d0e9884c10698ed8a101a7c0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060unixEcho\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":"test-files/test_gap_turnloop_net_sockets.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"75005a566283e16c9a3afc42dec8742b2c7719ac64ba8bcb657d63e03fc90597"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060unixEcho\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":"test-files/test_gap_turnloop_net_sockets.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"233153bd165968f1f78e9f92903f9d48ef11661f32a79cf6f0264eb9367fc229"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060unixEcho\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":"test-files/test_gap_turnloop_net_sockets.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd06f5bf8e4daca4f76d4766e9842fe58c0fc5105c384634546cc6d0ab3044c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060unixEcho\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":"test-files/test_gap_turnloop_net_sockets.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9016a472c8063eeb16c7af187cd10ad9796613ec69ded42d609be085e78c8e9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060journey\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":"test-parity/node-suite/net/connection/string-write-encoding.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2de7ed1d90d55931a16a1bc065676503487769d5ebd04257e26c50bcd7c426"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060journey\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":"test-parity/node-suite/net/connection/string-write-encoding.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77b0dea0fe42417e911d69ceaf882da51f87f1964c2f2fae4e88ff312878c15"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060callback to map\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":"upstream/actions/actions/setup-node/src/cache-utils.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cd9c56bcf9483a4a205426684ed0182f20c37b09cd2ddf7833608b8a6a8dd6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060callback to filter\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":"upstream/actions/actions/setup-node/src/cache-utils.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"487f72854a09aa43a303767ccb4c9c25aece85f525b9b1e25fdcf6e7f70de8e8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060projectHasYarnBerryManagedDependencies\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":"upstream/actions/actions/setup-node/src/cache-utils.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"778cefaf4a6fb2934e74d330cbb36d4c2066c358f95af27cfcadca0acc6f37f5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060projectHasYarnBerryManagedDependencies\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":"upstream/actions/actions/setup-node/src/cache-utils.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"98539dc50d7a6b303fc0be408e69caba9b4dd9827cfb15e0de913a99b881a5d9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060extractArchive\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":"upstream/actions/actions/setup-node/src/distributions/base-distribution.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f26f25bd4156b4b60a8c9bab03f5d654d13c624d4a7f9318cc8ea1d3a2818b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060extractArchive\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":"upstream/actions/actions/setup-node/src/distributions/base-distribution.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"56174f1b2222daaafbd3e0d01383a9c9a09d488465b451b578422ea69f6df24d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060hashFiles\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":"upstream/actions/astral-sh/setup-uv/src/hash/hash-files.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"37695f21ca57c7c6f7c3bdc5c566b6397f0a46d6092be5a332c7f66e077eebc4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060saveCache\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":"upstream/actions/astral-sh/setup-uv/src/save-cache.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"661404fe2deef969a4233652a838b295f857a3caa93601dd33d5430da6c9cd50"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060saveCache\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":"upstream/actions/astral-sh/setup-uv/src/save-cache.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"128a7eba9baa248cc2cc546e588cb2a41feabed4a21a6623ca2c622065cea2a5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060anonymous function\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":"upstream/actions/oven-sh/setup-bun/src/action.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea757d44cba2cd1820d843b450d41c623dd74bcc12f43452682c84aa91a0e9d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060symlinkSync\u0060 in \u0060anonymous function\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":"upstream/actions/oven-sh/setup-bun/src/action.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec33206b2e9897e57e26f30a5a378e39b645f9a1cee413ae98c4154bad0bd8ee"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060anonymous function\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":"upstream/actions/oven-sh/setup-bun/src/action.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a98715361b60fd4482b32e8ccaafeb66dce3770b2a8528d98f929e904f6118"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060renameSync\u0060 in \u0060downloadBun\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":"upstream/actions/oven-sh/setup-bun/src/action.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00fcea7d4eef56bfdf36807b8e6bc5a48f1e9d632ee5239e86df359d2de8aa4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060copyFileSync\u0060 in \u0060downloadBun\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":"upstream/actions/oven-sh/setup-bun/src/action.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42117abe519f0c5e3e27c4e4a4915d36b843af4686d9d9119249cf08ba1f145"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readdirSync\u0060 in \u0060extractBun\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":"upstream/actions/oven-sh/setup-bun/src/action.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"a435a677dff1ff998e3d953aa15d4a93173c823af553a83bdb4277ef79f725d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 2 sibling directories (22 clone groups): 22 duplicated blocks under crates/ have copies in at least two of the sibling directories perry-codegen-js, perry-codegen-wasm \u2014 18 of them are reported below, and 4 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 22 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 22 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 22 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":3423}}}],"partialFingerprints":{"codehealthFindingId/v1":"4659f71a5c1344f5ff72c53de8afc58b0435019623faa38ca076f4ed612526c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (166 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:3423 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:3933 \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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":3423}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e16e4d91b3a4161ec8de776532c06705936561b904d6ba68f42eb5e46e2175f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (75 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:1827 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:3645 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a31352439fdbbc944e1e2972ea535d2dbdccbb4b45b4aafea7a4c2b21d7b541"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:1416 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:3521 \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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"15987ad826e818f376742d93ef4fbaca774bfaf66006f8ffdb121d7267b35663"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (46 matched lines \u00D7 2 locations): scripts/turnloop/apps/mysql_parity.ts:25 \u00B7 scripts/turnloop/apps/mysql_pool_parity.ts:18 \u2014 the two spans are one implementation copied and then locally edited \u2014 379 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":"scripts/turnloop/apps/mysql_parity.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2ab675011950b35e465c2d0e5f1209df56b9205762928cc1902dbef16e9d2a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2 locations): scripts/turnloop/apps/_helpers/p9_worker_acceptance_worker.ts:20 \u00B7 scripts/turnloop/apps/p9_worker_agent_acceptance.ts:36 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/_helpers/p9_worker_acceptance_worker.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c18ad333a38e15c9a41aefdef027bddfde87f77187090391f930d9a9bb65a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 4 locations): scripts/test-exported-local-storage.mjs:9 \u00B7 scripts/test-imported-value-class-collision.mjs:9 \u00B7 scripts/test-object-array-methods.mjs:9 \u00B7 scripts/test-string-static-spread.mjs:9 \u2014 the 4 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 4 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":"scripts/test-exported-local-storage.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a393fc9e3f5557adc6dfe18aaf38bce4e4c3067e7550da96bf036e3db959960"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:601 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:3252 \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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b118d288e9995e0003e176dc8354645abea07032edbaf8151a08ce77a45b79"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:3611 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:4124 \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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":3611}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec14febc91bd200961adad109b2380fea2abb3cca1c244bf8c745c80528e596"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:652 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:3303 \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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bd90a8f2f0fd0740c094e69890edf26f4994a804efd245a6bec66aebabe265"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): scripts/test-async-resource-own-bind.mjs:20 \u00B7 scripts/test-child-output-late-iterator.mjs:21 \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":"scripts/test-async-resource-own-bind.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ce6e0fe55e09f82ca038a28b75b5b9ec0c376489111ce14c6808c898b7cb6d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (27 matched lines \u00D7 2 locations): upstream/actions/actions/upload-artifact/src/merge/input-helper.ts:9 \u00B7 upstream/actions/actions/upload-artifact/src/upload/input-helper.ts:9 \u2014 the two spans are one implementation copied and then locally edited \u2014 177 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":"upstream/actions/actions/upload-artifact/src/merge/input-helper.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"65217bedaea104db494cd42bfe277e12f23595098a30c0e94ed7586ca4e075ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:2518 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:2547 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":2518}}}],"partialFingerprints":{"codehealthFindingId/v1":"4028c5168f5d60dce6749ab56b29722efa86d44f0e55288f4e807b7f1d0bff0b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:845 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:885 \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f83258844b64a9e3d1e8cd33d4a9a48a003d932211759419c78ffac72067b9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): upstream/actions/actions/checkout/src/git-command-manager.ts:545 \u00B7 upstream/actions/actions/checkout/src/git-command-manager.ts:570 \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":"upstream/actions/actions/checkout/src/git-command-manager.ts"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea850e7557482be691a24e3bccf4e0222ad055eec05cd908c0afc10b4efa5df7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): packages/perry-threads/src/parallel.ts:15 \u00B7 packages/perry-threads/src/parallel.ts:58 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/perry-threads/src/parallel.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6dc291da83ce93fa5ba08adfcee2a3cf6876ca8e4f25bece44b3b5f53aa247"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 5 locations): scripts/test-exported-local-storage.mjs:25 \u00B7 scripts/test-import-meta-require-value.mjs:25 \u00B7 scripts/test-imported-value-class-collision.mjs:26 \u00B7 scripts/test-object-array-methods.mjs:26 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 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":"scripts/test-exported-local-storage.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c2859b5a2ad35ed47e7349f45427eef792a75e0e33b734cbc08be374c0e821"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (23 matched lines \u00D7 2 locations): scripts/turnloop/apps/_helpers/p9_worker_gc_stress_worker.ts:17 \u00B7 scripts/turnloop/apps/p9_worker_gc_stress.ts:22 \u2014 the two spans are one implementation copied and then locally edited \u2014 205 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":"scripts/turnloop/apps/_helpers/p9_worker_gc_stress_worker.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"59eb7a75fcf446aa508788f9a7acf2ece709b8772adf9f1991bd2785c09776a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): upstream/actions/actions/configure-pages/src/config-parser.js:163 \u00B7 upstream/actions/actions/configure-pages/src/config-parser.js:240 \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":"upstream/actions/actions/configure-pages/src/config-parser.js"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdb02bd4fe4d905de4c056e1c0bc576a3dd695803a09ccefe9f92c5d4470de2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): scripts/turnloop/apps/mongo_parity.ts:57 \u00B7 scripts/turnloop/apps/mongo_tls_parity.ts:72 \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":"scripts/turnloop/apps/mongo_parity.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f54d08c1dfd0760cf65d78bf52353d8a38769b00d9c712238d49dda6a3cdfc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): scripts/turnloop/apps/mongo_parity.ts:17 \u00B7 scripts/turnloop/apps/mongo_tls_parity.ts:32 \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":"scripts/turnloop/apps/mongo_parity.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cc78a790a7dfb35a18d5088becb5f8ba1a139781c29eedc4d2e4fc3cce3139"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): scripts/test-export-dollar-underscore-collision.mjs:20 \u00B7 scripts/test-namespace-getter-binding-identity.mjs:30 \u2014 the two spans are one implementation copied and then locally edited \u2014 260 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":"scripts/test-export-dollar-underscore-collision.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e365b213865010289e86bc0a9f1fb5b59d3c59ba6e05a7dfeac6c3f8eadb79a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:1910 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:3742 \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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":1910}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ed5b59f8a6d81e01d3a4800fa48ebcc17fc679161cf77883bceb8e8c054532"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/perry-styling/src/color.ts:60 \u00B7 packages/perry-styling/src/color.ts: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":"packages/perry-styling/src/color.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca12f0acd94186d8ce67fa0a52a6a782a4cbd51068acec2fc998709ce152f956"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): scripts/publish/release.mts:276 \u00B7 scripts/publish/release.mts:306 \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/publish/release.mts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f48b1db974fcd8fa85b0fb536a14d80085b20c0a223667b593f54b7690efb0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): scripts/turnloop/apps/db_thread_census.ts:105 \u00B7 scripts/turnloop/apps/db_thread_census.ts:128 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/db_thread_census.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff25959024395a9c65e380f257839cec2f88d8b95d0ddb694d994e83af846d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:1242 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:3107 \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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95ba4c7fd5410e524c47c29beef7cc8fb894f2e33c2ef603ab62d0cbfa65c05"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): scripts/turnloop/apps/_helpers/tokio_worker_agent_census_worker.ts:7 \u00B7 scripts/turnloop/apps/tokio_worker_agent_census.ts:28 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/_helpers/tokio_worker_agent_census_worker.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24396d29a7e6d860863cd4f07a5c273a9e404cde23abeced9a93ce5b4d8fe5c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): scripts/turnloop/apps/db_thread_census.ts:33 \u00B7 scripts/turnloop/apps/pg_thread_census.ts:32 \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":"scripts/turnloop/apps/db_thread_census.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd79730d715e35a3fbf7456b5b4019dffb47ed60c71b33e1b1f176d764ab6b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): scripts/turnloop/apps/pg_parity.ts:38 \u00B7 scripts/turnloop/apps/pg_tls_parity.ts:27 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/pg_parity.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f2acda29f6b4a8ec80967954e8f4623f9d97435697a43b90522f55ce944d3e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): upstream/actions/actions/download-artifact/src/download-artifact.ts:149 \u00B7 upstream/actions/actions/upload-artifact/src/merge/merge-artifacts.ts:23 \u2014 the two spans are one implementation copied and then locally edited \u2014 121 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":"upstream/actions/actions/download-artifact/src/download-artifact.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3076fb94a9179740fe222cdffbe48bfc9d256affb8b145788f37256b74aea716"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): scripts/turnloop/apps/db_thread_census.ts:145 \u00B7 scripts/turnloop/apps/pg_thread_census.ts:73 \u00B7 scripts/turnloop/apps/pg_thread_census.ts:115 \u2014 the 3 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":"scripts/turnloop/apps/db_thread_census.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef65cc3002ff38be0ae6a22d43030f5568535ad3b655a1f724b8716901d5a58e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): upstream/actions/astral-sh/setup-uv/src/save-cache.ts:15 \u00B7 upstream/actions/astral-sh/setup-uv/src/setup-uv.ts: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":"upstream/actions/astral-sh/setup-uv/src/save-cache.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf819161ea8988a402c0ad400dd1ae510e17de295f86ca7d34c52b138729936"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): upstream/actions/astral-sh/setup-uv/src/utils/inputs.ts:204 \u00B7 upstream/actions/astral-sh/setup-uv/src/utils/inputs.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/utils/inputs.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f422597ba0c0cae522646c0ea62f9a19458668df2daa367c469e28a560ef95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): upstream/actions/actions/checkout/src/ref-helper.ts:99 \u00B7 upstream/actions/actions/checkout/src/ref-helper.ts:127 \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":"upstream/actions/actions/checkout/src/ref-helper.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"5169de0df5e7e6a083fd78d445f79b7a5bdbbcfff5a82113c2765ccf7005d960"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): upstream/actions/actions/deploy-pages/src/internal/api-client.js:128 \u00B7 upstream/actions/actions/deploy-pages/src/internal/api-client.js:146 \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":"upstream/actions/actions/deploy-pages/src/internal/api-client.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"850e0b6bddca58680590ccd7c73db6d30488b8b8fac0658dd6bbc4dc8b844667"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:658 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:1916 \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6a1df396d07ebacaf7880b539379801420ebde914736c8de5f740a661e582b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:681 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:1935 \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"0809870e35eace4eb56f5a5340ecf7d122da7a6d7f8ded5b7988d879f3effe15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:779 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:2005 \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/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa4464caa5aa3e201561aa09dc98eb3741c9b938b605d0941b2db77c3b4173c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): scripts/turnloop/apps/p9_socket_concurrency.ts:55 \u00B7 scripts/turnloop/apps/p9_worker_message_fanin.ts:29 \u2014 the two spans are one implementation copied and then locally edited \u2014 94 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":"scripts/turnloop/apps/p9_socket_concurrency.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"557629200fcee9d751defd5654aeb4cdabfd9bb3903f807c945d36bdef448d7f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): upstream/actions/actions/setup-node/src/distributions/base-distribution.ts:199 \u00B7 upstream/actions/actions/setup-node/src/distributions/base-distribution.ts:216 \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":"upstream/actions/actions/setup-node/src/distributions/base-distribution.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"008ac811da388e8f078f3180d298ace332c528d3cab1935789f002a7eee982a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): upstream/actions/actions/upload-artifact/src/merge/merge-artifacts.ts:53 \u00B7 upstream/actions/actions/upload-artifact/src/upload/upload-artifact.ts:69 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 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":"upstream/actions/actions/upload-artifact/src/merge/merge-artifacts.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1e45037e4c52d6847b191e53cc4fd6e0cf09a3b8e8f9e1ae54f1de70978a3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): scripts/publish/shared.mts:45 \u00B7 scripts/publish/shared.mts:69 \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/publish/shared.mts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3747d806dcb0b4f94184d7005e6f2f5f095539337e48e87cdc6559ff1e58e43"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): upstream/actions/actions/checkout/src/ref-helper.ts:10 \u00B7 upstream/actions/actions/checkout/src/ref-helper.ts:147 \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":"upstream/actions/actions/checkout/src/ref-helper.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c201c0e85826dd845e6e38b45eba0ab9c57627f2fecb55438c9c4057957a62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): upstream/actions/astral-sh/setup-uv/src/version/resolve.ts:201 \u00B7 upstream/actions/astral-sh/setup-uv/src/version/resolve.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/version/resolve.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"2301430fef98b48ae07f586b930f657310426a8d1ec7e09d52a021e7c985a591"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:688 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:3853 \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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4487c42a4b0231df19314f77734f0dc84f9af71d0587863a74c8d1d2ed94d8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:721 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:1970 \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6ea1da58f6b6c79dd907848497024b0e84cf1ab117f860b77f1cfd9b63cfc9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): upstream/actions/actions/cache/src/saveImpl.ts:81 \u00B7 upstream/actions/actions/cache/src/saveImpl.ts:110 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 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":"upstream/actions/actions/cache/src/saveImpl.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"7372f38b2b9caf7c285b46bb109dea84f2aaf1429e731e29d1ea44e61674ef43"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): upstream/actions/actions/cache/src/utils/actionUtils.ts:6 \u00B7 upstream/actions/actions/setup-node/src/cache-utils.ts:292 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/actions/cache/src/utils/actionUtils.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"de469913488d1f5e1967881c9146241fa9078944fb76d68052b280155a07452e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): upstream/actions/jdx/mr-boxington-action/src/index.ts:628 \u00B7 upstream/actions/jdx/mr-boxington-action/src/index.ts:682 \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":"upstream/actions/jdx/mr-boxington-action/src/index.ts"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0f4ae95f351aa0421b308ba016abcf1914715609aa7a4ef11180c7655edc00"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): upstream/actions/jdx/mr-boxington-action/src/target-cache.ts:191 \u00B7 upstream/actions/jdx/mr-boxington-action/src/target-cache.ts:224 \u2014 the two spans are one implementation copied and then locally edited \u2014 101 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":"upstream/actions/jdx/mr-boxington-action/src/target-cache.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80323e296924731843bf744403ab8652f593388a7d7abb9e9c026b1f08a57bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): upstream/actions/oven-sh/setup-bun/src/registry.ts:34 \u00B7 upstream/actions/oven-sh/setup-bun/src/registry.ts:48 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 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":"upstream/actions/oven-sh/setup-bun/src/registry.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1b7005dc4f51ab8c6072aeeb9deadb6ebe73a59cadfc66d9b4beb500860ef5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:5 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:2594 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e333206ff7e76269de59b4b436b03045cad95e70a5350e8b263bd6e00302fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): crates/perry-codegen-js/src/web_runtime.js:1994 \u00B7 crates/perry-codegen-js/src/web_runtime.js:2025 \u00B7 crates/perry-codegen-js/src/web_runtime.js:4206 \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":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":1994}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5ad4ba2eada7edbba5111b249f48e5dbf9708e8fd4d7ef48ce0ecee5da52de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:1150 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:1190 \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb636244416aa25ddc5da1d59b66e03525697865bc5e8ee9b384089f895d1af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:2473 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:2488 \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":2473}}}],"partialFingerprints":{"codehealthFindingId/v1":"5937c893e865f8825660cea703480168191971ffd77ee7bc6f32f9c409217723"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): packages/perry-styling/src/tokens.ts:83 \u00B7 packages/perry-styling/src/tokens.ts:96 \u00B7 packages/perry-styling/src/tokens.ts:109 \u00B7 packages/perry-styling/src/tokens.ts:122 \u2014 all 4 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":"packages/perry-styling/src/tokens.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"302ab6ca2ad59778e383435c4248d44b191268319e736eb9e45866f033930da1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/turnloop/apps/_helpers/p9_socket_concurrency_worker.ts:21 \u00B7 scripts/turnloop/apps/p9_socket_concurrency.ts:25 \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":"scripts/turnloop/apps/_helpers/p9_socket_concurrency_worker.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb97da5d09b6450a6abfcae2e11e91eaf684160877d4b2defb80282d2afef061"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:493 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:3135 \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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7395509b09012a5cf1bcb2fa3fe9f52fca42cc603e7e61c503c6a859f038e3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:3397 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:3904 \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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":3397}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aeee785e5e5c8e1c5a4972ce40c5de29dd8f52ef828afcb7609ee3178ca74d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:181 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:1638 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"af915e27d873ef6850dbedc83ffe6a32056890dfccfaa8e6e3cdb40661a56610"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:300 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:333 \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2954196e1968b6191d62ee3be795f0467a4d78fcbbf64fcc204142d9493b3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:539 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:556 \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"4154797ecbb3de1ce9ea27930e2637a80922b0492a79cd80d2f761e1f8457ee7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:766 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:1993 \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/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"f139dd72e15c6e50ecf01661957cf3107744aa36ff0dcd263af02ca62638df57"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:3234 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:3297 \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/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":3234}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f351635025d8e2c7c05e249ce40c69a63cf8492f477adb4607c9713bd9a39bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): packages/perry-styling/src/generator.ts:82 \u00B7 packages/perry-styling/src/generator.ts:93 \u00B7 packages/perry-styling/src/generator.ts:104 \u00B7 packages/perry-styling/src/generator.ts:115 \u2014 all 4 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":"packages/perry-styling/src/generator.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"40169adb96be7f304768e7e3700dabd6b5fa2a95970cbe4eaaaf3da66dd86b30"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): packages/perry-styling/src/generator.ts:151 \u00B7 packages/perry-styling/src/generator.ts:163 \u00B7 packages/perry-styling/src/generator.ts:175 \u00B7 packages/perry-styling/src/generator.ts:187 \u2014 all 4 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":"packages/perry-styling/src/generator.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ed0a0fdb06d6d42d060a85e502f4d101b9875046f90624c3d3c9163764935f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): scripts/publish/brew/tap-publish.mts:123 \u00B7 scripts/publish/cargo/ffi-publish.mts:46 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 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":"scripts/publish/brew/tap-publish.mts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce2c28adfd3541c28479e4131e3d0b10b818eac0cc5ceb586880236e3131e04"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/test-async-resource-own-bind.mjs:9 \u00B7 scripts/test-child-output-late-iterator.mjs:9 \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":"scripts/test-async-resource-own-bind.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"028a8d9b46d1c60b635d66ed0a017be4ff45e00268338883ae53411b81bdf0bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): scripts/turnloop/apps/_helpers/p9_rss_worker.ts:26 \u00B7 scripts/turnloop/apps/_helpers/p9_worker_acceptance_worker.ts:34 \u00B7 scripts/turnloop/apps/p9_worker_agent_acceptance.ts:50 \u2014 the 3 copies are spread across 3 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":"scripts/turnloop/apps/_helpers/p9_rss_worker.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea71b2431d2853964a2f77346dc7dfebd3f0c76f6bff45ec16d3faffddd8735b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): scripts/turnloop/apps/p9_agent_loop_rss.ts:76 \u00B7 scripts/turnloop/apps/p9_worker_message_fanin.ts:29 \u2014 the two spans are one implementation copied and then locally edited \u2014 100 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":"scripts/turnloop/apps/p9_agent_loop_rss.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"57871161aecad85a843bebe0f156ed58e49ec2b0b39bbaf81a58a4574bfdf4f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): upstream/actions/actions/checkout/src/git-auth-helper.ts:76 \u00B7 upstream/actions/actions/checkout/src/git-auth-helper.ts:233 \u2014 the two spans are one implementation copied and then locally edited \u2014 68 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":"upstream/actions/actions/checkout/src/git-auth-helper.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd76d01613c8a481f3a49911d3a985addd3e3dfedd09a6468d4153a503b6bc3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:240 \u00B7 crates/perry-codegen-js/src/web_runtime.js:250 \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":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"708aa2cb20f4e31fad94d88a74fa6f08b2b89f0b17a5fc09581befc725f0326b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:518 \u00B7 crates/perry-codegen-js/src/web_runtime.js:531 \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":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0502070447b8d612df90bf52e094041c353a0d120cb05780275b47a49a0343"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:999 \u00B7 crates/perry-codegen-js/src/web_runtime.js:1957 \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":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"7338e7f2e58a3f1b56a0e81b93825fbd7893403d97188b96f7201b8ecf09fd6e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:1518 \u00B7 crates/perry-codegen-js/src/web_runtime.js:1538 \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":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":1518}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7f1dbbfbba34034b94b3612a650c0da2789209ea318511a8d2f118016b5d44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:2420 \u00B7 crates/perry-codegen-js/src/web_runtime.js:2495 \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":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":2420}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8c4b0f85f9e066786d517def37f92125410a27cda79410d13171cde22c5209"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:315 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:1158 \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1cb11c7d9992bacf28068d55c92b64c1f21ede08d3095b786eb341195deb1a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:1391 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:1421 \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"df837663fc192da7bc085f9156df6d70ba3468aa8188aee08fc2d3a9bab6ecb9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:2773 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:2782 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:2942 \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/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":2773}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafa6c74f07b61786b3657a72511a349b4b711970f3fcb6668d11e40adb4e56e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): upstream/actions/actions/checkout/src/fs-helper.ts:3 \u00B7 upstream/actions/actions/checkout/src/fs-helper.ts:58 \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":"upstream/actions/actions/checkout/src/fs-helper.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"736804d23824348e14892909ea010768aa81e1de55663a732e04390836e3f8f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): upstream/actions/actions/checkout/src/git-source-provider.ts:199 \u00B7 upstream/actions/actions/checkout/src/git-source-provider.ts:216 \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":"upstream/actions/actions/checkout/src/git-source-provider.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7bfb5a703c92150561dd33c973ebb04e5cc1862aa994697b25cf49f56e966d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:221 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:2752 \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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f282d152dca7cf9aa28737807188fc27cde63366d7a7b1ab8219dbc6cc4ff9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:942 \u00B7 crates/perry-codegen-js/src/web_runtime.js:1383 \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":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84cb56c9c61511f4bc26c325f6ea548a5004ee7a560ce010b853beec76141e5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:2533 \u00B7 crates/perry-codegen-js/src/web_runtime.js:2543 \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":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":2533}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17333e7b8c9562395d1adaa59f530a068c296685346cf75d1890c460e433d4e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:81 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:4945 \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/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a7eeaccf72d4fbbbaebe05f088c9708f28102c1e0100d6c56946635fd131a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:398 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:406 \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"60faa0174bfc2f7a5fc0a5a711949811549754caff6099f6d0385108b5a34a5a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:410 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:418 \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89a926c98ca81d8ef5fb142d5e8e13f239693da16f6097b2b491ecae8b102ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:554 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:569 \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8f675de7dd2a6463fdab0a683e010a856878b1c0a6511d5f3be15d333c5d2d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:631 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:639 \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e396fcbf8e2de0f15d8ddd5827c1367642e32956dd0103458481e2eb41890d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:1198 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:1210 \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cefef75eb6e7e8eefb23c808d267c6678c6127d9e9f6a0cc45d0d3cc22c2d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:2454 \u00B7 packages/perry-threads/src/pool.ts:168 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 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/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":2454}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee29feda8d3ec68003e05759922d1eb21c52ca979cf2506f54d860131a13e2e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): scripts/turnloop/apps/mysql_parity.ts:71 \u00B7 scripts/turnloop/apps/pg_parity.ts:82 \u00B7 scripts/turnloop/apps/pg_tls_parity.ts:76 \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":"scripts/turnloop/apps/mysql_parity.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3faa583f24d6f3265218066e84062e519e62323536666c005ebb58973e2d3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): scripts/wasi_acceptance/gc.ts:1 \u00B7 scripts/wasi_acceptance/p1/gc.ts:1 \u2014 the two spans are one implementation copied and then locally edited \u2014 88 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":"scripts/wasi_acceptance/gc.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9519bd128cbe521cfdc662a5df0f56b1239c227b81d6a9b06c26934bfbb0d8b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): upstream/actions/actions/cache/src/restoreImpl.ts:87 \u00B7 upstream/actions/actions/cache/src/saveImpl.ts:75 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 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":"upstream/actions/actions/cache/src/restoreImpl.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"375735b08473e4d4add2be38d3e3a51e1a0f19e03124d0caa0ebadb84f82a49e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:1566 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:3406 \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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":1566}}}],"partialFingerprints":{"codehealthFindingId/v1":"4724d74691b514b51ba4b4c7c8ff714c120c91a7be5bc0014e026adeda9ff3cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:2275 \u00B7 crates/perry-codegen-js/src/web_runtime.js:3127 \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":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":2275}}}],"partialFingerprints":{"codehealthFindingId/v1":"992178be5718384e14b3f2a7665ce1c6f55509232e7c48202a90e38a7f38c605"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:564 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:1851 \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/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b84edd3f465b8bc2fc1a08f2b7206837579c196a87fc8f48c7346e7028d5f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): packages/perry-styling/src/cli.ts:85 \u00B7 packages/perry-styling/src/tokens.ts:83 \u00B7 packages/perry-styling/src/tokens.ts:96 \u00B7 packages/perry-styling/src/tokens.ts:109 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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":"packages/perry-styling/src/cli.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"5606c46d5395380610e3e6f1603707b3a052ee0d7c90f8c344205012b7810f2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/perry-styling/src/color.ts:45 \u00B7 packages/perry-styling/src/color.ts:53 \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":"packages/perry-styling/src/color.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f99aae2f7cb09ef8d03181a055e1adf8234f0fd21352b673eefd3ae9f25333d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): scripts/check/action-pins-are-current.mts:8 \u00B7 scripts/update.mts:45 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 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":"scripts/check/action-pins-are-current.mts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6848eccc728a9acb791c4b9dfd981a2f1dd778044d35441e947d7e402fde5b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): scripts/node_compat_matrix.mjs:199 \u00B7 scripts/soak/external-tools.mts:76 \u2014 the two spans are one implementation copied and then locally edited \u2014 84 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":"scripts/node_compat_matrix.mjs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3fd506f07dfb21b9717793f8b9e5772926d3e987160632c8fb943cc8f648292"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/turnloop/apps/mongo_parity.ts:47 \u00B7 scripts/turnloop/apps/mongo_tls_parity.ts:62 \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":"scripts/turnloop/apps/mongo_parity.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"3faae98a5e32023e897e2e3cac76875b2b471ead6b06353175073e6524332604"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7 locations): scripts/turnloop/apps/mongo_parity.ts:80 \u00B7 scripts/turnloop/apps/mongo_tls_parity.ts:95 \u00B7 scripts/turnloop/apps/mysql_parity.ts:99 \u00B7 scripts/turnloop/apps/mysql_pool_parity.ts:88 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 copies are spread across 7 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":"scripts/turnloop/apps/mongo_parity.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fab1fef1f9c614bbd5d68384001820a99f105203affb0075cf9cbfaae81f504"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/turnloop/apps/p9_worker_agent_acceptance.ts:96 \u00B7 scripts/turnloop/apps/tokio_worker_agent_census.ts:62 \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":"scripts/turnloop/apps/p9_worker_agent_acceptance.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8567634b3b451b96dc49e7ca16840deacbd84c92d5763e93316e522fd3749b8e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): scripts/wasi_acceptance/tcp.ts:2 \u00B7 scripts/wasi_acceptance/tcp_timers_gc.ts:18 \u2014 the two spans are one implementation copied and then locally edited \u2014 86 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":"scripts/wasi_acceptance/tcp.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78a05b8b2a5c330c8e67610c23b1beec883faa3fd99e8e64367a3f19384bce8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): upstream/actions/Swatinem/rust-cache/src/cleanup.ts:134 \u00B7 upstream/actions/Swatinem/rust-cache/src/cleanup.ts:150 \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":"upstream/actions/Swatinem/rust-cache/src/cleanup.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d09424bc1ae14cd71e4d460e5a16d582b02f798c1a75d7a8ec9eeb929875ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): upstream/actions/jdx/mr-boxington-action/src/target-cache.ts:128 \u00B7 upstream/actions/jdx/mr-boxington-action/src/target-cache.ts:146 \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":"upstream/actions/jdx/mr-boxington-action/src/target-cache.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d09d4a1d0295c0a2391c647c7460e6b9a85af7d15c2c5c835effcbfb966373d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:1102 \u00B7 crates/perry-codegen-js/src/web_runtime.js:1109 \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":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fba16a25a5ef295ef3698b1100932420e2fd373f2bb3010778c6ff52f77894"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:1534 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:3395 \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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"096341d9c8d6a7ca704ff666707b35dfebefbf18860c490cb9b9d9a2109185e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:1903 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:3732 \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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":1903}}}],"partialFingerprints":{"codehealthFindingId/v1":"88578d7d3e64238026436c3a2f3e3256c850453441708d48fa8dfd91ee3324ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:2402 \u00B7 crates/perry-codegen-js/src/web_runtime.js:2625 \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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":2402}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0950880c04fe6893f3246e645bb4ce94f89da3db01dd1b5ddb2801af560f32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:498 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:507 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:515 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:523 \u2014 all 4 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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcd17c3343b0057929fd0f1dae2e631058c6ece330760f360249a8ae43ff7b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:581 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:594 \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56b6d091dbc4668b26f0ca1b0ac60e7fcdb4598b089a2f141e115fe3e7995be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:808 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:2032 \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"de857cab52c01c2dc406d80344e0847a58bc4f0fecdd1d111a23d01b1a02ab68"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:1300 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:2146 \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"101f9704edf73b675dc684f61265422ecc719ff2c97a8f904d067493ba1dee64"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:1343 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:1349 \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3152d0a445aa0488e6264ef800c57671dac1415b56914660adaee60d6a1920"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:2893 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:3237 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:3300 \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/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":2893}}}],"partialFingerprints":{"codehealthFindingId/v1":"0842a335a0a502e5f2437693f1e0891b321e069bdcb547dd98d527a3dea6af18"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/perry-styling/src/color.ts:35 \u00B7 packages/perry-styling/src/color.ts:42 \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":"packages/perry-styling/src/color.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48d3736fa42841ec076e83feeb763f5ee57f0d90e8e50ea07c7ddf225019d08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/perry-styling/src/index.ts:70 \u00B7 packages/perry-styling/src/index.ts:129 \u2014 the two spans are one implementation copied and then locally edited \u2014 119 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/perry-styling/src/index.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c58298e59c966518e4b45f780e62eebcb2155425e7a54093b4f33b2a3c882e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): scripts/check/action-pins-are-current.mts:9 \u00B7 scripts/update-actions.mts:225 \u2014 the two spans are one implementation copied and then locally edited \u2014 71 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":"scripts/check/action-pins-are-current.mts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3971fdaac7dd33e4055a1f74f3c2c86d984f5a9c832ff534b58a120d424bf4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/publish/nightly.mts:19 \u00B7 scripts/publish/pipeline.mts:199 \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":"scripts/publish/nightly.mts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"78316caa5b5d8e0da8f207a588975d1cc55076d62f7436a94fec3d26ff6f963f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): scripts/test-export-dollar-underscore-collision.mjs:9 \u00B7 scripts/test-loop-lexical-tdz.mjs:9 \u00B7 scripts/test-namespace-getter-binding-identity.mjs:9 \u2014 the 3 copies are spread across 3 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":"scripts/test-export-dollar-underscore-collision.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f23f820d11edb7c4d311a562ee31a23308922e12d9af5cbae0afdd43dca97d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): scripts/update-actions.mts:225 \u00B7 scripts/update.mts:46 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 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":"scripts/update-actions.mts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c36b6537937b75ca4b85a9f716e71ab1c377e822d67651e47f9981d2d177504"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): upstream/actions/actions/download-artifact/src/download-artifact.ts:11 \u00B7 upstream/actions/actions/upload-artifact/src/merge/merge-artifacts.ts:12 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/actions/download-artifact/src/download-artifact.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"619809d82fa549ec798f1be565a79629ef0f32986761dc4aecd01d538ad66110"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): upstream/actions/jdx/mr-boxington-action/src/index.ts:353 \u00B7 upstream/actions/jdx/mr-boxington-action/src/index.ts:370 \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":"upstream/actions/jdx/mr-boxington-action/src/index.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"262dca60e52139f6ec50a52d5c686425a20b40a1496990b6f1f1351aba33b05d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): crates/perry-codegen-js/src/web_runtime.js:426 \u00B7 crates/perry-codegen-js/src/web_runtime.js:466 \u00B7 crates/perry-codegen-js/src/web_runtime.js:1585 \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":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ff403fa56ac229ff26ab656eb953b40100422f36c1090fdd514b3d1fd9b393"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:441 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:2991 \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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6751af7d179d36235175af83bd7d4a4c53c5ce94215075cf870c193c81f2b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:466 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:3090 \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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c99dc3fe434d0d3b501b8d3b5ee920e8835978a096931ccacdd4efe14646df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:1039 \u00B7 crates/perry-codegen-js/src/web_runtime.js:1061 \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":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ab233b1dcf57efd3fe24da99e310020533aff6da0e6884672e4b3e4669762b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:1481 \u00B7 crates/perry-codegen-js/src/web_runtime.js:1489 \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":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc46208dc25bca77b4f64a47e575742b3682a8a3da7c73c2c28407234d81c5e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): crates/perry-codegen-js/src/web_runtime.js:2775 \u00B7 crates/perry-codegen-js/src/web_runtime.js:2781 \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":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":2775}}}],"partialFingerprints":{"codehealthFindingId/v1":"704f105dcd5ffc01ba792b35ab143890c9d20f843be28ff5c3eefc25906c4264"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:519 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:1820 \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9523a18213764ad99a6b475e5f39924790b1ef03dcbd1a5552631123836dc5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:528 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:1828 \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbf1e099e5e66e58e668b4e239eb28f541416f4a274aecc2cb2fafd2f9697dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:1258 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:2221 \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"49261ffb129d705ed825e46ff0df0c689ee3b9adb553123b659c7db20eb0014c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:1271 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:2228 \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e37125ce751590da25d5518505dd1e0358ef57ce87256db8442a6cb627ea2a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:1802 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:1810 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:1817 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:1824 \u2014 all 4 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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":1802}}}],"partialFingerprints":{"codehealthFindingId/v1":"956919db232624d3f2897fdcaaef23c0d38c3d84cce33b24ff7b52057d7a59c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:1837 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:1845 \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd7235c462ac162889b6b25c40246654f495570ff5f097815dbd1b5e35cb889"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:1898 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:1904 \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"134e9a576be1afd41c7c0fee374f249f7781183723d5fa229f1e9097c1fcb335"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): crates/perry-codegen-wasm/src/wasm_runtime.js:3196 \u00B7 crates/perry-codegen-wasm/src/wasm_runtime.js:3245 \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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":3196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f129ffc8d3a481f004385eed1258eca5c3c26dc778d2033ef54fbe0345990b37"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): scripts/test-async-resource-own-bind.mjs:14 \u00B7 scripts/test-child-output-late-iterator.mjs:15 \u00B7 scripts/test-minsize-inline-policy.mjs:63 \u2014 the 3 copies are spread across 3 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":"scripts/test-async-resource-own-bind.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc85157bfe63fc36b9a1ca9ea552c26281e03a06ab8d62095f87e6e173857ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/test-bun-embedded-compression.mjs:9 \u00B7 scripts/test-bun-text-modules.mjs:10 \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":"scripts/test-bun-embedded-compression.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b33e7912c9917e7ea28fb0f8f86a10dff649c3c94b7f840361d1ab928cda36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/turnloop/apps/redis_parity.ts:39 \u00B7 scripts/turnloop/apps/redis_tls_parity.ts:45 \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":"scripts/turnloop/apps/redis_parity.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e66bfac2219e6b7da598773ef407f8ebcfdde8db9c6379986195b6aed8fabb"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:undeclared-workspace-dep]: packages/perry-solid/src/index.ts:1 imports perry/ui, a package this repository publishes, but this package\u0027s own package.json does not list it in dependencies (or peer/optional dependencies) \u2014 it resolves only through the workspace link, so an installed copy of this package is missing it. Add it to this package\u0027s dependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/perry-solid/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27961bea3ff8504b5c1a54dec0bebbdaac8844fc1bcdcc2f0141c929a2c53df1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function big (cyclomatic 140, cognitive 145): big has cyclomatic complexity 140 and cognitive complexity 145; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"test-files/test_gap_split_regions.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a9c86627ada956c0c820284b9f0c93adb554b5e3c70f42514e1fbf0813bc5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 60, cognitive 76): main has cyclomatic complexity 60 and cognitive complexity 76; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"upstream/actions/jdx/mr-boxington-action/src/index.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"14779172ae95598526dfa7c2bcf378d3cf94b1d3e89a0c391acfe0f548fcee0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findConfigurationObject (cyclomatic 58, cognitive 37): findConfigurationObject has cyclomatic complexity 58 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 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":"upstream/actions/actions/configure-pages/src/config-parser.js"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b360466b77a7da3dd65abe1f4e0f0e3fc89c0fe0fe39be135141736bb6018028"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 56, cognitive 55): (top-level) has cyclomatic complexity 56 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":"test-files/test_gap_builtin_constructor_statics2_inherited.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc3b1dc759dbf7906af4dc3ead46f6c5c8eba11583490e490172a9e289ca32e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _perryCodeToKey (cyclomatic 55, cognitive 29): _perryCodeToKey has cyclomatic complexity 55 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":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":1831}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc179d95985d5f355b87cb03ec9b028530009eec932fab5ef3d3bd1e5be28f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __perryCodeToKey (cyclomatic 55, cognitive 29): __perryCodeToKey has cyclomatic complexity 55 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":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":3652}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce888fd1d497cce3118b47def903be9bc2b54146807dbbb9996e4aa5eb1385b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sloppyArm (cyclomatic 45, cognitive 44): sloppyArm has cyclomatic complexity 45 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 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":"test-files/test_gap_9459_property_set_strictness.cts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f73ecb41aa14f979a92f897fadaed176f15e9df780e0287ddef6f5c842d57b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function strictArm (cyclomatic 45, cognitive 44): strictArm has cyclomatic complexity 45 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 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":"test-files/test_gap_9459_property_set_strictness.cts"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f15f79b928420a24b8a87512b9cd1016f2373dd77db36f872703a37b849f5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _mapKeyToAction (cyclomatic 45, cognitive 43): _mapKeyToAction has cyclomatic complexity 45 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 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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":2245}}}],"partialFingerprints":{"codehealthFindingId/v1":"404274f2b0bfa69f3d9382031d325e99893a38f8b16ee3fb5c10af04eb210dfd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function namedColor (cyclomatic 40, cognitive 39): namedColor has cyclomatic complexity 40 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/perry-styling/src/color.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf52ddf9b5ca92f6b3589ea750eebb540a8fb4a9a747aee7c7edfd4321659c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 37, cognitive 70): run has cyclomatic complexity 37 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":"test-files/_helpers/fake_mongo_server.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ff813cc34556956ec841fbb1b49dc5742116238e2d70d4662436df0eed4ad7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getSource (cyclomatic 35, cognitive 53): getSource has cyclomatic complexity 35 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 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":"upstream/actions/actions/checkout/src/git-source-provider.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59d3a9fd284cba7be270cdc979771ec32e5272580327255bedd7c0a5470b5ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateTheme (cyclomatic 34, cognitive 66): generateTheme has cyclomatic complexity 34 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":"packages/perry-styling/src/generator.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"976814be84ef9616afe123b16c3e4426bf82e43afac5c043dfc43ff0ed81a183"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureTagAndRelease (cyclomatic 33, cognitive 51): ensureTagAndRelease has cyclomatic complexity 33 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":"scripts/publish/release.mts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"9460f44458bf87b00a42a17e602b177081a00bf0ee7b65727bc46ed8837b5733"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getInputs (cyclomatic 33, cognitive 28): getInputs has cyclomatic complexity 33 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 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":"upstream/actions/actions/checkout/src/input-helper.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1bb09e10cddeb04b53c9d14e59601e4f37b473a5c60eb8974fe2b00c37604f"}},{"ruleId":"R3","level":"warning","message":{"text":"crates/perry-codegen-wasm/src/wasm_runtime.js: 4745 lines of code: crates/perry-codegen-wasm/src/wasm_runtime.js has 4745 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/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c1915e387c7e0c03905a2d5785718bf1395965ede0b0d839a07bf6b065ae2e"}},{"ruleId":"R3","level":"warning","message":{"text":"crates/perry-codegen-js/src/web_runtime.js: 3805 lines of code: crates/perry-codegen-js/src/web_runtime.js has 3805 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/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8880fa5e04f2b7a957093d33dd07040130e6d2b5326654d141ad51176d66160a"}},{"ruleId":"R3","level":"warning","message":{"text":"test-files/test_gap_13049_chunked_literal_births.ts: 2985 lines of code: test-files/test_gap_13049_chunked_literal_births.ts has 2985 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":"test-files/test_gap_13049_chunked_literal_births.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d3337909919faf87f82dcf201ca2c8ffe461fa90ec398dfc21b648bf9488ba"}},{"ruleId":"R3","level":"warning","message":{"text":"test-files/test_gap_element_receiver_regions.ts: 1769 lines of code: test-files/test_gap_element_receiver_regions.ts has 1769 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":"test-files/test_gap_element_receiver_regions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6dad40cb1bb667954cfeb5d870db51675119e7922674afb35b8901816d72e4"}},{"ruleId":"R3","level":"warning","message":{"text":"test-files/test_gap_array_layout_multi_unit.ts: 1232 lines of code: test-files/test_gap_array_layout_multi_unit.ts has 1232 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":"test-files/test_gap_array_layout_multi_unit.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0661d440db5eac5ad501e1a3264d68e2e580c89fc18a3eeb07e1a5662fe83a2"}},{"ruleId":"R3","level":"warning","message":{"text":"test-files/test_gap_10418_bigint_bitwise_typing.ts: 1017 lines of code: test-files/test_gap_10418_bigint_bitwise_typing.ts has 1017 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":"test-files/test_gap_10418_bigint_bitwise_typing.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62fce8fa6b5b335375564848ddcd7ec6e673ce44e369835a5cbfd5033a570c2"}},{"ruleId":"R3","level":"warning","message":{"text":"test-files/test_gap_10420_call_arity_limits.ts: 944 lines of code: test-files/test_gap_10420_call_arity_limits.ts has 944 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":"test-files/test_gap_10420_call_arity_limits.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"439b9fe71b3da21ad1d4c6cc84089571190cf59ee065d405d308e15021623d14"}},{"ruleId":"R3","level":"warning","message":{"text":"upstream/actions/jdx/mr-boxington-action/src/objects-cache.ts: 917 lines of code: upstream/actions/jdx/mr-boxington-action/src/objects-cache.ts has 917 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":"upstream/actions/jdx/mr-boxington-action/src/objects-cache.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6d7165627ec7526f3dd9f4c209918b4d612e7ed8976f39c5ede59733214166"}},{"ruleId":"R3","level":"warning","message":{"text":"test-files/test_gap_builtin_constructor_statics2_inherited.ts: 894 lines of code: test-files/test_gap_builtin_constructor_statics2_inherited.ts has 894 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":"test-files/test_gap_builtin_constructor_statics2_inherited.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bf01c034d98dc430bf836a1d263a4f49026a225cfc1ab20acc64a60ecb01e4"}},{"ruleId":"R3","level":"warning","message":{"text":"test-files/test_gap_forward_class_binding_class_captures.ts: 710 lines of code: test-files/test_gap_forward_class_binding_class_captures.ts has 710 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":"test-files/test_gap_forward_class_binding_class_captures.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9187f10903b799e5d6e88e363a3e62d783e607fde9b2f7911f57d95a3b5d94be"}},{"ruleId":"R3","level":"warning","message":{"text":"upstream/actions/jdx/mr-boxington-action/src/index.ts: 684 lines of code: upstream/actions/jdx/mr-boxington-action/src/index.ts has 684 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":"upstream/actions/jdx/mr-boxington-action/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4abc5ad8ba25b05381e5f61b340258d8359707f5628d0c7400f04703d8dba39"}},{"ruleId":"R3","level":"warning","message":{"text":"test-files/test_gap_region_loops.ts: 661 lines of code: test-files/test_gap_region_loops.ts has 661 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":"test-files/test_gap_region_loops.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20252814e2c1dc926734812d4c31cf9fd1bd4496a897172b201db5106865917e"}},{"ruleId":"R3","level":"warning","message":{"text":"upstream/actions/actions/checkout/src/git-command-manager.ts: 655 lines of code: upstream/actions/actions/checkout/src/git-command-manager.ts has 655 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":"upstream/actions/actions/checkout/src/git-command-manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae2648d3d1b31e728b29e704a15205694882bc554ead593b90787cd07abfc06"}},{"ruleId":"R3","level":"warning","message":{"text":"test-files/test_gap_gc_11929_stable_home_marking.ts: 626 lines of code: test-files/test_gap_gc_11929_stable_home_marking.ts has 626 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":"test-files/test_gap_gc_11929_stable_home_marking.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8512b10b0e0b63cce6a4cb595383aba34a6e980641ed942dfc689df353a604bb"}},{"ruleId":"R3","level":"warning","message":{"text":"test-files/test_gap_json_record_loop_clone.ts: 612 lines of code: test-files/test_gap_json_record_loop_clone.ts has 612 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":"test-files/test_gap_json_record_loop_clone.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9a2587df14b1445e0742b9e14d0d667ff76a75622a6021806d289c87a4c4db"}},{"ruleId":"R3","level":"warning","message":{"text":"test-files/test_gap_split_regions.ts: 600 lines of code: test-files/test_gap_split_regions.ts has 600 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":"test-files/test_gap_split_regions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a51b1ff83998e6d0f0289f51dda1f469b71be9d5f111f921f25f53511719d48"}},{"ruleId":"R3","level":"warning","message":{"text":"test-files/test_gap_10476_builtin_named_guarded_receivers.ts: 590 lines of code: test-files/test_gap_10476_builtin_named_guarded_receivers.ts has 590 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":"test-files/test_gap_10476_builtin_named_guarded_receivers.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b37ceb85c12e590ef4b3e6d3638f474fa197307a20013e6bddb18b39bc0a8e"}},{"ruleId":"R3","level":"warning","message":{"text":"test-files/test_gap_typed_array_compound_update.ts: 562 lines of code: test-files/test_gap_typed_array_compound_update.ts has 562 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":"test-files/test_gap_typed_array_compound_update.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cd7a487b552ecebbf41c088e7d7af4b4d1114467610e99df85eea87725ab67"}},{"ruleId":"R3","level":"warning","message":{"text":"test-files/test_gap_10894_typed_array_generic_annotation.ts: 558 lines of code: test-files/test_gap_10894_typed_array_generic_annotation.ts has 558 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":"test-files/test_gap_10894_typed_array_generic_annotation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e547d990ed165c9910c616f406fcb17065c2e939366ba838258a5a1cd3015a2e"}},{"ruleId":"R3","level":"warning","message":{"text":"upstream/actions/actions/checkout/src/git-auth-helper.ts: 538 lines of code: upstream/actions/actions/checkout/src/git-auth-helper.ts has 538 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":"upstream/actions/actions/checkout/src/git-auth-helper.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e724d5734f85831609e30b2a4373b37bfbe60109057073ea3a28301b22893204"}},{"ruleId":"R3","level":"warning","message":{"text":"test-files/test_gap_9445_implicit_this_restore_sweep.ts: 521 lines of code: test-files/test_gap_9445_implicit_this_restore_sweep.ts has 521 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":"test-files/test_gap_9445_implicit_this_restore_sweep.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d26451fafb3c15fca751c762abb614402f69f68e4e3cd89aea2f9ddcea075c9"}},{"ruleId":"R3","level":"warning","message":{"text":"test-files/test_gap_dynamic_get_matrix.ts: 506 lines of code: test-files/test_gap_dynamic_get_matrix.ts has 506 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":"test-files/test_gap_dynamic_get_matrix.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79cab6f19a334e2e4629474bc5983b4f0764b4789bf3c52d9e3281551e428a0d"}},{"ruleId":"R3","level":"warning","message":{"text":"upstream/actions/jdx/mr-boxington-action/src/lib.ts: 498 lines of code: upstream/actions/jdx/mr-boxington-action/src/lib.ts has 498 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":"upstream/actions/jdx/mr-boxington-action/src/lib.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a57c95be181ba277d3b0dbe3c6041402f6b1faa3a875eb85f7f06516f9b8710"}},{"ruleId":"R3","level":"warning","message":{"text":"test-files/test_gap_10419_generator_loop_header_yield.ts: 493 lines of code: test-files/test_gap_10419_generator_loop_header_yield.ts has 493 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":"test-files/test_gap_10419_generator_loop_header_yield.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbbae65d6ac3dbd998bad97dad56419e05cf6e043657ff884ae30805dc10559"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/perry-updater/src/index.ts: 472 lines of code: packages/perry-updater/src/index.ts has 472 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/perry-updater/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed3186bc099204697c1b871b0a7b9450a02bf6dbec3fa1f18f0354ee9d00dc1"}},{"ruleId":"R3","level":"warning","message":{"text":"test-files/test_gap_repsel_element_shape_loop_clone.ts: 471 lines of code: test-files/test_gap_repsel_element_shape_loop_clone.ts has 471 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":"test-files/test_gap_repsel_element_shape_loop_clone.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc16d285b10dd77dc3f4210a3823f40ae85c3a7915fce8a15d525dcc3a9ecb3"}},{"ruleId":"R3","level":"warning","message":{"text":"test-files/_helpers/h2_wire.ts: 459 lines of code: test-files/_helpers/h2_wire.ts has 459 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":"test-files/_helpers/h2_wire.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8501ae602d921687a65177df870e315c2ad761adcd93c866f3ea5b6b58fb7b8e"}},{"ruleId":"R3","level":"warning","message":{"text":"test-files/test_gap_repsel_ptr_shape_locals.ts: 448 lines of code: test-files/test_gap_repsel_ptr_shape_locals.ts has 448 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":"test-files/test_gap_repsel_ptr_shape_locals.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f91b2e786ac1f13e80d1a1fc147b691880b59437a808e91d9011d6dd99f90d2"}},{"ruleId":"R3","level":"warning","message":{"text":"test-files/test_gap_typed_array_guarded_view_keys.ts: 446 lines of code: test-files/test_gap_typed_array_guarded_view_keys.ts has 446 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":"test-files/test_gap_typed_array_guarded_view_keys.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd478fb02208602577082d067b98abeb51c1e1f08f02e98f78fd57b496b58299"}},{"ruleId":"R3","level":"warning","message":{"text":"test-files/test_gap_lblk_labeled_blocks.ts: 432 lines of code: test-files/test_gap_lblk_labeled_blocks.ts has 432 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":"test-files/test_gap_lblk_labeled_blocks.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d366e4810ffe1dfc2fda898c9965711b6f285ec47098cadb7f5f0e2857cc04"}},{"ruleId":"R3","level":"warning","message":{"text":"test-files/test_issue_945_scalar_method_guards.ts: 430 lines of code: test-files/test_issue_945_scalar_method_guards.ts has 430 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":"test-files/test_issue_945_scalar_method_guards.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bc951fc1edb80a491a8bc828c7fbdf0be592bc3891e3ca2fff512b4944b984"}},{"ruleId":"R3","level":"warning","message":{"text":"example-code/forgejo-deployment/main.ts: 427 lines of code: example-code/forgejo-deployment/main.ts has 427 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":"example-code/forgejo-deployment/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2336464084773346168e672ebc726d388984768794e12cc956fbfb6d6f1bb25"}},{"ruleId":"R3","level":"warning","message":{"text":"test-files/test_gap_received_value_diagnostics.ts: 424 lines of code: test-files/test_gap_received_value_diagnostics.ts has 424 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":"test-files/test_gap_received_value_diagnostics.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"747e0694fcb4ac89d55285d3c0d43d08e9dd6bebb5b1f6ba93246e4917aaf3b4"}},{"ruleId":"R3","level":"warning","message":{"text":"test-files/test_issue_5893_private_brand_freshness.ts: 415 lines of code: test-files/test_issue_5893_private_brand_freshness.ts has 415 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":"test-files/test_issue_5893_private_brand_freshness.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98561c679030ff99f0031369e1499d99542c7af379ec25f6aef05529b4d73495"}},{"ruleId":"R3","level":"warning","message":{"text":"test-files/test_ffi_surface_runtime_core.ts: 409 lines of code: test-files/test_ffi_surface_runtime_core.ts has 409 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":"test-files/test_ffi_surface_runtime_core.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4797452befbdaacc5bbe55a290c17bd2df1cf4f776f1126ddd17ec0c1ed1d9e2"}},{"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":"upstream/actions/jdx/mr-boxington-action/src/objects-cache.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5271c37a5a74982790198484ef6d17d8a6c851e474eb10e073ea9e257d8a3de"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/node_compat_matrix.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c36b18768975c097af2b19b24a0f2416a150135b647029de8d1339351bcb6d"}},{"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":"upstream/actions/actions/checkout/src/git-command-manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd9fec705ab5360e3f563da973221712ac7d97dc18ce1f2530f570445ae812f"}},{"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":"upstream/actions/jdx/mr-boxington-action/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3348666b16207af9e1185c6d34f6cde1bedc37fcf69e437beeddc7e7f15cf8f9"}},{"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":"upstream/actions/actions/checkout/src/git-auth-helper.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae49b4061f26280392481afaea2ff75e5cdd547579e97a4bc0dd1cc43764bc0e"}},{"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":"upstream/actions/jdx/mr-boxington-action/src/lib.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8b77aa031c8cfd29566a2ed7e49a709e8f5985af570504cecd5695bd995280"}},{"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":"example-code/forgejo-deployment/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb41c1cd3a262f78b213b3db1e911962eb61cc5ce1ec2c4748c742ee46e69b7a"}},{"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":"upstream/actions/Swatinem/rust-cache/src/config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd5fd5a188b8a19c1336a652bb4d9a8dc7d68e95aa01753378eac1f5eb8f932"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/binding_pins.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"825f3d1533c22a1fbbea39a067591f59d5bd980522804d36d9aff29dc337e803"}},{"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":"upstream/actions/astral-sh/setup-uv/src/utils/inputs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97930e6f91e08d1c2b4033d90ab8fae204bdec08ffc989290d235f08c533083"}},{"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":"upstream/actions/actions/checkout/src/git-source-provider.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94382093a95e59c0302f9703425c6d53e174f3ca2742724c853fed883cf64ae2"}},{"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":"upstream/actions/actions/setup-node/src/distributions/base-distribution.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61823786132f07accebb37fa11500e985e679a98018a2fe16b6135196eca9a53"}},{"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":"upstream/actions/astral-sh/setup-uv/src/download/manifest.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d8afff7a99cbddbb557b190c5f7e8cf10442802aca74f0f45bd66a24155b44"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/fp_fuzz.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ffd3c9750a7c152ceed631273e400407ab97ffaa374164421ecd5c30e53c67"}},{"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":"upstream/actions/actions/setup-node/src/cache-utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"654545718b5835d452d957a0303ceed856f2ecb25d773d472aa25060c83feef5"}},{"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":"upstream/actions/actions/checkout/src/ref-helper.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"008b22f883cc8ce8b9d7a900e6413af6e2937cd95e74ba8a6bcf7407a2c5ffa7"}},{"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":"upstream/actions/Swatinem/rust-cache/src/cleanup.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1339fda692f94cd5fb5882dc642757b1267798b32571e978cd751ab09825de8"}},{"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":"upstream/actions/actions/setup-node/src/distributions/official_builds/official_builds.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ce5acf7ea31dd89c606bfbff65000df00977a96d8ed28b66a236edf3cdbdcd"}},{"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":"upstream/actions/astral-sh/setup-uv/src/setup-uv.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23fb2bff1a46a47e41de07a86e51ae28b1c53f516e6f938ab94969ce75a0e48b"}},{"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":"upstream/actions/jdx/mr-boxington-action/src/target-cache.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a5dd98e7d1fac801236dcf9d09767936e99770acb58ed9e2a30cb872595d49"}},{"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":"upstream/actions/actions/download-artifact/src/download-artifact.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77695ad2e8d3e3071c0e14feda2e1fb4f63b1706e367ac39548cec33646f6c24"}},{"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":"upstream/actions/oven-sh/setup-bun/src/action.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e729ca3192afab996e39afb5f53f8ef416015893cf960db1360894f86569c2d7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/regex_9217_9218_differential.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e07e569d56ecb7e56124e1e0081522af8dd9f1981db5e65d8874a6e23801f1"}},{"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":"upstream/actions/astral-sh/setup-uv/src/version/resolve.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd1ab9f0f8dfdf6403d96c4dd059749a6bb37a272b14b3fb4aac46a978fcace"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/update-actions.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3264f0bac33b75d3194fabe20f75852f557cb8fdf5d2a1272804ebcef80f24a"}},{"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":"upstream/actions/ilammy/msvc-dev-cmd/lib.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"586d8880e8ff4411ac56f2ce1002da49989e2939618d459ef76bdbd936e10d70"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/perry-threads/src/pool.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5f1220afc600881fabf49ab6ebfca7912cd09d87a00715034b6220e5e3ff6b"}},{"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":"upstream/actions/actions/checkout/src/input-helper.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e620fedf2dee9842bb846b8ccbb4c799fa28717250f25875091202cc59250c7"}},{"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":"upstream/actions/astral-sh/setup-uv/src/download/download-version.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88bf73432e96d9272229c8fd15f28a2d7c3c9d3abaa466c5a3fcb722d37356e9"}},{"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":"upstream/actions/actions/checkout/src/github-api-helper.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7205d9015ed577353747985c3f15b8dad40863d8d194a6939d18fee2782362"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/perry-styling/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a4fcc45f27e0d094d520ccec485346a62b832d093ebdd7ce4ebf816ca6b095"}},{"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":"upstream/actions/oven-sh/setup-bun/src/utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee6a32542d734317333e0c674ca253a90156e973b11ec454bd2f63127279468"}},{"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":"upstream/actions/mozilla-actions/sccache-action/src/show_stats.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"429bcaa0adfa7c9c72ea3118be335aa20641ec06c4523091a44383aa73d064bd"}},{"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":"upstream/actions/actions/setup-node/src/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f56dbc8a05991f212b9231448210af900006d0fd2b84cb610299801c43c1d29"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/db_thread_census.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d473dd0caee650a83999cee369e5475c7123b38317f791be07a313a8ce1fa4"}},{"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":"upstream/actions/astral-sh/setup-uv/src/utils/platforms.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c6127e7e9a424b2a7688c2fd8cca7e8e99aa681970b00c44d871ec7ea0ca06"}},{"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":"upstream/actions/mozilla-actions/sccache-action/src/setup.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74ee722530cda8eeaa275cf098e7679d0d3807620c1e7def33d8bc3d22904ef"}},{"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":"upstream/actions/astral-sh/setup-uv/src/save-cache.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3027a4fb9f430934efea091c2a1a6f5ddcba10878c6050fc301ce63e259a1c41"}},{"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":"upstream/actions/actions/upload-artifact/src/shared/search.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd709bdff6290314e2d8c8f73ea684de7c417897b08ce633721ded38ec623e0"}},{"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":"upstream/actions/astral-sh/setup-uv/src/version/version-request-resolver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc97666ed44c0dc28e0ffc4e7be24e461e4254b81aeffbed799ebfa571df71b3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/brew/tap-publish.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5563d72069d0c96e44ee515ce01186f7f4f8ad161e1952ba0e75c2fd95e4a4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/p9_agent_loop_rss.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86617508a69a24d1eab3bd51e4e281579b2c5ef606d6e9e1221c2540565f25df"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/pg_thread_census.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d982978a3668f94247b0ba3b21de917969915238848fd4fc28062c218af282cc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-minsize-inline-policy.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eec277d5d389e4f9897c9085ca53e2a3a79a97b79c78b629fc26cfd7697f982"}},{"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":"upstream/actions/actions/checkout/src/misc/generate-docs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cfbb5ec190d62fe2a87e31916707b469db30aa74869e99de311801dcb5fb1f"}},{"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":"upstream/actions/actions/cache/src/saveImpl.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9faae8316cd67c8a802cc91f66e7e0308c11d1aca0b23539c7d224fa60580eb9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/perry-styling/src/cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c142071884e2d3bb6cbf9f50dc464166e643230c9b0bb78d8668ed73317f3780"}},{"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":"upstream/actions/actions/checkout/src/git-directory-helper.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81727ed434ebe966af2d9c370f2d0877ae0eee00d387d2fa8cb0d3736ade4cd"}},{"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":"upstream/actions/astral-sh/setup-uv/src/cache/restore-cache.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a6cc45c9409b4f46f34e7419a9ae41542d280923b5a91b5a95275be202d11a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/pg_parity.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5154e1cf0dc885fe6d333ec68e5bceeee74391e1445f5b1e0151886a26db0149"}},{"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":"upstream/actions/actions/cache/src/restoreImpl.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48266ba750e36274e1d15ae790f25adc0bec6f0120fa21722e824fd2bf779748"}},{"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":"upstream/actions/actions/setup-node/src/util.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba06e76fd70fe89af5a87a5ed10d459f08941399c3048f6038c6111d3636bc0f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/pg_tls_parity.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3598549816fded0bf57c4dde0306e522b64417eeac7ae0fc62789729b9e3695c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/hono-perry-server/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b123e4bfe4f3535ab732b8c40d867fcd83d74d6a02f7781b9d7f70595f714998"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/perry-threads/src/parallel.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1c49ab6f4c30efb15636d678b63063d118d6d602bd12114493561d4c82e1ba"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-bun-embedded-compression.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c4bc308f72f974ec1e866571ba4a612d5f17992f000c273b8acc0c7a27ac15"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/mysql_parity.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d22fb956693946247db1bbc9c500a204ffb9b8b8c281ed816b38a6da971f55"}},{"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":"upstream/actions/astral-sh/setup-uv/src/version/file-parser.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6caaff58210f0a54f28d55ce78fbcf5833e34fd985486be5d4de5cdab2ca28"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/redis_gc_stress.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf6900f54aa2aa164c01cac1f621f360e2873e1aea0ca28818f8c654e40a177"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/mongo_tls_parity.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19464b4fbd3e83544efd72bb75010a68933c1ea6a95aad1f8e3468f2f93a3f63"}},{"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":"upstream/actions/Swatinem/rust-cache/src/save.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3223972c0cbd12b03a8f048539236878b1276fc4359b2a51e875ab99be20a687"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/p6_abort_midbody.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0cb14c28c25d201328b78746e750d402a29c18ecb014d21a91c44e1cc61a40"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/mysql_pool_parity.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f73ee62223cd849c890d736182089d8fab01effc5f128db6a2b310770abcb8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/redis_parity.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fa8d094d2ecd406d3ba014991e261289bdab4dc785522e5c2b9ac0404bccbd"}},{"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":"upstream/actions/actions/upload-artifact/src/merge/merge-artifacts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9b682cfd3e675ca9cd95216cf385c85eb5b7f7a97ebd4449ac17d51ea9a1f8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-retained-source-pool.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7cce0ab52de4677b561fbba389f68589ca612d5cef3976aef8cb605661ef56b"}},{"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":"upstream/actions/actions/upload-artifact/src/upload/upload-artifact.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7669a8ad3f462d20f64c0fb8936464f96fd1bba8dcb7348acdaa2859a63ae934"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/soak/update-deps.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb146676f56ef71c7c3cf93cfee50dca76d7795c94b671c0cf835b6ee6eae95e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/p9_socket_concurrency.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b2c74a08326b1ec0a276206a230999ae77bfc576a319b73adbceeb67f1ff25"}},{"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":"upstream/actions/actions/setup-node/src/cache-restore.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2151dc168327a0093fb36e0901eee8901dc91b39d820e348638f53317330b9ca"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/mongo_parity.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"588ceedd308e033aa4279d49b36f81dc6199ab5dd511f8488ce285fdabe8b247"}},{"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":"upstream/actions/actions/checkout/src/unsafe-pr-checkout-helper.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ccc9ed78392c2e6748ebeaab91b9dd5f55810e136567a11b049bef194f85dd9"}},{"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":"upstream/actions/actions/cache/src/utils/actionUtils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"640070b3ce67f84991e4d1a7ca04b97bd24463b76f4bbb24509efd3b4a4c9a41"}},{"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":"upstream/actions/astral-sh/setup-uv/src/version/tool-versions-file.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84858444661ef82ccd59685be60965c5f8850a35f0b197a6b5113d9126d7f729"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/nightly.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df8b94ed7deb60c565ebc8b263b5d7ee8896d17670365df84a972e52c466f2f"}},{"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":"upstream/actions/oven-sh/setup-bun/src/download-url.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f966e2a2e6c85e106f1dc730a781f7fdd6ec087a626d93b3db9a9e3c79e204"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/timer_loop_stats.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5514cbf68f52fb4d0896e82533c116154d42404207767be06aac5e936dc5df30"}},{"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":"upstream/actions/actions/checkout/src/fs-helper.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d4afe1d65979b15f2ef7e170174de5baebf6414e1267fe77612c12bc8f941c"}},{"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":"upstream/actions/Swatinem/rust-cache/src/restore.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5561165b5f3da4fb0fb0a42b45580d7b52f96136c2b7687e2929bfd29396a0d"}},{"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":"upstream/actions/actions/checkout/src/url-helper.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0779cc5948c95580354f467ea766d175528e30fdc3d1378c79543afab63c12"}},{"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":"upstream/actions/oven-sh/setup-bun/src/bunfig.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3d4020574912468c1d599ac69bbabbc1f0941a79433e9023966bfa8e7d2af2"}},{"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":"upstream/actions/Swatinem/rust-cache/src/utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3bdbf45a51c238d7769996ebd3bc266fd90f653bb16d6d793de9cd764557ab"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/http2_tls_parity.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbcf09ee3297aaf2a297b1e588df9ff66e1f8d71f9b7dae8a3da654986e6c90"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/redis_tls_parity.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c001a49b3b8aa1e27fa1a64ea23bddf871e457ff9af209c52f9412ee096d1310"}},{"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":"upstream/actions/actions/checkout/src/git-version.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac400427ea6cdbfdb0ac302b3d068f081e07810cd249520585147b1631126988"}},{"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":"upstream/actions/actions/setup-node/src/cache-save.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27aac7f6cbe3908681e7096d76ad0c2889e5820432cd751edeeabb2c1191d13b"}},{"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":"upstream/actions/astral-sh/setup-uv/src/version/requirements-file.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a720756c9e6ee6dc671fe416855ff50d356ca169801403a957f8de009e6cce2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/p9_worker_message_fanin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e9e7cc4e22ad4d59f5c7e0a40aecac1ad117fafa27524bfe59caa49c67d9d1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/prepare-ci-packages.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be7c0f9cfe50b946fb3e07cb67ac4886264f7750bd63564bf3f434d590f3ba4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/tokio_worker_agent_census.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b64d2ced002c00a741e503dd914de491429fb3bc65e8fdd03fbce2eb70fde2"}},{"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":"upstream/actions/astral-sh/setup-uv/src/download/checksum/checksum.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"118921c34dc34a276911f0ce579c02b1309d06621f6ddf9d6dd330b37e2a7dd7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-net-pump-symbol-identity.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1ccc5dd73127e20ebc5633fea9f8f81ddd36ae714de6fc2478b7b3838298bf"}},{"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":"upstream/actions/Swatinem/rust-cache/src/workspace.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c44af22faf195a0f7cb7fe402850f3bdd53c18c6465d5505291467b54fbf50"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/date_cell_padding.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"142596198f50e786fce145bb7a75cc964d0259f70ff72bf14e117c06c2f8e362"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-bun-text-modules.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f59a0c94f17c719e4b411f93ed19fc8e638573799a3ed1f75ddd95c2dd0edf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/_helpers/p9_rss_worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f6ad35d66e81b19459cb3fcf5965281fa1ef7a8a01a9d51d7707dfddc53aa3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/_helpers/p9_worker_gc_stress_worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"097ae72cc6572cf9a24d00bb6c5bb683f2e6ccc7856611e328c9924e603c238a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/p9_thread_agent.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c7424073e31bd2f4816438f77e65d0a314b2a3d461fd150e4124f003ee37f0"}},{"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":"upstream/actions/oven-sh/setup-bun/src/registry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"010fbe9ebe5e68ad94f9f64617f4d69e2902b3c4ac22d56daf047f16e762834f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/p9_worker_gc_stress.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6a2cd0e1efcc513e63bf96aea8d01e49dab02553c4863939490445646244db"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/pool_gc_stress.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6da4f288df198508d52cb81bffb49913dfd53252ece757b8a704bf9be6bc7aa"}},{"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":"upstream/actions/actions/checkout/src/retry-helper.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"505969a317e16c8cc27646cd58df75341726d9c61fbd89c4433ad74f864bf396"}},{"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":"upstream/actions/actions/checkout/src/state-helper.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64db98b1863384e058abe3d6796d3b4a4d33a0141ad6dd3f94ff817eb46c340e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/cargo/ffi-publish.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18e119837b5d141560d4cd8c277df00fc0e0bd7a9e6745d581fdcda96751d7c"}},{"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":"upstream/actions/astral-sh/setup-uv/src/version/specifier.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"403fe2b37b5b0028ef89686bd6edcd3aa6dc51800864c6d4c2abf03311b7058c"}},{"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":"upstream/actions/actions/upload-artifact/src/upload/input-helper.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5e585bd63a551490480bd4f1a2236a602f3c8a15c615d59e879c180b7ab304"}},{"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":"upstream/actions/astral-sh/setup-uv/src/update-known-checksums.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07fa7f2c19a5cce9624a2729a50b3efdd065ae10ac2cab345f6b6269a14e4cc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/p6_tls_remote.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"204a0eda7f4dc60ccea7fffa0859e6725deaa7539caebeb17b738a17ff5de1ed"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/update.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24cf2c63ebcb7e481e4c16ffc4865954786aa320a1ea8c950be53aeadfcf815"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-namespace-getter-binding-identity.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68daa8074e66d2b815c5dbe5c3f85ab2d13fafd954b753e54258d29c69b0538d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/pool_thread_census.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1393d43f6820e7b09ebfc8b6135037778983846e66a17e80f9cd9b8992015612"}},{"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":"upstream/actions/actions/setup-node/src/authutil.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d5aa0e62224f7c11338d5d414a6163449118485bd3eff9ee647e9f424c2596"}},{"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":"upstream/actions/actions/setup-node/src/distributions/base-distribution-prerelease.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e03ecdf46cbc0a0bd8df077f43983622f8341b9fbfa1adb23730acfed678ac"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-loop-lexical-tdz.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bc05732d123b00efff3545eb37ae6ad37ab5ec1a8934ffacd07b5a210b7baa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/scan-ci-packages.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"038bd068add1114188aa1cadc2af63b7e943d1660da5082ca8b13e53ea0ce1ac"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/wasm_eh_managed.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db92b46dc07ed434f43b8fd762bcf6a702bd16297dfd6484d6851f3e656a179"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-child-output-late-iterator.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5e6fb6e92914623922bcb00285de0c1d5249ab2b0b1cbf7b9f0933fa5099fb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-async-resource-own-bind.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98c306b9f879dfca910f77069b07120a07be46c1cebfb2fca481dbadb16b635"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-codegen-unit-resume.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0e26f6dc63d879fc17779e7aa35155c0fb15c4941c6a36396ce62cfa5c5c52"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-imported-value-class-collision.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8369206128f6c757c951e73a80e465e29910f5c5ffb2999eec33628396ee122"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-object-array-methods.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce920ff8edf67c1132caa12ceb024719029bc27dae44011ff42144d11905ffb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-string-static-spread.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ad124debb115e8ce5bdd10d0238072fe96dc35d517895e8c48ae9e5172dc10"}},{"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":"upstream/actions/astral-sh/setup-uv/src/hash/hash-files.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5296a5cb5cdd556bd87fe18e01d3a434de60a8395f21ab2e1658d8a18d0342f1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-exported-local-storage.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c5b1b460b11e9d2c6bd839c67127457ce3ae60569c684799792ad8efbea3fd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-import-meta-require-value.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db665ffb65b51651659bfa4fd59771bfa8a96a8359635883f647654abbe22764"}},{"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":"upstream/actions/actions/checkout/src/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc0d21ebf5f902985653c10bc1d619e61b316b5bc92747e2f1c22479fae79ad"}},{"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":"upstream/actions/oven-sh/setup-bun/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0fa78e4c31641b0b9f95b69d4e6e0e5a2694d3ec5084fab92620685ba62e9c"}},{"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":"upstream/actions/actions/cache/src/stateProvider.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37f761de426236f9447cc386d606c0830510bd59b50954dba59482b7dae8abb"}},{"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":"upstream/actions/actions/upload-artifact/src/merge/input-helper.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f51a532ac0e3d4020f8e7315d88e4f36b0faca7729af04a78e28cd9b22800a"}},{"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":"upstream/actions/actions/cache/src/utils/testUtils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c8bf7aa66bf99160d9190ff7d628de948854d2c0260c572ee0230fc37dc6ab"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/exception_boundaries.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fea3188bd92542dbdacb13950c717dcb77926bb446bb5b8875ea25d98f6c085"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/p1/node_zlib_dictionary.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48275ce0fd5fb49547b8226f61dadc479561eae0dec24d6d03e9a9804900363"}},{"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":"upstream/actions/astral-sh/setup-uv/src/utils/python-runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6119aef2d8fa30e0c5ae406484cf9771aba6420a382edea891a799745d08fe"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/p1/exceptions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9309af31e356e02787bd9bd4edddbac7c8ba724089f67fbee208652a04b0b9e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-export-dollar-underscore-collision.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d56d65021cada7dd1ca5a544365022236c54dd508b2707b7de76bfad0b4a34"}},{"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":"upstream/actions/astral-sh/setup-uv/src/download/variant-selection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da79bd8a2d0530e8dadaa2933d1f262e26ec8117fccd07418e264d69c0da1a36"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check/run.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1100dc38a32a160fce09e4ed679101a2325fad529c391d9cd6d96305200b37cc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/wasm_eh_completion.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d678a0d07f43c848b9c888c09a8db2cffec12e6762b8f7a005a04b89488c20af"}},{"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":"upstream/actions/astral-sh/setup-uv/src/utils/config-file.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead42a7e8de1484d9aa3a5496a62db8c2d794242a106bfb438bfc6347da3f34e"}},{"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":"experiments/llvm-inprocess-spike/spike.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa56944c555e92cd18faa184af2d4600db3c04576de129d4e0c58ee88c1f6afe"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/_helpers/tokio_worker_agent_census_worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ab268cc6771b3adac0aaeba7f330a7be55bd43e098dd76df3d7eb0eb38d11f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/node_http_hello.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88099949908c5b4b6bd7e655462e5466ccb135dc78bae8bfa0c7f114f63df45c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/p1/node_events.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8d5f8d74baf9438285bdbcf54c1971b27daeda9b0e19b75151984a372846de"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/perry-styling/src/platform.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2f4fd47019432abfe3c475961c52fbb643f72b93841350bf5fa31fc46a62fa"}},{"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":"upstream/actions/astral-sh/setup-uv/scripts/build-dist.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd07e7a505d9c1f6a2ae3786ef23e3dd90c418405c6d4244bf6728924b8eec6"}},{"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":"upstream/actions/actions/checkout/src/workflow-context-helper.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"723eb00df03f57c8f8057fb7425146a9c59a8b6ab15687010712f78d0d247ed4"}},{"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":"upstream/actions/actions/setup-node/src/distributions/installer-factory.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc276494677309ced0dd1a8d0eb845d2cb029b0fad868e0a27b42d931e99a3fa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/wasm_eh_roots.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade049c9f92897ef9dfeaeb2299184ccb329f928d2696ba66c236e9c9f95bfea"}},{"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":"upstream/actions/actions/configure-pages/src/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17084c0d1481e46f6224da2a332ac3944c60d945d078b998d04b39fdf32c485e"}},{"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":"upstream/actions/actions/upload-artifact/src/shared/upload-artifact.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"702232e8d3f06e1df545edfa524d6f8d88ecc83c18d50fd48c27538a1dcc479a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/p1/node_http.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ce49c24120e8927c6689d58443e28fb1a9252199cc2fef544df8f2e0c39713"}},{"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":"upstream/actions/actions/cache/src/constants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b8de81c8fc556c55a574991eb2e21ba5d26b690d51b633d71fdfbeb653c8d2"}},{"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":"upstream/actions/actions/upload-artifact/src/upload/constants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c529934ec0e1da2141b99a1e96c3cdc73f720f640b1e5fe6e9bbc22064f61a3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/p9_thread_agent_async_refused.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e8a661e4e28b5e486c216821ffe44cfd636eb4408c45ccf1e88e9a7fcf2f1b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_smoke/classes.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06084e9378e5b8b1da4009bca407af94686f6c4cc5467750549a8754fbf10899"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/_helpers/p9_message_fanin_worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5937c6ced88c561fa471097fc89ce8c272078380a56a9fb9352db465014f127"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/_helpers/p9_servers.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b5b2b15de857a0a243746d11a76f757806231870207e04c5877f6a4d40d815"}},{"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":"upstream/actions/actions/configure-pages/src/context.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbdd5bc02da2d42862a5e7510569f4df0063ef7df0c70b97b0fe1d2d0db8198"}},{"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":"upstream/actions/astral-sh/setup-uv/src/download/checksum/update-known-checksums.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ec93556c53bf8d58cc9775194c7ada78eab73488a93d8ed973a5f7b537fdd6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/gc_edges.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2af2177ee8f98ced521cc1bc2258417cb577acb2aab6a663fcf5b9ef3facf6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/process_id.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b764a6cd369f29b9929eefbdd351e046ed55a13858617fa793b39c085cb646"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/tcp_timers_gc.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6022017422b11cdb7de3dba65b5c0a2a0eb6ebf6f1331a8e225548196d1a5a9"}},{"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":"upstream/actions/astral-sh/setup-uv/src/version/uv-lock-file.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc809cbc9dd0f063070851e52d7ff8fc7e455f34ac0466e3c0fb725c485d079"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/closure_call_in_loop.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5cfeb24e74c6d96002b59ebc6d42be41dbe58b55b7446fb5bcf18a71881dd9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/p1/stdin_busy_loop.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b460c2c6c068f1f811598da37da2c5a18056b236e7cf87934dd3e721f309f6c2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/tcp_reconnect.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff23f62ffbec21bb9d8f03751ab8178f98e9cf715df5f8c012dd53293507efa"}},{"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":"upstream/actions/actions/download-artifact/src/constants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4b49c67a6daff5255b22dc3ab2c48e4dbc536e7289a50c695da1fcab0d52c1"}},{"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":"upstream/actions/astral-sh/setup-uv/src/download/checksum/known-version.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7482f6f75854b9918fb27fbf910a763aaa97e2ecd40d338b1a354af1eddea783"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_smoke/closures.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eee7972e232b72a862f48cd89b7abf792f0603d62a916a2309adf462e7a7a45"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_smoke/iterators.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdc56a34acc53bf5a545d6ebce31e4e10606fced3aecfbdc431f0c32113bd72"}},{"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":"upstream/actions/astral-sh/setup-uv/src/utils/logging.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e5280f61549b6be63acbe887b8537d62722770ebba85058c20328aa0615986"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/p1/net_unsupported.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a3b02a5c3f6e8dda91160da4a421206b416b0fa3e71e57e1b205dba2f52c48"}},{"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":"upstream/actions/astral-sh/setup-uv/src/utils/fetch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7441bec4507d63460f4b1b2e68c6402f4306f745d79c6c2a858eb554de4376"}},{"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":"upstream/actions/ilammy/msvc-dev-cmd/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c738ec0801126ed951b200f1253c168dcb83b52b0092271530714258b271a336"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/child_process.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3183fccb067abf6e786c92cd2f4870fe12d559165932ab125e41fb117ef6946"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/p1/node_zlib.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"964f8b8d5b24db5a0f1758f8494ddab8430a201a380d519ee87f1143d8a43449"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/p1/node_zlib_abandoned.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f170d327e4874f37b0112b7b0cc0a9c9c5171ccb673defc9a6fd1746a2cfef"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/array_some_callback_arity.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d71d143f18d9db6be6d0118bfccaa1076a87cecd45f06a9fbdd2a28e48c35c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/static_layouts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2939ca6ed39ecf34ed14e2c9eec3e85f17a6b29e1fc159224be93a3a282a2e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/string_literal_images.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5225db107ed229907f207c3bac612b37b3ca0ab2d2a25a9dc986ec74a8920fcd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/thread_fallback.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"017f018cd7a6e9fc1763302c16090b2606280f6a294a06fa8ca8605a4b418851"}},{"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":"upstream/actions/oven-sh/setup-bun/src/cache-save.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a189e5f961c0d7bb7b582ac396ec458f0299aea0eee1bd767155da0d31278d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/image_seeds.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c100e1c95b563c5ccd28d4ce67616b633f04393341ca79a1c898941915e3e064"}},{"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":"upstream/actions/actions/setup-node/src/constants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ee49f9236df348e8160804752c7a8dc326250d821cbb9aa7945588a763d88d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check/action-pins-are-current.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa881ce63c455d2900f829af806b75ce1af8d8a15540453666d68983e8726a6d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/p1/gc.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3db1e03f107c17922fc7749ff7d89f63ce1283ae212ec8a63a05ac901cc2a30"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/p1/node_modules_default.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"981264563f3056b09dd73b7e1a98ebec57267a342b93f105b53e600204687763"}},{"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":"upstream/actions/actions/setup-node/src/distributions/nightly/nightly_builds.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7b1f911c8ba073d2d5e33ce4b34329ead18175724325a213a001c9b64c18ba"}},{"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":"upstream/actions/actions/setup-node/src/distributions/v8-canary/canary_builds.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4749e2fe2944bbaf9487879c54102dfa2cbba8d6fff6964118713bfb1af59d8c"}},{"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":"upstream/actions/actions/setup-node/src/distributions/rc/rc_builds.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09422d7153b061b4ec1faf41371ff425428fef732b9765e5202d62cc9c0d4e9"}},{"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":"upstream/actions/astral-sh/setup-uv/src/utils/constants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e1b38abf913080d647393628a967f97b23eb0eecabd9703238e984f7afa9f3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check/dependency-soak-is-current.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34687a0e7a454f92a23b67ff95f7ba9c2c8adb604f618d561f8fc0128a41953"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check/external-tools-are-valid.mts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"635de8adb3e8ca5ececdd2f232afe5ee0ee451d0e7e1b45c77b3b2ab04408284"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/p1/node_crypto.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb24cfe8509fc6f82d45650db8c67151ff56db6554672832a1092d4fd91bf3b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/imported_static_width.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59bb381b27a3663342c290bc487c56adbe105a999798cf499b8c2bd6ffa72b7e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_smoke/collections.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72e9305db2f98e6abfa4f6346a4dbf4e9be879da6e7d01fec320f44da31d59d"}},{"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":"upstream/actions/actions/upload-artifact/src/merge/constants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a7abbb13ae7a5bbdc35f64bdb102c1d096458806d6965491fa321b6c730e96"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/fs_std_descriptors.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4376015c91b9ac607663c1346ff8e7ae99f9bbfbba374da34ced917ffd7a7434"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/p1/features.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c08d3d888e1ccb2a09cbcacc70ed7844e20aae0f5aee18e5f45e4e5978e9bf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/p1/node_tls.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2d305b11e37b59ae355b09e3d9f95b94d2d9fe509a9c38d76ff47027a7adc7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/p1/stdin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcdec459e9854fcd1efb903c98a545fe1dcb150931d4c2aa23001b8365e1e38"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/process_id_gc.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fca48761e1c061b4ae3b38f0df426ed96afd6eea562e72c6a311383e26671a7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_smoke/values.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb11700318fe69292e2fabfc20176609c7dc183f6de6e1eee11e48963835bdd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/gc.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc51d0e77c8a1b65d1e2bfea5369f053a3db160522371bfa4c1cea3d7285c63d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/_helpers/static_width_lib.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f0d4a2cf42e84a1a391adbd6fc56da612d6a746966f29157cd600bc35c387c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/bytes.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0076ee914812ef1c910574d7d1326f10f9caa0b07815dc71c1752e3c6e3dc8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/exceptions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac611ac6dedaaef5f350d69cfac9090affa7c6edf78d047e4287de9f241aa2a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/filesystem_denied.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21243b663a4132dda3cd0cda6c17790e1c6f128546db3cbc8475fe1f4b3c16ab"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/tagged_values.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"983e5b0a5fc49a580fbdee71b0196c5e0ca1cedbe7a4dcc1e69ca3cb43863af3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/_helpers/wasm_eh_imported.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4666e8d90dc01ab159d3f572965ef1f9d166eedb4fa6732557c089c2406304f6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/p1/filesystem.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21a5d7f06ebccc63ebd0f66eb4b0c65c38aee9b176153e1d5d5191cedfe4291"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/tcp_denied.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"053f7eeb0614a7f3c430701a822ef3767d4cd528db38e2603c7a3e50c81e0949"}},{"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":"upstream/actions/actions/upload-artifact/src/merge/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0df82620927ed30da7f07f980723e46149b0b5705aecc5753f40cb41ff0a52"}},{"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":"upstream/actions/actions/upload-artifact/src/upload/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22ab00323cb4dd8400743e9675ef3abc6491c1585745132b505c492801fbb36"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/dns.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b55e6f4624522898f5ee3bdcb922425f00f65d8b67ffeabf45410fbdd09908"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/wasm_eh_imported.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfd36727d7114594fd4c24fc5d545b1f576c518767214dc6ff5fecce04d8c01"}},{"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":"upstream/actions/actions/checkout/src/regexp-helper.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae6ab2156f8fece02314bff8810e596cec9d1db02bf1bacfb9deba53ae3b809"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/date.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e60e5dea27096c86ead40526dbadc436092b555c9fba62d32dadee2ca28774b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/filesystem.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1043bf1925449fda0647cd6171dbaad18504bbbfd8f18a1d1e96777e1f3cab7a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/threads.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"550c2b70f5516de001f52814094efbf756309f2e49039b58df9613d134dd1d34"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/_helpers/cross_module_method_wrapper.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c81e6875a14c6e0f02af98facd349b4c83fcf95a9f33f1caa7d1dcc601000d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/timer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af667158a55377ea05b6add443b83c75e31a4ea9b6dafda64561a33b83c9d2b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_smoke/exit_code.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4097c9655031fecdd8004fc4052963a0f27d3ec0b9e798f0e8d7cd0295082e59"}},{"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":"upstream/actions/actions/cache/src/restore.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e25a097f10428a092591590f681a9273affd769bb5fbe42d6dc9483f31d719"}},{"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":"upstream/actions/actions/cache/src/restoreOnly.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd53e96e2bd782bf8ccd280151dfad682997a5aed6cedbd056400cd2482f545b"}},{"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":"upstream/actions/actions/cache/src/save.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ed87167ed8683e7b2d34f0911133da4a3880d12aedb30613be8d1d3fea0715"}},{"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":"upstream/actions/actions/cache/src/saveOnly.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a55deea280d8f297a170566521fbc88c7747921590c5b9631e507f09555637"}},{"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":"upstream/actions/actions/configure-pages/src/blank-configurations/next.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d670a64759cd1c29a51351ff7452376d6af411fc5ea6440f15249c87f1a512"}},{"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":"upstream/actions/actions/setup-node/src/setup-node.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24af71ab67bf3fd82d82a5c783c7265fed4e0c63bb8d374508ca64747910576"}},{"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":"upstream/actions/astral-sh/setup-uv/src/download/checksum/known-checksums.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37539b3a34e3af0567216cb67e8ca4990b19702f528fe9231a3eaa9d925a4a5c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/cjs_module_layout.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f8d7d2322e4c179ed8b01c269d972910c0036fcc1cd9356490c144d7d246ee"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fad311bc0e55ec46655e7f679cb98fc92e10f2ca7a938cb88eccda93e81517"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/cross_module_method_wrapper.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e83aa861331a60b469622ba8f4d9787acc71e570f8c97ed43248214eb06985"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/p1/hello.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a9b28d61d77dd71e011ba703ed95456c042c66fcba1df1a0c905b31085ea50"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/_helpers/cjs_module_layout.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"650afafa1f2100eb45fc746eaf7ad6e4e6b8d5a90d65bfe461aba37440ad6b0b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/_helpers/image_seed_peer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"690d1e87383a8264cde1f922d4d9fcbda4a09c18829a75ba860a2fe93cabae0d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027formatColor\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/perry-styling/src/color.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04b570aeb01d428859c88c097479b7d99fc382c894d6670ccfefd8927b1b866"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DEFAULT_DIST_TAG\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/constants.mts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6395f9748761d4f5f1eac8be14feae44248af5a42f57f7af7419e322141387c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027APT_REPO\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/constants.mts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b542052dd726b7b59895fb460e4c8084b68ee59cbacd47a9601fdfb8e0bf0148"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027HOMEBREW_FORMULA\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/constants.mts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a9173edfbad18687f5a5d2e7ff8d052b71c4f948d1f362f8461855ffe7d1a8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ensureTagAndRelease\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/release.mts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb99589b09e97d23166cb8a391d306f097d14f5e9c59502bf697c7331f12215"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027logApproveHandoff\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/shared.mts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b045595c5fffaeaab756c73c7c4f82fdd26c6845ad9991ebb814bc735d419bf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027runInheritTee\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/shared.mts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"71de0d35980ad0d9ef6c257868cec3d44bc0671610d350c76f5f14518a8405e0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027NON_INTERACTIVE_RENDER_ENV\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/shared.mts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcaa1383c62e71bdcdea7395f5ff1771bea95611de1cbe8f25994d4faf0900c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027runInheritTty\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/shared.mts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4249c03fd31a03d631df09661d1c24800e9fe7202b1d07ef937590abb512ae"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027checkNpmFloor\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/shared.mts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"da34471e6a6f1d302b60f6bbb684368f0361cce0db9b1146ceb7d7b6466fb920"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027gitShortSha\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/shared.mts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2c95557225414291e4049a0cd3d13488222d1a3b0c585e9ad8660c8cfea591"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027provenanceAllowed\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/shared.mts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"8492ffd82dc568b8a933063e631afd84094923de294456679b4b2c72cbe67801"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isknownVersion\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/download/checksum/checksum.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f0c8419cb799d7876c1e9dd6005ce9033782033e15d2c24f623fce8668a49e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MANIFEST_FETCH_ATTEMPTS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/download/manifest.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e7d3e7cbfa905c046b92d36ecfb6cb6845c3aa14e38a6167e0383c3a6b3ccd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027clearManifestCache\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/download/manifest.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e6c0627510e78a647fb9d70e4c94936dafbdae20ddbfc109187fbc681408d9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027error\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/utils/logging.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad9bfc827e6c82735b5c0a1072fd18e1a913b01c6813f7be0d994a8f529514c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getUvVersionFromFile\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/version/file-parser.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c6a752eb9997392d3bbb8700b01afa3f6536ec61f53c08f74607db7008a202"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getUvVersionFromRequirementsFile\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/version/requirements-file.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"530a0cd7e2074e6b50f1d5b8245a374806e11fe1da87794d7e6eb98ca828cea7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027hasFlag\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":"packages/perry-styling/src/cli.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b4e1dbced9dfce8889477b4503f049e4b4233fca154e17b0f91f79f4975773"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027outerValue\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":"test-files/fixtures/cjs-eval-with.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1243af61a94f3ff627ab214cfa562c01c93e2f11af16ad61a5faaa834e03a4a0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RequestMethod\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":"test-files/test_decorators_nest_common_canary.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5acb83840637c3b91cf37c15dbeaf4ca555b3176f08ed4941eebf8c668f5787"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#i\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-files/test_gap_11142_class_self_binding_static_factory.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6679bfdf05d97561f03bb7e47392d464f5222f284e199ea7d83f0c0a34d721c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#f\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-files/test_gap_11791_private_error_texts.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6595ceff42a3e7a87dd570a9d2a00b0073709ae90ca6958e0a7797a37a23d831"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027#mm\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-files/test_gap_11791_private_error_texts.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"141f644de670fcb3316ceb4c016666c30b5c43319af930d6ba69b20077b7896e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#label\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-files/test_gap_11791_private_transfer.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee6d10c17f4f73a8d2dd176a272e222eedb2961a2034b3103d5b573dfcaeb8e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027attempt\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":"test-files/test_gap_native_module_misc_modules.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57cf16a96f5b8b06474a2fc2ce67ba18407554060773a659d37c962eeb795c7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027URLSearchParams\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":"test-files/test_gap_new_globalthis_shadowed_10359.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63a5efa702e1d893646e0d77e75a3dbdb4bab354075b2f1e4b1242c7193a5f9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Gadget\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":"test-files/test_gap_new_globalthis_shadowed_10359.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"be758edaf2ccd37aab3e3d5b063b6c37d34ba289269f549bc93f74842af96d60"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#hidden\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-files/test_gap_own_names_clone_snapshot.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c52b8b6c65339eebc3766a81663783d1bef26d3743f9e20a6ba6eb017aeb879"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#hidden\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-files/test_gap_shape_driven_structured_clone.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe38b5854c623a31a9697fc5786c478f162a23f53f816da24fd2f7778a92f3f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027str\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":"test-files/test_gap_stale_array_format_json.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd6f0fecc8b1904c4741654b41fe837086a1cd5e10ea2224dd163d347df3835"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027wide\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":"test-files/test_gap_stale_array_format_json.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a638229f06fcebd937fccc2566a7bfd05e807cf5ffb4c0d187393214143d6ad9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027obj\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":"test-files/test_gap_stale_array_format_json.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed796f23fd8b1921b173b6a1686a5226ad46fc5d3eb647ae8690f2ee442bcb4f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027pair\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":"test-files/test_gap_stale_array_format_json.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef71d2ea5a97fa5893c472947905bc80550298e64c5204a7935b6c9ed9d948c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027code\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":"test-files/test_gap_stale_array_format_json.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1d170100f7faf01875550d7f3695f4aa8d18058e70b33f76e2ce5ae4432702"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027byte\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":"test-files/test_gap_stale_array_format_json.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"8125a2e87775685a076dc60c1f9e86ecac2be1e3e4c3aa1fa11653e35b251303"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027wide\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":"test-files/test_gap_stale_array_inspect.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e082e0983375aad83399c65f85e3ee59763c9fe00897d3c49a332f53672bff"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027obj\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":"test-files/test_gap_stale_array_inspect.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"2318fd9f32d47c3d25f96f4dca72b42522a20801692eff92d47dfd6cfa0ec84c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027pair\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":"test-files/test_gap_stale_array_inspect.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd97c66446b082602ac79ef65f03b69ddbed411d2d0a0ae87bf8e4f5c1ddc8b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027code\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":"test-files/test_gap_stale_array_inspect.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a58adb6657dd4e263b8ea43c69c959da06107a7433d5f6134514b98ed7dd75"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027byte\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":"test-files/test_gap_stale_array_inspect.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2024225414cfaf464cc49adbd061d54cb6664df4aed3b50011e04d38f5dd7ab5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027num\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":"test-files/test_gap_stale_array_spawnsync.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d2a3d088189c2e6c8d21337ebc235a126851a110a0860e2e338354d762b3de"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027obj\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":"test-files/test_gap_stale_array_spawnsync.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51a3336e7ddf6488fca975ad53796c789a58cd630e975a9f16a733881a5b426"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027commandBuffer\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-files/test_issue_350_round2_set_class_id_collision.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b7c523c98c8a40945d538c07b2ace51d56ca4c418da8c334d5ca9d35704aac"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_Unused\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":"test-files/test_parity_684_type_only_namespace_collision.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8fe351cf95b8fbbd4c45eb20e5e1ad730b9573fdfc241e2b5526b1327011c9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027S2\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/test_array_index_loop.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbdd27c90c9f20dcbc4098b67024920c5fd151e96cf7d7e134d4445fcbd5f99"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027S5\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/test_array_index_loop.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a8dde23dcd2af1898f612063bc25d7d954d511dabc448a34dabe99295e7aca"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027D0\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/test_array_index_loop.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed0d60fe3fffaf7b6db0a2c93b44022d2db3ec36a1ad40374c4630a8bd546e8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027D1\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/test_array_index_loop.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6752095ff3636491d424271ab8c710dc03555f536e1a92c259f681be346a587"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027S7\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/test_array_index_loop.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e928695b6e670246907b543a6d20d57d54b6a665078d75263f4c78ece92b7c63"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027fn0\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/test_array_index_loop.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"5018f1a806d9aa99d1b266957b13e3167ef81e384830e8ff3905c1aea5db8292"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027fn1\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/test_array_index_loop.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"8153669f3a53e4761591bfb0fa40ac3900f93e987e7d61123e87d013b061bd34"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027fn2\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/test_array_index_loop.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"47dc4c3ea1b5f516be201fbdaed961acd79dbc876ea845ce5958e1b24054682b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027fn4\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/test_array_index_loop.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"376120ce81078ace6bc7641d8882b20bcdd8b44644415bbac31db9732a8bf522"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027fn5\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/test_array_index_loop.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e57ed99f587048daa0c7aa3f9fd8d89117b179327116738ee1ef4bf3eb688ec"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027fn8\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/test_array_index_loop.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39658a403550269064561080960d33cb03f3a7d0c2dadb2f3c4b58fc087cefe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027fn9\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/test_array_index_loop.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31c7b04f4c57d2d80cbc1300b2233d7fedc487daa12cf86d2f3cb47affe4611"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027fn12\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/test_array_index_loop.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d41e129a8546da787bd6b75cedef3af9fef71556adebd5e40fd0c4979243ad"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027fn13\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/test_array_index_loop.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b403549689b92bfcea74dde5d74a446d68fbb08e3d1e20090f28b95d9a7baf"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027better-sqlite3\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-files/test_better_sqlite3_raw.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"044f8f324c788b345bb8686cfaabff0afbc8c09f16fe416e9efbfc0f8d360afd"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027drizzle-orm\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-files/test_issue_9330_drizzle_mysql2_transaction.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c1cdbe5065648777ebacccd52ddc46e63b7d99264677729d1c3779614f2a26"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027effect\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-files/test_effect_pipe_map.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"af75b4faf0edcafc212b0bbabdc50a74db0d4c4bc2ad49115c818e923d1b0e7d"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027hono\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-files/test_hono_bundle.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6407fa9b5366eb8aa41610130e9c54a0d6cfca04dac8f7964b911821ba96ad"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027lru-cache\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-files/test_parity_lru_cache.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4bc9ccf595cec42d182030af596a2c41daa6a0b9a45f2d4ba1f5f1715dc3de"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027minimatch\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/actions/download-artifact/src/download-artifact.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae4ff7b3026fdd0a296118131a06d9e7319550a40dae38423c6953bfb916c0c"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027reflect-metadata\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-files/test_decorators_builtin_metadata_9501.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"473bd19f54d9e514ca7ed2f063778e6a37459f9f193270cf75d3aefe646abd9a"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027semver\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/actions/setup-node/src/distributions/base-distribution-prerelease.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"923ef4146df72f748def18b1c070cd37d1aac20fb526777bc82d468ba119c106"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027ws\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-files/_helpers/gap_11044_ws_reexport/ws_facade.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3439badcd7eac825f577bdf07f8de3003156e58f9ea7d1fd2fae125d291c4056"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027run-local-ci\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":"477d0c3b311e57f126351f30ad6c927c161c103ffa062527e7e38c55322af4d6"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027slugify\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":"d9eeeb17b507242357967b2b319fa95bf1973d0eecdc8c5dddf97d69da52a734"}},{"ruleId":"S1","level":"error","message":{"text":"TLS certificate validation disabled: a rustls \u0060ServerCertVerifier\u0060 that accepts every certificate (\u0060NoVerify\u0060) is set on a TLS client, so every peer certificate is accepted \u2014 including one an attacker presents. Chain, expiry, revocation and hostname are all skipped, so an attacker on the network path can present any certificate and read or rewrite the traffic \u2014 the connection is encrypted to the attacker, not to the intended host. Remove the override so the TLS stack verifies the peer \u2014 reqwest, native-tls, rustls and openssl\u0027s \u0060SslConnector\u0060 all check the chain and hostname when nothing is set. If the server presents a self-signed or privately-issued certificate, trust THAT issuer rather than every certificate: \u0060reqwest::ClientBuilder::add_root_certificate(Certificate::from_pem(\u2026))\u0060, a rustls \u0060RootCertStore\u0060 holding its CA, or \u0060SslConnectorBuilder::set_ca_file\u0060, which keeps the chain and hostname checks on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-net/src/tls.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11059502c8b3cdf072cf54b98438c6913ad9150ba0be475dce161a9190c8380"}},{"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/perry-container-compose/src/compose.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f96c6534b9ea63dbb41ff4c2a3a19315e4b090285bd689462181d22f5b36bf"}},{"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/perry-container-compose/src/service.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"704508b0328182f3e09c43041275c89def2462cc288b59632aa1990515cfa16a"}},{"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/perry-container-compose/src/service.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c5c07a91431cb9f5f9c2e3bcc9b3aaa9e843eed108ec371d74242e842e55f4"}},{"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/perry-container-compose/src/testing/mock_backend.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"002e092cd5bacf57f7c5bb816062dd2aad718ac0cd40f8693cb8bdb2bfce13bd"}},{"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/perry-http-client/src/ws/frame.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"253037d140ae49ca6be814e20e2e11d18ff2097a834f54c312d6273f9e6b5a7e"}},{"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/perry-stdlib/src/crypto/certificate.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b11db5b4a4ae3208d7a25de98ec26442fc9ca5c262589e33d531a09e980629"}},{"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/perry-stdlib/src/crypto/hash.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88593b12f4d984df298397ad7bad6e57be4c6c6f39804a69f25874f14c4c801"}},{"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/perry-stdlib/src/crypto/hash_handles.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4e8c17fcdcb4102fcea9a5f5dbc8345c2f3a8a2bacb6b9b1ff2780d8ba41b1"}},{"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/perry-stdlib/src/crypto/hash_handles.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"c351a3230e80c7eb70415e598523d92d42fcb25e828b324a3d19df48bef5d925"}},{"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/perry-stdlib/src/crypto/util.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34c84cd19d609f14259f3c3a35f4cb7b2fcb6e514ef80b6e83f668f26382e80"}},{"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/perry-stdlib/src/crypto/x509.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b1b00286ea8bb17baa80a100211bb5c3447565c1127b5012354d30e6b7cdd9"}},{"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/perry-stdlib/src/crypto/x509.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"78311b00f46a83b6e0d314161b11a26981fa6cf0ca9a6e459eed6e91d2e47d0e"}},{"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/perry-stdlib/src/webcrypto/util.rs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"1363e61549c8c1e34f819af50559dd84b6f3584b6d0b5ad0d4d55e9f64469327"}},{"ruleId":"S1","level":"warning","message":{"text":"Third-party script without Subresource Integrity: \u0060https://pa.skelpo.com/js/pa-R_kbATcyJ91THVHqtLpnN.js\u0060 is executed by this page with no Subresource Integrity. Whoever can answer that request \u2014 the CDN, anyone who compromises it, anyone on the network path \u2014 runs arbitrary script in this page\u0027s origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time \u2014 the executed bytes can change with nobody touching this repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/theme/head.hbs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b272a4fa4211ce1e7d75c1b6e7d821d4874a02aed2999e476d1cd991cd40a878"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!!input.commit \u0026\u0026 prShas.includes(input.commit.toLowerCase())\u0060 appears character-identically in 2 files \u2014 .github/actions/perry/actions/checkout/src/unsafe-pr-checkout-helper.ts, upstream/actions/actions/checkout/src/unsafe-pr-checkout-helper.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/actions/perry/actions/checkout/src/unsafe-pr-checkout-helper.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e7481ac23088ef23a91050e3c22ab8c5deb4781674c4a3cc82828c650a94ec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Array.isArray(pythons) || pythons.length !== 1 || typeof pythons[0]?.key !== \u0022string\u0022 || pythons[0].key === \u0022\u0022\u0060 appears character-identically in 2 files \u2014 .github/actions/perry/astral-sh/setup-uv/src/utils/python-runtime.ts, upstream/actions/astral-sh/setup-uv/src/utils/python-runtime.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/actions/perry/astral-sh/setup-uv/src/utils/python-runtime.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1303abe89f15cd1acb10db3be4eb7cd0ddbc4c0b8e4b002d05a7a3b165c800"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!fs.existsSync(filePath) || !filePath.endsWith(\u0022.toml\u0022)\u0060 appears character-identically in 2 files \u2014 .github/actions/perry/astral-sh/setup-uv/src/utils/config-file.ts, upstream/actions/astral-sh/setup-uv/src/utils/config-file.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/actions/perry/astral-sh/setup-uv/src/utils/config-file.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0704aa20ec7e722a42541edd0819e9daa4aae56e78e4e2da6577416fdeddab4b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!fsHelper.directoryExistsSync(path.join(repositoryPath, \u0027.git\u0027)) || repositoryUrl !== (await git.tryGetFetchUrl())\u0060 appears character-identically in 2 files \u2014 .github/actions/perry/actions/checkout/src/git-directory-helper.ts, upstream/actions/actions/checkout/src/git-directory-helper.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/actions/perry/actions/checkout/src/git-directory-helper.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cad76d0c60ea27e7e399f602a5fa9a320adc5b8ab276aa6a47163236f114527"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!inputs.archive \u0026\u0026 searchResult.filesToUpload.length \u003E 1\u0060 appears character-identically in 2 files \u2014 .github/actions/perry/actions/upload-artifact/src/upload/upload-artifact.ts, upstream/actions/actions/upload-artifact/src/upload/upload-artifact.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/actions/perry/actions/upload-artifact/src/upload/upload-artifact.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"134d05c5102f39f7b48eb3464f7226f117c89b70788dd6d5a54571ca73595b7d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isGitHubHost \u0026\u0026 !isGitHubEnterpriseCloudHost \u0026\u0026 !isLocalHost\u0060 appears character-identically in 6 files \u2014 .github/actions/perry/actions/cache/src/utils/actionUtils.ts, .github/actions/perry/actions/checkout/src/url-helper.ts, .github/actions/perry/actions/setup-node/src/cache-utils.ts, upstream/actions/actions/cache/src/utils/actionUtils.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/actions/perry/actions/cache/src/utils/actionUtils.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b513f45c2e344952195869eb85cb82a5b190439455a98ffb22ccefe929bc5c6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isValidIsoDate(published) || !isValidIsoDate(removable)\u0060 appears character-identically in 2 files \u2014 scripts/soak/external-tools.mts, scripts/soak/soak.mts. It is one line, so the duplication detector\u0027s token 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/soak/external-tools.mts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f61538159d13cc134d6abca70307b065bb98088e5621e3307eac969cb0aa7e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!options.customUrl \u0026\u0026 existsSync(bunPath)\u0060 appears character-identically in 2 files \u2014 .github/actions/perry/oven-sh/setup-bun/src/action.ts, upstream/actions/oven-sh/setup-bun/src/action.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/actions/perry/oven-sh/setup-bun/src/action.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afd07b47eeee1030d0b85d4c9033b0849d83822fa6d563506c0f63b7a3e81f2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!placeholderMatches || placeholderMatches.length !== 1\u0060 appears character-identically in 2 files \u2014 .github/actions/perry/Swatinem/rust-cache/src/config.ts, upstream/actions/Swatinem/rust-cache/src/config.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/actions/perry/Swatinem/rust-cache/src/config.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee97dc8a0d9bb98c62011cb9227b46162d80cc424f6a8b66a21e7f573114bfc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!repositoryMatchesPrHead \u0026\u0026 !refMatchesPullPattern \u0026\u0026 !commitMatchesPrHeadSha\u0060 appears character-identically in 2 files \u2014 .github/actions/perry/actions/checkout/src/unsafe-pr-checkout-helper.ts, upstream/actions/actions/checkout/src/unsafe-pr-checkout-helper.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/actions/perry/actions/checkout/src/unsafe-pr-checkout-helper.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc31ece0fcb29424fe8ca1231c9b9dd41cbcbbcd88fc7a0426b322097cb9c34f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!repositoryPath || !fsHelper.fileExistsSync(path.join(repositoryPath, \u0027.git\u0027, \u0027config\u0027))\u0060 appears character-identically in 2 files \u2014 .github/actions/perry/actions/checkout/src/git-source-provider.ts, upstream/actions/actions/checkout/src/git-source-provider.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/actions/perry/actions/checkout/src/git-source-provider.ts"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3b63eae4e24f4cc7d8a7a448aac22994a4746b34d7effea517a406776d334e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!scope \u0026\u0026 registryUrl.indexOf(\u0027npm.pkg.github.com\u0027) \u003E -1\u0060 appears character-identically in 2 files \u2014 .github/actions/perry/actions/setup-node/src/authutil.ts, upstream/actions/actions/setup-node/src/authutil.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/actions/perry/actions/setup-node/src/authutil.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b61a74df2e15dd7b862f1acd721581ed831deb83bcbbd24910addf50ea5624d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!segment.endsWith(\u0027 \u0027) \u0026\u0026 !segment.endsWith(\u0027\\n\u0027) \u0026\u0026 segment\u0060 appears character-identically in 2 files \u2014 .github/actions/perry/actions/checkout/src/misc/generate-docs.ts, upstream/actions/actions/checkout/src/misc/generate-docs.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/actions/perry/actions/checkout/src/misc/generate-docs.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"762cdaa7b26ab6c666ba46fc74674680e607ca04de80f14fdfb2d09a3752aad7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!this.deploymentInfo || this.deploymentInfo.pending !== true\u0060 appears character-identically in 2 files \u2014 .github/actions/perry/actions/deploy-pages/src/internal/deployment.js, upstream/actions/actions/deploy-pages/src/internal/deployment.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/actions/perry/actions/deploy-pages/src/internal/deployment.js"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d0f44f9ffa9ef3e96cbcb9babc0bcbf720ef07046d7abb80422ae4809f7265"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!version || /latest|canary|action/i.test(version)\u0060 appears character-identically in 2 files \u2014 .github/actions/perry/oven-sh/setup-bun/src/action.ts, upstream/actions/oven-sh/setup-bun/src/action.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/actions/perry/oven-sh/setup-bun/src/action.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b47208f212c3f97f267c1ca76665ca4359a39fcc889ef06bda9c3de9f5ac75"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(err as any)?.status === 404 \u0026\u0026 repo.toUpperCase().endsWith(\u0027.WIKI\u0027)\u0060 appears character-identically in 2 files \u2014 .github/actions/perry/actions/checkout/src/github-api-helper.ts, upstream/actions/actions/checkout/src/github-api-helper.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/actions/perry/actions/checkout/src/github-api-helper.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"859320d71a3ea3bc9c5e288c909614eb1afe2feb3ca8a595d6600f70a5be945c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(parsed.version !== 3 \u0026\u0026 parsed.version !== 4) || !(\u0022package\u0022 in parsed)\u0060 appears character-identically in 2 files \u2014 .github/actions/perry/Swatinem/rust-cache/src/config.ts, upstream/actions/Swatinem/rust-cache/src/config.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/actions/perry/Swatinem/rust-cache/src/config.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"640f8c627370f89e14fad16a56a5ae9809908063c1b8ad851a0b15d9dcf5eff5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060/^bun/.test(name) \u0026\u0026 entry.isDirectory()\u0060 appears character-identically in 2 files \u2014 .github/actions/perry/oven-sh/setup-bun/src/action.ts, upstream/actions/oven-sh/setup-bun/src/action.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/actions/perry/oven-sh/setup-bun/src/action.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de382e93fb959dcdad747ecfee532f12617213c411144ab0966e576c1220641"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isFinite(reportingIntervalInput) \u0026\u0026 reportingIntervalInput \u003E 0\u0060 appears character-identically in 2 files \u2014 .github/actions/perry/actions/deploy-pages/src/internal/deployment.js, upstream/actions/actions/deploy-pages/src/internal/deployment.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/actions/perry/actions/deploy-pages/src/internal/deployment.js"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"111cded363ac1a1e102226d52bcba1da39bd0e14881bd6cec7ab1b4ff5f9dbdb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060RefKey in process.env \u0026\u0026 Boolean(process.env[RefKey])\u0060 appears character-identically in 2 files \u2014 .github/actions/perry/actions/cache/src/utils/actionUtils.ts, upstream/actions/actions/cache/src/utils/actionUtils.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/actions/perry/actions/cache/src/utils/actionUtils.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9221d93bd5f4ffcd22fd97c6cf75ca0af5a0d2fa68ea804f1a99ab18ad60e2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060allowWrappingCall \u0026\u0026 defaultExport \u0026\u0026 defaultExport.declaration.type === \u0027CallExpression\u0027 \u0026\u0026 defaultExport.declaration.arguments.length \u003E 0 \u2026\u0060 appears character-identically in 2 files \u2014 .github/actions/perry/actions/configure-pages/src/config-parser.js, upstream/actions/actions/configure-pages/src/config-parser.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/actions/perry/actions/configure-pages/src/config-parser.js"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfb1d899b0f741937a7c2f84f8a974bb173cfc500d446c4213e6a7234cf2386"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060allowWrappingCall \u0026\u0026 defaultExport \u0026\u0026 defaultExport.declaration.type === \u0027CallExpression\u0027 \u0026\u0026 defaultExport.declaration.arguments.length \u003E 0 \u2026\u0060 appears character-identically in 2 files \u2014 .github/actions/perry/actions/configure-pages/src/config-parser.js, upstream/actions/actions/configure-pages/src/config-parser.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/actions/perry/actions/configure-pages/src/config-parser.js"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"73365591efe55d8d74826ced30ea92db95a771fdda68b1897e0bae3d60f0d50f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060allowWrappingCall \u0026\u0026 identifierInitialization \u0026\u0026 identifierInitialization.type === \u0027CallExpression\u0027 \u0026\u0026 identifierInitialization.arguments.le\u2026\u0060 appears character-identically in 2 files \u2014 .github/actions/perry/actions/configure-pages/src/config-parser.js, upstream/actions/actions/configure-pages/src/config-parser.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/actions/perry/actions/configure-pages/src/config-parser.js"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ca5973b316bbc3f922a0b1c5883054a3a7a9fbde7aca018074c5defeacffdf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060allowWrappingCall \u0026\u0026 moduleExport \u0026\u0026 moduleExport.expression.right.type === \u0027CallExpression\u0027 \u0026\u0026 moduleExport.expression.right.arguments.leng\u2026\u0060 appears character-identically in 2 files \u2014 .github/actions/perry/actions/configure-pages/src/config-parser.js, upstream/actions/actions/configure-pages/src/config-parser.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/actions/perry/actions/configure-pages/src/config-parser.js"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fde27395fccad0466a4a413625bad2da0285bad1df77ca00e4125b794b65067"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060allowWrappingCall \u0026\u0026 moduleExport \u0026\u0026 moduleExport.expression.right.type === \u0027CallExpression\u0027 \u0026\u0026 moduleExport.expression.right.arguments.leng\u2026\u0060 appears character-identically in 2 files \u2014 .github/actions/perry/actions/configure-pages/src/config-parser.js, upstream/actions/actions/configure-pages/src/config-parser.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/actions/perry/actions/configure-pages/src/config-parser.js"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"766dceacb619de9f59852de346422c401750e074cd76db5f82760206206e5ee3"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 6/13 async functions that make a cancellable request (fetch, axios, ky, ofetch) 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: resolveRelease: \u0060resolveRelease\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":"upstream/actions/jdx/mr-boxington-action/src/index.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6c14098c4a6518912ce2a3f89aad5c9b8815ed1911b202a1ce19bb79f82449"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchManifestResponse: \u0060fetchManifestResponse\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":"upstream/actions/astral-sh/setup-uv/src/download/manifest.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"1642a85f0a0c29a69ac6a13202841c358a9e83f350735d8ed3436f01c391605b"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: primary: \u0060primary\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":"scripts/turnloop/apps/p9_thread_agent.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"737562541a98f43d229a06cb865e6d3a4134f276ad00bb9e0bfa27300548a701"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: doFetch: \u0060doFetch\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":"scripts/turnloop/apps/p9_worker_agent_acceptance.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e3ff09b4ea3a12954c2b379ecd130fc7e50a69f857e2ed18bcc1f8f48e8f21"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: doFetch: \u0060doFetch\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":"scripts/turnloop/apps/_helpers/p9_worker_acceptance_worker.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"bedcf715d144e113bd36f613f8aade06844c061d429690f64368a5e67ae6bf2b"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: checkForUpdate: \u0060checkForUpdate\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":"packages/perry-updater/src/index.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4af17f01e8442e098a73311b481ced15209f8ffa47d21ecea9185311382bcf"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: downloadAndVerify: \u0060downloadAndVerify\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":"packages/perry-updater/src/index.ts"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffb31ebe8df215437f7961f6cb8a3a51a96246edc642faf2f27e5a35881d651"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060svg\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc719b109b0805fc4c7f1a0cb4c96a874a024eac684c2f3452e5056523af032"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060item.title\u0060 is text this program did not author, and it is written into the text of an element through \u0060innerHTML\u0060 with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2d364ed1acca8e75994d93182008f0c88b13e00173e8266675ed564c9f7ef8"}},{"ruleId":"X28","level":"warning","message":{"text":"Index access outside its own emptiness guard: This condition tests \u0060fields\u0060 for emptiness and then indexes it on a branch that test does not reach. \u0060fields[2]\u0060 is evaluated whenever the guarded half is false \u2014 which includes the case the guard exists to anticipate, \u0060fields\u0060 being empty \u2014 so an empty \u0060fields\u0060 indexes position 2 of nothing and throws. This same condition already shows the intended bracketing: \u0060fields[4]\u0060 sits INSIDE the guard. Either the guard is load-bearing, in which case this access escapes it and crashes, or \u0060fields\u0060 cannot be empty here, in which case the guard beside it is dead code \u2014 the condition is wrong under both readings. Move the parenthesis so the emptiness test brackets every access to \u0060fields\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/measure_linux_rss_ab.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb116992cf0914d1363a9d4fdf4c76ea5ebf0eca504bcb4b1c5b6bbfd0ff829"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/jdx/mr-boxington-action/src/index.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df9528ed49676c071a566217a871691abaf627f114a6257c91e0259c9b46c2a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/jdx/mr-boxington-action/src/objects-cache.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3518a11518ef8a958c37d80b47d6af92ad281853ad346c0b79fc90e16bba6efb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/jdx/mr-boxington-action/src/objects-cache.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e796fbe853179c82c5725977a2e6d3594c5f4cc5b69b191874942d812f42d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/jdx/mr-boxington-action/src/objects-cache.ts"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"f506fcd7d2dae229f6a9735531d0f424d93d32e08f284773bc7875c8d13e4110"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/utils/platforms.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e8c6b7860d2b050598526751048fc39dd836421357a75144b8ae9ffe6596af"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/actions/checkout/src/git-source-provider.ts"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e15815764033f8990bb83881a411bf2e64af455c291ff91f7be70a006dbd4b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/Swatinem/rust-cache/src/cleanup.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3e2aa7a3b9fcba031ac1edb234505643ee06fc1d531666013ff5f72f0d6356"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/Swatinem/rust-cache/src/cleanup.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0a9c25c3660f4283ce5adb85002bcea4f37f5c754ba03047694d75e8ba2732"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/Swatinem/rust-cache/src/cleanup.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94f744d28d2664cd73e59c52ce2f3b6e165e0167bcd314ef696028fd32c624f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/Swatinem/rust-cache/src/cleanup.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a097be512ab6ec99a50b3cd70cdae55f3a14ea1cd5d3416112ab0a819b4fee53"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/Swatinem/rust-cache/src/cleanup.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7385ea1553ba0487632b78de0b5cff54fdcc65f418c3555a008a7a77c16af1c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/Swatinem/rust-cache/src/cleanup.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4233ce75478e6f06ce0573b2a365824928ded481718210c862ec9a2d489241"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/Swatinem/rust-cache/src/cleanup.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"38755662832386bef52551684cdd1ae6a41a3a68fb648bca310b2ea55911513e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_e)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/Swatinem/rust-cache/src/config.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"7361ffab9e8af08eae6518769a1b3ad540148013b7a9e32bc87dae9fc5b6c997"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/Swatinem/rust-cache/src/config.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9561a8288ed6fa986a4a4cf0ab2f36bd511bfc7bc5dd9f1753c6afd2648a649"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/Swatinem/rust-cache/src/restore.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5330ae8a872f256635ea922fed41687d6c786ededb22efa015c0132682c6729"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/Swatinem/rust-cache/src/save.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"90abaa35ffe2a6e44037f112961c01a17de483d05abbff36d12298e466157960"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci_ext_link_scope.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3ecee1ff650912d4ec0b3b89454b2f831ca9da8facdf025a3fa4ce0becd06e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/node_suite_run.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f3a43ed12b687d5101217b5fd1471bcfb069f54cd59a594b8cce3fc131e07b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/node_suite_run.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcdcd4903f6c7536c3f433f845562c13f8721ac0191a811e9753cc33442d4cc0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/node_suite_run.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"3357ab8ef85376fcff4980fa89c697282aa4db8efa434bb53f11e0178124be84"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/package_bench.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ad27f3c7633b34da2174924941ef151c3218550f0150762df2ca5ed8ece6e2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/update-actions.mts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f7ce7f52aae1b437ff63ae047febe714a65b854574f1353d7661fc77f5b78e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/wasm_eh_managed.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc45824aecf59f3f1858129ffab80310c1fd48287cc4bb63fcdccea3871ae4be"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/wasm_eh_managed.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e95e78b85a785c10bb93495b292be51e8a19463c1533a06eb0eeeb29e1bf4c3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/wasm_eh_managed.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94e73f240634cb1d95d16f9ac27eee3b5f53bd940462b1a9762c33ff30f58ac"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/wasm_eh_managed.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"beea8a3b1daf305fd010cf295ce7b9203ebe96789bdcbb6f93d242476fbdc221"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/wasm_eh_managed.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c131c952f1b2169613ca6096d768ced1d23e2a4beda4624aedf61800187f57a2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wasi_acceptance/wasm_eh_roots.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"74014c313803f4d0e3e4f639eb855f4752a66131d2d41c99058735c0529f0dbc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/server_ab.py"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa5483f1f7d88c7753df129bd7becff0a29de68b419196d9dac377a2974b5a7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/db_thread_census.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"050d1e7e823ad703ac95eafc6976b7589d3a42720c31c900e5a54eb381c9444d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/p6_abort_midbody.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6483aadfd3793b58940aa47439482a985da641197f35671ded5f2c5e0170f9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/pg_thread_census.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48f3d7d6aa9738cae02a26e395c8f3485712a73b566293c5be4cd01d8de6075"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/pool_thread_census.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e96487ce177e17dd42a92c637c0ef6173b08c799b12ff0d1eecec3e7904fa3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/tokio_worker_agent_census.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c50d0ece0d0e908e1aa10bc4444394c4448648e79408be69d07db80705a013"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/turnloop/apps/_helpers/tokio_worker_agent_census_worker.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c5b78e79b6dbbcbb3d9b2ea06cd975e42233d65cac6b590b476efb0dc28861"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/nightly.mts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2fa0c4ad8fa051d9fcb372c2ecb90350fdf6dd5dcecdc9f73a6888ad596005"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/pipeline.mts"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa42135bd0ef7aa4fa87a1f62ce3c475ab422461327bb6f2a663838acd388a62"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/pipeline.mts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b892c02726c41aedd61492c752f2766b673f7b6c9d7f552ab1cc098e51feb4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/release.mts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6a99d43909cdbef09f17c89bdb1f772f55e358b4ad46f6bb1b42365f68e489"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/release.mts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e7cfebd2d2698bd7bc02bd3d73068e74f5fcfc89bdcc0029a7c5c95285f424"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/release.mts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"94855e14073ef5719d3f015fc160645e7d436870c33781ffe2ce6010c7e9b4d6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/platform-visibility.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5112efa7e0e1bc8128e2c0e9d16269c995a0d40f1fed7a08fa869fa57dfdb9d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/perry-threads/src/pool.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d943faa538f2d172ef64e0d49b1bca5cd1e2e0ecc07439470e3d0fb1811cece3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/perry-styling/src/cli.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"c667dbfcdca142f2b58000915ae7c665e049138831f6cb8a017de9c8195eb5ff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9d8600da3feb7f2775c6b2e218aed3cd47583c1cd61f86ee8127d0ccab7ef7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"522f90ac8054fba327e684bc0e39a5ae6580bcab5607721a77cc4fa9251cfeee"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"88367e2c4ee4fe7b17e6898cb97825ea1b69f05a47744c4a4883d0c0f49c09f2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5638a291f1efc581536aa49b1eff81061d21f5dc431956e7dae3cabd9e743b8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4e752b5989d0acce8e8b68b56a151763fe78e696108c497f85460bdb8bdeb8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":3461}}}],"partialFingerprints":{"codehealthFindingId/v1":"71defb4fa330be1c8f3d6c2dd41652a0da9f96c2d9184b288b26566267786704"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":3485}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84fc6db4747c7bc2dd7d034132307dfb80551b331219d92a4a414d555e244da"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":3486}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dac66660736a63df162eb1292865d316422a14c91f38c78dd6828647f038d00"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":3547}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd0d2a9976837522a10ccfa48ca45959770839dedb4714c980e738239bee93b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":3614}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21a43f8a3d3991da7721e0fd70b0f32a4e9a11d5036817fda5f50658671a22e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":3864}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1cb76f6cd48b7b9af64ca037bbdda882c01817811c7288b0ba265bb9d3214e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":3866}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5b141bbab876da9d42f922be45568626d8ab52b3f7fd6ca973ff55d95e30c4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":3977}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb42ee2ed32fac390b0cf569066209a29a238498817e92b984f4a4ba8de9df75"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4055}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d40d717ee1d15974b2e2be2177852b26a9f8663e55a0f7a5d829dc30edda337"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4069}}}],"partialFingerprints":{"codehealthFindingId/v1":"85dc6060dfc9e4236ff1233502cd59c561fd43d3a980fbe7c77838a306b7a25c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4150}}}],"partialFingerprints":{"codehealthFindingId/v1":"277a62f46af19af15a79db5a5669826465717834c77f761952a5bebe8bde1b30"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bde881dfa11e093be8a6aeaee2ab8f39189369dc9e28ab7530b1f2923235386"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4259}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbde7bac6472eb571770e20b36b845f3bd9aedbbb0b7dd70e65a297a91f0417"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4272}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6294e2ac9762433c596d908ac93c0ffe65b96ee208b48e07bbec354b5787b9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4278}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ba6b5140799ad01d224c3909b973c78f0aced5135b858537518b2c1dbacbcf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4382}}}],"partialFingerprints":{"codehealthFindingId/v1":"89786b4f5e9bd40be559a579e9c85edec5e1fd2bddee44496ec45218b43f4e30"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4452}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73fa34413bcc0d36d0b40621473a1131a97f8862c227fb1a61182364dde4244"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4455}}}],"partialFingerprints":{"codehealthFindingId/v1":"366752315066afbba3b863fa16faa7522ec47d42d5666e7467eb2c53c89ab0b2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4459}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4906f50b7d5060c2dc3dce770f574c3bfa35225b8d06ff5709ca29061cf4059"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4489}}}],"partialFingerprints":{"codehealthFindingId/v1":"10403552e6a81c49558d602274cf97ab4bdba92f903b03d1eb513458c27b3daa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4537}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c77975e2af5e608925bf88b2b9c402408f93772193adc6ed5372d73e858ce7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4549}}}],"partialFingerprints":{"codehealthFindingId/v1":"acab3774cc22fd72d9a8ec1d8b2439542360016c9e7e146ef6f753c08329cd80"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4585}}}],"partialFingerprints":{"codehealthFindingId/v1":"277c39bc35c41ce17f932cc8a5fb118548b708c95191124f4a241474da6c343a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4615}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd906faafcfe35f22cf8601ed5d5e76cff91b5356a5ba2e7473e8a5327eeb154"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-wasm/src/wasm_runtime.js"},"region":{"startLine":4648}}}],"partialFingerprints":{"codehealthFindingId/v1":"12af80ab071708a2b1b6c5c094634b97f7591cd5e3c180ec852016ef5f1a27fb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be2a6477596d6dd220eff06d27090b4eb8eb227d833e1bcc0403f6229a9e38f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"788872319fc2d7a0c1ca90cfcd62d72af5622e72395eda363c9580bc5de27ccf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(function(){})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ddd292ed99448d242d7f5dad9066d4baa8b2d646dd3c03417f552541ab7410f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0f6756fedb109b4821f40d486f28a5a6fbfd5d07bbca47835ae922ef3b77d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfacb5c7597c879a8148a8ee86e0542828cd01edcf96fa63531734ee50c7648e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":2015}}}],"partialFingerprints":{"codehealthFindingId/v1":"7619f9d5f352ff5400704f364b48ae367aaa82d083cfac2d0092dc728558f33a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":2022}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1914417297fd0a83af210b4c38b9de43adb55c6aadb1096c7ead3d5a3d89c77"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":2336}}}],"partialFingerprints":{"codehealthFindingId/v1":"3734d9940141f98d93a2cca6186d8c28d138020bbd2ded817c8d680449261994"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":2384}}}],"partialFingerprints":{"codehealthFindingId/v1":"475a485c0353b8ff4da76773d643ed1e7c8a12dc4b7e1afdbdb098ce60b95744"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":2416}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a9984ead162fac2862f97a4a2c7ab2cfef2cda091ba0f4bfb141c86d1c1033"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":2494}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7654357561da1bcc0ff09d6767a4efd6a85cdf7b146a72c8920a60e29ad387"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(function(){})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":2773}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b13a5ad7e670cc137e595d69f9c37e05e49e1c87a81b5928e52a829bdcc5b2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":3157}}}],"partialFingerprints":{"codehealthFindingId/v1":"be573b2c699feca244e0c3102d1d443fb103776ce0825bad76960ad6309a318a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":3262}}}],"partialFingerprints":{"codehealthFindingId/v1":"12647a628223655e6cec1aab0aa03a12549f79bc663361d918c46f7d23411ccf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":3339}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c5c8369029fd14de21ccbd379fbda7d62671ae17a90c32ad18479458272828"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":3466}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3938ad59933f992635d6035714ed2393f6cc23a2fe25a5a989cc87b8b50f1a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":3544}}}],"partialFingerprints":{"codehealthFindingId/v1":"095ed9a288ed9986c296024c90554d528a11fb3677012bbcd08025273f4dfb26"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":3558}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efb7e26f42ab2b6294d3aeec23a04deae56742d08b93759249e717295e13a77"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":3637}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a9dc793327551907eaef8ddb1b24e6052817e42b94e6f7cb46d06cb15b3038"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen-js/src/web_runtime.js"},"region":{"startLine":3638}}}],"partialFingerprints":{"codehealthFindingId/v1":"d834cd7faccca2e23e4aad661d74d882cf65ac90e313d667703d945fdb8e80b4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"196b5c919acc80b7713e4628d52e9b819c7781f96eb2693698172a7675373cff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d67171fb7c75efb21fff9d2f0a93d152c0ef500e4eacf244389d3ef05168cb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"f309e8a89c38fa3066252cc15ec0c201af7250d3149a72a6cb5b691629c54695"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"0522c4e078ba3af37325da510266fd0ecb509ead0deabc03c827b53914b03dfe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 69 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/save-cache.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e332960395323c2ce4cd54bc0e72711c6759dcaf6c4bd4bd293166b2d460df9c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 157 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/save-cache.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"4527cb2b3648acd7beac0d0400aadaa5f5224443f784520093f608eb03bcd66a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 161 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/save-cache.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d537600e6d34b8a72de46105c42ca453aa90d89bcc96e7da4f2e1bf9c8296ba"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 163 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/save-cache.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"3942f9c5cca6d9c783fa8bd2b7df7beb4530d51cc692197ef3ac5f33bd241815"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 101 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/setup-uv.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc145085f7dbc0c32b132c090eafdaf8d24d5f999ccfe8d5b67627b0b5d847ac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 146 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/setup-uv.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1406f22d155a15cebb69edd22c56816a9ece5c770b60f0c663330109a82894"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 177 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/setup-uv.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"12acb74af5f9fc5495c5d3ba1a3a52f317b21b578dd8706e3c3361590f491c9e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 184 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/setup-uv.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e5cf4a9132e459456d833fd43db23293f3e24ffe01fc3d6b40a33d616981a8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 186 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/setup-uv.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"6958b72d2cb3534b2af67ce9a4dc6ac0d4e173920487aa819a696089e435dd7a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 191 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/setup-uv.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6e4d700d100c2995585bf404cc1214935190ba9f6f74ccc8b116642385fe76"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 200 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/setup-uv.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadac06f3be912620980f64ab8215575f3d5d5d60e1012a6965566069ce043a1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 203 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/setup-uv.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75d9306eba656c728f5e08e6ff4cb36064fbece7ad93d944da86e77b595ce1b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 206 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/setup-uv.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7986783a36ba7983fea122c035f217a7c3fb4867880f468f007720e713de495"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 214 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/setup-uv.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee321a28f6395a927dc8e8b25b5ae869b9a898f342bd4a62875952c3720d9159"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 220 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/setup-uv.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"281160d13050875d8dc4e5e388cab5d44ffe730349fb3b4d2499a66c2442f038"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 225 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/setup-uv.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b9a7cd327a6c99277200c91d7146c84c127b9f46e9b22acde4d294aac4ad14"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 232 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/setup-uv.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c8034107694ed84bf5096caa25cd6abf93107cede01a0487c9b0ec571dd964"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 244 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/setup-uv.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"44953cf0a0910486016d7bc91e4d8f979976f8618183f6af7c15da8cc73bc1da"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 276 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/setup-uv.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"45712c56521cafbfb7d7a93c2d4a688d27d7e92e7cc931b3676cb4c3c648d071"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 27 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/update-known-checksums.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb81ad731fbf50007b165e1e407797185dafdc0d9c1b9df72ebf1dfb1004d7b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 71 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/version/file-parser.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9105783bfd8ee309b81734b60287d50efc55afae4a9bf11a746e9846ce9d855"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 74 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/version/file-parser.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"9412436f2874a66876369e69d6b0d23cad4dcc61a5a1ebcc8551083cfc58aadd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 90 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/version/file-parser.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc3e2894760884c254130a638a9f3a729db8a342bee4310a3768a76f0748ae9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 183 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/utils/inputs.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84a10d38e5889028c51744aa5dd29a9d337963f8900bc3ea4d5e5632a3a58b0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 259 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/utils/inputs.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed23a48894a8f6cef56719c82ed33beeb77580f8508368622f186805e5c87a0c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 296 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/utils/inputs.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ae8b17deeff93f7db92cfbfea70a16ec2c745693e9f9eaa30ea20e534d4107"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 310 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/utils/inputs.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39b2ea3fc0302eac5c926cbc0ca449278848f7775a35aa632bd136dadaf64a9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 132 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/download/download-version.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe40bc0f4341b79c39dcabb14ddc70f9f16df76ec35686d58336a81697356c7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 155 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/download/download-version.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a19bbd2cd84ac47cec851de25abf29035cc034cf3c00b304d97cfbf46ffbcf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 110 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/download/manifest.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac848587526a8e4fc544b0e1f332abfe21e01b0d5d2480b61cf9534b67253c8f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 172 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/download/manifest.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"aadfd3353b2f8b5675907eb4d1e5821965d1440a3acdd7095d4c5fd9d81b4d50"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 181 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/download/manifest.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d53c2d0f8bc4ea56849a9693a37ddf0a4c3d105adeac63d358d6a1f4eef45f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 59 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/cache/restore-cache.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"64182b60385b104efea354c6839bb37f93d8e11f861e463396acf26b3e546c07"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 81 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/cache/restore-cache.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"81712e2d544d7c59349bf4da589e27297ff4e660fba570e0ace2ce87f94c0a75"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 115 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/cache/restore-cache.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7777bc476ea88364c841216b81c7fab15c6db83106c7e20b3c96019dd41e32"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 121 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upstream/actions/astral-sh/setup-uv/src/cache/restore-cache.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71351b6ca103006e56e08c2504c8e2ff20ab0da1564462f74a3371cc4e4c991"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 48 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/nightly.mts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcba6f13876a89ccdee912ae13da696ab51acacbdadb9bc4f45dcd8762af0688"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 74 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/nightly.mts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dabd5273c7511c1778b78bcb1dfc57e124f404d10dd184ca5480c584f0940b0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 267 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.log({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.log(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/pipeline.mts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a914022a14f184120067c60841a05b84e24d30d5a9f8eb65d4203d13b15e5a7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 301 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.log({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.log(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/pipeline.mts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfeff53cec40c02e06a098aab15be7b7af213693e7519d86787ea389aa89a2a9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 429 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.log({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.log(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/pipeline.mts"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"a102f2b8d603d0ba6ecc0856af71e30100f40be7f0e724cf0e24a90016a3501f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 438 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.log({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.log(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/pipeline.mts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"e353080deeeb8cc31105c3449d6d23a032fd7e1f02007468874e5e7c175ab00c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 439 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.log({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.log(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/pipeline.mts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"f862015db0fc61d493291b14ebdee420f2f3fc7249ffb3cc02353207720b4f46"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 440 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.log({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.log(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/pipeline.mts"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfe92f09e871b24c2c7ed53a3d770e37bd4af9d2cd23e9d19725bfc8b59a776"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 441 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.log({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.log(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/pipeline.mts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cf8fa6b7aeed778aca8e9e8f93567a19a1d4b3d39447fc62c4ae203bbcf2b0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 442 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.log({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.log(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/pipeline.mts"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c3b08ec2619090a74df0ba47a83ac06abb3345f4bad083c5c900ed079d8b7e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 443 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.log({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.log(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/pipeline.mts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc8cac36038906410e8d7bdb06cda348cd8dc1e381f2ef02c98e84d9819519b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 444 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.log({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.log(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/pipeline.mts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb935c0855576006fee5eab6847d31ee06150d939a92c629abb0be4312f346a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 445 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.log({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.log(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/pipeline.mts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c015282a5be1f8a58b7ca6ecd42f75d30cf58dc5dd18c5d6fd7e46166db27a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 446 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.log({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.log(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/pipeline.mts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13f24423df7c8547491982d1faadc77ad24aba15887b23be1744a5fda99a295"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 89 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/release.mts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"773d7bc5f907c022363f78bc5a2c9945654bbe961c2e469a3e99599eabf3aa8c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 98 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/release.mts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b629ae129b3127814076541e1c390c7bfa2e7945f90586570e27becaad3429c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 203 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.log({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.log(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/release.mts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"768b63739be40507f911e66c95115272b1b5fe7992125257aaa13e8864cbcb34"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 251 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.log({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.log(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/release.mts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4b6223dbfec08234c2a67c03680b522ebbef350215eb03930f573c76b2ac45"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 270 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.log({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.log(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/release.mts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a17b8f4c42486e24c7762bd62978a6809ee4803334eea6f62e097de71ea3331"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 273 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.log({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.log(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/release.mts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"5542cc58cee474e138047b62e8326c7e1a8551a81c826d0c79a1cdf8db20f750"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 34 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.log({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.log(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/cargo/ffi-publish.mts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04bacadd14f263bbeb89a10b71339f610e8e92620e965898d4e67fad86aaba4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 51 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.log({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.log(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/cargo/ffi-publish.mts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7bf27afb0cb3757c785c6372c2325fc5392635110c6508049b26cfd5aafd07"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 55 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.log({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.log(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/brew/tap-publish.mts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5b832182197569b9976fc63fac9e982836f951a9c1f2f4d495d641d9c99f03"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 116 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.log({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.log(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/brew/tap-publish.mts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"45366836b755de91a948bdb478769b604ef2d6c4e4d74e969415f7c57a0a63c4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 129 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.log({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.log(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/brew/tap-publish.mts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3744b32ce1323480480010e8df46cf680d95ffbccf5e5541e153d527207c84"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 466 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wasi/src/filesystem.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5374cc49555fdfd643da4bf88903bb7493f95eb4ebfb112be41935b04c0cc8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 690 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wasi/src/p2/host/filesystem.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c66c5e57c4a2bb50de9ed5722a7173389f361887392a4b2f414bb56bc5cb8bd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 72 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wasi/src/p2/host/network.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb78bac85b7dec46f722f0c79682ad86a7ba14ca61a760515249027731a87aa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 134 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wasi/src/p2/host/network.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"594100d490095d50c31d4aba555930862b105f66c39c974e8ba183295e1577fe"}},{"ruleId":"X5","level":"note","message":{"text":"Strict null checking is not enabled everywhere the repository type-checks: 9/10 of this repository\u0027s type-checking configuration(s) turn on strict null checking (\u0060\u0022strict\u0022: true\u0060, or \u0060\u0022strictNullChecks\u0022: true\u0060). A configuration that states neither is counted as OFF, because off is tsc\u0027s own default; a solution-style one whose \u0060\u0022files\u0022\u0060 is empty and whose \u0060\u0022references\u0022\u0060 point at other projects is in neither number, because it checks no source itself. Where it is off, \u0060string\u0060 admits \u0060null\u0060 and \u0060undefined\u0060: passing a value that is null compiles silently and throws on the first property access."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8870f9ff7b17c2e14c5ba3bc13137b94673aad0b9498438c572dabb049852943"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) reduce the strict null checking score: ~1.8 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 45 assertion(s) across the 24700 source line(s) of the 243 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: scripts/soak/external-tools.mts (14), scripts/soak/soak.mts (10), scripts/soak/update-deps.mts (3). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 exists to produce."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"edb251d0f8dd1deb75ff6fa12d145c3d5c948a70b0aaf8da052107c857335979"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check_npm_publish_freshness.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"620cf62b647f2a361120073976d43f630a27e4c90f39e081c00ae976c2a92a46"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/package_bench.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"934507f00f4a36541b4855f5b55a6602346d74f616c1fd7d18ddf1ee9c549cd5"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/parity_normalize.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"50595ed8c2fae45c4ed47450858ba746fc15d40a4219f8df7f25eae04f6cc8c7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getDangerousPermissionsToRequest\u0060 swallows every exception into \u0060emptyList()\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. 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 in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryActivity.kt"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52275d7dbe4d0def78159cd2273a85cda3dd39e2fb286c508e12a89157b857e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060registerWatchListener\u0060 swallows every exception into \u00600L\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. 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 in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-android/template/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4f7bbfcb446990c86e35f986948859efe695db4a490b152be834caf44adf5c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getDangerousPermissionsToRequest\u0060 swallows every exception into \u0060emptyList()\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. 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 in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-build/app/src/main/java/com/perry/app/PerryActivity.kt"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c5184b69ad777085cd3f025beb7ee8bafc52a3ab04d2d92a598b12533955e8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060registerWatchListener\u0060 swallows every exception into \u00600L\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. 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 in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android-build/app/src/main/java/com/perry/app/PerryBridge.kt"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"893fabf73f261206a97786df8fbbbda7ba1b8a9bf3a9ce70741fba62475edd6e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060read_resolved_version\u0060 returns \u0060\u0027\u0027\u0060 when \u0060json.JSONDecodeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-compat/npm-sweep/run.py"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e7140e25b49fa97c5a7b3c2c103796eea1444efb57e8355b48f3bb0eadca2b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060bytes\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry/src/commands/compile/collect_modules/source_prep.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc60e5d47896a125e1acdbdebb19776da69d558237e7d62627135ecf350ac92f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060load\u0060 turns every \u0060Err\u0060 into \u0060Self::default()\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/perry/src/compat_reports.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"44026d81cd75d0c3b9392e899701623e016fc7bcbb4e5e0fbfa5937ea928c167"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060extract_object_literal_exports_from_require\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/perry/src/commands/compile/cjs_wrap/extract_exports.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"2205746f6c13206a1c03aba18b2684aba518f07b014ff1bd5ad12680712ed21b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060cyclic_missing_property_names\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/perry/src/commands/compile/cjs_wrap/wrap.rs"},"region":{"startLine":1882}}}],"partialFingerprints":{"codehealthFindingId/v1":"953b68f4c73d79d27cb66b5bb368815baf075308acf5c5a28f65c5de4e337a3a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060resolve_bunfs_literal_assets\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/perry/src/commands/compile/embed.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8d30decc1e487231fbe77064a433af6ae12877cc2a8eecaa3e9b6dbf522bb7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_package_json_embed\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/perry/src/commands/compile/embed.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"da050e4ca1a9eb461bac9bdff7cb6467ccfda25487434b54738689168cb28bf6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_perry_toml_embed\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/perry/src/commands/compile/embed.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"58cbb10198e682e1da9d57f5ff9b449d40b476b25d2b24ca32d5704576b77adc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060winget_lib_candidates\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/perry/src/commands/compile/library_search.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"807940ced6e1e6c95d6386709d896a15d2b2738676011695c6f2b61dbb9ce9f8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_widget_entries\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/perry/src/commands/compile/widget_build.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"73033a8a4b531e3c6a420bfbbf5b67e96a8ba5a1a2408d71a01aa1caf1242e3b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_user_allowscripts\u0060 turns every \u0060Err\u0060 into \u0060BTreeSet::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/perry/src/commands/install/lifecycle.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6a28faf13f028aa6a216f9c15e40beab8838043cf0ee53a1b99fb125193a70"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060resolve_file_deps\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/perry/src/commands/publish/tarball.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"5737d6e843024e13cd0d25de677cca2b87402e13f141f1df8ab687ac70a930a6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060compatible_final_layouts\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/perry-codegen/src/codegen/static_shape_ids.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d13303435bc0f548fa9875881d9de5cf2a1391b1636c0372bc9cb1fa33cb6a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060image_colour_flags\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/layout_desc.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32b8e475d798ef9cea438f41be81fcaacc6eb751dff394324956f2e3f8977f2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060reap_stale_llvm_scratch\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/linker_temp.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"3596b75d3c9b1d887fd5ab246c4ae34c46ea7c3686fd54ec8b816aacc667fbec"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060take_gc_map\u0060 turns every \u0060Err\u0060 into \u0060GcMapTotals::default()\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/perry-codegen/src/statepoint_report.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f15f6a683a52087f1172df19d2a7846aba623ae5d35878ce5d64955809c2009"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060request_key\u0060 turns every \u0060Err\u0060 into \u0060\u0022localhost::\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/perry-ext-http/src/agent.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25d7cca55f2437f4c9a8e0beba4d1473a990f656516f907d0c50d290fad537e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060process_pending_h2_events\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-http/src/server/http2_server/pump.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"de24398e2b67d3d877b034b3f8ec82a321d7cb6a081f5c4c403a766d571b5c5d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060combined_headers_json\u0060 turns every \u0060Err\u0060 into \u0060\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/perry-ext-http/src/server/request.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde4fa8c9bfd74804081f59cb5707454c2d487f794e318692cf86f7e28986d91"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060js_node_http_im_raw_headers_json\u0060 turns every \u0060Err\u0060 into \u0060\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/perry-ext-http/src/server/request.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"05af85c855ae046f1a5bef90204e08630e39255ffdaca03f7f64aa4e5e815dc8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060js_node_http_im_headers_distinct_json\u0060 turns every \u0060Err\u0060 into \u0060\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/perry-ext-http/src/server/request.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1d2559db88b7a81eaa4891ad4ec1983c12dd7e7efdb0a948f17a42cbb33dbc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060js_node_http_im_trailers_json\u0060 turns every \u0060Err\u0060 into \u0060\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/perry-ext-http/src/server/request.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"1177aa0182cc7fa2bc68779db8d9200c10b37c3d167005fbcd5830c98d8b8f0a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060js_node_http_im_trailers_distinct_json\u0060 turns every \u0060Err\u0060 into \u0060\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/perry-ext-http/src/server/request.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74e3885582d3bb4968a7039e5d0d25541741e509396e2afee6c45c5cbbd6257"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060address_json\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\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/perry-ext-net/src/payload_server.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f01eda5807cad0353a327db886f7c3c6b246ffe0df3ffbcf35d31b5065f013e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060open_image_path\u0060 turns every \u0060Err\u0060 into \u0060-1\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/perry-ext-sharp/src/lib.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d991707cbbacda9bb2c2b7d04d4d5dc7cd827cb1429eef8efc7a82e5b2c2fcb0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060decode_image_bytes\u0060 turns every \u0060Err\u0060 into \u0060-1\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/perry-ext-sharp/src/lib.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48993354e087d05cfaf95d47b996d6dccbf63c984ac9b5da6296a2fce9923d4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060next\u0060 turns every \u0060Err\u0060 into \u0060Some(None)\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/perry-runtime/src/gc/roots/stack_maps_lazy.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8dc9fa58563b32a6ef5cee6c5dc48db9d06cb182ef17b68f35f4de336796cf7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060js_buffer_copy\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/buffer/copy_write.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9402955ff27ba55fd0c1caa325d17a97283c9c847bfd2f8ed0efbbc137a3b2a2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060invoke_record\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/bun_ffi/callback.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"5330ee9755d2bfb11c53b65ca37f0322ddbcad2412107b610184828f1b0343a8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060nameservers\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/perry-runtime/src/dns_config.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f111098b053063b4405240ed7e04572acac7600e4858fc810551126e3c4fde"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060current_dir_slashes\u0060 turns every \u0060Err\u0060 into \u0060\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/perry-runtime/src/fs/dir_glob_watch/glob.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f6221d2006159dc719abcdbc2c4301d771f3fa527ae9a59a266710db793308"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_sync_result\u0060 turns every \u0060Err\u0060 into \u0060Ok(0.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/perry-runtime/src/fs/fd_ops.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca08b9e6a6808d11bde911284e3523db5625529f07cfd59fb97472805e8fb20"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060write_buffer_sync_result\u0060 turns every \u0060Err\u0060 into \u0060Ok(0.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/perry-runtime/src/fs/fd_ops.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"35369cfd0b778f35243bb8f5fa30fdf040566f565645e71a207ea4f9dd4e0bbd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060writev_sync_inner\u0060 turns every \u0060Err\u0060 into \u0060Ok(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/perry-runtime/src/fs/fd_ops.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91db0710473cdf25b83f741f203475a78ab93ea002d929858c3ba9e8a089a59"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060collect\u0060 (in \u0060loaded_stack_map_sections\u0060) turns every \u0060Err\u0060 into \u0060false\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/perry-runtime/src/gc/roots/stack_maps_sections.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e14d3f2b896a7d11f2ab192928e58404c3b174358378bbb6be43a76c52aa5c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060perry_geisterhand_find_by_shortcut\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/perry-runtime/src/geisterhand_registry.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce695c2bdf5d6460f0776125690ff23c805b54424c28608e692a0b2b2706198"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060perry_geisterhand_get_closure\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/perry-runtime/src/geisterhand_registry.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"116e3253f21d040ed131eefeba38b42f201303cae6ea004bec952987dafb1ffd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060duration_to_fractional\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/perry-runtime/src/intl/duration_format.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e5f23c7a0fa4472d03dc341a1f27c5c227c51a16f4889c4426120626fd0cd4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060path_registry_census\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/perry-runtime/src/module_require/path_registry.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"866815a7466ab58d33972c0e4d09f00962f44fd3d2b29f0cf9a30cbdf0d16bc1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060drain_async_completions\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/node_api_host/async_work.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60ec00bc573fdd4924500dd7a21d341a7262960cfdd176af1a73fc78ec8bcf9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060posix_cwd_as_win32_path\u0060 turns every \u0060Err\u0060 into \u0060\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/perry-runtime/src/path.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c5c3341d5c53251f65e7c63b6b5262d28c19fd2aefb68e0bc0063d6727ba57"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060process_report_json_string\u0060 turns every \u0060Err\u0060 into \u0060\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/perry-runtime/src/process/report.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d3165278aff12b4a7da4ec8535d0f884c99712c18a6ccfce2c6a081016b1cd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060js_run_agent_pumps\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/lib.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d0e4b276c974441a531d9c2813ac8735f5778ca3361c782243e7ea85a04c8c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060run_aux_pumps\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/lib.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a8e299931281c78641289f686644327f3b35b1652d713ae95e2795a10534c1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060drain_input\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-runtime/src/tui/input.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"7686f52e38b3eb8742214d50ac689787f477c9b64e99989eda46c79dc108e2f8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060js_crypto_scrypt_async\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/perry-stdlib/src/crypto/kdf.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"f312eb427480dcdd47dc7a7a555f4c174692fd272f29ab3d13561123f0ebe35e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060js_readline_next_wake_ms\u0060 turns every \u0060Err\u0060 into \u0060-1.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/perry-stdlib/src/readline/pump.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb31bd2dc2996ea1c93ae7f11f932b7a84a668137dc5ab899db77e5c9a648280"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060js_sharp_from_file\u0060 turns every \u0060Err\u0060 into \u0060-1\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/perry-stdlib/src/sharp.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebd525d1f2ecbb346cc9f442179e901eed396e692172a60e9e3dd69c2739b6e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060js_sharp_from_buffer\u0060 turns every \u0060Err\u0060 into \u0060-1\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/perry-stdlib/src/sharp.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"afde8db23f104950ff1aed319c000f0e978d2a08ae4dcd5c2dd439190b858872"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060js_sqlite_open\u0060 turns every \u0060Err\u0060 into \u0060-1\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/perry-stdlib/src/sqlite/better.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb9384b190a24b0f19844fe8b278d08ec66bfa8ea3e736a03d1c4ea4a96a515"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_selected_row_at\u0060 turns every \u0060Err\u0060 into \u0060-1\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/perry-ui-android/src/widgets/table.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7d3aad8a58f90459d7d894f2039726f8827b452125c081d4c6174e4375c988"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060perry_geisterhand_lookup_hwnd\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-geisterhand/src/lib.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52ff5fed8af7eac150101017528eea8c2444b6a52fd792c45de1e8b81719ae5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060icon_pixmap\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/perry-ui-gtk4/src/tray.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d1d23f86a8da95b5bdc11a008e30c8081001d8b8cc2807f774776dfeac0998"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060tool_tip\u0060 turns every \u0060Err\u0060 into \u0060ToolTip::default()\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/perry-ui-gtk4/src/tray.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"376e3dc062f214b73955d27876ad240374bba7921e7645435ec5170763888938"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060menu\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/perry-ui-gtk4/src/tray.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd32e0251f06e086e638fe7cf7b1c8a4fa1336abbe4631878e273b9235084c4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060create_player\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-windows/src/media_playback.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1259fb7f77eafa891e589e0055bb243d6621d558e7500cc5f17bb8806cc72b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060prefs_dir\u0060 turns every \u0060Err\u0060 into \u0060\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/perry-ui-windows/src/system.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"810b2fc202073b13eafd04b926cdaa3a7bef0f90197c4c949e2cf15cdd7aa215"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060find_handle_by_hwnd\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-windows/src/widgets/mod.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee46a4023114f800e198580c0d342618fbbee2f74940dfa1a445e1a8f0a3ced0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060find_handle_by_control_id\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-windows/src/widgets/mod.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c633a0def9bdd9f5381272940e539825caf7f4559c929a68cee9870503b4f3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060create\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ui-windows/src/widgets/bloomview.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eab963edbbf5dcad6b553851fa77e58695643fb14eff2e4c808af7e39859aca"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get\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/perry-wasi/src/http/p2/handlers.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe11a6f390d9a68223f63dbe49ea722533bfe7de49fda0f43bb9fb3e6215965"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060sender_text\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":"third_party/windows-winui/windows-reactor/src/winui/backend/convert.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"352cb88b5a6c0eb789431ba98a1587a910df2d02037f938228ffd50d109ff4a4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060js_bcrypt_hash_sync\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-ext-bcrypt/src/lib.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"5387b6009eaff12bca48dbd9f49893b4c40d07f6feafb13c0a8f35d8fd75553d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060disposedFallback\u0060 swallows every exception into \u0060return 17\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":"benchmarks/compiler_output/fixtures/native_owned_typed_views.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"94162ecd545085a7cc0ba3c1fbe60badc422509e589914c11b1f2bd43555a226"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readPackageJson\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":"scripts/publish/npm/shared.mts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b8cd11e45d2b821c0fa40e147ee48b97890c09815582386f600c30e14a2469"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060threadNames\u0060 swallows every exception into \u0060return \u0022unavailable\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":"scripts/turnloop/apps/_helpers/tokio_worker_agent_census_worker.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2356bbd27b8edb158fc86ae9f0fcbb61f4f48fb35fdfa47b1555ef6a34b179"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060names\u0060 swallows every exception into \u0060return \u0022unavailable\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":"scripts/turnloop/apps/db_thread_census.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e5fb764bf9999433c9b12b27e6111adf764eca4b0e8a042e4a9566ac08326d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060count\u0060 swallows every exception into \u0060return -1\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/turnloop/apps/db_thread_census.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2bdcf60801c4dbf5843f76bb8207be93cdbbdb7f2ed8a194f10ea93f7fb10d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060rssKb\u0060 swallows every exception into \u0060return -1\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/turnloop/apps/p9_agent_loop_rss.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b85a0ad2fd1e4a04bd6aeebca4e48aeb2ca3035d2280e0c85488b4bb606fe2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readyFiles\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":"scripts/turnloop/apps/p9_agent_loop_rss.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35aebcf0c850f225f268a0f137de10fba0d78dde22b527f168035c17c1e0cd6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060names\u0060 swallows every exception into \u0060return \u0022unavailable\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":"scripts/turnloop/apps/pg_thread_census.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4a43d3bd9763992e1149d2e501745efc06f9875e0a8c3ef0d9ef60749079d7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060count\u0060 swallows every exception into \u0060return -1\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/turnloop/apps/pg_thread_census.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a299e73cde34a62fc18cbbc60051ba4f9c014e2e0d1e640b69a1373a241ce0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060names\u0060 swallows every exception into \u0060return \u0022unavailable\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":"scripts/turnloop/apps/pool_thread_census.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c51fd6e83a333709e8bf396be0791bd7eb0b1cec0b05818678a05e050cfe69f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060count\u0060 swallows every exception into \u0060return -1\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/turnloop/apps/pool_thread_census.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e3a56303c5da1d8f9f5743ce35613c6dddfb5aa0adabf2d103e09efeaff5e7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060threadNames\u0060 swallows every exception into \u0060return \u0022unavailable\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":"scripts/turnloop/apps/tokio_worker_agent_census.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c79bbd0441f4887453414b9ce502c12c19ee7fbd306396018495cbb5f20807"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060noOwnRoots\u0060 swallows every exception into \u0060return 23\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/wasi_acceptance/wasm_eh_roots.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b308cf780e491c708bfae6c4e0b5dadc54bf5458b24eac32b7350a0d02e4498b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060survey\u0060 swallows every exception into \u0060return \u0027throws\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":"test-files/test_gap_host_object_prototype_chains.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab438be0075333edbede9497a21521e8371bdb08dc0696b14346e971bc62c62f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060call\u0060 swallows every exception into \u0060return -1\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":"test-files/test_gap_private_site_guard_handle_floor.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a66471e4cc203e49bf29791f2e9c0fe668a54bfc2f0f6a22335252a3d1e42c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060len\u0060 swallows every exception into \u0060return \u0022threw\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":"test-files/test_gap_rbwfn_closure_reads.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e375fee894316ba42335d9571a387397456eee8eee0a6b4d1b456eee4f78502"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060run\u0060 swallows every exception into \u0060return -1\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":"test-files/test_gap_try_free_entry_brackets.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b14c4789251779e1c6534dc22bd8de1b3556775d68ab03b2944ca724dfa6ceb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060step\u0060 swallows every exception into \u0060return -2\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":"test-files/test_parity_try_block_no_leak_on_return.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff78fbedcbaa77834259fdf7ec1677cae21f3f92de5a767ef4a80d1719409f0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060noThrow\u0060 swallows every exception into \u0060return -1\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":"test-files/test_parity_try_catch_across_await.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6e454312782ae6fc198546b0d401f79902cf3699ed5dbcff8bba8eeefb6155"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMemory\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":"test-parity/node-suite/wasi/imports/syscall-arguments.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ab0ae5426da9ee7dd35e7732f724c87f5d55d142a0bd3a62ab2ae40d546c9a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMemory\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":"test-parity/node-suite/wasi/lifecycle/exports-access-order.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f909586b3f7f550a67bb282849595ccb7930b59a3a1cd5569fabd72da8907f0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMemory\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":"test-parity/node-suite/wasi/lifecycle/finalize-bindings.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0e8db31970a7e85210ecf2aa97a865c46a1a6be30a5a64651db2b5b76cef06"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMemory\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":"test-parity/node-suite/wasi/lifecycle/finalize-failure-recovery.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc96c6f576212c175760d092ca8046782c93d4401d57a7463363df6d5b02577"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMemory\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":"test-parity/node-suite/wasi/lifecycle/finalize-memory-override.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a0e55885c0077e5e554b02b0274111f05bff2b437321d6bd0b4428821cc086"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMemory\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":"test-parity/node-suite/wasi/lifecycle/finalize-options-validation.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9270a14dcbc174f844a517b14fa9b0bf03ef65a76811963b4c4510a37c0c0ec0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMemory\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":"test-parity/node-suite/wasi/lifecycle/finalize-state.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"421e8294b5e1e11183e2cef1f1683f9e104583c4356337081b64b2424302f1bd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMemory\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":"test-parity/node-suite/wasi/lifecycle/initialize-executes.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b70f62f39c38d4feea90402aef5daa4a2a7f6d0a83624c082b67ea1d756c90"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMemory\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":"test-parity/node-suite/wasi/lifecycle/initialize-export-validation.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef7c76d35472160ae6e5ddc1e5264c00a971bf79c9cd25278a34c28ed3c087c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMemory\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":"test-parity/node-suite/wasi/lifecycle/initialize-rethrows-export-error.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"82292c5347119b075c7c6a1f71b1764a33f247e9f615a4a3ffb180847891a587"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMemory\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":"test-parity/node-suite/wasi/lifecycle/initialize-state.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5d8bc79bfafa8f3d3c873bf44bf91e2174f4402c1ce42febd742169b2c1304"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMemory\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":"test-parity/node-suite/wasi/lifecycle/initialize-validation-consumes-state.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad74d665d81f92ea83a5b034f6dfaf463f3fc06d83ddc4e4373b956087634d92"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMemory\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":"test-parity/node-suite/wasi/lifecycle/return-on-exit-default.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffcb09de2f23144d0754df3e9379945f5c47272644bda3926e3dcbc6af1dca2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMemory\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":"test-parity/node-suite/wasi/lifecycle/return-on-exit-false.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"277fe149622270f6e10c69363a630744f48619cd5926a4e8053fce08c0165dff"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMemory\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":"test-parity/node-suite/wasi/lifecycle/return-on-exit-true.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a9372d620d2f8662f7cb0adf3bd0022ca0238f302e8753806626df55a3ed1d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMemory\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":"test-parity/node-suite/wasi/lifecycle/start-executes.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"94bac5f36b76b9820f82b22680afc9b4439cab2e959fca0cf6dfb4f87a8c9d76"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMemory\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":"test-parity/node-suite/wasi/lifecycle/start-export-validation.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f2a190d2afe6283960a11eea11cea38dafa5336fe6dcfc725f99f4852a2d03"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMemory\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":"test-parity/node-suite/wasi/lifecycle/start-rethrows-import-error.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee71861aa155878b5be3da11ec5998c4b73c37e6a16a0db83982e937ac39256"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMemory\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":"test-parity/node-suite/wasi/lifecycle/start-state.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc226491e71b85987b9dd7d0bbe647ed12dfcb040ad7c3c70ce34991c0c0b5b7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMemory\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":"test-parity/node-suite/wasi/lifecycle/start-validation-consumes-state.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"89533138a6d344aecde9995b8a53b9cbb9f119013e89471ac1d650bd86928b10"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMemory\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":"test-parity/node-suite/wasi/semantics/args-exposure.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c20205c500e3e719928da91fe47e0e9acb577285104a5ee6d057d207bf343a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMemory\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":"test-parity/node-suite/wasi/semantics/clock-random.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ddba036b14c0cd2ab8a5292481b82c721be399850b9cc49a3643994aff62d1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMemory\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":"test-parity/node-suite/wasi/semantics/env-exposure.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1def08d0a1d94af7c4f3fd25cd210287b03f8aa12c6653d9b8f8dc8c35de264"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMemory\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":"test-parity/node-suite/wasi/semantics/nul-termination.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1764e1a79f9fead1109f154137193472de801efe76336253f79f1180386e3452"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createMemory\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":"test-parity/node-suite/wasi/semantics/options-snapshot.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cef1109cb900fd49eef001dba339d917cf6d9799254194a8a7686fb406a65b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060values\u0060 swallows every exception into \u0060return \u0022detached\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":"test-parity/node-suite/worker_threads/worker-lifecycle/constructor-rollback.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"97053d5226e923afd4c147a73161db0e84157166f6201c1c9ee6dca70d9706cc"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060src.contains(\u0022make()\u0022)\u0060 can never decide this \u0060\u0026\u0026\u0060 \u2014 every value satisfying \u0060src.contains(\u0022t.make()\u0022)\u0060 also satisfies \u0060src.contains(\u0022make()\u0022)\u0060, so the \u0060\u0026\u0026\u0060 chain is already decided by the former. The expression is equivalent to the chain without it, which means it is narrower than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-wpfacts/src/tests/unit_ctor.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccacab3725d6b0334eb52db7f41af460f8fb75d8a37f0a12345d4a242b29e0af"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060dump.contains(\u0022ArraySpread\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060dump.contains(\u0022ArraySpread\u0022)\u0060 also satisfies \u0060dump.contains(\u0022Spread\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/perry-hir/tests/array_destructuring_fast_path.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"096ac1c844423665c3373ea80135e4a7fe4a2af8a7fa38fc89c87a99a1f8528c"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060name.contains(\u0022node_modules/@tanstack/react-router/\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060name.contains(\u0022node_modules/@tanstack/react-router/\u0022)\u0060 also satisfies \u0060name.contains(\u0022node_modules/@tanstack/react-\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/perry-hir/src/lower/lower_module_fn.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ff1bfb6f6744346af27fd8f958c03d4c175c63c1d8ccadfcf30d93bde11eab"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060probe.ends_with(\u0022, double %arg2)\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060probe.ends_with(\u0022, double %arg2)\u0022)\u0060 also satisfies \u0060probe.contains(\u0022, double %\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/perry-codegen/tests/native_proof_regressions.rs"},"region":{"startLine":16591}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c3f364174318efe09fea13bb2414a25928d8d09075e5864c8e6b394b9c1ae6"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060ir.contains(\u0022or i32\u0022)\u0060 can never decide this \u0060\u0026\u0026\u0060 \u2014 every value satisfying \u0060ir.contains(\u0022xor i32\u0022)\u0060 also satisfies \u0060ir.contains(\u0022or i32\u0022)\u0060, so the \u0060\u0026\u0026\u0060 chain is already decided by the former. The expression is equivalent to the chain without it, which means it is narrower than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/tests/native_proof_regressions.rs"},"region":{"startLine":15106}}}],"partialFingerprints":{"codehealthFindingId/v1":"2662cf636b3dce0f07b45a24f0ef459321ad07a83167e86fee071da37045ba8b"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060ir.contains(\u0022or i32\u0022)\u0060 can never decide this \u0060\u0026\u0026\u0060 \u2014 every value satisfying \u0060ir.contains(\u0022xor i32\u0022)\u0060 also satisfies \u0060ir.contains(\u0022or i32\u0022)\u0060, so the \u0060\u0026\u0026\u0060 chain is already decided by the former. The expression is equivalent to the chain without it, which means it is narrower than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/tests/native_proof_regressions.rs"},"region":{"startLine":15217}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e32cb9c472cf263a360f5ea6502fa12e563f2424cbf7dab33f714bb6a4a1b9a"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060err.contains(\u0022crypto\u0022)\u0060 can never decide this \u0060\u0026\u0026\u0060 \u2014 every value satisfying \u0060err.contains(\u0022\u0060js_crypto_\u0060\u0022)\u0060 also satisfies \u0060err.contains(\u0022crypto\u0022)\u0060, so the \u0060\u0026\u0026\u0060 chain is already decided by the former. The expression is equivalent to the chain without it, which means it is narrower than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/ext_registry.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"440169d98558236368d9be93b43adcbb7cb408a01b87158566094d52d3f44414"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060default.contains(\u0022w64-mingw\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060default.contains(\u0022w64-mingw\u0022)\u0060 also satisfies \u0060default.contains(\u0022mingw\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/perry-codegen/src/linker.rs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"60603fa7f48be9e6fbdc382e4d6ce248e8a607ddbaa58479d68a8f15c6c4c080"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060t.contains(\u0022w64-mingw\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060t.contains(\u0022w64-mingw\u0022)\u0060 also satisfies \u0060t.contains(\u0022mingw\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/perry-codegen/src/linker.rs"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9e87d23679bf255840f010d9b34785edd1868721cba6afd609680889a7dbad"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060ir.contains(\u0022rloop.recheck\u0022)\u0060 can never decide this \u0060\u0026\u0026\u0060 \u2014 every value satisfying \u0060ir.contains(\u0022br i1 true, label %rloop.recheck\u0022)\u0060 also satisfies \u0060ir.contains(\u0022rloop.recheck\u0022)\u0060, so the \u0060\u0026\u0026\u0060 chain is already decided by the former. The expression is equivalent to the chain without it, which means it is narrower than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/region_loop_tests.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e177f07abb644c7b3fbd6a1cf0f08945f24533264dc541079139132136102a"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060ir.contains(\u0022rloop.recheck\u0022)\u0060 can never decide this \u0060\u0026\u0026\u0060 \u2014 every value satisfying \u0060ir.contains(\u0022br i1 true, label %rloop.recheck\u0022)\u0060 also satisfies \u0060ir.contains(\u0022rloop.recheck\u0022)\u0060, so the \u0060\u0026\u0026\u0060 chain is already decided by the former. The expression is equivalent to the chain without it, which means it is narrower than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/expr/region_loop_tests.rs"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3329f7f2f529f4d3ed9b68059aa99159005b1cab556ab6fdd1adc542bd6d6b5"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060ir.contains(\u0022$typed_f64_recv\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060ir.contains(\u0022$typed_f64_recv\u0022)\u0060 also satisfies \u0060ir.contains(\u0022$typed_f64\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/perry-codegen/src/collectors/proven_this_routing_tests.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c443f62549e800e3b2fefe9f70d566f49ceb8ccb3a25fa82f5f7c6e30621f0d"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060probe.contains(\u0022, 2\u0022)\u0060 can never decide this \u0060\u0026\u0026\u0060 \u2014 every value satisfying \u0060probe.contains(\u0022, 268435456\u0022)\u0060 also satisfies \u0060probe.contains(\u0022, 2\u0022)\u0060, so the \u0060\u0026\u0026\u0060 chain is already decided by the former. The expression is equivalent to the chain without it, which means it is narrower than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/collectors/proven_this_routing_tests.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9641e23a7afb8086696a14fb28a7a427c61bcae451f59fd68e0199a4c0fe4a"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060iterate.contains(\u0022versioned_index.loop.slow.preheader\u0022)\u0060 can never decide this \u0060\u0026\u0026\u0060 \u2014 every value satisfying \u0060iterate.contains(\u0022label %versioned_index.loop.slow.preheader\u0022)\u0060 also satisfies \u0060iterate.contains(\u0022versioned_index.loop.slow.preheader\u0022)\u0060, so the \u0060\u0026\u0026\u0060 chain is already decided by the former. The expression is equivalent to the chain without it, which means it is narrower than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/perry-codegen/src/codegen/index_method_clone_tests.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"08003e64a41dcf96fb6b9097eafe41a364a051e5fa750690513439e5a2445a02"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060trimmed.starts_with(\u0022///\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060trimmed.starts_with(\u0022///\u0022)\u0060 also satisfies \u0060trimmed.starts_with(\u0022//\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/perry/src/commands/sanitize.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddba91f2caa803a754abed750e68b424c7db8a3dbf7f63a34f4b3bae91b78c04"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060rest.starts_with(\u0022===\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060rest.starts_with(\u0022===\u0022)\u0060 also satisfies \u0060rest.starts_with(\u0022==\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/perry/src/commands/compile/cjs_wrap/extract_requires.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"da279c6b333100429dda5fc92659e3c073627286b2eead4244b3f77cc8454f9a"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1164","guid":"793ece19-b164-f952-a8b3-33dc3b591809","name":"CWE-1164","shortDescription":{"text":"CWE-1164"},"helpUri":"https://cwe.mitre.org/data/definitions/1164.html"},{"id":"CWE-125","guid":"98717707-96bf-ca5b-9568-8d1d257574c1","name":"CWE-125","shortDescription":{"text":"CWE-125"},"helpUri":"https://cwe.mitre.org/data/definitions/125.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-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-191","guid":"31b5d115-a84b-875f-a016-48689827db3c","name":"CWE-191","shortDescription":{"text":"CWE-191"},"helpUri":"https://cwe.mitre.org/data/definitions/191.html"},{"id":"CWE-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"Uncaught Exception","shortDescription":{"text":"Uncaught Exception"},"helpUri":"https://cwe.mitre.org/data/definitions/248.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-310","guid":"97174724-2e33-8455-b7cd-5c3258d1cb8f","name":"CWE-310","shortDescription":{"text":"CWE-310"},"helpUri":"https://cwe.mitre.org/data/definitions/310.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.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-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"Insertion of Sensitive Information into Log File","shortDescription":{"text":"Insertion of Sensitive Information into Log File"},"helpUri":"https://cwe.mitre.org/data/definitions/532.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-755","guid":"ac8136dd-f77c-1c5e-bdcc-3905bbad9bd9","name":"Improper Handling of Exceptional Conditions","shortDescription":{"text":"Improper Handling of Exceptional Conditions"},"helpUri":"https://cwe.mitre.org/data/definitions/755.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-862","guid":"2d96ecd7-f7f1-7f55-9f3a-43bb5bafdf33","name":"Missing Authorization","shortDescription":{"text":"Missing Authorization"},"helpUri":"https://cwe.mitre.org/data/definitions/862.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":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-1","guid":"a40d9a4c-89f5-4b5d-b2dc-32dc9cbfe814","name":"Insufficient Flow Control Mechanisms","shortDescription":{"text":"Insufficient Flow Control Mechanisms"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-01-Insufficient-Flow-Control-Mechanisms"},{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-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":1683,"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."]}]}